The principle of the algorithm 1 is to use the variable ind to build all the n-uples of focal elements of the n input belief functions. Then, if the intersection of these is not ∅ or equivalent to ∅, the corresponding conjunctive mass (the product of all the masses of the focal elements in the n-uple)
is put on the intersection; otherwise, it is distributed over the input focal elements and their disjunction.

Algorithm 1: Fusion by the MDPCR combination rule Data: M experts ex: ex[1] **. . . ex**[M] Result: Fusion of ex by MDPCR rule : ep for i *= 1 to* M do foreach c in ex[i] do Append c to cl[i];
foreach ind *in [1,* size(cl[1])] × [1, size(cl[2])] × *. . .*×
[1, **size**(cl[M])] do δ = 1 - size(s) / min16i6M (size(cl[i][ind[i**]]))**;
s ← Θ; lprod ← 1; lsum ← 0; lu ← ∅;
for i *= 1 to* M do s ← s ∩ cl[i][ind[i]]; lprod ← lprod × ex[i](cl[i][ind[i]]); lsum ← lsum + ex[i](cl[i][ind[i]]); lu ← lu ∪ cl[i];
if s = ∅ **then**
nc ← 0; for i *= 1 to* M do for j *= 1 to* M, j 6= i do

$\begin{array}{l}\mbox{\bf\ }\bigsqcup\mbox{\bf if}cl[i]\cap cl[j]=\emptyset\mbox{\bf then}nc\leftarrow nc+1;\\ \alpha\leftarrow1\mbox{\bf\ }-nc/(M(M-1));\\ \mbox{\bf for}i=I\mbox{\bf\ }to\mbox{\bf\ }M\mbox{\bf\ }\mbox{\bf do}\\ \mbox{\bf\ }ep(ex[i][ind[i]])\leftarrow\alpha.ep(ex[i][ind[i]]);\\ \mbox{\bf\ }ex[i](cl[i][ind[i]])*\mbox{\bf l}\mbox{\bf prod}/\mbox{\bf l}\mbox{\bf sum};\end{array}$

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

else
ACKNOWLEDGMENT
This work is supported by the European Union (FEDER),
the French state (FNADT), the Brittany region and the French Department of Finistere.

## References

[1] L. Xu, A. Krzyzak and C.Y. Suen, "Methods of Combining Multiple Classifiers and Their Application to Handwriting Recognition," IEEE Transactions on Systems, Man Cybernetics, vol. 22, no. 3, pp. 418-435, May 1992.

[2] L. Lam and C.Y. Suen, "Application of Majority Voting to Pattern Recognition: An Analysis of Its Behavior and Performance," *IEEE Transactions* on Systems, Man Cybernetics - Part A: Systems and Humans, vol. 27, no. 5, pp. 553-568, September 1997.

[3] L. Zadeh, "Fuzzy sets as a basis for a theory of possibility," *Fuzzy Sets* and Systems, vol. 1, no. 3, pp. 3-28, 1978.
[4] D. Dubois and H. Prade, *Possibility Theory: An Approach to Computerized Processing of Uncertainty*, Location: Plenum Press, New York, 1988.

[5] A.P. Dempster, "Upper and Lower probabilities induced by a multivalued mapping," *Annals of Mathematical Statistics*, vol. 83, pp. 325-339, 1967.

[6] G. Shafer, *A mathematical theory of evidence*. Location: Princeton University Press, 1976.

[7] Ph. Smets, "Constructing the pignistic probability function in a context of uncertainty," *Uncertainty in Artificial Intelligence*, vol. 5, pp. 29-39, 1990.

[8] R.R. Yager, "On the Dempster-Shafer Framework and New Combination Rules," *Informations Sciences*, vol. 41, pp. 93-137, 1987.

[9] D. Dubois and H. Prade, "Representation and Combination of uncertainty with belief functions and possibility measures," *Computational Intelligence*, vol. 4, pp. 244-264, 1988.

[10] Ph. Smets, "The Combination of Evidence in the Transferable Belief Model," *IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 12, no. 5, pp. 447-458, 1990.

[11] T. Inagaki, "Independence between safety-control policy and multiplesensors schemes via Dempster-Shafer theory," IEEE Transaction on reliability, vol. 40, no. 2, pp. 182-188, 1991.

[12] Ph. Smets, "Belief functions: the Disjunctive Rule of Combination and the Generalized Bayesian Theorem," *International Journal of Approximate Reasoning*, vol. 9, pp. 1-35, 1993.

[13] A. Josang, M. Daniel and P. Vannoorenberghe, "Strategies for Combining Conflicting Dogmatic Belief," *International Conference on Information Fusion*, Cairns, Australia, 7-10 July 2003.

[14] F. Smarandache and J. Dezert, "Information Fusion Based on New Proportional Conflict Redistribution Rules," International Conference on Information Fusion, Philadelphia, USA, 25-29 July 2005.

[15] M.C. Florea, J. Dezert, P. Valin, F. Smarandache and A.L. Jousselme,
"Adaptative combination rule and proportional conflict redistribution rule for information fusion," *COGnitive systems with Interactive Sensors*, Paris, France, March 2006.

[16] A. Martin and C. Osswald, "A new generalization of the proportional conflict redistribution rule stable in terms of decision," *Applications and* Advances of DSmT for Information Fusion, Book 2, American Research Press Rehoboth, F. Smarandache and J. Dezert, pp. 69-88 2006.

[17] T. Denœux, "The cautious rule of combination for belief functions and some extensions," *International Conference on Information Fusion*,
Florence, Italy, 10-13 July 2006.

[18] Ph. Smets, "The α-junctions: the commutative and associative non interactive combination operators applicable to belief functions," *Qualitative* and quantitative pratical reasoning, Springer Verlag, D. Gabbay and R.

Kruse and A. Nonnengart and H.J. Ohlbacg, Berlin, pp. 131-153, 1997.

[19] E. Lefevre, O. Colot and P. Vannoorenberghe, "Belief function combination and conflict management," *Information Fusion*, vol. 3, pp. 149-162, 2002.

[20] A. Appriou, "Approche g´en´erique de la gestion de l'incertain dans les processus de fusion multisenseur," *Traitement du Signal*, vol. 22, no. 4, pp. 307-319, 2005.

[21] C. Osswald and A. Martin, "Understanding the large family of DempsterShafer theory's fusion operators - a decision-based measure," *International Conference on Information Fusion*, Florence, Italy, 10-13 July 2006.

[22] F. Smarandache and J. Dezert, "Proportional Conflict Redistribution Rules for Information Fusion," Applications and Advances of DSmT for Information Fusion, Book 2, American Research Press Rehoboth, F.

Smarandache and J. Dezert, pp. 3-68, 2006.

[23] A.-L. Jousselme, D. Grenier and E. Boss´e, "A new distance between two bodies of evidence," *Information Fusion*, vol. 2, pp. 91-101, 2001.