Search Results for "j-interop"
Sort By:
Showing 25 open source projects for "j-interop"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
JMEScriptGUI
Pequeño IDE para el lenguaje JMEScript.
Con este IDE podrá probar cualquier script escrito en JMEScript con toda la funcionalidad del lenguaje, incluidos gráficos 2D y conexión MySQL. La versión para Android, en este momento, tiene menos funcionalidad y ejecuta la versión 0.1 de JMEScript. Parser JME y lenguaje JMEScript en https://sourceforge.net/projects/jme/ Documentación en https://morenobarrientos-jme.site44.com/ Código fuente y UDL para Notepad++ en pestaña 'FILES' -
2
JME (Java Math Expression)
Evaluador de expresiones matemáticas para Java en español
...Puede consultarse la documentación de usuario y de desarrollador en la página https://miguelalejandromorenobarrientos.github.io/JmeDoc/ IDE JMEScriptGUI https://sourceforge.net/projects/j -
3
dupost
Dual Porosity Stokes model implemented with FEniCS
...In: Rodrigues J. et al. (eds) Computational Science – ICCS 2019. ICCS 2019. Lecture Notes in Computer Science, vol 11539. Springer, Cham -
4
...With the basic library one can solve heat flow equations, Maxwell equations, and solid mechanical problems. Several add-ons are available for particular application classes. New paper: J. Schöberl: "C++11 Implementation of Finite Elements in NGSolve", ASC Report 30/2014, Institute for Analysis and Scientific Computing, Vienna University of Technology, 2014 http://www.asc.tuwien.ac.at/~schoeberl/wiki/publications/ngs-cpp11.pdf
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
MathFu
C++ math library developed primarily for games focused on simplicity
MathFu is a small, header-only C++ math library optimized for games and real-time graphics on mobile and desktop. It provides fixed-size vector, matrix, and quaternion types with APIs that mirror the operations you actually use in inner loops—dot, cross, normalize, transforms, and projections. Implementations are carefully tuned to leverage SIMD instruction sets such as SSE and NEON while preserving a clean fallback path for portability. Because types are fixed at compile time, the compiler... -
6
n-chinese-remainders
chinese remainder theorem - progressive solving, n-soln, extras
...showing win or fail of each eqn and solving other sawtooth intersections is possible, due to that. crAll2@crtwo provides n soln near x for CR using width of soln crchart3 shows sawtooth CR waves and visible soln align1: solves i m2 == j m2 + b -> {i,j,dist} (like PowerMod->i but b is any and gcd(m1,m2) not req.) other funs: Euclidians, showFactors, changeBaseArr, caesar, rsa, inverseMod, IntToModTups (large number math for PC's) crfindnSolnAfterxInEqm (solve saw wave LL,RL,LR,... intersects) congruence, plots, y-shifted triangular wave solve, testing (for historic reasons files are also in https://sourceforge.net/projects/periodictablemm/) -
7
Jafaran
Fast and more random implementations of java.util.Random.
...The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm. -
8
Fast Expansions
Fast implementation of multiple precision arithmetics.
Fast implementation of multiple precision arithmetics using expansions as described in Shewchuk, J. R.. "Adaptive precision floating-point arithmetic and fast robust geometric predicates." Discrete & Computational Geometry 18.3 (1997): 305-363.. -
9
hbgm
'Hierarchical Bond Graph Modelling of Biochemical Networks'
Scripts and supplementary data for the manuscript 'Hierarchical Bond Graph Modelling of Biochemical Networks': Peter J. Gawthrop(1), Joseph Cursons(1,2), and Edmund J. Crampin(1-4). (1) Systems Biology Laboratory, Melbourne School of Engineering, University of Melbourne, Victoria 3010, Australia. (2) ARC Centre of Excellence in Convergent Bio-Nano Science, Melbourne School of Engineering, University of Melbourne, Victoria 3010, Australia. (3) Department of Mathematics and Statistics, University of Melbourne, Victoria 3010, Australia... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
ArchNURBS
NURBS-based elastic and limit analysis of masonry arches in MATLAB
...A comprehensive descritpion of ArchNURBS is given in "ArchNURBS: NURBS-Based Tool for the Structural Safety Assessment of Masonry Arches in MATLAB", A. Chiozzi, M. Malagu', A. Tralli and A.Cazzani, J. Comput. Civil Eng., 2015. (http://ascelibrary.org/doi/abs/10.1061/%28ASCE%29CP.1943-5487.0000481) ArchNURBS has been developed thanks to a collaboration between the University of Ferrara (Italy) and the University of Cagliar -
11
Finds communities in networks with a submodular algorithm based on the optimization of Newman's modularity. The algorithm finds a weakly optimal community partition of the network. Developed by J. R. Busch, M. G. Beiro and J. I. Alvarez-Hamelin,
-
12
TIDES
Taylor series Integrator for Differential Equations
...Performance of the Taylor series method for ODEs/DAEs, Appl. Math. Comput. 163 (2), pp. 525--545 * R. Barrio, 2006. Sensitivity analysis of ODE's/DAE's using the Taylor series method, SIAM J. on Scientific Computing 27 (6), pp. 1929--1947 -
13
-
14
Fylogenetica
Constructing level-1-networks consistent with a set of quartets
This project is an implementation of an algorithm by J. Keijsper and R. Pendavingh. The goal of the algorithm is to construct a phylogenetic level-1-network that is consistent with a given set of quartets. -
15
...Related Papers: [1] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. An oracle-based, output sensitive algorithm for projections of resultant polytopes. International J. Computational Geometry & Applications (Special issue) World Scientific, 2013. [2] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. An output-sensitive algorithm for computing projections of resultant polytopes. In Proc. 28th Annual Symposium on Computational Geometry (SoCG 2012), pp.179-188, Chapel Hill, USA.
-
16
This project provides a set of libraries written in Java to easily manipulate Multi-Criteria Decision Aid (MCDA) concepts, especially related to outranking methods, and XMCDA files.
-
17
...Forcade, "Generating derivative structures from multilattices: Application to hcp alloys," Phys. Rev. B 80 014120 (July 2009) http://msg.byu.edu/papers/multi.pdf Gus L. W. Hart, Lance J. Nelson, and Rodney W. Forcade, "Generating derivative structures at a fixed concentration," Comp. Mat. Sci. 59 101-107 (March 2012) http://msg.byu.edu/papers/enum3.pdf
-
18
J3calc
Java Calculator
J³calc was initially a little project for my school but I enhanced it on and on and now it is a quite powerful calculator. It is written in Java with Swing. The sourcecode is open under the GPL 3.0 license -
19
knowceans
Utility classes from maps to search engine to random samplers
.... --- Highlights: --- org.knowceans.util: IndexQuickSort, TableList: apply order of one array/list to others +++ Vectors, ArrayUtils: array convenience +++ RandomSamplers, CokusRandom, ArmSampler, Densities: random sampling and distributions +++ Arguments: command line parser +++ StopWatch, Which, ExternalProcess: runtime stuff +++ ParallelFor: OpenMP workalike +++ PatternString, NamedGroupRegex: regex convenience --- org.knowceans.corpus: CorpusSearcher: full-text search engine +++ LabelNumCorpus: svmlight corpus storage and filtering +++ NIPS corpus with text, authors, labels and citations --- org.knowceans.map: InvertibleHashMultiMap, BijectiveHashMap: implement n:m and 1:1 relations. --- Other libs: knowceans-arms = port of the Adaptive Rejection Metropolis Sampler (ARMS) for arbitrary distributions +++ lda-j = port of lda-c, implementing Latent Dirichlet Allocation (LDA) -
20
Sistema de reconocimiento de voz usando CMU Sphinx-4 y un modelo acústico basado en el corpus de VoxForge en español y gramáticas en JFlex y BYACC/J para el dictado en habla casi natural para la escritura de expresiones matemáticas.
-
21
Algorithms that optimally & efficiently map atomic reactions. See 1) Atomic Reaction Mapping {Crabtree: amazon, b&n} 2) J. of Exp. Algorithmics, Vol 13 {Crabtree, Mehta} 3) J. Chem. Inf. Model., 2010, 50 (9), pp 1751–1756 {Crabtree, Mehta, Kouri}.
-
22
Source code for the paper J. Keiner and B. Waterhouse. Fast Principal Components Analysis method for finance problems with unequal time steps. In P. L'Ecuyer and A. B. Owen, editors, Monte Carlo and Quasi-Monte Carlo Methods 2008, Springer Verlag, 2010
-
23
Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.
-
24
-
25
The Python Genetic Programming Project implements a Genetic Programming System a la J Koza in Python.
- Previous
- You're on page 1
- Next