Search Results for "translator algorithm java" - Page 9
Sort By:
Showing 692 open source projects for "translator algorithm java"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
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. Concerning performance... -
2
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. -
3
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 -
4
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. -
Secure remote access solution to your private network, in the cloud or on-prem.OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
-
5
CalPCS
A pitch class set analyzer.
CalPCS is a free pitch class set calculator software. System requeriments: Java Runtime Environment 1.6 or above. Screen of at least 800x600px. Optional: A Java Sound Bank. The program displays for each set their normal order, classification, transposition, whether it is an inversion, prime form, interval vector and the invariant property. -
6
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... -
7
JConstraints
Java Framework to implement solutions to solve constraints problems
JConstraints is a Java Framework that enables implementations of advanced solutions for combinatorial problems as constraints satisfaction problems. The architecture was built thinking in the constraints satisfaction paradigm. The Framework is easy to use. Therefore, with few interfaces implementations you can already run advanced combinatory solutions. Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety... -
8
algorithmic trading testing
Testing framework for structures regarding performance.
Framework for testing of various java structures regarding performance. Eg. comparison of arrays vs list. Performance of structures is crucial when building software aiding algorithmic trading. In area of algorithmic trading, especially in high frequency trading. In high frequency trading (HFT) it is all about latency. Software which supports this kind of operations has to introduce lowest possible latency by itself. Therefore analysing every possible element that may introduce latancy... -
9
En2ArTrans
an English to Arabic text translator
this project in no more valid because UTF-8 is not showing correctly in the new java versions, I'll verify and update soon. :) sorry for inconvenience. -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
Brute-Force Sudoku Solver
Java, Brute Force, Recursive Sudoku Solver
This program prompts the user for a text file containing puzzle data, attempts to solve the puzzle using a brute force algorithm, and prints the solution along with the time it took to solve. I've included 3 sample puzzle files in the "res" folder. "Sub-box width/height" refers to the dimensions of the inner boxes in the puzzle. For example, a 9x9 puzzle has 9 3x3 sub-boxes. The 6x6 puzzle that I've included has sub-box dimensions of 3x2. This version does not contain any GUI components, so... -
11
HAWK - PDF Text Search Java Project
No more support for this project - TAKE A LOOK AT FALCONSEARCH
No more support for this project - TAKE A LOOK AT FALCONSEARCH "https://sourceforge.net/projects/falcontextsearch/" -
12
LoveCalculator
A Love Calculator with a Rich User Interface
This is a Love Calculator with a rich user interface and animations made by using JavaFX. This application runs on Windows, Linux and Mac. Java 7 or later is required. Unlike the other Love Calculators found on Internet, this one does not generate random numbers. It uses a popular hand worked algorithm used by most of the school students. The Love Percentage is calculated by the process of listing the frequencies of each letter in the string "<Name1> LOVES <Name2>" and then adding... -
13
An easy-to-use simulator for decentralized distributed scheduling in Clusters, Grids, and Cloud ecosystem MaGate 2.0 is now available from github! https://github.com/huangye177/magate
-
14
Fileprivacy
Fileprivacy easily encrypts your files
... change the algorithm after setting the keylength. It has to be restarted for further use. Because there are no start scripts, yet, you have to start Fileprivacy from console by typing: java -jar Fileprivacy-1.0_<version>.jar ####### ALSO NOTE ####### The author of this software is not responsible for the safety of your data. There is no guarantee that one or more of the implemented algorithms cannot be compromised. -
15
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 matrices... -
16
JCryptor
JCryptor is an encrypting tool based on the Caesar-cipher.
JCryptor uses the Caesar-cipher to encrypt keystrokes on-the-fly. It can also be used to decrypt an encrypted text easily. Caesar-cipher is a simple encryption algorithm, developed by Julius Caesar, to encrypt his correspondence with Cicero in the ancient world. Therefore it uses a simple character substitution method to replace a given character by another. A keyshift of thirteen is called ROT13. ROT13 can be decrypted by encrypting it again with ROT13. Even today this simple method is used... -
17
Mouse Rate
OS independent mouse rate checker written in Java.
Tiny program written in Java, which provides OS - independent and clean algorithm to measure your mouse rate (mouse latency). Java 7u5 or higher needed to run version 1.1 and lower. Java 7u40 or higher needed to run version 1.2 and higher. **Version 1.3 changes - Fixed graphic artefacts appearing while program window is dragged. **Version 1.2 changes - Major code review & cleanup - Mouse watching algorithm optimized - Duplicate cursor statistics calculations removed & rewritten... -
18
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
19
The IJBlob library indentifying connected components in binary images. The algorithm used for connected component labeling is: Chang, F. (2004). A linear-time component-labeling algorithm using contour tracing technique. Computer Vision and Image Understanding, 93(2), 206–220. doi:10.1016/j.cviu.2003.09.002 The ImageJ *Shape Filter Plugin* (see downloads) uses this library for flitering the blobs by its shape. If you are using IJBlob in a scientific publication, please cite...
-
20
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. Initial results... -
21
Unsupervised TXT classifier
Classify any two TXT documents, no training required - JAVA
This program is made to address two most common issues with the known classifying algorithms. First, over-training and second, shortage of data for a training of categories. Instead, each TXT file is a category on its own, rather than an assigned category. In a way, this is similar to clustering but not really a clustering algorithm since there is some training involved. The summarizer from Classifier4J has been adjusted to accept two inputs (lets call them A and B). Then, the summarizer gets... -
22
WOLFSIM: Wideband Optical FDTD Simulator
FDTD Electomagnetic Wave Simulation Software
... these publications for full details on the algorithm: http://www.ece.ncsu.edu/oleg/files-wiki/6/62/SPIE_12_Miskiewicz_wolfsim3D.pdf http://www.ece.ncsu.edu/oleg/files-wiki/1/13/OptExpress07_OH.pdf -
23
Java application for training and deploying text processing applications such as part-of-speech taggers, based on a re-implementation of Brill's algorithm in Java.
-
24
gannu
Java API and tools for performing NLP and other AI tasks
Java API and tools for performing a wide range of AI tasks such as: word sense disambiguation (released), optimization (5 Evolutionary Algorithms Implemented ETA February 2014), opinion mining (ETA November 2014) and text wikification (ETA July 2014). Gannu includes some graphical interfaces for scientific purposes. When using Gannu please cite: *Jiménez, F. V., Gelbukh, A. F. & Sidorov, G. (2013). Simple Window Selection Strategies for the Simplified Lesk Algorithm for Word Sense... -
25
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
