Download JAR files tagged by concept with all dependencies

With distributed systems being developed as a part of the cloud age. With focus on performance associated with an application dependent on one DB instance, there is a need to bring down the dependency to a database to generate unique numbers for creating a private key when lots of data needs to be stored in the database tables. This library is intended to provide a way of generating unique numbers on the fly in a JAVA based distributed system. This is not a new concept but this library helps in keeping you focused on the business logic that you need to develop for your applications rather than spending time on how this is done. Typically applications powered by RDBMS can leverage the benefit as instant scalability might not be available for these setups when the load to the system spikes.

Welcome to the Blazegraph/TinkerPop3 project. The TP3 implementation has some significant differences from the TP2 version. The data model has been changed to use RDF*, an RDF reification framework described here: https://wiki.blazegraph.com/wiki/index.php/Reification_Done_Right. The concept behind blazegraph-gremlin is that property graph (PG) data can be loaded and accessed via the TinkerPop3 API, but underneath the hood the data will be stored as RDF using the PG data model described in this document. Once PG data has been loaded you can interact with it just like you would interact with ordinary RDF - you can run SPARQL queries or interact with the data via the SAIL API. It just works. The PG data model is also customizable via a round-tripping interface called the BlazeValueFactory, also described in detail in this document.

Janus is an open-source multi-agent platform fully implemented in Java 1.8. Janus enables developers to quickly create web, enterprise and desktop multiagent-based applications. It provides a comprehensive set of features to develop, run, display and monitor multiagent-based applications. Janus-based applications can be distributed across a network. Janus could be used as an agent-oriented platform, an organizational platform, and/or an holonic platform. It also natively manages the concept of recursive agents and holons. Janus is jointly developed by the multiagent team of the University of Burgondy Franche Comté, and the Grupo de Investigación en Tecnologías Informáticas Avanzadas de Tucumán. This is the new version of Janus fully reimplemented to support the SARL Agent-Oriented Programming Language (http://www.sarl.io).

The idea and motivation of the lindbergframework is to provide resources and simple solutions to problems based on the concept 'Plug and Use'. In the current version, the framework provides easy and simple solutions to the population of beans from SQL queries, abstraction of the complexities to access to stored procedures and stored functions , population of database cursors, transaction management, dependency injection, integration with Spring, JSF and Adobe Flex. The lindberg-persistence (LINP) solution, implements a important concept: separated repository of SQL commands. Among other resources.

MyDtt-Plus is a starter of spring-boot, It is an object-oriented Java framework that helps developers increase productivity, "Domain Driven Table" is the concept of DTT, It makes you focus more on domain objects rather than tables. Aims to make it easy to automatically create DB tables based on your Java model with annotation driven. It's also support the ability of create table automatically for MyBatis what Hibernate can do and optionally export SQL to local file，Each table can be added database name concat with table name and fully comments, It can work with ORM frameworks such as MyBatis-Plus and MyBatis with little learning and usage costs. It's worth mentioning that DTT can be MyBatis-Plus is integrated in a 0-code way, just like JPA. However, MyDtt-Plus and MyBatis-Plus may be easier to expand and use than JPA. In addition to supporting the functions of JPA, DDT provides multi-table associated SQL DDL based on MyBatis operation, DTT support databases server for MYSQL, ORACLE, DB2, SQLSERVER, MARIADB, POSTGRESQL and embedded database for H2, HSQL, DERBY.

relay-jdbc allows a JDBC connection to be relayed through an intermediate relay server: it is both a JDBC driver (client) and a JDBC relay server. It is a fork of https://github.com/AugeoSoftware/VJDBC project, where Aleksei Yu. Semenov has implemented a number of brilliant improvements of the orignal VJDBC project hosted on http://vjdbc.sourceforge.net Original Developers were: Hunter Payne ([email protected]) and Michael Link ([email protected]). For all pre-existing code, credits go to the original respective author. This product brings the original VJDBC concept further and (apart from code quality improvements and bug fixes) implements complete separation of the underlying transport mechanism, introducing support for connecting directly through a SSH pipe, where the relay server interacts with the client through standard I/O pipes. The re-designed transport architecture supports easy development of new transport implementations, allowing this JDBC relay to be quickly adapted to a variety of exotic environments.

This module contains a more general approach to construct AlignmentAlgorithms by relying on the theoretical concept of Algebraic Dynamic Programming (ADP) as developed by Giegerich et al. ADP defines four ingredients for an alignment algorithm: 1.) A signature that defines the permitted alignment operations. Operations are just function templates with an associated arity, meaning the number of arguments it takes from the left sequence and from the right sequence. In the TCSAlignmentToolbox we have a fixed signature with the following operations: REPLACEMENT(1, 1), DELETION(1, 0), INSERTION(0, 1), SKIPDELETION(1, 0) and SKIPINSERTION(0, 1) 2.) A regular tree grammar that produces alignments, that is: sequences of operations, in a restricted fashion. 3.) An algebra that can translate such trees to a cost. In the TCSAlignmentToolbox this is a Comparator. 4.) A choice function, in case of the TCSAlignmentToolbox: the strict minimum or the soft minimum. An alignment algorithm in the TCSAlignmentToolbox sense of the word then is the combination of choice function and grammar. While we provide hardcoded versions of these combinations in the main package, the adp package allows you to create your own grammars. You can combine them with a choice function by instantiating one of the Algorithm classes provided in this package with a grammar of your choice. For example: AlignmentAlgorithm algo = new SoftADPScoreAlgorithm(my_grammar, comparator); creates an alignment algorithm that implicitly produces all possible alignments your grammar can construct with the given input, translates them to a cost using the algebra/comparator you provided and applies the soft minimum to return the score. This all gets efficient by dynamic programming. Note that there is runtime overhead when using this method in comparison with the hardcoded algorithms. But for complicated grammars this is a much easier way to go. For more information on the theory, please refer to my master's thesis: "Adaptive Affine Sequence Alignment using Algebraic Dynamic Programming"