Excerpt Details
The study of bialgebraic structures started very recently. Till date there are no books solely dealing with bistructures. The study of bigroups was carried out in 1994-1996. Further research on bigroups and fuzzy bigroups was published in 1998. In the year 1999, bivector spaces was introduced. In 2001, concept of free De Morgan bisemigroups and bisemilattices was studied. It is said by Zoltan Esik that these bialgebraic structures like bigroupoids, bisemigroups, binear rings help in the construction of finite machines or finite automaton and semi automaton. The notion of non-associative bialgebraic structures was first introduced in the year 2002. The concept of bialgebraic structures which we define and study are slightly different from the bistructures using category theory of Girard's classical linear logic. We do not approach the bialgebraic structures using category theory or linear logic....

Description Details
The author's motivating interest the past few years has been the development and dissemination of G-dimensional theory (GDT). K. Toshihara, from Japan, proposed the concept of a paper defining G-Dimensional theory in relation to the Smarandache quantum paradoxes. After reviewing a draft, Dr. M. L. Perez, Editor of the SNJ, suggested the inclusion of the Smarandache (FTL) Hypothesis as well. So it is hoped that a determination of parametric relationships between the quantum paradoxes and GDT proves helpful in advancing interest and research in both areas. It became apparent from preliminary research that, although described in several forums and papers, e.g., the Smarandache quantum paradoxes have not been analyzed in depth or in terms of their relevance to modern science theory; so that, for example, "ask the expert" type online forums offer little in the way of explanatory relevance of these paradoxes....

Description Details
This book is organized into seven chapters. Chapter one is introductory in content. The notion of neutrosophic set linear algebras and neutrosophic neutrosophic set linear algebras are introduced and their properties analysed in chapter two. Chapter three introduces the notion of neutrosophic semigroup linear algebras and neutrosophic group linear algebras. A study of their substructures are systematically carried out in this chapter. The fuzzy analogue of neutrosophic group linear algebras, neutrosophic semigroup linear algebras and neutrosophic set linear algebras are introduced in chapter four of this book. Chapter five introduces the concept of neutrosophic group bivector spaces, neutrosophic bigroup linear algebras, neutrosophic semigroup (bisemigroup) linear algebras and neutrosophic biset bivector spaces. The fuzzy analogue of these concepts are given in chapter six. An interesting feature of this book is it contains nearly 424 examples of these new notions. The final chapter suggests over 160 problems which is another interesting feature of this book....

Excerpt Details
Now we proceed onto define the notion of neutrosophic subgroup of a neutrosophic group. DEFINITION 1.2: Let N(G) = (GuI) be a neutrosophic group generated by G and I. A proper subset P(G) is said to be a neutrosophic subgroup if P(G) is a neutrosophic group i.e. P(G) must contain a (sub) group. Example 1.3: Let N(Z2) = 􀂢Z2 􀂉 I􀂲 be a neutrosophic group under addition. N(Z2) = {0, 1, I, 1 + I}. Now we see {0, I} is a group under + in fact a neutrosophic group {0, 1 + I} is a group under ‘+’ but we call {0, I} or {0, 1 + I} only as pseudo neutrosophic groups for they do not have a proper subset which is a group. So {0, I} and {0, 1 + I} will be only called as pseudo neutrosophic groups (subgroups). We can thus define a pseudo neutrosophic group as a neutrosophic group, which does not contain a proper subset which is a group. Pseudo neutrosophic subgroups can be found as a substructure of neutrosophic groups. Thus a pseudo neutrosophic group though has a group structure is not a neutrosophic group and a neutrosophic group cannot be a pseudo neutrosophic group. Both the concepts are different. Now we see a neutrosophic group ...

