Modeling classifier networks by Markov chains - IMT Mines Albi-Carmaux Accéder directement au contenu
Article Dans Une Revue Powder Technology Année : 1999

Modeling classifier networks by Markov chains

Résumé

The applicability of probabilistic ideas to processes involving particles is first presented and followed by a general definition of a Markov chain which is illustrated by a simple example. The stochastic nature of the concept of grade efficiency in separation processes is demonstrated by assuming a particle of size x to be the system and the grade efficiency function to be a transition probability. This is used to calculate the overall grade efficiency for various classifier networks showing the evolution of the probability of presence of a particle at each point of the circuit as a function of the number of steps. Finally, performing the calculation with indefinite number of classifiers and taking into account dead flux, we emphasize the possibility of modelling complex particle flow in hydrocyclone.

Dates et versions

hal-01664128 , version 1 (14-12-2017)

Identifiants

Citer

Henri Berthiaux, John A. Dodds. Modeling classifier networks by Markov chains. Powder Technology, 1999, 105 (1-3), pp.266-273. ⟨10.1016/S0032-5910(99)00147-3⟩. ⟨hal-01664128⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More