Download JAR files tagged by input with all dependencies

zlib is designed to be a free, general-purpose, legally unencumbered -- that is, not covered by any patents -- lossless data-compression library for use on virtually any computer hardware and operating system. The zlib data format is itself portable across platforms. Unlike the LZW compression method used in Unix compress(1) and in the GIF image format, the compression method currently used in zlib essentially never expands the data. (LZW can double or triple the file size in extreme cases.) zlib's memory footprint is also independent of the input data and can be reduced, if necessary, at some cost in compression.

FunctionExecutors 1. GeoWithinFunctionExecutor Input : (longitude double, latitude double, geoJSONGeometryFence string) OR (geoJSONGeometry string, geoJSONGeometryFence string) Output : true if (longitude, latitude) or geoJSONGeometry is within the geoJSONGeometryFence 2. GeoIntersectsFunctionExecutor Input : (longitude double, latitude double, geoJSONGeometryFence string) OR (geoJSONGeometry string, geoJSONGeometryFence string) Output : true if (longitude, latitude) or geoJSONGeometry intersects the geoJSONGeometryFence 3. GeoWithinDistanceFunctionExecutor Input : (longitude double, latitude double, geoJSONGeometryFence string, distance double) OR (geoJSONGeometry string, geoJSONGeometryFence string, distance double) Output : true if (longitude, latitude) or geoJSONGeometry is within distance of the geoJSONGeometryFence StreamProcessors 1. GeoCrossesStreamProcessor Input : (id string, longitude double, latitude double, geoJSONGeometryFence string) OR (id string, geoJSONGeometry string, geoJSONGeometryFence string) Output : an event with `crosses` additional attribute set to true when the object ((longitude, latitude) or geoJSONGeometry) crosses into geoJSONGeometryFence and an event with `crosses` additional attribute set to false when the object crosses out of the geoJSONGeometryFence 2. GeoStationaryStreamProcessor Input : (id string, longitude double, latitude double, geoJSONGeometryFence string, radius double) OR (id string, geoJSONGeometry string, geoJSONGeometryFence string, radius double) Output : when the object ((longitude, latitude) or geoJSONGeometry) starts being stationary within the radius an event with `stationary` additional attribute set to true. When the object starts to move out of the radius an event with `stationary` additional attribute set to false. 3. GeoProximityStreamProcessor Input : (id string, longitude double, latitude double, geoJSONGeometryFence string, radius double) OR (id string, geoJSONGeometry string, geoJSONGeometryFence string, radius double) Output : when two objects ((longitude, latitude) or geoJSONGeometry) starts being in close proximity within the radius an event with `inCloseProximity` additional attribute set to true. When the object starts to move out of the radius an event with `inCloseProximity` additional. attribute set to false. On each event, additional attributes `proximityWith` gives the id of the object that this object is in close proximity and `proximityId` is an id unique to the pair of objects

Information extraction is the process of identifying specified classes of entities, relations, and events in natural language text – creating structured data from unstructured input. JET, the Java Extraction Toolkit, developed at New York University over the past fifteen years, provides a rich set of tools for research and education in information extraction from English text. These include standard language processing tools such as a tokenizer, sentence segmenter, part-of-speech tagger, name tagger, regular-expression pattern matcher, and dependency parser. Also provided are relation and event extractors based on the specifications of the U.S. Government's ACE [Automatic Content Extraction] program. The program is provided under an Apache 2.0 license.

A timer using the crontab syntax and additional binary input to provide a resolution of one second (1000 ms / 1000 millis / 1s). The timer uses the whiteboard pattern to notify the clients. There are only a few dependencies to commons-codec, osgi and osgi-blueprint. The bundle 'org.i3xx.step/org.i3xx.step.clockmongo' provides a store for the clock configuration based on mongodb. The additional dependency is 'org.mongodb/mongo-java-driver'. The bundle 'org.i3xx.util/org.i3xx.util.whiteboard' can be used to avoid a dependency to bundles used. In other words, your bundle can use the clock but need no dependency to the bundle 'org.i3xx.step.clock'. Take a look at the description there.

The biblio transformation engine is a java framework developed by the Hellenic National Documentation Centre (EKT, www.ekt.gr) and consists of programmatic APIs for filtering and modifying records that are retrieved from various types of data sources (eg. databases, files, legacy data sources) as well as for outputing them in appropriate standards formats (eg. database files, txt, xml, Excel). The framework includes independent abstract modules that are executed seperately, offering in many cases alternative choices to the user depending of the input data set, the transformation workflow that needs to be executed and the output format that needs to be generated.

