Search Results for "encryption algorithm java" - Page 2
Sort By:
Showing 167 open source projects for "encryption algorithm java"
View related business solutions-
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.
-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
1
Latin Square Toolbox
Generates Latin squares and counts their transversals
The Latin Square Toolbox contains software tools for efficiently generating Latin squares and counting their transversals with various user-configurable options. This open source release aims to help educate folks on Latin squares and their important applications to cryptography. This version contains three tools: 0. Latin Square Generator (LSG) 1. Latin Square Transversal Counter (LSTC) 2. Latin Square Property Checker (LSPC) -
2
BioPPSy
A biochemical property prediction system
Computationally predicts the pharmacokinetic properties of drug candidates using Quantitative Structure Property Relationships (QSPR) modelling. Assembles a set of tools and databases for predicting the physical properties of small molecules. The program models a given property's dependence on a collection of molecular and structural descriptors using a training set of molecules. Neural networks and support vector regression are available, as well as linear models. The models generated by... -
3
A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.
-
4
jalicanto
Traveling Salesman Problem "window time based" aproximate solver
Time based Traveling salesman problem solver. Using iterated local search algorithm, implements xkick perturbation Programmed in Java. A class to use the TSP Suite(Thomas Weise, Raymond Chiong, J ¨org L¨assig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. 2014.),is implemented. -
Earn up to 16% annual interest with Nexo.Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
GUI Ant-Miner is a tool for extracting classification rules from data. It is an updated version of a data mining algorithm called Ant-Miner (Ant Colony-based Data Miner).
-
6
smartblob
tiny code, html webcam game or plug brain in each blob, java server
...I'm planning a huge multiplayer world, some blobs played by people holding a bendable loop game controller (tape a 1 meter cut of thick extension cord into a loop) in front of webcam and bend it to bend your blob on screen, and other blobs controlled by AI. This is a game for general AI research in a fun way people can do together. The physics and vision algorithm is half working in version 0.3.0. The gameplay is better experienced in 0.2 which is controlled with the mouse so you dont have enough freedom of movement compared to webcam. This small file contains its own source code including occamserver, a tiny general java server I built which I'll adjust to allow http streaming connections to stay open for faster ajax than a new web call each time. ... -
7
Flamethyst is a flame fractal renderer written in java. It generalizes the classical algorithm in several ways, and support most features of Apophysis .flame files.
-
8
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
9
Visualization of Protein-Ligand Graphs
Compute protein graphs. Moved to https://github.com/MolBIFFM/PTGLtools
NOTE: Project moved to https://github.com/MolBIFFM/PTGLtools. The Visualization of Protein-Ligand Graphs (VPLG) software package computes and visualizes protein graphs. It works on the super-secondary structure level and uses the atom coordinates from PDB files and the SSE assignments of the DSSP algorithm. VPLG is command line software. If you do not like typing commands, try our PTGL web server: http://ptgl.uni-frankfurt.de/ -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
10
erne
ERNE - Extended Randomized Numerical alignEr
We present ERNE (Extended Randomized Numerical alignEr), a short string alignment package whose goal is to provide an all-inclusive set of tools to handle short (NGS-like) reads. ERNE comprises ERNE-FILTER (read trimming and continamination filtering), ERNE-MAP (core alignment tool/algorithm), ERNE-BS5 (bisulfite treated reads aligner), and ERNE-PMAP/ERNE-PBS5 (distributed versions of the aligners), -
11
Jafaran
Fast and more random implementations of java.util.Random.
...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. -
12
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
13
GDLOG
Implementation of the GNFS for discrete logarithm problem in GF(p)
GDLOG is an implementation of the General Number Field Sieve algorithm for discrete logarithm problem in GF(p). -
14
CUDAlign
CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs
CUDAlign is a tool able to align pairwise DNA sequences of unrestricted size in CUDA GPUs, using the Smith-Waterman algorithm combined with Myers-Miller. It produces the optimal alignment of 1 million base sequences in 45 seconds using a GTX 560 Ti. Many optimizations are being developed for this software. Look at the following papers for detailed information: [1] Edans Sandes, Alba Melo. Retrieving Smith-Waterman Alignments with Optimizations for Megabase Biological Sequences using GPU.... -
15
GenomeView is a genome browser and annotation editor that displays reference sequence, annotation, multiple alignments, short read alignments and graphs. Most major data formats are supported. Local and internet files can be loaded. This project has moved to GitHub: https://github.com/GenomeView/genomeview
-
16
gametes
Generate complex SNP models and heterogeneous datasets
Genetic Architecture Model Emulator for Testing and Evaluating Software (GAMETES) is an algorithm for the generation of complex single nucleotide polymorphism (SNP) models for simulated association studies. GAMETES is designed to generate epistatic models which we refer to as pure and strict, that constitute the worst-case in terms of detecting disease associations, since such associations may only be observed if all n-loci are included in the disease model. User friendly GAMETES software... -
17
fPotencia
Power flow library in C++
fPotencia is the fruit of free time and passion for power systems simulation. After observing the lack of ready-to-implement libraries for power system analisys, and that the existing ones focus on command line workflow, I decided myself to start a project to fill the gap. Since Power system simulations have started needing to be executed in parallel, the old C-like designs are outdated; modular design is now needed to launch many simulations at the same time based on a base... -
18
CryptoDock
CryptoDock is a tool that hosts various crypto. algorithms.
CryptoDock is free multi-platform application written in Java that hosts various hash and modern cryptographic algorithms you can use to protect your sensitive data on your computer. Available cryptographic algorithms: 1. NLSE-1 2. One Time Pad 3. AES Available hashing algorithms: 1. MD5 2. SHA-1 3. SHA-256 4. SHA-512 IMPORTANT: In order to run CryptoDock you need to have Java installed on your computer. Java is free and can be downloaded from - http://www.java.com/ -
19
phenotemp
phenological trends using NOAA AVHRR time series
Starting from GIMMS values as ascii data (each line will be treated as individual time series), the application can smooth the ts - values by applying different algorithm that are based on Fouriertransformation. Separation of seasonal figure as well as the detection of linear trends is possible. Possible breaks in longterm mean can be detected with a change-point analysis using CuSum algorithms. Phenological events such as start-of-season, day-of-max/day-of-min, end-of-season can be... -
20
FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences.
-
21
Impact is an explicit Finite Element Program Suite which simulates dynamic impact events. It has a range of elements, contact handling and different material laws. Models can be created, solved and analyzed with the included pre- and postprocessor. Impact is based on an Explicit Time stepping algorithm. These kind of codes are used to simulate dynamic phenomena such as car crashes and similar, usually involving large deformations.
-
22
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. ... -
23
FALCON - Text Search Java Project
JSON based text search Java Project
----------------- - What is it? - ----------------- The "Falcon Search" is a JAVA API and tool to search inside the documents. It was originally started to search the content in pdf files under the project "HAWK Search". Searching with this tool is query-based not word-based as in most of the document search tools OR document readers. It also takes care of jumbling of words within query and spelling mistakes. Commonly used techniques in this project are Natural Language... -
24
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). Requires Java 5 or later. -
25
cmotif
A method for mining conditional phosphorylation motifs
Phosphorylation motifs represent position-specific amino acid patterns around the phosphorylation sites in the set of phosphopeptides. The discovery of phosphorylation motifs is a very valuable work in bioinformatics. Although several algorithms have been proposed to uncover phosphorylation motifs, the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. In this paper, we propose an algorithm called C-Motif...
