Open Source Java Algorithms

basE91 is an advanced method for encoding binary data as ASCII characters. It is similar to UUencode or base64, but is more efficient. The overhead produced by basE91 depends on the input data. It amounts at most to 23% and can range down to 14%.

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

CADI is an implementation of the JPIP standard (JPEG2000 Interactive Protocol - Part 9). CADI includes a JPIP server, a JPIP proxy, and a JPIP Client. CADI is designed and programmed with the aim to provide a flexible framework to test and develop ne

HL7 to XML Transformation toolkit. Using HL7 v2 XML

Java Concurrency Tools for the JVM. This project aims to offer some concurrent data structures currently missing from the JDK. There’s more to come and contributions/suggestions are most welcome. JCTools has enjoyed support from the community and contributions in the form of issues/tests/documentation/code have helped it grow. JCTools offers excellent performance at a reasonable price (FREE! under the Apache 2.0 License). It’s stable and in use by such distinguished frameworks as Netty, RxJava and others. JCTools is also used by commercial products with great results. JCTools is maven built and requires an existing Maven installation and JDK8 (only for building, runtime is 1.6 compliant). With ‘MAVEN_HOME/bin’ on the path and JDK8 set to your ‘JAVA_HOME’ you should be able to run “mvn install” from this directory. While you are free to copy & extend JCTools, we would much prefer it if you have a versioned dependency on JCTools to enable better support, upgrade paths and discussion.

JNdiff: An Optimized Alghorithm for Natural (XML) Diff-ing

K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.

A markup language for expressing knitting patterns which can serve as a software interchange format

LiMa means Lightweight Markup Language. It is a parser for an easy to use ASCII/Text-based markup - comparable to Markdown or the Wikipedia-Markup language with special configurable extensions in defining Links and image-resources.

The OS561 operating system based around FORTH/Java. The OS is to run on a VHDL chip OpenHardware design called the Minon, but could become available for other platforms. The unique point of the design is a revolutionary data compression technology.

A P2P overlay construction toolkit, which supports routing algorithm researchers in addition to application developers. It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu

TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.

Ky eshte nje projekt i HAPUR/FALAS per publikun Shqip-foles i cili permban nje seri Video-Kursesh, Udhezime, dhe Shembuj Kodi per gjuhe (web) si: XHTML, CSS, JS, PHP, AS3 etj. si dhe per Desktop: C++, Java, Adobe Air etj. + programe/praktika te ndryshme.

The Vodoo/Stream project let users to define transducers dedicated to document analysis. Such transducers describe how fragments are matched and transformed. Finally a document can be an XML fragment, a free text or something else depending on extensions

This application talks to a GPS device over the NMEA protocol via the WIGSGPSComm API. The first version of the WIGS application will present the GPS data in an intuitive fashion, and later releases will be further enhanced with special map support.

This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.

Connection pool: manage SQL in file, Strong (auto recover/detect connection) Data persistence: Store/fetch java object from/to DB/XML/PureText. configable XML: extend W3C DOM Programming: extend java, (multi-line properties etc.)

This project is a reasoner for the description logic EL+. It computes the concept subsumption hierarchy. It is an OWL 2 EL reasoner.

OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has been discovered, and it is added to the ontology. If the user rejects it, the user has to give a counterexample to this question, i.e., an individual that is an instance of C1, C2 and not C3. When all such questions (about some initially given classes) have been answered, the ontology is complete with respect to the application domain.