Download JAR files tagged by derivative with all dependencies
root_2.11 from group com.talenteca (version 1.0.0)
A derivative work of Lift focused on new updates and security recommendations.
Artifact root_2.11
Group com.talenteca
Version 1.0.0
Last update 06. August 2021
Organization Talenteca
URL https://github.com/talenteca/olon-web-framework
License Apache License, Version 2.0
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!
Group com.talenteca
Version 1.0.0
Last update 06. August 2021
Organization Talenteca
URL https://github.com/talenteca/olon-web-framework
License Apache License, Version 2.0
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!
opendap from group edu.ucar (version 2.2.2)
Open-source Project for a Network Data Access Protocol, modified for NetCDF purpose.
This artifact is a derivative work from the official OPeNDAP library (http://opendap.org), modified by UCAR.
The packages were renamed from "dods.*" to "opendap.*" and the groupID from "org.opendap" to "edu.ucar".
Artifact opendap
Group edu.ucar
Version 2.2.2
Last update 07. March 2011
Organization OpenDAP
URL http://opendap.org/
License LGPL 2.1
Dependencies amount 3
Dependencies servlet-api, jdom, commons-httpclient,
There are maybe transitive dependencies!
Group edu.ucar
Version 2.2.2
Last update 07. March 2011
Organization OpenDAP
URL http://opendap.org/
License LGPL 2.1
Dependencies amount 3
Dependencies servlet-api, jdom, commons-httpclient,
There are maybe transitive dependencies!
jcobyla from group de.xypron.jcobyla (version 1.4)
COBYLA2 is an implementation of Powell's nonlinear derivative free
constrained optimization that uses a linear approximation approach.
The algorithm is a sequential trust region algorithm that employs
linear approximations to the objective and constraint functions, where
the approximations are formed by linear interpolation at n + 1 points
in the space of the variables and tries to maintain a regular shaped
simplex over iterations.
It solves nonsmooth NLP with a moderate number of variables (about 100).
Inequality constraints only.
The initial point X is taken as one vertex of the initial simplex with
zero being another, so, X should not be entered as the zero vector.
3 downloads
Artifact jcobyla
Group de.xypron.jcobyla
Version 1.4
Last update 31. May 2022
Organization not specified
URL https://github.com/xypron/jcobyla
License The MIT License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group de.xypron.jcobyla
Version 1.4
Last update 31. May 2022
Organization not specified
URL https://github.com/xypron/jcobyla
License The MIT License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Page 3 from 3 (items total 23)