Algorithms

OVium originates and extends various categories of algorithms to support enterprise methodologies and cloud computing strategies.

 

  • Search: Spider agents that seek designated categories of information on internal an external networks, i.e. Nutch, Solr
  • Classification: The employment of clustering and trend prediction algorithms, SVM and HMM, to characterize categories and identify outliers in data. Outlier items can be used to reprogram search agents to seek new data sources.
  • Natural Language Processing: Development of semantic trees and inverted indexes from documents. NLP products provide inputs and are guided by higher level classification algorithms
  • Security: PGP, public key and private key algorithms for point to point and collaborative security solutions. Both cyclical and elliptical algorithms
  • Linear Programming: Linear algebra based hyper-polytope and dual constraint solution regions for direct an recursive clustering for classification solutions
  • Non-Linear Programming: Non-linear regions, typically convex, based on higher order splines and dual constraint solution regions for direct an recursive clustering for classification solutions. Other approaches are min-max clustering algorithms that exclusively employ recursive number comparisons rather than standard addition and multiplication arithmetic, eliminates precision loss with alternative classification behavior
  • Finite Field Integer Programming: Finite Galois field algebra and matrix diophantine constraint solution regions for direct an recursive clustering for classification solutions. These solutions use integer processing to eliminate floating point precision errors