Projects

patl

STL-compatible, high-performance template containers and auxiliary classes useful for stringology > Trie containers - trie_set & trie_map. > Online suffix tree containers - suffix_set & suffix_map - O(N) both time & space, 16 bytes per symbol, alphabet-independent. > ... [More] Iterators over each type of containers - standard (const_)(reverse_)iterator, special (post|pre|level)order_iterator for respective tree traversals. > Partial match iterators (const_)partimator (joker pattern filter, Hamming & Levenshtein automata filter). > suffix_cont-special match_iterator & (super_)maxrep_iterator for matching statistics and (super)maximal repeats. > Lowest common ancestor (LCA) O(1) time requests after O(N) postprocessing of the suffix_cont - lca_oracle. > Small & clever demo programs. [Less]

wykobi

Wykobi is an efficient, robust and simple to use multi-platform 2D/3D computational geometry library. Wykobi provides a concise, predictable, and deterministic interface for geometric primitives and complex geometric routines using and conforming to the ISO/IEC 14882:2003 C++ language specification. ... [More] The design and structure of Wykobi lends itself to easy and seamless integration into projects of any scale that require a robust yet efficient 2D/3D computational geometry back-end. General FeaturesPairwise intersections in 2D/3D between - Rays, Segments, Lines, Planes, Triangles, Quadii, Circles, Spheres, Rectangles, Boxes, Polygons, Cubic and Quadratic beziers Point inclusion test - Triangle, Rectangle, Circle, Quadix, Sphere and Convex\Concave Polygon region, In Circle and In Sphere Closest point from a point on - Segment, Line, Triangle, Quadix, Circle, Sphere and AABB Closest point on a circle/sphere from a 2D/3D segment or line Mirroring 2D/3D (reflection) about an axis or plane - Point, Segment, Line, Triangle, Quadix, circle, Sphere, Polygon Nonsymmetric mirroring 2D/3D (reflection) about an axis or plane - Point, Segment, Line, Triangle, Quadix, Circle, Sphere, Polygon Euclidean, Ley, Manhattan, Chebyshev and inverse Chebyshev pairwise distance - Rays, Segments, Lines, Planes, Triangles, Quadii, Circles, Spheres, Rectangles, Boxes, Cubic and Quadratic beziers Minkowski pairwise sum and differences between - Rays, Segments, Triangles, Quadii, Circles, Spheres, Rectangles, Boxes and Polygons Clipping of segments agains - Rectangles, Triangles, Quadii, Boxes and Circles Area Calculation - Triangle, Quadix, Rectangle, Circle and Polygon Perimeter Calculation - Triangle, Quadix, Rectangle, Circle and Polygon Generate random points within - AABB, Triangle, Quadix, Circle, Pentagon, Hexagon, Heptagon and Octagon Projection along linear path - Point, Segment, Triangle, Quadix, Circle, Sphere and Polygon Axis aligned bounding boxes - Segments, Triangles, Quadii, Circles, Sphere and polygons Centering of 2D geometric primitives at a specified location 2D/3D Vector addition, subtraction, normalization, magnitude, dot product, cross product calculation 2D/3D Rotations, fast rotations, translations, scaling and shear Point of reflection Quadratic and Cubic Bezier curve creation (2D/3D) Quadratic and Cubic Bezier curve length calculation Polygon approximation of supported geometrical objects Conversions between Cartesian and Barycentric coordiante systems Orientation, Collinear, Coplanar Perpendicular and Parallel primitives Vertex and relative Cartesian angle calculation AlgorithmsConvex Hull - Graham scan, Jarvis march, Melkman Minimum Bounding Ball - Randomized, Ritter and naive Polygon Clipping - Sutherland Hodgman, Polygon re-ording Polygon Triangulation - Ear Clipping Algorithm For Simple Polygons Statistical - Isotropic normalization, Covariance matrix, Eigen values and vectors Group Intersections - Naive pairwise intersections Special triangles, Circles and CentersAnticevian triangle Anticomplementary triangle Antipedal triangle Antipodal points Cevian triangle Circle tangent points Circum-center Circum-circle Confined triangle median Contact triangle Cyclocevian conjugate Equilateral triangle Euler Line Excentral triangle Exmedian point External triangle bisector Extouch triangle Feuerbach point and triangle Incentral triangle Incenter Inscribed circle Inner and outer napoleon triangles Inner and outer vecten vecten triangles Inverse Point Inverse Circle and Sphere Isogonal conjugate Isosceles triangle Medial triangle Morley triangle Orthocenter Orthic triangle Pedal trianglepoint Perspectrix between 2D/3D triangles Symmedial triangle Symmedian point Torricelli point Triangle median Triangle symmedian and plenty more... Compatible C++ CompilersGCC 4.0+ Intel C++ Compiler 9.0+ Microsoft Visual C++ 8.0+ Comeau C/C++ 4.1+ For more information please visit: http://www.wykobi.com [Less]

