QAT Code: The Warehouse

quasiArtifactualIntelligence —a perception from the edge

---

edit

  About ∞ White paper ∞ QuasiMatrix Code ∞ QAT Code ∞ Data Examples ∞ Scatter-Gather Explained ∞ The Plow Share ∞

edit

The QAT Code — The Warehouse (of everything)

---

The Warehouse if Pairs Expansion then Visual Scatter else Visual Cluster redim Bracketing Clusters while Event Chemistry wend SLIP class redim

In edit

QuasiMatrix code —the lean, mean code, redacted for performance—

Will move to a separate category quasiMatrix.code

''      ####   ##  ##    ##     ####   ####  ##   ##    ##    ######  #####   ####  ##  ##
''     ##  ##  ##  ##   ####   ##  ##   ##   ### ###   ####     ##    ##  ##   ##   ##  ##
''    ##  ##  ##  ##  ##  ##  ##       ##   #######  ##  ##    ##    ##  ##   ##    ####
''   ##  ##  ##  ##  ##  ##   ####    ##   ## # ##  ##  ##    ##    #####    ##     ##
''  ##  ##  ##  ##  ######      ##   ##   ##   ##  ######    ##    ## ##    ##    ####
''   ####   ##  ##  ##  ##  ##  ##   ##   ##   ##  ##  ##    ##    ##  ##   ##   ##  ##
''      ###   ####   ##  ##   ####   ####  ##   ##  ##  ##    ##    ##  ##  ####  ##  ##
''
''
'' File: quasiMatrix.cls
'' Name: clsQuasiMatrix
'' Copyright: XenoEngineer@groupKOS.com. All rights reserved.
''
'' Description: This class represents a combination of a binary tree and 
'' linked list for employing category theory methods on immutable data logs.
''
'' Note: The analysis methods used are geared towards the analysis of time-series data sample measurements. 
''       The category theory analysis technique is also applicable to sparse data sampling.
''
'' This implementation of Quasi Axiomatic Theory and Paradigm involves the detection of simultaneous
'' category events in separate data logs. These data logs are conjectured to contain relationships
'' with the dynamic causes captured in sparse samplings of the data streams.
''
'' The implementation of a linked list of equal values provides a fast lookup for value-category membership.
'' This is done by treating a linked list of equivalent data values as the total membership.
''
'' The frequency of membership occurrence over time can be obtained from the list count of the
'' membership of a particular value category.
''
'' The 'occurrenceFrequency' value is also stored within the value-category tree node
'' to enable faster access to category frequency data.
''
'' Simultaneity between a pair of quasiMatrices allows for a prismatic examination of a data population
'' by stratifying dynamically simultaneous frequency groups and visualizing them as point-clouds.
''
'' References:
''      'Event Detection and Categorical Abstraction' - Paul S. Prueitt PhD, OntologyStream, April 9, 2002
''      http://www.ontologystream.com/cA/papers/EventDetection.htm
''