Search Results for "https"
Sort By:
Showing 21 open source projects for "https"
View related business solutions-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
1
Java·Applied·Geodesy·3D
Least-Squares Adjustment Software for Geodetic Sciences
JAG3D is no longer developed at source-forge, and has moved to GitHub. Please visit https://github.com/applied-geodesy/jag3d or https://software.applied-geodesy.org to get the latest version. -
2
NOTE: The GROOVE codebase has moved to https://github.com/nl-utwente-groove
-
3
PLEASE NOTE that we are in the process of moving to GitHub: https://github.com/jasypt/jasypt Jasypt (Java Simplified Encryption) is a java library which allows the developer to add basic encryption capabilities to his/her projects with minimum effort, and without the need of having deep knowledge on how cryptography works. PLEASE NOTE that we are in the process of moving to GitHub: https://github.com/jasypt/jasypt
-
4
...In contrast to other GA implementations, the library uses the concept of an evolution stream (EvolutionStream) for executing the evolution steps. Since the EvolutionStream implements the Java Stream interface, it works smoothly with the rest of the Java Stream API. Other repositories: - https://github.com/jenetics/jenetics Maven: - https://mvnrepository.com/artifact/io.jenetics
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
5
Point Symmetry Clustering
Point Symmetry Clustering Approach Using Differential Evolution
Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf http://www.softcomputing.net/smca-paper1.pdf 1. ... -
6
FUMOLA - Functional Mock-up Laboratory
An FMI-based co-simulation framework.
FUMOLA is a co-simulation framework specifically designed to support the features offered by the FMI specification. It provides a flexible platform that allows to configure and execute co-simulation setups in an easy way. FUMOLA is developed on top of the Ptolemy II framework (https://ptolemy.eecs.berkeley.edu) and the FMI++ library (http://fmipp.sourceforge.net). The online documentation of FUMOLA is available here: https://sourceforge.net/p/fumola/wiki/Home/ -
7
EntOpt Layout
Relative entropy optimization network layout plugin
...If you are using the plugin, please cite: Ágg B, Császár A, Szalay-Bekő M, Veres DV, Mizsei R, Ferdinandy P, Csermely P and Kovács IA (2019) The EntOptLayout Cytoscape plug-in for the efficient visualization of major protein complexes in protein-protein interaction and signalling networks, Bioinformatics 35(21):4490-4492 https://academic.oup.com/bioinformatics/article/35/21/4490/5475596 Our detailed Tutorial on the use of the plugin: https://suopte.com/entopt_2_1_tutorial_20200518.pdf A video about the version 2.1: http://suopte.com/entopt_2_1_tutorial_video.mp4 Don't hesitate to send any questions, comments or bug reports also to agg.bence {at} med.semmelweis-univ.hu. -
8
Jafaran
Fast and more random implementations of java.util.Random.
...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. -
9
**NOTE**: The WALA project is now hosted at https://github.com/wala/WALA; the latest source code and updates are available there. The code here on Sourceforge is highly out of date and unsupported. The T. J. Watson Libraries for Analysis (WALA) provide program analysis capabilities for Java bytecode and related languages. The WALA libraries constitute an open-source release of parts of IBM Research's DOMO analysis infrastructure.
-
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.
-
10
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego/treelayout/. -
11
Structorizer is a little tool which you can use to create Nassi-Schneiderman Diagrams (NSD). Stuctorizer is written in Java and free for any use. The code has been moved to Github: https://github.com/fesch/Structorizer.Desktop
-
12
jmathstudio - Java Image/Signal toolkit
Java toolkit for discrete Image and Signal processing.
JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/ -
13
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). ... -
14
algebrain
Math Parser for Java
Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint. -
15
Funnel Sort
command line sort utility
Moved to GitHub https://github.com/fedups A command-line utility to sort files. Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. -
16
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013. -
17
BinBase
BinBase is a software for the automatic analysis of Massspec data from
BinBase is a software for the automatic analysis of Massspec data from LECO GC-Tofs. All code and documentation has been moved to the google code site of this project: https://code.google.com/p/binbase/ And support is provided by the company coding and more, which can be reached under: contact@codingandmore.org -
18
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
...We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/ If you use our ESM implementation to support academic research, please cite the following paper: Haibin Liu, Vlado Keselj, and Christian Blouin. Exploring a Subgraph Matching Approach for Extracting Biological Events from Literature. Computational Intelligence, 2013. -
19
EvolutionaryComputation
Evolutionary Computation on Android
...We, Tom BERNARD and Ugo PICHE, were asked to do this project as part of our electronic & computer science in the Polytech'Paris-UPMC engineer school, in France. We wanted to thank Mario Zechner and all contributors behind the fabulous libGDX project (https://code.google.com/p/libgdx/) which allowed us to use Box2D and OpenGL ES more, more easily than without this API. -
20
This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. ...
-
21
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pack:tag is now available at github: https://github.com/galan/packtag >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
- Previous
- You're on page 1
- Next
