Download JAR files tagged by have with all dependencies

Batch processing is a pervasive workload pattern, expressed by a distinct application organization and execution model. It is found across virtually every industry, applied to such tasks as statement generation, bank postings, risk evaluation, credit score calculation, inventory management, portfolio optimization, and on and on. Nearly any bulk processing task from any business sector is a candidate for batch processing. Batch processing is typified by bulk-oriented, non-interactive, background execution. Frequently long- running, it may be data or computationally intensive, execute sequentially or in parallel, and may be initiated through various invocation models, including ad hoc, scheduled, and on-demand. Batch applications have common requirements, including logging, checkpointing, and parallelization. Batch workloads have common requirements, especially operational control, which allow for initiation of, and interaction with, batch instances; such interactions include stop and restart.

A NSGA-II implementation using Java. This implementation of NSGA-II algorithm is in pure reference to the original published paper. This is not an effort to convert the originally implemented C code in Java. The original C code by the authors has not be referred to while writing this implementation. This is a fully customizable implementation of the NSGA-II algorithm, made as generic as possible. This documentation assumes you have basic understanding of the NSGA-II algorithm. Apart from the core concepts of the algorithm, everything else in this package can be implemented as per the user's choice and plugged into the algorithm dynamically. Since NSGA-II is more like a set of protocols to follow as an algorithm rather than a concrete implementation of every aspect, this package has been re-written from scratch keeping complete customizability in mind. Apart from the core concepts of the algorithm, everything is considered to be a plugin external to the algorithm that can be implemented by the user and dynamically plugged into the algorithm during runtime as needed. This opens up the possibility of the package to be used simply as a PoC or be converted into something much more complex according to the users needs.

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.

--------------------------------------------------------------------------- Version for VIVO 1.8 This uses the source and test code from the Version for VIVO 1.10, edited to make it compatible with VIVO 1.8. It also borrows some code from VIVO 1.10 itself, changes the package name to avoid conflicts, and adds it here. * Vitro 1.8 uses Jena 2, not Jena 3, and Commons Lang 2, not 3, so modify the "import" statements in the Data Distribution code accordingly. * Vitro 1.8 does not have a "...webapp.utils.sparqlrunner" package, so borrow the source from Vitro 1.10, move it to a different package (just for compatibility with the 1.9 version), modify it to use Jena 2 and Commons Lang 2, and modify the Data Distribution API code to use this sparqlrunner package. * Vitro 1.9 has an earlier version of "...webapp.utils.configuration" package, so borrow the source from Vitro 1.10, move it to a different package so it won't conflict with the 1.9 version, modify it to use Jena 2 and Commons Lang 2, and modify the Data Distribution API code to use this configuration package. Make these modifications, compile, JAR it up, and deploy. --------------------------------------------------------------------------- Because VIVO 1.8 is not available as a Maven package, we have extracted the class files, JARed them up, and stored them in a file-based repository within this project. But that doesn't include any transitive dependencies, so any package that this code requires must be explicitly listed as a dependency. ---------------------------------------------------------------------------