Search Results for "encryption algorithm java" - Page 4

GSH builder is a free Galois Sub-Hierarchy visualization tool. The algorithm for calculating GSH is called Pluton and the present Java realization is based on two articles. "Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. ...

JCRCGen is a tool written completely in Java that will output public domain Java source code containing both the simple and table-driven implementations of the Rocksoft Model CRC algorithm. Generator polynomials may be any 8-bit multiple between 8 and 64 bits.

Java library for parsing and evaluating math expressions. Javadoc is available at http://bracer.sourceforge.net/javadoc/ P.S. This library depends on Apache Commons Math, so don't forget to include commons-math-2.2.jar to your project.

A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be...

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.

Using encryption to secure your code or text. Click File->Run to run your code using Ruby, see the pop up for output. Never save your text or code to disk unencrypted. Don't forget your password. Encryption is error-persistent.

Project aim to provide simple easy APIs for Java developers to use interactive abilities in their Java Applications like speech recognition, handwriting recognition, use of web cam , sound record/play, decision trees , text to speech and many others.

A library help for signing data with PKCS11 token (certificates with SHA1withRSA Sign Algorithm) and create CMS packages. It uses Bouncy Castle Crypto API and SUNPKCS11. Also it verify the signed data and verify signing certificate's OCSP control.

OpenForecast is a package of general purpose, forecasting models written in Java that can be applied to any data series. No knowledge of forecasting is required. Using this package, the most appropriate algorithm for your data will be selected.

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

ProViz is a program visualization framework for Java. It is built as a plugin to the Eclipse IDE. (We are getting close to publishing resources and making this project distributable. Stay tuned!) A video demo: http://www.youtube.com/watch?v=BsoK1n-OM

X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.

JConfigura is a library usable in java environments for sharing configuration parameters between different java applications. Moreover it exculpates developers of aspects like property file reading and securing property files with rsa encryption.

The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources.

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.

TextConverter is a graphical text editor allowing the user to encrypt/decrypt the textual contents displayed on the screen using a 128-bit AES (Advanced Encryption Standard) cipher.

The project Jaulp is jet another utility library project written in Java. It contains utility classes for Date ,Calendar, Collections, Resources, Files, IO for Random data, and many more. This is the last version for this project.

LEA is a lightweight eyetracking algorithm library (hence the name) written in and for Java. LEA is able to track eye movements with an ordinary webcam and returns relative movements (up, down, ...). It is also able to compensate for slight head motions.

JEnigma is a java API to implement the Enigma cipher, as used by the Enigma encryption machine.

...Uses server to store user information (user name, password, email address, friends list, log in state, IP address) in encrypted form. Uses custom designed symmetric encryption algorithm.

The IEEE 1619 Committee open-source reference implementations of encryption algorithms, plus testing and certification suites, for each encryption algorithm included in the standard.

G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.

Manentia Commons is a set of general purpose Java utility classes, including collection handling, configuration reading, date handling, logging wrappers, mail wrappers, database connection pooling manager, simple encryption wrappers and XML utilities.

The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.