The biblio transformation engine is a java framework developed by the Hellenic National Documentation Centre (EKT, www.ekt.gr) and consists of programmatic APIs for filtering and modifying records that are retrieved from various types of data sources (eg. databases, files, legacy data sources) as well as for outputing them in appropriate standards formats (eg. database files, txt, xml, Excel). The framework includes independent abstract modules that are executed seperately, offering in many cases alternative choices to the user depending of the input data set, the transformation workflow that needs to be executed and the output format that needs to be generated.

Jetty is an open-source, standards-based, full-featured web server implemented entirely in Java. It is released under the Apache 2.0 licence and is therefore free for commercial use and distribution. First created in 1995, Jetty has benefitted from input from a vast user community and consistent and focused development by a stable core of lead developers. There are many more examples of Jetty in action on the Jetty Powered Page that has selections from among the tens of thousands of production Jetty instances. However, as Jetty aims to be as unobtrusive as possible, countless websites and products are based around Jetty, but Jetty is invisible!

`Romaji` is a converter library to romanize Japanese hiragana/katakana string by standard and IME typing style. Even though [icu::Transliterator](http://userguide.icu-project.org/transforms/general) already has provided the same functions, and returns only one romanized string. However, there exists several different romanization systems, so one hiragana/katakana string has so many romanize string. For example, `"ちゃ"` can be romanized as `"cha"`, `"tya"`, `"chixya"`, `"tixya"`, `"chilya"`, or `"tilya"`. `Romaji` provides romanized strings as many as possible. If an input string contained non hiragana/katakana characters (includes kanji), `Romaji` return the characters as same as the input. For example, `Romaji` converts the input `"お茶の水"` to `"o茶no水"`. The mapping from hiragana/katakana to romaji is based on common IME's system to type Japanese on a computer. Therefor, `Romaji` does not directly implement the standard system like Hepburn, Nihon-shiki or Kunrei-shiki, but includes them.

This module defines the interface for AlignmentAlgorithms as well as some helper classes. An AlignmentAlgorithm computes an Alignment of two given input sequences, given a Comparator that works in these sequences. More details on the AlignmentAlgorithm can be found in the respective interface. More information on Comparators can be found in the comparators module. The resulting 'Alignment' may be just a real-valued dissimilarity between the input sequence or may incorporate additional information, such as a full Alignment, a PathList, a PathMap or a CooptimalModel. If those results support the calculation of a Gradient, they implement the DerivableAlignmentDistance interface. In more detail, the Alignment class represents the result of a backtracing scheme, listing all Operations that have been applied in one co-optimal Alignment. A classic AlignmentAlgorithm does not result in a differentiable dissimilarity, because the minimum function is not differentiable. Therefore, this package also contains utility functions for a soft approximation of the minimum function, namely Softmin. For faster (parallel) computation of many different alignments or gradients we also provide the ParallelProcessingEngine, the SquareParallelProcessingEngine and the ParallelGradientEngine.

This module defines the interfaces for Comparators in the TCS Alignment Toolbox. A Comparator has the purpose of defining the dissimilarity between elements in the input sequences of an Alignment. More specific information on Comparators can be found in the 'Comparator' interface. You can find a lot of helpful standard implementations of Comparators in the comparators-lib module. In the TCS Alignment Toolbox we require the output values of Comparators to lie in the range [0,1]. Many natural dissimilarities on value sets do not meet this criterion, such that additional normalization has to be applied. To that end this package also contains a Normalizer interface for functions that map real values from the range [0, infinity) to the range [0,1]. This package also provides a few convenience implementations of the Comparator interface to make the implementation of custom Comparators simpler, namely: SkipExtendedComparator, ParameterLessSkipExtendedComparator, ComparisonBasedSkipExtendedComparator, and ParameterLessComparisonBasedSkipExtendedComparator. Finally the TCS Alignment Toolbox also provides the means to learn parameters of Comparators. To enable that Comparators must implement the DerivableComparator interface to properly define the parameters that can be learned and the gradient of the dissimilarity with respect to these parameters. Gradients are stored using the Gradient interface as well as some convenience implementations of said interface, namely EmptyGradient, SingletonGradient, ArrayGradient and ListGradient.