Download JAR files tagged by replacement with all dependencies

This package contains Microsoft Azure App Service Management SDK. This package has been deprecated. A replacement package com.azure.resourcemanager:azure-resourcemanager-appservice is available as of 31-March-2022. We strongly encourage you to upgrade to continue receiving updates. See Migration Guide https://aka.ms/java-track2-migration-guide for guidance on upgrading. Refer to our deprecation policy https://azure.github.io/azure-sdk/policies_support.html for more details.

This package contains Microsoft Azure Batch Account Management SDK.

This package has been deprecated. A replacement package com.azure.resourcemanager:azure-resourcemanager is available as of 31-March-2022. We strongly encourage you to upgrade to continue receiving updates. See Migration Guide https://aka.ms/java-track2-migration-guide for guidance on upgrading. Refer to our deprecation policy https://azure.github.io/azure-sdk/policies_support.html for more details.

Contains extra CRS defined by ESRI (and other parties) in the EPSG namespace. Those CRS are not defined in the official ESPG database, but are used widely enough to warant an optional plugin in Geotools. This plugin do not contains any definition already found in the official EPSG database - it is not a replacement for epsg-hsql or epsg-postgresql. One of the above plugins (at user choice) should be in the classpath.

The JavaFX Deploy Lib provides a core functionality for assembling JavaFX applications. It is build-tool independent and is intended to be used as a base to build plugins for Maven, Gradle and other third party tools. It is a direct replacement for the 'JavaFX packaging' library that comes with the JDK but without the limitations that come from being bundled in the JDK.

CITA-Cloud is an open-source blockchain development framework. It is released under the Apache 2.0 license and provides an architecture and development tools for customization. Its aim is to overcome the scalability and programmability challenges of blockchain technology at the underlying level. Leveraging cloud-native capabilities, it allows flexible replacement of blockchain components. Research institutions can easily integrate and transform their research results. Ultimately, the goal is to achieve flexibility, openness, and interoperability at the underlying level of blockchain for different scenarios.

This is client side library for forker, and the one you most likely want to use in your own applications. It provides the ProcessBuilder replacement, ForkerBuilder, as well the helpers in OSCommand. ForkerBuilder is capable of launching processes using non-blocking I/O or attached to a PTY. It has many additional features not available in the standard process builder including permission elevation, daemonize, processor affinity and more. Parts of the non-blocking API are based on NuProcess (https://github.com/brettwooldridge/NuProcess)

Bond is a small library that can be used to spy values and mock functions during tests. Spying is a replacement for writing the assertEquals in your test, which are tedious to write and even more tedious to update whem your test setup or code inevitably changes. With Bond, you separate what is being verified, e.g., the variable named output, from what value it should have. This way you can quickly spy several variables, even have structured values such as lists or dictionaries, and these values are saved into an observation log that is saved for future reference. If the test observations are different you have the option to interact with a console or visual tool to see what has changed, and whether the reference set of observations need to be updated.

The Universal Java Matrix Package (UJMP) is an open source library for dense and sparse matrix computations and linear algebra in Java. In addition to the basic operations like matrix multiplication, matrix inverse or decomposition methods, it also supports visualization, JDBC import/export and many other useful functions such as mean, correlation, standard deviation, mutual information, or the replacement of missing values. It's a swiss army knife for data processing in Java, tailored to machine learning applications.

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"