Dynamic partitioning process

Partitioning is the first and probably the simplest model of the retention mechanism. It assumes the existence of two different phases (mobile and stationary) and instant equilibrium of the analyte partitioning between these phases. Simple phenomenological interpretation of the dynamic partitioning process was also introduced at about the same time. Probably, the most consistent and understandable description of this theory is given by C. Cramers, A. Keulemans, and H. McNair in 1961 in their chapter Techniques of Gas Chromatography [12]. The analyte partition coefficient is defined as... 

The taxonomy matching system AnchorFlood implements a dynamic partition-based matching that avoids the a-priori partitioning of the ontologies (Hanif and Aono 2009). It also utilizes anchors (similar concept pairs) but takes them as a starting point to incrementally match elements in their structural neighborhood until no further matches are found or all elements are processed. Thus the partitions (called... 

All chromatography processes are based on the multiple repetition of minute separation steps, such as the continuous dynamic partition of the components between two phases (Martin and Synge, 1941 Bock, 1974). 

Salis and Kaznessis proposed a hybrid stochastic algorithm that is based on a dynamical partitioning of the set of reactions into fast and slow subsets. The fast subset is treated as a continuous Markov process governed by a multidimensional Fokker-Planck equation, while the slow subset is considered to be a jump or discrete Markov process governed by a CME. The approximation of fast/continuous reactions as a continuous Markov process significantly reduces the computational intensity and introduces a marginal error when compared to the exact jump Markov simulation. This idea becomes very useful in systems where reactions with multiple reaction scales are constantly present. 

---