Search Results for "data structures" - Page 2

...SmartSlog applies the code generation approach: given an OWL ontology description, the ontology programming library is produced. The latter provides API to access the smart space via a Smart-M3 Semantic Information Broker (SIB) and data structures and functions to represent and maintain locally in KP code all ontology classes, relations, properties, and individuals. Since 2012 the project is supported by grant KA179 of Karelia ENPI programme, http://kareliaenpi.eu/ More information about project: http://oss.fruct.org/wiki/SmartSlog Smart-M3 on Wikipedia: http://en.wikipedia.org/wiki/Smart-M3

Animal is a Java-based system for visualizing and animating algorithms and data structures. Available since 1999, it is one of the established AV systems, and provides one of the largest collections of supported algorithms. Animations can be generated on the fly based on user input - for a large selection of algorithms and topic areas, including, but not limited to, the topic areas of backtracking algorithms, compression, cryptography, basing, searching and sorting.

...The Logo dialect is almost the same as Xlogo's, but some Logo commands were reimplemented to fit with the new programming environment and workspace. Some commands which were buggy in the original XLogo have been fixed. The interpreter works now more efficient due to the usage of more suitable data structures. The output of turtle graphics is now smoother and more appealing due to different rendering settings. Various features have been added to support better user experience and satisfaction in schools. @Translations: The new GUI parts are available in * English * German * French * Italian If you would like to make the application available in your language and if you would like to contribute, please contact us...

Software Engineering Environment(SEE) is a general frame to customize and manage information. The default information set is the data for software development. Users can manage tables like Problem Reports, Change Requests, Working Log and Plans, Testing Cases, etc. It is written in servlet and data are saved in XML. Any data structures can be added and customized.

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

"JavaFeedParserCommon" is a Java-library, which provides common classes and interfaces, which can be used by projects, which should allow to parse XML-based news feeds, such like RSS- or Atom-feeds.

Calculates Natural Product(NP)-likeness of a molecule, i.e. the similarity of the molecule to the structure space covered by known natural products. NP-likeness is a useful criterion to screen compound libraries and to design new lead compounds. Maven dependancy: <dependency> <groupId>uk.ac.ebi.cheminformatics</groupId> <artifactId>NP-Likeness</artifactId> <version>2.1</version> </dependency> Required repository: <repositories> ...

Big Sack is a Java persistence mechanism that allows storage of key value pairs following the popular Big Data paradigms. Its a very simple and straightforward way to bridge the gap between in-memory data structures and long-term storage. It has the convenience of Java SDK TreeMap and TreeSet classes and is used the same easy way, but it includes rollback through undo logging to checkpoint data so it does not wind up in an unknown state regardless of failures. ...

...Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap. Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3

XTarget is an Groovy Library for automated editing of small XML Databases with Groovy scripts. It focuses on simultaneous editing of data, including structures like lists and maps, and linking between various XML files.

Java library for operations with Iterables and other data structures in functional way.

Cognity is an object-oriented neural network library for Java. It's goal is to provide easy-to-use, high level architecture for neural network computations along with reasonable performance.

This project provides a set of libraries written in Java to easily manipulate Multi-Criteria Decision Aid (MCDA) concepts, especially related to outranking methods, and XMCDA files.

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

AlgoExplorer is a dynamic data structures viewer for Java. It allows the visualization of data structure of a Java program, allowing you to see how objects, handled by the algorithms, interact with each other and how they are related and linked. The project has been moved on: http://code.google.com/p/algoexplorer/

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

A librairie devoted to backtrackable data structures

Service Invocation Tool generates Java code to implement a declared service facade by calling operations of another service and mapping data structures between them.

Plexus is a Java library with specifications and implementations for generic graph data structures. Like the Java Collections Framework, vertices and edges are containers for arbitrary user-defined objects.

MicroWSS is a lightweight web services server/toolkit written in Java. Its purpose it to allow for simple development and deployment of services that use SOAP 1.2 and WSDL. It handles everything relating to XML, so that you only need to deal with Java.

Java API with XML based declarative parsing logic to parse complex structured data messages such as electronic data interchange messages etc, check data types of parsed data and transform the parsed data to XML structures or to Java Objects.

An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/

The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.

Performance oriented data structures and other programming utilities for Java that are meant to replace those provided by Java. They are designed to provide a solid backbone for any software project.