Table of Contents Details
Preface 5 Chapter One INTRODUCTION 7 Chapter Two SET NEUTROSOPHIC LINEAR ALGEBRA 13 2.1 Type of Neutrosophic Sets 13 2.2 Set Neutrosophic Vector Space 16 2.3 Neutrosophic Neutrosophic Integer Set Vector Spaces 40 2.4 Mixed Set Neutrosophic Rational Vector Spaces and their Properties 52 Chapter Three NEUTROSOPHIC SEMIGROUP LINEAR ALGEBRA 91 3.1 Neutrosophic Semigroup Linear Algebras 91 3.2 Neutrosophic Group Linear Algebras 113 Chapter Four NEUTROSOPHIC FUZZY SET LINEAR ALGEBRA 135 Chapter Five NEUTROSOPHIC SET BIVECTOR SPACES 155 Chapter Six NEUTROSOPHIC FUZZY GROUP BILINEAR ALGEBRA 219 Chapter Seven SUGGESTED PROBLEMS 247 FURTHER READING 277 INDEX 280 ABOUT THE AUTHORS 286 ...

Description Details
This book has four chapters. Chapter one is introductory in nature, for it recalls some basic definitions essential to make the book a self-contained one. Chapter two, introduces for the first time the new notion of neutrosophic rings and some special neutrosophic rings like neutrosophic ring of matrix and neutrosophic polynomial rings. Chapter three gives some new classes of neutrosophic rings like group neutrosophic rings, neutrosophic group neutrosophic rings, semigroup neutrosophic rings, S-semigroup neutrosophic rings which can be realized as a type of extension of group rings or generalization of group rings. Study of these structures will throw light on the research on the algebraic structure of group rings. Chapter four is entirely devoted to the problems on this new topic, which is an added attraction to researchers. A salient feature of this book is that it gives 246 problems in Chapter four. Some of the problems are direct and simple, some little difficult and some can be taken up as a research problem....

Excerpt Details
Now we proceed onto define the notion of neutrosophic subgroup of a neutrosophic group. DEFINITION 1.1.2: Let N(G) = 〈G ∪ I〉 be a neutrosophic group generated by G and I. A proper subset P(G) is said to be a neutrosophic subgroup if P(G) is a neutrosophic group i.e. P(G) must contain a (sub) group. Example 1.1.3: Let N(Z2) = 〈Z2 ∪ I〉 be a neutrosophic group under addition. N(Z2) = {0, 1, I, 1 + I}. Now we see {0, I} is a group under + in fact a neutrosophic group {0, 1 + I} is a group under ‘+’ but we call {0, I} or {0, 1 + I} only as pseudo neutrosophic groups for they do not have a proper subset which is a group. So {0, I} and {0, 1 + I} will be only called as pseudo neutrosophic groups (subgroups). We can thus define a pseudo neutrosophic group as a neutrosophic group, which does not contain a proper subset which is a group. Pseudo neutrosophic subgroups can be found as a substructure of neutrosophic groups. Thus a pseudo neutrosophic group though has a group structure is not a neutrosophic group and a neutrosophic group cannot be a pseudo neutrosophic group. Both the concepts are different. Now we see a neutrosophi...

Table of Contents Details
Preface 5 Chapter One INTRODUCTION 1.1 Neutrosophic Groups and their Properties 7 1.2 Neutrosophic Semigroups 20 1.3 Neutrosophic Fields 27 Chapter Two NEUTROSOPHIC RINGS AND THEIR PROPERTIES 2.1 Neutrosophic Rings and their Substructures 29 2.2 Special Type of Neutrosophic Rings 41 Chapter Three NEUTROSOPHIC GROUP RINGS AND THEIR GENERALIZATIONS 3.1 Neutrosophic Group Rings 59 3.2 Some special properties of Neutrosophic Group Rings 73 3.3 Neutrosophic Semigroup Rings and their Generalizations 85 Chapter Four SUGGESTED PROBLEMS 107 REFERENCES 135 INDEX 149 ABOUT THE AUTHORS 154 ...

Description Details
In this book authors study and analyze the problem of school dropouts and their life after. The problems can by no means be analyzed by collecting the numerical data. For such data can only serve as information beyond that the data can be of no use, for the school dropouts suffer an environment change after becoming a school dropout. Thus the emotions of the school dropout; is technically involved....

