DTheta{step}=union(DTheta{step},base{sBase+c-nbC});

![0_image_0.png](0_image_0.png)

end

## Acknowledgment

The author thanks Pascal Djiknavorian for the interesting discussion on the generation of DΘ
r
, Florentin Smarandache for his comments on the codification and Jean Dezert for his advices on the representation of the DSm cardinality CM(X).

## References

[1] A. Appriou. Uncertain data aggregation in classification an tracking process. In B. Bouchon-Meunier, editor, Aggregation and Fusion of Imperfect Information, pages 231–260. Springer, 1998.

[2] A. Appriou. Approche g´en´erique de la gestion de l'incertain dans les processus de fusion multisenseur. *Traitement du signal*, 24(4):307–319, 2005.

[3] J.A. Barnett. Computational methods for a mathematical theory of evidence. In International Joint Conference on Artificial Intelligence *(IJCAI)*,
pages 868–875, Vancouver, Canada, August 1981.

[4] M. Bauer. Approximation algorithms and decision making in the dempstershafer theory of evidence. *International Journal of Approximate Reasoning*,
17:217–237, 1997.

[5] M. Daniel. Classical combination rules generalized to DSm hyper-power sets and their comparison with the hybrid DSm rule. In F. Smarandache and J. Dezert, editors, *Applications and Advances of DSmT for Information Fusion*, volume 2, chapter 3, pages 89–112. American Research Press Rehoboth, 2006.

[6] A.P. Dempster. Uper and Lower probabilities induced by a multivalued mapping. *Anals of Mathematical Statistics*, 38:325–339, 1967.