Download JAR files tagged by algorithm with all dependencies

Webpipes is a library to manage web resources like javascript and css files which need processing before being served. It manages processing like minimization, file merging, css generation from less, linters, jsx transformation. Resources can be managed as streams from source, or regularly checked cached resources, or to be generated with an Ant task. This module contains the test for the CJSon compression algorithm.

Webpipes is a library to manage web resources like javascript and css files which need processing before being served. It manages processing like minimization, file merging, css generation from less, linters, jsx transformation. Resources can be managed as streams from source, or regularly checked cached resources, or to be generated with an Ant task. This module adds support for the CJSon compression algorithm.

This artifact contains several miscellaneous, well-known algorithms, which however are rather specific in their concrete use case and therefore not fit for the AutomataLib Utilities library. Examples include Dijkstra's algorithm for the SSSP problem, the Floyd-Warshall algorithm for the APSP problem and Tarjan's algorithm for finding all strongly-connected components in a graph.

Module providing the webservice interface based on the Jetty embedded webserver and the FreeMarker template engine. Defines a simple format for providing textual annotations and produced output in HTML or JSON. This module has no dependencies to the other SCIE modules (except for the PDF text extractor) or the UIMA framework and thus can be used in any context, where text is annotated by an algorithm and should be presented to an end user.

Helping synchronization between clients and servers accross a network. The client is expected to have pushed its changes to the server and then requests the library to pull changes from the server. Clients of the library must provide on the server a way to serialize items and an endpoint, as well as a way to deserialize items and to access the server endpoint on the client. The algorithm requires O(log(n)) roundtrips to the server and consumes a total bandwidth of O(n) where n is the number of items which changed on the server since the last synchronization

Class implementing the predictive apriori algorithm for mining association rules. It searches with an increasing support threshold for the best 'n' rules concerning a support-based corrected confidence value. For more information see: Tobias Scheffer: Finding Association Rules That Trade Support Optimally against Confidence. In: 5th European Conference on Principles of Data Mining and Knowledge Discovery, 424-435, 2001.

This Content Negotiation Filter provides a content negotiation filter for Java EE servlet containers. The content negotiation algorithm is based on the Apache negotiation algorithm but lacks support for the encoding and character set. The variants can be configured through an XML file, negotiation.xml, in the WEB-INF/classes directory. This file can be overriden with the 'xmlInputFile' filter parameter. This XML file is parsed with the class 'com.mattunderscore.filter.contentnegotiation.variantsource.FilterVariantXMLSource'. This class can be overridden with the 'variantSource' filter parameter. The XML parser is implemented as a SAX parser. The SAX handler class can be overridden by the saxHandlerClass filter parameter. The 'variantSource' parameter can take any class that implements the 'com.mattunderscore.filter.contentnegotiation.variantsource.VariantSource'.

Binary-class and multi-class alternating decision trees. For more information see: Freund, Y., Mason, L.: The alternating decision tree learning algorithm. In: Proceeding of the Sixteenth International Conference on Machine Learning, Bled, Slovenia, 124-133, 1999. Geoffrey Holmes, Bernhard Pfahringer, Richard Kirkby, Eibe Frank, Mark Hall: Multiclass alternating decision trees. In: ECML, 161-172, 2001.