Excerpt Details
The basic tools used in the analysis of the problem of school dropout and their life after are described briefly in this chapter. We provide also the references for these concepts. Bart Kosko introduced the Fuzzy Cognitive Maps (FCMs) in the year 1986. Fuzzy Cognitive Maps are fuzzy structures that strongly resemble neural networks, and they have powerful and far-reaching consequences as a mathematical tool for modeling complex systems. FCM was a fuzzy extension of the cognitive map pioneered in 1976 by political scientist Robert Axelord, who used it to represent knowledge as an interconnected, directed, bilevel-logic graph....

Table of Contents Details
Preface 5 Chapter One INTRODUCTION 7 Chapter Two BASIC CONCEPTS 21 Chapter Three CAUSES OF SCHOOL DROPOUTS – A MATHEMATICAL ANALYSIS 35 Chapter Four SCHOOL DROPOUTS AS CHILD LABOURERS 59 Chapter Five SCHOOL DROPOUTS AS RAG PICKERS USING FUZZY MODELS 79 Chapter Six PERFORMANCE ASPECTS OF SCHOOL STUDENTS USING RULE BASED CONTROL SYSTEM 89 Chapter Seven MIGRATION OF PARENTS AND THE SCHOOL DROPOUTS A STUDY USING THE FUZZY RELATIONAL MAPS MODEL 99 Chapter Eight THE IMPACT OF MISSIONARY INTERVENTIONS ON THE EDUCATION AND REHABILITATION OF DEPRIVED CHILDREN – A FUZZY ANALYSIS 117 Chapter Nine CONCLUSIONS AND SUGGESTIONS 129 FURTHER READING 139 INDEX 143 ABOUT THE AUTHORS 145...

Description Details
A collection of papers concerning Smarandache type functions, numbers, sequences, integer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc. is published this year....

Excerpt Details
This document will describe the current status on the search for factors of Smaranda.che consecutive numbers and their reverse. A complete list up to index 200 will be given, with all known factors. Smarandache numbers are the concatenation of the natural numbers from one up to the given index, and reverse Smaranda.che numbers are the concatenation of the natural numbers from the given index dO\vIJ. to 1....

Description Details
Aims and Scope: The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, and published quarterly comprising 100-150 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache geometries, mathematical combinatorics, non-euclidean geometry and topology and their applications to other sciences. Topics in detail to be covered are: Smarandache multi-spaces with applications to other sciences, such as those of algebraic multi-systems, multi-metric spaces,. . . , etc.. Smarandache geometries; Differential Geometry; Geometry on manifolds; Topological graphs; Algebraic graphs; Random graphs; Combinatorial maps; Graph and map enumeration; Combinatorial designs; Combinatorial enumeration; Low Dimensional Topology; Differential Topology; Topology of Manifolds; Geometrical aspects of Mathematical Physics and Relations with Manifold Topology; Applications of Smarandache multi-spaces to theoretical physics; Applications of Combinatorics to mathematics and theoretical physics; Mathematical theory on gravitatio...

Excerpt Details
Extending Homomorphism Theorem to Multi-Systems Abstract: The multi-laterality of WORLD implies multi-systems to be its best candidate model for ones cognition on nature, which is also included in an ancient book of China, TAO TEH KING written by Lao Zi, an ancient philosopher of China. Then how it works to mathematics, not suspended in thought? This paper explains this action by mathematical logic on mathematical systems generalized to Smarandache systems, or such systems with combinatorial structures, i.e., combinatorial systems, and shows how to extend the homomorphism theorem in abstract algebra to multi-systems or combinatorial systems. All works in this paper are motivated by a combinatorial speculation of mine which is reformed on combinatorial systems and can be also applied to geometry. Key Words: Homomorphism theorem, multi-system, combinatorial system. ...

