Download JAR files tagged by logic with all dependencies

Small Java library for generating dynamic proxies on top of [ByteBuddy](https://github.com/raphw/byte-buddy) or [Javassist](https://github.com/jboss-javassist/javassist). You can generate data transfer objects, rich traits or even whole implicit DAO implementations dynamically at runtime easily. This library solves the complex stuff, so you can focus on application logic. Serializability, cloning are already solved by us. We also aim for transparent and easily debuggable proxies, because as we know proxies is usually part of "magic" for the team. Hence, the name of this library - Proxycian as a magician for the proxies ;)

PLSA.R is an Open Source Java Server + API for high demand, low latency requirements. There are no static references, no file reads, access to static fields per request. Everything is either cached and or instantiated on the fly. PLSA.R runs via one command so there are no .war files to deploy, no additional plugins to install it is a simple yet powerful alternative to container deployment environments. PLSA.R even boasts a little dependency injection for data logic. www.plsar.net

In brewing, a fermenter is a vessel in which unfinished ingredients become nearly finished beer. In Model Driven Architecture, Fermenter is a project that converts functional concepts into nearly finished applications. This approach allows for the quick definition and assembly of applications with the focus on functional concepts rather than technical underpinnings. Fermenter is an MDA engine that allows common concepts to be modeled and spawn any number of generated source files. In turn, this allows developers to focus more time on business logic, less time on technical underpinnings, and achieve extremely high levels of architectural conformity.

scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure for knowledge representation and reasoning. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, parser are available for: - THF (TH0/TH1): Monomorphic and polymorphic higher-order logic, - TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, including extended TFF (TFX), - FOF: Untyped first-order logic, - TCF: Typed clause-normal form, - CNF: (Untyped) clause-normal form, and - TPI: TPTP Process Instruction language. The parser was initially based on v7.4.0.3 of the TPTP syntax BNF (http://tptp.org/TPTP/SyntaxBNF.html), but is continuously updated to keep track of TPTP language updates.

In C++, writing a loop that iterates over a sequence is tedious. We can either use iterators, which requires a considerable amount of boiler-plate, or we can use the std::for_each() algorithm and move our loop body into a predicate, which requires no less boiler-plate and forces us to move our logic far from where it will be used. In contrast, some other languages, like Perl, provide a dedicated "foreach" construct that automates this process. BOOST_FOREACH is just such a construct for C++. It iterates over sequences for us, freeing us from having to deal directly with iterators or write predicates.

This project has a lot of business classes to work with genes and related named entities. Genes are part of a GeneDocument and may have gold IDs as well as mapped/predicted IDs. Another large part are species because most (all?) gene ID databases are species specific. So there are also classes or members to represent species mentions and the assignment of species IDs (taxonomy IDs) to genes. There is little to no business logic herein. This project is only useful as building block in other projects dealing with species assignment, gene ID mapping or similar efforts.