Download JAR files tagged by http with all dependencies

Maximum Likelihood Rule Ensembles (MLRules) is a new rule induction algorithm for solving classification problems via probability estimation. The ensemble is built using boosting, by greedily minimizing the negative loglikelihood which results in estimating the class conditional probability distribution. The main advantage of decision rules is their simplicity and comprehensibility: they are logical statements of the form "if condition then decision", which is probably the easiest form of model to interpret. On the other hand, by exploiting a powerful statistical technique to induce the rules, the final ensemble has very high prediction accuracy. Fork of the original code located at: http://www.cs.put.poznan.pl/wkotlowski/software-mlrules.html

A tool for data backup and consistency. Architecture and technologies: + the classic three-tier architecture is used: Model, DAO, Presentation; + [Spring 6 / Spring Boot 3](https://spring.io/) is the reference framework; + [SQLite](https://sqlite.org/) is the underlying database; + [Spring Data JPA](https://docs.spring.io/spring-data/jpa/docs/current/reference/html/) with [Hibernate](https://hibernate.org/) is used as ORM; + JPA entities are separated objects; + `Finder` and DCI roles from [TheseFoolishThings](http://tidalwave.it/projects/thesefoolishthings) are used; + [SLF4J](https://slf4j.org) and [Logback](https://logback.qos.ch) are used for logging; + [TestNG](https://testng.org) and [Mockito](https://site.mockito.org/) are used for testing; + [Lombok](https://projectlombok.org) is used for cleaner code.

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.

DynamicJasper (DJ) is an API that hides the complexity of Jasper Reports, it helps developers to save time when designing simple/medium complexity reports generating the layout of the report elements automatically. It creates reports dynamically, defining at runtime the columns, column width (auto width), groups, variables, fonts, charts, crosstabs, sub reports (that can also be dynamic), page size and everything else that you can define at design time. This dependency provides basic ttf font files to be used along with DynamicJasper This packages requires JasperReports 6.3.1 or newer http://dynamicjasper.com

JSON is a light-weight, language independent, data interchange format. See http://www.JSON.org/ The files in this package implement JSON encoders/decoders in Java. It also includes the capability to convert between JSON and XML, HTTP headers, Cookies, and CDL. This is a reference implementation. There is a large number of JSON packages in Java. Perhaps someday the Java community will standardize on one. Until then, choose carefully. The license includes this restriction: "The software shall be used for good, not evil." If your conscience cannot live with that, then choose a different package.