Table of Contents Details
Contents Extending Homomorphism Theorem to Multi-Systems BY LINFAN MAO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 01 A Double Cryptography Using the Smarandache Keedwell Cross Inverse Quasigroup BY T. G. JA´IY´EOL´A . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 On the Time-like Curves of Constant Breadth in Minkowski 3-Space BY SUHA YILMAZ AND MELIH TURGUT. . . . . . . . . . . . . . . . . . . . . 34 On the Basis Number of the Strong Product of Theta Graphs with Cycles BY M.M.M. JARADAT, M.F. JANEM AND A.J. ALAWNEH. . . . . . . . . . . .40 Smarandache Curves in Minkowski Space-time BY MELIH TURGUT AND S¨UHA YILMAZ . . . . . . . . . . . . . . . . . . . . . 51 The Characterization of Symmetric Primitive Matrices with exponent n − 3 BY LICHAO, HUANGFU AND JUNLIANG CAI . . . . . . . . . . . . . . . . . . 56 The Crossing Number of the Circulant Graph C(3k − 1; {1, k}) BY JING WANG AND YUANQIU HUANG. . . . . . . . . . . . . . . . . . . .79 On the Edge Geodetic and k-Edge Geodetic Number of a Graph BY A.P. SANTHAKUMARAN AND S.V. ULLAS CHANDRAN. . . . . . . . . .85 Simple Path Cove...

Description Details
In a world of chaotic alignments, traditional logic with its strict boundaries of truth and falsity has not imbued itself with the capability of reflecting the reality. Despite various attempts to reorient logic, there has remained an essential need for an alternative system that could infuse into itself a representation of the real world. Out of this need arose the system of Neutrosophy, and its connected logic, Neutrosophic Logic. Neutrosophy is a new branch of philosophy that studies the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra. This was introduced by one of the authors, Florentin Smarandache. A few of the mentionable characteristics of this mode of thinking are [90-94]: It proposes new philosophical theses, principles, laws, methods, formulas and movements; it reveals that the world is full of indeterminacy; it interprets the uninterpretable; regards, from many different angles, old concepts, systems and proves that an idea which is true in a given referential system, may be false in another, and vice versa; attempts to make peace in the war of ideas, and to make w...

Description Details
Papers concerning any of the Smarandache type functions, sequences, integer algorithms, paradoxes, Non-Euclidean geometries, conjectures, open problems, neutrosophic logic/set/probability, etc. have been selected for this volume. The...

Description Details
Papers concerning any of the Smarandache type functions, sequences, numbers, algorithms, inferior/superior f-parts, magic squares, palindromes, functional iterations, semantic paradoxes, Non-Euclidean geometries, manifolds, conjectures, open problems, algebraic structures, neutrosophy, neutrosophic logic/set/probability, hypothesis that there is no speed barrier in the universe} quantum paradoxes, etc. have been selected for this volume. Contributors are from Australia, China, England, Germany, India, Ireland, Israel, Italy, Japan, Malaysia, Morocco, Portugal, Romania, Spain, USA. Most of the papers are in English, a few of them are in Spanish, Portuguese, or Gennan....

Description Details
In this book, we consider various many-valued logics: standard, linear, hyperbolic, parabolic, non-Archimedean, p -adic, interval, neutrosophic, etc. We survey also results which show the tree different proof-theoretic frameworks for many-valued logics, e.g. frameworks of the following deductive calculi: Hilbert ’s style, sequent, and hypersequent. Recall that hypersequents are a natural generalization of Gentzen ’s style sequents that was introduced independently by Avron and Pottinger . In particular, we examine Hilbert ’s style, sequent, and hypersequent calculi for infinite-valued logics based on the three fundamental continuous t-norms: Lukasiewicz ’s, Godel ’s, and Product logics....

Excerpt Details
1.1 Neutrality concept in logic Every point of view A tends to be neutralized, diminished, balanced by Non-A. At the same time, in between A and Non-A there are infinitely many points of view Neut-A. Let’s note by A an idea, or proposition, theory, event, concept, entity, by Non-A what is not A, and by Anti-A the opposite of A. Neut-A means what is neither A nor Anti-A, i.e. neutrality is also in between the two extremes. ...

