Download JAR files tagged by well with all dependencies
jung-parent from group net.sf.jung (version 2.1.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: net.sf.jung Artifact: jung-parent
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
straightedge from group com.massisframework (version 0.8)
Includes 2 main parts:
- Path finding through 2D polygons using the A star algorithm and navigation-mesh generation
Field of vision / shadows / line of sight / lighting.
The basic polygon and point classes are the KPolygon and KPoint.
KPolygon contains a list of KPoints for vertices as well as a center (centroid), area, and radius (circular bound or distance from center to furthest point).
KPolygon was born out of the need for a more game-oriented and flexible polygon class than the Path2D class in the standard Java library. KPolygon implements java.awt.geom.Shape so it can be easily drawn and filled by Java2D's Graphics2D object.
- This API provides path-finding and field-of-vision. For other complex geometric operations such as buffering (fattening and shrinking) and constructive area geometry (intersections and unions) it is recommended to use the excellent Java Topology Suite (JTS). The standard Java2D library also provides the Area class which can be used for some constructive area geometry operations. Note that there is a utility class PolygonConverter that can quickly convert KPolygons to JTS polygons and vice versa.
Artifact straightedge
Group com.massisframework
Version 0.8
Last update 21. December 2015
Organization not specified
URL https://github.com/rpax/straightedge
License New BSD License
Dependencies amount 1
Dependencies jts,
There are maybe transitive dependencies!
Group com.massisframework
Version 0.8
Last update 21. December 2015
Organization not specified
URL https://github.com/rpax/straightedge
License New BSD License
Dependencies amount 1
Dependencies jts,
There are maybe transitive dependencies!
xapi from group net.wetheinter (version 0.5)
XApi is a dependency injection, service-oriented, polyglot java framework.
It is comprised of standalone modules for use in web, desktop and mobile java applications.
This codebase enables complete reuse of all code across your java stack,
as well as the ability to easily define your own Platform, so you can
build your own customized runtime environment to extend or replace existing platforms.
It is currently geared towards servlets and gwt clients, but the target we are currently developing include:
java, gwt [webkit, firefox, ie], javafx, playn [android, ios, flash], appengine & vert.x
For Google Web Toolkit, we also include reflection support,
more complete emulation of java.lang.Class, zero-overhead dependency injection,
a range of code generation utilities, and even "magic-method injection"
(for production compiles any method in the app can be swapped out with
others based on configuration properties, or any AST mangling / code generating
methods you wish to write).
There is also a bytecode transformer in the works which will replace calls
into the DI utility with direct references to static final factories,
to allow the java compiler to completely erase all injection overhead in all java runtimes.
Group: net.wetheinter Artifact: xapi
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact xapi
Group net.wetheinter
Version 0.5
Last update 30. May 2015
Organization The Internet Party
URL https://github.com/${github.account}/xapi
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.wetheinter
Version 0.5
Last update 30. May 2015
Organization The Internet Party
URL https://github.com/${github.account}/xapi
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
gwt-reflect from group net.wetheinter (version 2.5.1)
Artifact gwt-reflect
Group net.wetheinter
Version 2.5.1
Last update 23. February 2014
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies xapi-dev-source, gwt-method-inject,
There are maybe transitive dependencies!
Group net.wetheinter
Version 2.5.1
Last update 23. February 2014
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies xapi-dev-source, gwt-method-inject,
There are maybe transitive dependencies!
gwt-method-inject from group net.wetheinter (version 2.5.1)
Artifact gwt-method-inject
Group net.wetheinter
Version 2.5.1
Last update 23. February 2014
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.wetheinter
Version 2.5.1
Last update 23. February 2014
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jadex-rules from group net.sourceforge.jadex (version 2.4)
Jadex Rules is a small lightweight rule engine, which currently
employs the well-known Rete algorithm for highly efficient rule
matching. Jadex rules is therefore similar to other rule engines
like JESS and Drools. Despite the similarities there are also
important differences between these systems:
* Jadex Rules is very small and
intended to be used as component
of other software. Even though rules can be specified in a Java
dialect as well as (a small variation of) the CLIPS language
its primary usage is on the API level. Jadex Rules is currently
the core component of the Jadex BDI reasoning engine.
* Jadex Rules cleanly separates between state and rule representation.
This allows the state implementation as well as the matcher to be
flexibly exchanged. Some experiments have e.g. been conducted with
a Jena representation. Regarding the matcher, it is planned to
support also the Treat algorithm, which has a lower memory footprint
than Rete.
* Jadex Rules pays close attention to rule debugging. The state as
well as the rete engine can be observed at runtime. The rule debugger
provides functionalities to execute a rule program stepwise and also
use rule breakpoints to stop the execution at those points.
0 downloads
Artifact jadex-rules
Group net.sourceforge.jadex
Version 2.4
Last update 20. December 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 3
Dependencies jadex-commons, jadex-xml, antlr-runtime,
There are maybe transitive dependencies!
Group net.sourceforge.jadex
Version 2.4
Last update 20. December 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 3
Dependencies jadex-commons, jadex-xml, antlr-runtime,
There are maybe transitive dependencies!
jung2 from group net.sf.jung (version 2.0.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: net.sf.jung Artifact: jung2
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung2
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 7.0.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. Chips-n-Salsa now also includes genetic
algorithms as well as evolutionary algorithms more generally. The
library very extensively supports simulated annealing. It includes
several classes for representing solutions to a variety of optimization
problems. For example, the library includes a BitVector class that
implements vectors of bits, as well as classes for representing
solutions to problems where we are searching for an optimal vector
of integers or reals. For each of the built-in representations, the
library provides the most common mutation operators for generating
random neighbors of candidate solutions, as well as common crossover
operators for use with evolutionary algorithms. Additionally, the
library provides extensive support for permutation optimization
problems, including implementations of many different mutation
operators for permutations, and utilizing the efficiently implemented
Permutation class of the JavaPermutationTools (JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
0 downloads
Artifact chips-n-salsa
Group org.cicirello
Version 7.0.0
Last update 01. August 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Group org.cicirello
Version 7.0.0
Last update 01. August 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
mahout from group org.apache.mahout (version 14.1)
Mahout's goal is to build scalable machine learning libraries. With scalable we mean: Scalable to
reasonably large data sets. Our core algorithms for clustering, classification and batch based collaborative
filtering are implemented on top of Apache Hadoop using the map/reduce paradigm. However we do not restrict
contributions to Hadoop based implementations: Contributions that run on a single node or on a non-Hadoop
cluster are welcome as well. The core libraries are highly optimized to allow for good performance also for
non-distributed algorithms. Scalable to support your business case. Mahout is distributed under a commercially
friendly Apache Software license. Scalable community. The goal of Mahout is to build a vibrant, responsive,
diverse community to facilitate discussions not only on the project itself but also on potential use cases. Come
to the mailing lists to find out more. Currently Mahout supports mainly four use cases: Recommendation mining
takes users' behavior and from that tries to find items users might like. Clustering takes e.g. text documents
and groups them into groups of topically related documents. Classification learns from existing categorized
documents what documents of a specific category look like and is able to assign unlabelled documents to the
(hopefully) correct category. Frequent itemset mining takes a set of item groups (terms in a query session,
shopping cart content) and identifies, which individual items usually appear together.
Group: org.apache.mahout Artifact: mahout
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact mahout
Group org.apache.mahout
Version 14.1
Last update 16. July 2020
Organization The Apache Software Foundation
URL http://mahout.apache.org
License Apache License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group org.apache.mahout
Version 14.1
Last update 16. July 2020
Organization The Apache Software Foundation
URL http://mahout.apache.org
License Apache License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jsgen from group com.github.jochenw (version 1.2)
Jsgen is a Java Source Generation Framework: That means, it should be a valuable tool, if you intend to write a custom generator for Java
sources.
As such, it is the successor of a previous framework, called JaxMeJS (http://jaxme.sourceforge.net/JaxMeJS/docs/index.html).
The predecessor came into being as a standalone project. It was incorporated into the bigger JaxMe project, when the latter
was adopted by the Apache Webservices project. And it was buried as part of the bigger project, when the latter was moved to the
Apache Attic (http://svn.apache.org/repos/asf/webservices/archive/jaxme/).
That was fine for quite some time, because the latest released version (JaxMeJS 0.5.2) did its job quite well.
Over the years, however, the Java language has evolved, and the lack of support for features like Generics, or
Annotations, became a burden. Hence the Successor: Jsgen picks up, where JaxMeJS ended. It is, however, a complete
rewrite with several additional features, that the author considers to be important for modern Java applications:
1. It supports Generics.
2. It supports Annotations.
3. The builder pattern has been adopted. Almost all important classes are implemented as builders.
This should make writing the actual source generators much more concise, and maintainable, than
it used to be before.
4. The code style is configurable. Code styles allow you to concentrate on the actual work.
The resulting Jave source will look nicely formatted, anyways. As of this writing, you
can select between two builtin code styles:
- The default code style is basically the authors personal free style, roughly comparable to the default
code style of the Eclipse Java IDE.
- As an alternative, there is also a Maven code style, which is widely used in the Open Source communities.
Compared to the default style, it is less concise, if not even a bit verbose. On the other hand, it is
widely adopted by projects in the vicinity of {{{https://maven.apache.org}Apache Maven}}.
5. Import lists are created, and sorted, automatically.
Artifact jsgen
Group com.github.jochenw
Version 1.2
Last update 10. November 2019
Organization not specified
URL https://jochenw.github.io/jsgen
License Apache License, Version 2.0
Dependencies amount 1
Dependencies jsr305,
There are maybe transitive dependencies!
Group com.github.jochenw
Version 1.2
Last update 10. November 2019
Organization not specified
URL https://jochenw.github.io/jsgen
License Apache License, Version 2.0
Dependencies amount 1
Dependencies jsr305,
There are maybe transitive dependencies!
Page 213 from 3 (items total 2143)