Search Results for "translator algorithm java" - Page 3
Sort By:
Showing 193 open source projects for "translator algorithm java"
View related business solutions-
Attack Surface Management | Criminal IP ASMCriminal IP’s Attack Surface Management (ASM) is a threat-intelligence–driven platform that continuously discovers, inventories, and monitors every internet-connected asset associated with an organization, including shadow and forgotten resources, so teams see their true external footprint from an attacker’s perspective. The solution combines automated asset discovery with OSINT techniques, AI enrichment and advanced threat intelligence to surface exposed hosts, domains, cloud services, IoT endpoints and other Internet-facing vectors, capture evidence (screenshots and metadata), and correlate findings to known exploitability and attacker tradecraft. ASM prioritizes exposures by business context and risk, highlights vulnerable components and misconfigurations, and provides real-time alerts and dashboards to speed investigation and remediation.
-
Airlock Digital - Application Control (Allowlisting) Made SimpleFor organizations seeking the most effective way to prevent malware and ransomware in their environments. It has been designed to provide scalable, efficient endpoint security for organizations with even the most diverse architectures and rigorous compliance requirements. Built by practitioners for the world’s largest and most secure organizations, Airlock Digital delivers precision Application Control & Allowlisting for the modern enterprise.
-
1
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... -
2
Tetris Puzzle Solver
Fills a rectangle using given tetris shapes
Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim. -
3
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
4
The project objective is the development of an optimization algorithm for the problem of stowing general cargo into platform supply vessels.
-
Software for managing apps and accounts | WebCatalogTurn websites into desktop apps with WebCatalog Desktop—your all-in-one tool to manage apps and accounts. Switch between multiple accounts, organize apps by workflow, and access a curated catalog of desktop apps for Mac and Windows.
-
5
Character Encoding Translator
Translate text from one encoding to another.
Character Encoding Translator is an API and utility for translating text from one character encoding to another. A single JAR provides a GUI application, a console application, and an API. -
6
Neural Libs
Neural network library for developers
This project includes the implementation of a neural network MLP, RBF, SOM and Hopfield networks in several popular programming languages. The project also includes examples of the use of neural networks as function approximation and time series prediction. Includes a special program makes it easy to test neural network based on training data and the optimization of the network. -
7
ProvErr
System Level Statistical Fault Diagnosis using Dependency Model
Code base moved to: https://github.com/Data-to-Insight-Center/ProvErr A statistical fault diagnosis tool that leverages an application's dependency model to automatically infer an o ending piece of software/system in event of failure -
8
PetriOpti
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks. -
9
MoccaCPU
Java based CPU stress testing tool
MoccaCPU is a CPU stress testing tool written in Java. It uses the Monte-Carlo-Algorithm to calculate approximate values of π (Pi) during the test. Mutiple threads can be started to use the full capacity of all given CPU cores. -
We help you deliver Virtual and Hybrid Events using our Award Winning end-to-end Event Management PlatformEventsAIR have been anticipating and responding to the ever-changing event industry needs for over 30 years, providing innovative solutions that empower event organizers to create successful events around the globe.
-
10
Strongly-Typed Javascript is a translator from Java its very similar Javascript counterpart. Unlike GWT, STJS doesn’t impose you any library on the client side and any special tool during development apart from a Maven plugin.
-
11
This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).
-
12
Extract Objects from Image
Connected Component Labeling Algorithm - Extracting Objects From image
fast Connected Component Labeling Algorithm - java application - Extracting Objects From image -
13
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. ... -
14
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. -
15
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
16
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
17
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
18
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
19
bioluminescence
A java library for polymorphic genome assembly.
Bioluminescence is a java library for facilitating de novo genome assembly in the context of reads sampled from a single highly-polymorphic diploid individual. Bioluminescence implements a novel algorithm which uses an artificial neural network to classify contigs in a genome assembly as haplotype-specific or not-haplotype-specific. It then uses this information to partition the original input read set into two subsets, each of which has been enriched for one of the haplotypes. ... -
20
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
21
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
22
Mjolnir
Java code for brute forcing keystore certificates
Mjölnir is a a java-based brute force algorithm for obtaining keystore passwords by brute force. It is multi-threaded -
23
po-auto-translator
Translating PO and POT files from one natural language to other.
Translating GetText PO and POT files from one natural language to other. -
24
oqt-maven-plugin
Maven OpenJPA Query Translator Plugin
The oqt-maven-plugin allows automatic JPQL to SQL query translation in a maven project. The result is outputted as standard maven report. Additional goals exist for simple JPQL validation. -
25
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...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.