Table of Contents Details
1 Introduction. . . . . . . . . . . . . . . 9 1.1 Neutrality concept in logic . . . . . . . . . . . . . . . . . . . . . . 9 1.2 Neutrality and non-Archimedean logical multiple-validity . . . . 10 1.3 Neutrality and neutrosophic logic . . . . . . . . . . . . . . . . . . 13 2 First-order logical language. . . . . . . . . . . . . . . 17 2.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.2 Hilbert’s type calculus for classical logic . . . . . . . . . . . . . . 20 2.3 Sequent calculus for classical logic . . . . . . . . . . . . . . . . . 22 3 n -valued Lukasiewicz’s logics. . . . . . . . . . . . . . . 27 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 3.2 Originality of (p + 1)-valued Lukasiewicz’s logics . . . . . . . . . 30 3.3 n-valued Lukasiewicz’s calculi of Hilbert’s type . . . . . . . . . . 32 3.4 Sequent calculi for n-valued Lukasiewicz’s logics . . . . . . . . . . 33 3.5 Hypersequent calculus for 3-valued Lukasiewicz’s propositional logic . . . . . . . . . . . .37 4 Infinite valued Lukasiewicz’s logics. . . . . . . . . . . . . . . 39 4.1 Prelimi...

Description Details
In this work the authors apply concepts of Neutrosophic Logic to the General Theory of Relativity to obtain a generalisation of Einstein’s four dimensional pseudo-Riemannian differentiable manifold in terms of Smarandache Geometry (Smarandache manifolds), by which new classes of relativistic particles and non-quantum teleportation are developed....

