Dependency Packages
-
OpSel.jl1Efficient optimal selection for tree breeding
-
DiscoDiff.jl1A small package for differentiable discontinuities in Julia.
-
OpticalFibers.jl1Julia package for Optical fibers
-
DiscriminativeCircuits.jl1Discriminative Circuits from the Juice library
-
DispatcherCache.jl1Adaptive persistency-based mechanism for Dispatcher task graphs
-
CompactBasisFunctions.jl1Compactly supported basis functions in Julia
-
DynamicBoundspODEsDiscrete.jl1Valid Discrete-Time Methods for Relaxing pODEs
-
StackedHourglass.jl1-
-
PowerSystemsMaps.jl1-
-
SSMPlots.jl1A Julia package for plotting sequential sampling models
-
SineFit.jl1Robustly and accurately fit monochromatic sine waves.
-
MPIFiles.jl1Julia Package for reading and writing MPI Files
-
JordanForm.jl1An _educational_ implementation for computing the Jordan form and its transformation matrix.
-
IteratedIntegration.jl1Iterated h-adaptive integration (IAI)
-
MortarContact2D.jl1Mortar contact mechanics for plane problems
-
SMLMData.jl1Data types and utilities for SMLM coordinate data.
-
DiscreteEntropy.jl1Estimation of Shannon Entropy for Discrete Random Variables
-
DeformableBodies.jl1Julia package dedicated to modeling and solving the change of reference frame problem for self-deforming bodies.
-
SMLMMetrics.jl1Metrics for SMLM
-
MonteCarloMarkovKernels.jl1Some generic Markov kernels for Monte Carlo
-
CopositiveAnalyticCenter.jl1Analytic center cutting plane method to solve copositive optimization problems
-
EquationOfStateRecipes.jl1Plotting recipes for equations of state
-
SMLMSim.jl1Simulation of single molecule data sets
-
CurricularVisualization.jl1CurricularVisualization.jl is an extension of the CurricularAnalytics.jl toolbox for visualizing curricula and degree plans.
-
Ewalder.jl1A reference implementation for Ewald summation, which calculates the electrostatic energy of a periodic system.
-
MLJGaussianProcesses.jl1Gaussian Processes for MLJ
-
QuasiCopula.jl1A Flexible Quasi-Copula Distribution for Statistical Modeling
-
SimSpread.jl1SimSpread is a novel approach for predicting interactions between two distinct set of nodes, query and target nodes, using a similarity measure vector between query nodes as a meta-description in combination with the network-based inference for link prediction.
-
SpinGlassEngine.jl1-
-
LearnVanishingIdeal.jl1-
-
SignedDistanceFunction.jl1-
-
AutomationLabsExportation.jl1Advanced exports management for AutomationLabs.jl
-
Equate.jl1Equating Functions
-
QuantumESPRESSOFormatter.jl1Format Quantum ESPRESSO input files
-
StatsProcedures.jl1An interface framework for sharing intermediate steps across statistical methods
-
Clusterpath.jl1Julia implementation of *l*_1-norm clusterpath (Hocking et al., 2011, Radchenko & Mukerjee, 2017)
-
ScTenifold.jl1-
-
SceneGraphs.jl1Scene Graphs for abstract (acyclic) representation of 3D Worlds
-
ScalarRadau.jl1The famous 5th order Radau IIA method, tailored for any *scalar* ODE that requires excellent solver stability
-
MiseEnPage.jl1Analyze the layout of manuscript pages edited according to the conventions of the Homer Multitext project
Loading more...