fastgeo

FastGEO is a library written in Delphi that contains a wide range of highly optimized vector based geometrical algorithms and routines for many different types of geometrical operations such as geometrical primitives and predicates, hull construction and triangulation, clipping, rotations and ... [More] projections. For more information please visit: http://www.partow.net/projects/fastgeo/index.html [Less]

jMotif

JMotif implements in Java number of methods for timeseries data handling and analysis: * Z normalization of timeseries * Piecewise Aggregate Approximation (PAA) of timeseries * Symbolic Aggregate Approximation (SAX) of timeseries * iSAX (indexed SAX) in order to help one leverage the symbolic ... [More] representation of timeseries, it implements: * TFIDF statistics * Cosine similarity * Sequitur algorithm as well as their application for: * Motif (recurring patterns) detection with SAX * Discord (unique patterns) detection with SAX * Timeseries classification * Timeseries clustering [Less]

ivela

Ivela is a JEE software that allows schools, universities, companies and institutions to create, offer and manage e-learning courses (in someway like Moodle). The courses creation goes beyond grades, exercises, teachers, coordinators and students management. It offers tools for online content ... [More] building based on rich text editors embedded into browser. But also the content administrator can choose to create a content outside the application using "third-part" tools, based on an "Ivela Content Package Standard". This standard defines a compressed package oriented by a xml descriptor file. Based on this standard, the package can store inside it a complete html content, with images, javascript and css. The Ivela application also has an important feature that is voice recognition which allows cr [Less]

adist

Astronomical library for photometric distances calculation. Implemented different extinction models. Pure Python inside.

zip-code

About Route-Nova Zip-code - Java libraryZip-code is a library for calculating the distance between two zip codes and finding all the records with x miles (or kilometers) of another zip code. Currently, Zip-code support only PostgreSQL. Additional future support for other databases will be added in ... [More] future releases of Zip-code. Zip-code is free software released under the terms of the new BSD license. Zip-code was written in JAVA and Pl/PgSQL. It runs for testing purposes with open-source US zip code data, that available for free at http://www.populardata.com in CSV format. The distance calculations are made by doing a great circle calculation on longitude and latitude points provided by the census data. The result is returned in kilometers or standard miles. [Less]

obsearch

Synopsis: Similarity search is required in many areas. For example, music matching and binary program matching require a similarity search engine. Nowadays, it is common to hear news of projects like "photosynth" that heavily rely on similarity search. OBSearch is a similarity search ... [More] engine that can help you to create an interesting and new application! Features: Single-computer or distributed mode. (1) Designed to handle efficiently heavy objects (trees, graphs). Code generation for each primitive datatype (byte, short, int, long, float, double) for maximum performance. The API is compact and easy to understand. Stability and scalability: OBSearch's secondary storage backend is Oracle's Berkeley DB. An extensive test suite makes sure that data integrity is preserved. Cutting edge: We strive to put together the latest algorithms the scientific community has to offer. For example, we use the K-means++ algorithm in one of our indexes. OBSearch can live on top of any B-Tree (or anything that allows range queries for one dimension). For example, Amazon's cloud service SimpleDB http://www.amazon.com/gp/browse.html?node=342335011 OBSearch's homepage is: http://obsearch.berlios.de/ This project started as part of Google Summer of Code 2007. The mentoring organization was Portland State University. Technicalities: Available indexes: IDistance Extended Pyramid Technique P+Tree D-Index (with rho=0) K-nn graph (1) The first version 0.7-GSOC supports distributed access by JXTA. Right now, we are evaluating the distributed technology we will employ in the future. Mailing lists: Announce: http://groups.google.com/group/obsearch-announce Users: http://groups.google.com/group/obsearch-users Dev: http://groups.google.com/group/obsearch-developers [Less]

friendsearth

根据您和您的好友家乡所在的城市，列出您和您所有的好友家乡的距离

ves-asoiu

This is Virtual Educational System that provides distance education abilities to students in KPI University on kafedra ASOIU.