Excerpt Details
1.2 The basics of neutrosophy Neutrosophy studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. It considers that every idea tends to be neutralized, balanced by ideas; as a state of equilibrium. Neutrosophy is the basis of neutrosophic logic, neutrosophic set which generalizes the fuzzy set, and of neutrosphic probability and neutrosophic statistics, which generalize the classical and imprecise probability and statistics respectively. Neutrosophic Logic is a multiple-valued logic in which each proposition is estimated to have percentages of truth, indeterminacy, and falsity in T, I, and F respectively, where T, I, F are standard or non-standard subsets included in the non-standard unit interval ] −0, 1+[. It is an extension of fuzzy, intuitionistic, paraconsistent logics. ...

Table of Contents Details
Preface of the Editor 4 Chapter 1 PROBLEM STATEMENT . THE BASICS OF NEUTROSOPHY 1.1 Problem statement 5 1.2 The basics of neutrosophy 8 1.3 Neutrosophic subjects 13 1.4 Neutrosophic logic. The origin of neutrosophy 14 1.5 Definitions of neutrosophic 16 Chapter 2 TRAJECTORIES AND PARTICLES 2.1 Einstein’s basic space-time 18 2.2 Standard set of trajectories and particles. A way to expand the set 22 2.3 Introducing trajectories of mixed isotropic/non-isotropic kind 28 2.4 Particles moving along mixed isotropic/non-isotropic trajectories 31 2.5 S-denying the signature conditions. Classification of the expanded spaces 35 2.6 More on an expanded space-time of kind IV 45 2.7 A space-time of kind IV: a home space for virtual photons 52 2.8 A space-time of kind IV: non-quantum teleportation of photons 55 2.9 Conclusions 59 Chapter 3 ENTANGLED STATES AND QUANTUM CAUSALITY THRESHOLD 3.1 Disentangled and entangled particles in General Relativity. Problem statement 61 3.2 Incorporating entangled states into General Relativity 64 3.3 Quantum Causality Threshold in General Relativity 69 3.4 Conclusions 72 Biblio...

Description Details
This book was intended to discuss some paradoxes in Quantum Mechanics from the viewpoint of Multi-Valued-logic pioneered by Lukasiewicz, and a recent concept Neutrosophic Logic. Essentially, this new concept offers new insights on the idea of ‘identity’, which too often it has been accepted as given....

Excerpt Details
2 Lukasiewicz Multi-Valued-logic: History and Introduction to Multi- Valued Algebra 2.1 Introduction to trivalent logic and plurivalent logic We all have heard of typical binary logic, Yes or No. Or in a famous phrase by Shakespeare: “To be or not to be.” In the same way all computer hardwares from early sixties up to this year are built upon the same binary logic. It is known that the Classical Logic, also called Bivalent Logic for taking only two values {0, 1}, or Boolean Logic from British mathematician George Boole (1815-64), was named by the philosopher Quine (1981) “sweet simplicity.” [57] But this typical binary logic is not without problems. In the light of aforementioned ‘garment analogue’, we can compare this binary logic with a classic black-and-white tuxedo. It is timeless design, but of course you will not wear it for all occasions. Aristotle himself apparently knew this problem; therefore he introduced new terms ‘contingency’ and ‘possibility’ into his modal logic [5]. And then American logician Lewis first formulated these concepts of logical modality. ...

Table of Contents Details
Contents Foreword 6 1 Introduction: Paradoxes, Lukasiewicz, Multi-Valued logic 7 2 Lukasiewicz Multi-Valued Logic: History and Introduction to Multi-Valued Algebra 10 2.1. Introduction to trivalent logic and plurivalent logic 10 2.2. History of Lukasiewicz and Multi-Valued Logic 12 2.3. Introduction to Multi-Valued Algebra, Chang’s Notation 15 2.4. Linkage between Multi-Valued Logic and Quantum Mechanics 15 2.5. Exercise 17 3 Neutrosophy 25 3.1. Introduction to Neutrosophy 25 3.2. Introduction to Non-Standard Analysis 26 3.3. Definition of Neutrosophic Components 27 3.4. Formalization 28 3.5. Evolution of an Idea 30 3.6. Definition of Neutrosophic Logic 31 3.7. Differences between Neutrosophic Logic and IFL 32 3.8. Operations with Sets 33 3.9. Generalizations 34 4 Schrödinger Equation 39 4.1. Introduction 39 4.2. Quantum wave dynamics and classical dynamical system 43 4.3. A new derivation of Schrödinger-type Equation 45 5 Solution to Schrödinger’s Cat Paradox 47 5.1. Standard interpretation 47 5.2. Schrödinger’s Cat Paradox 48 5.3. Hidden-variable hypothesis 50 5.4. Hydrodynamic viewpoint and diffusion i...

Description Details
Applications demonstrate the power of the DSmT framework. In this third Volume, DSmT is applied to the entire spectrum of the Information Fusion that would interest any reader in data, sensor, information, and mathematical fusion topics. Highlighted in Figure 1 are the contemporary issues that include the links between (1) data conditioning and information management, (2) combined situation and impact assessment, and (2) knowledge representation between machine processing and user coordination. Various applications leverage DSmT “Advances” listed above along with DSmH (hybrid), DSmP (Probabilistic), and DSmT theoretical insights. The third volume attacks these application issues of coordination between the “levels” of information fusion....

Table of Contents Details
Part I Advances on DSmT 1 Chapter 1 An introduction to DSmT 3 by J. Dezert and F. Smarandache 1.1 Introduction . . . . . . . . . . 4 1.2 Foundations of DSmT . . . . . . . . . 4 1.2.1 The power set, hyper-power set and super-power set . . 6 1.2.2 Notion of free and hybrid DSm models . . . . 18 1.2.3 Generalized belief functions . . . . . . 20 1.2.4 The classic DSm rule of combination . . . . . 21 1.2.5 The hybrid DSm rule of combination . . . . . 22 1.2.6 Examples of combination rules . . . . . . 24 1.2.7 Fusion of imprecise beliefs . . . . . . 29 1.3 Proportional Conflict Redistribution rule . . . . . 33 1.3.1 PCR formulas . . . . . . . . . 34 1.3.2 Examples . . . . . . . . . 35 1.3.3 Zadeh’s example . . . . . . . . 39 1.4 Uniform and partially uniform redistribution rules . . . 41 1.5 RSC Fusion rules . . . . . . . . . 43 1.6 The generalized pignistic transformation (GPT) . . . . 45 1.6.1 The classical pignistic transformation . . . . 45 1.6.2 Notion of DSmcardinality . . . . . . 46 1.6.3 The Generalized Pignistic Transformation . . . 47 1.7 The DSmP transformation . . . . . . . 48 1.7.1 The Probabilistic In...

Description Details
This second book devoted on advances and applications of Dezert-Smarandache Theory (DSmT) for information fusion collects recent papers from different researchers working in engineering and mathematics. Part 1 of this book presents the current state-of-the-art on theoretical investigations while, Part 2 presents several applications of this new theory. Some ideas in this book are still under current development or improvements, but we think it is important to propose them in order to share ideas and motivate new debates with people interested in new reasoning methods and information fusion. So, we hope that this second volume on DSmT will continue to stir up some interests to researchers and engineers working in data fusion and in artificial intelligence....

Table of Contents Details
Preamble iii Prefaces v Part I Advances on DSmT 1 Chapter 1 Proportional Conflict Redistribution Rules for Information Fusion 3 by Florentin Smarandache and Jean Dezert 1.1 Introduction . . . . . . . . . . . 3 1.2 The principal rules of combination . . . . . . . 6 1.2.1 Notion of total and partial conflicting masses . . . . . 6 1.2.2 The conjunctive rule . . . . . . . . . 6 1.2.3 The disjunctive rule . . . . . . . . . 8 1.2.4 Dempster’s rule of combination . . . . . . . 8 1.2.5 Smets’ rule of combination . . . . . . . 9 1.2.6 Yager’s rule of combination . . . . . . . 9 1.2.7 Dubois & Prade’s rule of combination . . . . . . 9 1.2.8 The hybrid DSm rule . . . . . . . . 10 1.3 The general weighted operator (WO) . . . . . . . 11 1.4 The weighted average operator (WAO) . . . . . . . 12 1.4.1 Definition . . . . . . . . . 12 1.4.2 Example for WAO . . . . . . . . . 13 1.4.3 Limitations of WAO . . . . . . . . . 13 1.5 Daniel’s minC rule of combination . . . . . . . 14 1.5.1 Principle of the minC rule . . . . . . . 14 1.5.2 Example for minC . . . . . . . . . 15 1.6 Principle of the PCR rules . . . . . . . . . 20 1.7 The...

Description Details
This book is devoted to an emerging branch of Information Fusion based on new approach for modeling the fusion problematic when the information provided by the sources is both uncertain and (highly) conflicting. This approach, known in literature as DSmT (standing for Dezert-Smarandache Theory), proposes new useful rules of combinations. We gathered in this volume a presentation of DSmT from the beginning to the latest development. Part 1 of this book presents the current state-of-the-art on theoretical investigations while Part 2 presents several applications of this new theory. We hope that this first book on DSmT will stir up some interests to researchers and engineers working in data fusion and in artificial intelligence. Many simple but didactic examples are proposed throughout the book. As a young emerging theory, DSmT is probably not exempt from improvements and its development will continue to evolve over the years. We just want through this book to propose a new look at the Information Fusion problematic and open a new track to attack the combination of information....

Table of Contents Details
Preamble xi Prefaces xiii I Advances on DSmT 1 1 Presentation of DSmT 3 1.1 Introduction . . . . . 3 1.2 Short introduction to the DST . . . . 5 1.2.1 Shafer’s model and belief functions . . . 5 1.2.2 Dempster’s rule of combination . . . 5 1.2.3 Alternatives to Dempster’s rule of combination . . . 6 1.2.4 The discounting of sources of evidence . . . 10 1.3 Foundations of the DSmT . . . . 11 1.3.1 Notion of free and hybrid DSm models . . . 11 1.3.2 Notion of hyper-power set D_ . . . 13 1.3.3 Generalized belief functions . . . . 15 1.3.4 The classic DSm rule of combination . . . 16 1.3.5 The hybrid DSm rule of combination . . . 17 1.3.6 On the refinement of the frames . . . 18 1.3.7 On the combination of sources over different frames . . . 20 1.4 Comparison of different rules of combinations . . . 21 1.4.1 First example . . . . . 21 1.4.2 Second example . . . . 25 1.4.3 Third example . . . . 26 1.4.4 Fourth example . . . . 27 1.4.5 Fifth example . . . . . 27 1.5 Summary . . . . . 29 1.6 References . . . . . 31 2 The generation of hyper-power sets 37 2.1 Introduction . . . . . 37 2.2 Definition of hyper-po...