Description Details
The main purpose of this paper is using the elementary method to study the mean value properties of the Smarandache function, and give an interesting asymptotic formula....

Excerpt Details
x1. Introduction In reference [1], the Smarandache Sum of Composites Between Factors function SCBF(n) is defined as: The sum of composite numbers between the smallest prime factor of n and the largest prime factor of n. For example, SCBF(14)=10, since 2£7 = 14 and the sum of the composites between 2 and 7 is: 4 + 6 = 10. In reference [2]: A number n is called simple number if the product of its proper divisors is less than or equal to n. Let A denotes set of all simple numbers. That is, A = f2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 13; 14; 15; 17; 19; 21. ...

Table of Contents Details
On the Smarandache function and square complements 1 Zhang Wenpeng , Xu Zhefeng On the integer part of the k -th root of a positive integer 5 Zhang Tianping , Ma Yuankui Smarandache “Chopped” NN and N + 1N¡1 9 Jason Earls The 57 -th Smarandache’s problem II 13 Liu Huaning , Gao Jing Perfect Powers in Smarandache n - Expressions 15 Muneer Jebreel Karama On the m -th power residue of n 25 Li Junzhuang and Zhao Jian Generalization of the divisor products and proper divisor products sequences 29 Liang Fangchi The science of lucky sciences 33 Jon Perry Smarandache Sequence of Unhappy Numbers 37 Muneer Jebreel Karama On m -th power free part of an integer 39 Zhao Xiaopeng and Ren Zhibin On two new arithmetic functions and the k -power complement number sequences 43 Xu Zhefeng Smarandache Replicating Digital Function Numbers 49 Jason Earls On the m -power residues numbers sequence 53 Ma Yuankui , Zhang Tianping Smarandache Reverse Power Summation Numbers 57 Jason Earls Some Smarandache Identities 59 Muneer Jebreel Karama On the integer part of a positive integer’s k -th root 61 Yang Hai , F...

Description Details
A short collection of mathematical papers from various authors relating to Florentin Smaradache's theories.

Excerpt Details
This dual will be studied in a separate paper (in preparation). 2. The additive analogues of the functions 5 and 5. are real variable functions, and have been defined and studied in paper [31. (See also one book [61, pp. 171-174). These functions have been recently further extended, by the use of Euler's gamma function, ill place of the factorial (see [1]). We note that in what follows, we could define also the additive analogues functions by the use of Euler's gamma function. However, we shall apply the more transparent notation of a factorial of a positive integer....

Table of Contents Details
Jozsef Sandor ON ADDITIVE ANALOGUES OF CERTAIN ARITHMETIC FUNCTIONS 29-32 M. Perez (Ed.) ON SOME SMARANDACHE PROBLEMS 33-38 M. Perez (Ed.) ON SOME PROBLEMS RELATED TO SMARANDACHE NOTIONS 39-40 G. Gregory (Ed.) GENERALIZED SMARANDACHE PALINDROME 41 M. Vassilev - lVlissana ON 15-TH SMARANDACHE'S PROBLEM 42-45 K. Atanassov ON THE SECOND SMARANDACHE'S PROBLEM 46-48...

Description Details
This book has six chapters. First chapter is introductory in nature. The new concept of non-associative semi-linear algebras is introduced in chapter two. This structure is built using groupoids over semi-fields. Third chapter introduces the notion of non-associative linear algebras. These algebraic structures are built using the new class of loops. All these non-associative linear algebras are defined over the prime characteristic field Zp, p a prime. However if we take polynomial non associative, linear algebras over Zp, p a prime; they are of infinite dimension over Zp. We in chapter four introduce the notion of groupoid vector spaces of finite and infinite order and their generalizations. Only when this study becomes popular and familiar among researchers several applications will be found. The final chapter suggests around 215 problems some of which are at research level. ...

Excerpt Details
Ln(m) is a loop of order n + 1 that is Ln(m) is always of even order greater than or equal to 6. For more about these loops please refer [37]. All properties discussed in case of groupoids can be done for the case of loops. However the resultant product may not be a loop in general. For the concept of semifield refer [41]. We will be using these loops and groupoids to build linear algebra and semilinear algebras which are non associative. ...

Table of Contents Details
Preface 5 Chapter One BASIC CONCEPTS 7 Chapter Two NON ASSOCIATIVE SEMILINEAR ALGEBRAS 13 Chapter Three NON ASSOCIATIVE LINEAR ALGEBRAS 83 Chapter Four GROUPOID VECTOR SPACES 111 Chapter Five APPLICATION OF NON ASSOCIATIVE VECTOR SPACES / LINEAR ALGEBRAS 161 Chapter Six SUGGESTED PROBLEMS 163 FURTHER READING 225 INDEX 229 ABOUT THE AUTHORS 231 ...

Description Details
This book has six chapters. The first one is introductory in nature. Second chapter introduces complex modulo integer groupoids and complex modulo integer loops using C(Zn). This chapter gives 77 examples and forty theorems. Chapter three introduces the notion of nonassociative complex rings both finite and infinite using complex groupoids and complex loops. This chapter gives over 120 examples and thirty theorems. Forth chapter introduces nonassociative structures using complex modulo integer groupoids and quasi loops. This new notion is well illustrated by 140 examples. These can find applications only in due course of time, when these new concepts become familiar. The final chapter suggests over 300 problems some of which are research problems....

Table of Contents Details
THEOREM 2.1: Let G = {C(Zn), *, (t, u); t, u ∈ Zn} be a complex modulo integer groupoid. If H ⊆ G is such that H is a Smarandache modulo integer subgroupoid, then G is a Smarandache complex modulo integer groupoid. But every subgroupoid of G need not be a Smarandache complex modulo interger subgroupoid even if G is a Smarandache groupoid. Proof is direct and hence is left as an exercise to the reader. Example 2.28: Consider G = {C(Z8), *, (2, 4)}, a complex modulo integer groupoid....

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
We in this book introduce the notion of pure (mixed) neutrosophic interval bisemigroups or neutrosophic biinterval semigroups. We derive results pertaining to them. The new notion of quasi bisubsemigroups and ideals are introduced. Smarandache interval neutrosophic bisemigroups are also introduced and analysed. Also notions like neutrosophic interval bigroups and their substructures are studied in section two of this chapter. Neutrosophic interval bigroupoids and the identities satisfied by them are studied in section three of this chapter. The final section of chapter one introduces the notion of neutrosophic interval biloops and studies them. Chapter two of this book introduces the notion of neutrosophic interval birings and bisemirings. Several results in this direction are derived and described. Even new bistructures like neutrosophic interval ring-semiring or neutrosophic interval semiring-ring are introduced and analyzed. Further in this chapter the concept of neutrosophic biinterval vector spaces or neutrosophic interval bivector spaces are introduced and their properties are described. In the third chapter we introduce the n...

Excerpt Details
Now we will be using these intervals and work with our results. However by the context the reader can understand whether we are working with pure neutrosophic intervals or neutrosophic of rationals or integers or reals or modulo integers. This chapter has four sections. Section one introduces neutrosophic interval bisemigroups, neutrosophic interval bigroups are introduced in section two. Section three defines biinterval neutrosophic bigroupoids. The final section gives the notion of neutrosophic interval biloops....

Table of Contents Details
Preface 5 Chapter One BASIC CONCEPTS 7 1.1 Neutrosophic Interval Bisemigroups 8 1.2 Neutrosophic Interval Bigroups 32 1.3 Neutrosophic Biinterval Groupoids 41 1.4 Neutrosophic Interval Biloops 57 Chapter Two NEUTROSOPHIC INTERVAL BIRINGS AND NEUTROSOPHIC INTERVAL BISEMIRINGS 75 2.1 Neutrosophic Interval Birings 75 2.2 Neutrosophic Interval Bisemirings 85 2.3 Neutrosophic Interval Bivector Spaces and their Generalization 93 Chapter Three NEUTROSOPHIC n- INTERVAL STRUCTURES (NEUTROSOPHIC INTERVAL n-STRUCTURES) 127 Chapter Four APPLICATIONS OF NEUTROSOPHIC INTERVAL ALGEBRAIC STRUCTURES 159 Chapter Five SUGGESTED PROBLEMS 161 FURTHER READING 187 INDEX 189 ABOUT THE AUTHORS 195 ...

Description Details
The first chapter is introductory in nature and gives a few essential definitions and references for the reader to make use of the literature in case the reader is not thorough with the basics. The second chapter deals with different types of neutrosophic bilinear algebras and bivector spaces and proves several results analogous to linear bialgebra. In chapter three the authors introduce the notion of n-linear algebras and prove several theorems related to them. Many of the classical theorems for neutrosophic algebras are proved with appropriate modifications. Chapter four indicates the probable applications of these algebraic structures. The final chapter suggests about 80 innovative problems for the reader to solve....

Table of Contents Details
Dedication 5 Preface 7 Chapter One INTRODUCTION TO BASIC CONCEPTS 9 1.1 Introduction to Bilinear Algebras and their Generalizations 9 1.2 Introduction to Neutrosophic Algebraic Structures 11 Chapter Two NEUTROSOPHIC LINEAR ALGEBRA 15 2.1 Neutrosophic Bivector Spaces 15 2.2 Strong Neutrosophic Bivector Spaces 32 2.3 Neutrosophic Bivector Spaces of Type II 50 2.4 Neutrosophic Biinner Product Bivector Space 198 Chapter Three NEUTROSOPHIC n-VECTOR SPACES 205 3.1 Neutrosophic n-Vector Space 205 3.2 Neutrosophic Strong n-Vector Spaces 276 3.3 Neutrosophic n-Vector Spaces of Type II 307 Chapter Four APPLICATIONS OF NEUTROSOPHIC n-LINEAR ALGEBRAS 359 Chapter Five SUGGESTED PROBLEMS 361 FURTHER READING 391 INDEX 396 ABOUT THE AUTHORS 402...

Description Details
This book has eight chapters. The first chapter is introductory in nature. Polynomials with matrix coefficients are introduced in chapter two. Algebraic structures on these polynomials with matrix coefficients is defined and described in chapter three. Chapter four introduces natural product on matrices. Natural product on super matrices is introduced in chapter five. Super matrix linear algebra is introduced in chapter six. Chapter seven claims only after this notion becomes popular we can find interesting applications of them. The final chapter suggests over 100 problems some of which are at research level....

Excerpt Details
In this chapter we only indicate as reference of those the concepts we are using in this book. However the interested reader should refer them for a complete understanding of this book. In this book we define the notion of natural product in matrices so that we have a nice natural product defined on column matrices, m * n (m ≠ n) matrices. This extension is the same in case of row matrices. We make use of the notion of semigroups and Smarandache semigroups. Also the notion of semirings, Smarandache semirings, semi vector spaces and semifields are used....

Description Details
This book has four chapters. Chapter one is introductory in nature. The reader is expected to have a good background of algebra and graph theory in order to derive maximum understanding of this research. The second chapter represents groups as graphs. The main feature of this chapter is that it contains 93 examples with diagrams and 18 theorems. In chapter three we describe commutative semigroups, loops, commutative groupoids and commutative rings as special graphs. The final chapter contains 52 problems....

Table of Contents Details
Preface 5 Chapter One INTRODUCTION TO SOME BASIC CONCEPTS 7 1.1 Properties of Rooted Trees 7 1.2 Basic Concepts 9 Chapter Two GROUPS AS GRAPHS 17 Chapter Three IDENTITY GRAPHS OF SOME ALGEBRAIC STRUCTURES 89 3.1 Identity Graphs of Semigroups 89 3.2 Special Identity Graphs of Loops 129 3.3 The Identity Graph of a Finite Commutative Ring with Unit 134 Chapter Four SUGGESTED PROBLEMS 157 FURTHER READING 162 INDEX 164 ABOUT THE AUTHORS 168...

Description Details
This book has six chapters. The first one is introductory in nature just giving only the needed concepts to make this book a self contained one. Chapter two introduces the notion of refined plane of labels, the three dimensional space of refined labels DSm vector spaces. Clearly any n-dimensional space of refined labels can be easily studied as a matter of routine....

Table of Contents Details
Preface 5 Chapter One INTRODUCTION 7 Chapter Two DSm VECTOR SPACES 17 Chapter Three SPECIAL DSm VECTOR SPACES 83 Chapter Four DSm SEMIVECTOR SPACE OF REFINED LABELS 133 Chapter Five APPLICATIONS OF DSm SEMIVECTOR SPACES OF ORDINARY LABELS AND REFINED LABELS 173 Chapter Six SUGGESTED PROBLEMS 175 FURTHER READING 207 INDEX 211 ABOUT THE AUTHORS 214...

Description Details
This is Smarandache's Russian translation from Romanian on Algebra.

Description Details
Prezenta lucrare contine exercitii §i probleme de algebra, grupate pe capitole, pentru clasele superioare de licee §i §coli medii de cultura generala. Scopul ei este pregatirea matematica a elevilor din liceele de toate categoriile §i va fi utila in lucrul de sine statator. De asemenea, lucrarea poate fi folosita pentru lucrul extra§colar, deoarece cititorul va gasi in ea teoreme §i for mule importante, notiuni §i definitii de baza care nu intotdeauna sunt incluse in manualele §colare....

Excerpt Details
Teoria axiomatica a multimilor este foarte dificila pentru a fi expusa la un nivel elementar, de aceea, intuitiv, prin multime vom in1elege o colec1ie de obiecte pe care Ie vom numi elemente sau puncte ale acestei mul1imi. 0 mul1ime este definita daca sunt date elementele sale sau daca se da 0 proprietate pe care 0 au toate elementele sale, proprietate care Ie deosebe§te de elementele altei mul1imi. Ulteror mul1imile Ie vom nota cu majuscule: A, B, C, .. . , X, Y, Z, iar elementele lor cu minuscule: a, b, c, ... , x, y, z etc....

Description Details
Chapter 1 first introduces the interval neutrosophic sets which is an instance of neutrosophic sets. In this chapter, the definition of interval neutrosophic sets and set-theoretic operators are given and various properties of interval neutrosophic set are proved. Chapter 2 defines the interval neutrosophic logic based on interval neutrosophic sets including the syntax and semantics of first order interval neutrosophic propositional logic and first order interval neutrosophic predicate logic. The interval neutrosophic logic can reason and model fuzzy, incomplete and inconsistent information. In this chapter, we also design an interval neutrosophic inference system based on first order interval neutrosophic predicate logic. The interval neutrosophic inference system can be applied to decision making. Chapter 3 gives one application of interval neutrosophic sets and logic in the field of relational databases. Neutrosophic data model is the generalization of fuzzy data model and paraconsistent data model. Here, we generalize various set-theoretic and relation-theoretic operations of fuzzy data model to neutrosophic data model. Chapter ...

Excerpt Details
The neutrosophic set generalizes the above mentioned sets from philosophical point of view. From scientific or engineering point of view, the neutrosophic set and set-theoretic operators need to be specified. Otherwise, it will be difficult to apply in the real applications. In this chapter, we de_ne the set theoretic operators on an instance of neutrosophic set called Interval Neutrosophic Set (INS). We call it as “interval" because it is subclass of neutrosophic set, that is we only consider the subunitary interval of [0; 1]....

Table of Contents Details
Preface iii 1 Interval Neutrosophic Sets 1 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Neutrosophic Set . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Interval Neutrosophic Set . . . . . . . . . . . . . . . . . . . . . 6 1.4 Properties of Set-theoretic Operators . . . . . . . . . . . . . . . . . . 14 1.5 Convexity of Interval Neutrosophic Set . . . . . . . . . . . . . . . . . . 15 1.6 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1.7 Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2 Interval Neutrosophic Logic 21 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.2 Interval Neutrosophic Propositional Calculus . . . . . . . . . . . . . . . 23 2.2.1 Syntax of Interval Neutrosophic Propositional Calculus . . . . . . . . . 23 2.2.2 Semantics of Interval Neutrosophic Propositional Calculus . . . . . . . . . 24 2.2.3 Proof Theory of Interval Neutrosophic Propositional Calculus . . . . . . . . 25 2.3 Interval Neutrosophic Predicate Calculus . . . . . . . . . . . . . . . . 27 2.3.1 Syntax of Interval Neutrosophic Predicate Cal...

Description Details
This book is organized into seven chapters. The first one is introductory in nature. In the second chapter authors give the unique and new way of analyzing the data which is time dependent. In chapter three the authors for the first time define the new concept of matrices with linguistic variables. In chapter four authors have used super matrices in super fuzzy models like super FCMs, super FRMs super FAMs etc. In chapter five we define interval matrix and matrix interval using the natural class of intervals, that is intervals of the form [a, b] where a b or a and b not comparable. In the final chapter we have defined the new notion of bimatrices and n-matrices. Using these new concepts we have constructed linear algebra of type I and linear algebra of type II. Using these matrices we can build n-eigen values and n-eigen vectors....

Table of Contents Details
Preface 5 Chapter One INTRODUCTION 7 Chapter Two AVERAGE TIME DEPENDENT (ATD) DATA MATRIX 9 Chapter Three FUZZY LINGUISTIC MATRICES AND THEIR APPLICATIONS 43 Chapter Four SUPERMATRICES AND THEIR APPLICATIONS 65 Chapter Five INTERVAL MATRICES AND NATURAL CLASS OF INTERVALS 149 Chapter Six DSM MATRIX OF REFINED LABELS 203 Chapter Seven N-MATRICES AND THEIR APPLICATIONS 205 FURTHER READING 217 INDEX 222 ABOUT THE AUTHORS 226...

Description Details
In this book the authors study the erasure techniques in concatenated Maximum Rank Distance (MRD) codes. The authors for the first time in this book introduce the new notion of concatenation of MRD codes with binary codes, where we take the outer code as the RD code and the binary code as the inner code....

Excerpt Details
We want to find efficient algebraic methods to improve the realiability of the transmission of messages. In this chapter we give only simple coding and decoding algorithms which can be easily understood by a beginner. Binary symmetric channel is an illustration of a model for a transmission channel. Now we will proceed onto define a linear code algebraically....

Table of Contents Details
Preface 5 Chapter One BASIC CONCEPTS 7 Chapter Two ALGEBRAIC LINEAR CODES AND THEIR PROPERTIES 29 Chapter Three ERASURE DECODING OF MAXIMUM RANK DISTANCE CODES 49 3.1 Introduction 49 3.2 Maximum Rank Distance Codes 51 3.3 Erasure Decoding of MRD Codes 54 Chapter Four MRD CODES –SOME PROPERTIES AND A DECODING TECHNIQUE 63 4.1 Introduction 63 4.2 Error-erasure Decoding Techniques to MRD Codes 64 4.3 Invertible q-Cyclic RD Codes 83 4.4 Rank Distance Codes With Complementary Duals 101 4.4.1 MRD Codes With Complementary Duals 103 4.4.2 The 2-User F-Adder Channel 106 4.4.3 Coding for the 2-user F-Adder Channel 107 Chapter Five EFFECTIVE ERASURE CODES FOR RELIABLE COMPUTER COMMUNICATION PROTOCOLS USING CODES OVER ARBITRARY RINGS 111 5.1 Integer Rank Distance Codes 112 5.2 Maximum Integer Rank Distance Codes 114 Chapter Six CONCATENATION OF ALGEBRAIC CODES 129 6.1 Concatenation of Linear Block Codes 129 6.2 Concatenation of RD Codes With CR-Metric 140 FURTHER READING 153 INDEX 157 ABOUT THE AUTHORS 161...

Description Details
This book has five chapters. First chapter is introductory in nature. Here we just study chemical pollution caused by garment industries in chapter two of this book using fuzzy associative memories. In chapter three we give ways to control pollution by improving the system performance using hierarchical genetic fuzzy control algorithm. This study is carried out using the past data reported by Shimada et al (1995). Health hazards suffered by the agriculture labourers; caused by the chemicals used as fertilizers and pesticides is analysed in chapter four using RTD matrices. Chapter five gives a method of minimization of SOx and NOx using fuzzy control theory in cement industries to reduce pollution....

Excerpt Details
In this chapter, we have used the fuzzy control method to find the correct measure of pressure and speed of kiln. Using data from Alathur cement industry, we have used mean of maximum method of fuzzy control with the data and we found the pressure and speed of kiln. Here the speed and pressure of kiln are important parameters in the kiln, because the SOx and N0X concentration is dependent on the kiln feed, coal feed and the kiln feed, coal feed are dependent on speed and pressure of kiln. That means if we increase the kiln feed and coal feed we must increase the kiln pressure and speed. By this way the mixing of SOx and NOx with kiln feed is maintained properly or otherwise the SOx and NOx will not mix fully with the kiln feed. The remaining unmixed gases of SOx and NOx are the wastage polluting the environment. For this, we convert all this kiln feed and coal feed level and pressure of kiln and speed of kiln into fuzzy control. By using fuzzy control we identify a correct pressure and speed of the kiln for a given kiln feed and coal feed. When we choose a correct pressure of kiln and speed of kiln through fuzzy control, the SO...

Table of Contents Details
Preface 5 Chapter One INTRODUCTION 7 Chapter Two USE OF FAM MODELS TO ANALYSE THE POLLUTION CAUSED BY THE GARMENT INDUSTRIES 11 Chapter Three HIERARCHICAL GENETIC ALGORITHM TO IMPROVE THE SYSTEM PERFORMANCE AND REDUCE POLLUTION BY CHEMICAL PLANTS 51 3.1 Introduction 51 3.2 Description of the Problem 53 3.3 Application of Hierarchical Genetic Fuzzy Control Algorithm to Control Process Variables of Decision Tables in Chemical Plants 56 3.4 Use of Hierarchical Genetic Fuzzy Control Algorithm in the Real Data 58 3.5 Conclusions 73 Chapter Four IDENTIFICATION OF THE MAXIMUM AGE GROUP IN WHICH THE AGRICULTURAL LABOURERS SUFFER HEALTH HAZARDS DUE TO CHEMICAL POLLUTION USING RTD MATRIX 75 4.1 Introduction 75 4.2 Estimation of the Maximum Age Group of the Agricultural Labourers having Cardio Vascular Problem due to Chemical Pollution using RTD Matrices 77 4.3 Conclusion 93 Chapter Five MINIMIZATION OF SOX AND NOX USING FUZZY CONTROL THEORY IN CEMENT INDUSTRIES TO REDUCE POLLUTION 95 5.1 Introduction 95 5.2 Description of the Problem 97 5.3 Process Fates of Sulfur in Cement Kiln 98 5.4 Process Fates of Ni...

Description Details
前言 数论这门学科最初是从研究整数开始的, 所以叫做整数论. 后来整数 论又进一步发展, 就叫做数论了. 确切的说, 数论就是一门研究整数性质 的学科. 它是最古老的数学分支. 按照研究方法来说, 数论可以分成初等 数论, 解析数论, 代数数论, 超越数论, 计算数论, 组合数论等. Foreword Number theory, this discipline was originally started from the study integer, so called Number Theory. Later integer on further development of number theory called it. Rather, number theory is an integer nature of disciplines and it is the oldest branch of mathematics concerned by the study methods, can be divided into elementary number theory, number theory, analytic number theory, algebraic number theory, transcendental number theory, computational number theory, combinatorics number theory and so on....

Table of Contents Details
第一章Smarandache函数. . . . . . . . . . . . 1 1.1 引言. . . . . . . . . . . . . . . . . . . . . . . 1 1.2 关于F.Smarandache可乘数函数的一类均值. . . . . . 1 1.3 Smarandache函数值的分布. . . . . . . . . . . . . 5 1.3.1 几个引理. . . . . . . . . . . . . . . . . . . 6 1.3.2 证明. . . . . . . . . . . . . . . . . . . . . 7 1.4 Smarandache函数df (n) 的均值. . . . . . . . . . . . 9 1.5 关于F.Smarandache LCM 函数以及它的主值. . . . . . 12 1.6 Smarandache Pierced 链. . . . . . . . . . . . . . . 16 1.7 Smarandache 函数的几个相关结论. . . . . . . . . . 18 1.7.1 关于Smarandache 函数的一个等式. . . . . . . . 18 1.7.2 关于文章\一个新的算术函数的主值"的一些注释. . 20 1.7.3 Smarandache 函数的一个推广. . . . . . . . . . 23 1.7.4 关于F.Smarandache函数及其k次补数. . . . . . . 27 1.7.5 关于F.Smarandache函数的奇偶性. . . . . . . . 32 第二章伪Smarandache 函数. . . . . . . . . . . . 36 2.1 伪Smarandache 函数的定义及性质. . . . . . . . . . 36 2.2 关于伪Smarandache函数的几个定理. . . . . . . . . 38 2.3 关于伪Smarandache 函数的几个方程. . . . . . . . . 40 2.3.1 一个与Smarandache函数有关的函数方程及其正整 数解. . . . . . . . . . . . . . . . . . . . . 41 2.3.2 一个包含伪Smarandache函数及其对偶函数的方程. 42 2.3.3 一个包含伪Smarandache 函数及Smarandache 可乘 函数的方程. . . . . . . . . . . . . . . . . . 45 2.4 伪Smarandache函数的...

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....

Description Details
The algebraic structure, linear algebra happens to be one of the subjects which yields itself to applications to several fields like coding or communication theory, Markov chains, representation of groups and graphs, Leontief economic models and so on. This book has for the first time, introduced a new algebraic structure called linear bialgebra, which is also a very powerful algebraic tool that can yield itself to applications. With the recent introduction of bimatrices (2005) we have ventured in this book to introduce new concepts like linear bialgebra and Smarandache neutrosophic linear bialgebra and also give the applications of these algebraic structures....

Excerpt Details
In this section we give the definition of linear algebra and just state the few important theorems like Cayley Hamilton theorem, Cyclic Decomposition Theorem, Generalized Cayley Hamilton Theorem and give some properties about linear algebra....

Description Details
Scientia Magna is published annually in 200-300 pages per volume and 1,000 copies on topics such as mathematics, physics, philosophy, psychology, sociology, and linguistics....

Excerpt Details
A structure theorem of right C-rpp semigroups1 Abstract A new method of construction for right C-rpp semigroups is given by using a right cross product of a right regular band and a strong semilattice of left cancellative monoids. Keywords Right C-rpp semigroups, right cross products, right regular bands, left cancellative monoids. x1. Introduction Recall that a semigroup S is called an rpp semigroup if all its principal right ideals aS1, regarded as right S1-systems, are projective. According to J.B. Fountain[5], a semigroup S is rpp if and only if, for any a 2 S, the set Ma=fe 2 E j S1a µ Se and for all x; y 2 S1, ax = ay ) ex = eyg is a non-empty set, where E is the set of all idempotents of S. An rpp semigroup S is called strongly rpp if for every a 2 S, there exists a unique idempotent e in Ma such that ea=a. It is easy to see that regular semigroups are rpp semigroups and completely regular semigroups are strongly rpp semigroups. Thus, rpp semigroups are generalizations of regular semigroups. A strongly rpp semigroups S is said to be a right C-rpp semigroup if L. _ R is a congruence on S and Se µ eS for all e 2 E(...

Table of Contents Details
X. Pan and B. Liu : On the irrational root sieve sequence 1 H. Liu : Sub-self-conformal sets 4 K. Liu : On mean values of an arithmetic function 12 L. Wang and Y. Liu : On an infinite series related to Hexagon-numbers 16 X. Ren, etc. : A structure theorem of right C-rpp semigroups 21 A. R. Gilani and B. N. Waphare : Fuzzy extension in BCI-algebras 26 A. S. Shabani : The Pell's equation x2 ¡ Dy2 = §a 33 L. Cheng : On the mean value of the Smarandache LCM function 41 W. Guan : Four problems related to the Pseudo-Smarandache-Squarefree function 45 Y. Lou : On the pseudo Smarandache function 48 J. L. Gonzalez : A miscellaneous remark on problems involving Mersenne primes 51 Y. Liu and J. Li : On the F.Smarandache LCM function and its mean value 52 N. T. Quang and P. D. Tuan : A generalized abc-theorem for functions of several variables 56 W. Liu, etc. : An assessment method for weight of experts at interval judgment 61 Y. Xue : On the F.Smarandache LCM function SL(n) 69 Y. Zheng : On the Pseudo Smarandache function and its two conjectures 74 Z. Ding : Diophantine equations and their positive integer solutions 77 S. Gou ...

Description Details
Scientia Magna is published annually in 200-300 pages per volume and 1,000 copies on topics such as mathematics, physics, philosophy, psychology, sociology, and linguistics....

Excerpt Details
Abstract In this paper, we use 4-cyclotomic cosets of modulo n and generator polynomials to describe quaternary simple-root cyclic codes of length n = 85. We discuss the conditions under which a quaternary cyclic codes contain its dual, and obtain some quantum error-correcting codes of length n = 85, three of these codes are better than previous known codes. Keywords Quaternary cyclic code, self-orthogonal code, quantum error-correcting code. x1. Introduction Since the initial discovery of quantum error-correcting codes, researchers have made great progress in developing quantum error-correcting codes. Many code construction are given. Reference [1] gives a thorough discussion of the principles of quantum coding theory. Many good quantum error-correcting codes were constructed from BCH codes, Reed-Muller codes, Reed-Solomon codes and algebraic geometric codes, see [2-6]. So it is natural to construct quantum error-correcting codes from quaternary cyclic codes. It is known that there is a close relation between cyclotomic coset and cyclic codes. Suggested by this relation, we use 4-cyclotomic coset modulo n and generator polyn...

Table of Contents Details
S. M. Khairnar and M. More : Subclass of analytic and univalent functions in the unit disk 1 Y. Ma, etc. : Large quaternary cyclic codes of length 85 and related quantum error-correcting 9 J. Chen : Value distribution of the F.Smarandache LCM function 15 M. Bencze : About a chain of inequalities 19 C. Tian and N. Yuan : On the Smarandache LCM dual function 25 J. Caltenco, etc. : Riemannian 4-spaces of class two 29 Y. Xue : On a conjecture involving the function SL¤(n) 41 Y. Wang : Some identities involving the near pseudo Smarandache function 44 A. Gilani and B. Waphare : On pseudo a-ideal of pseudo-BCI algebras 50 J. Chen : An equation involving the F.Smarandache multiplicative function 60 M. Enciso-Aguilar, etc. : Matrix elements for the morse and coulomb interactions 66 Y. Xu and S. Li : On s¤¡Supplemented Subgroups of Finite Groups 73 C. Tian : Two equations involving the Smarandache LCM dual function 80 W. Zheng and J. Dou : Periodic solutions of impulsive periodic Competitor- Competitor-Mutualist system 86 X. Zhang : On the fourth power mean value of B(Â) 93 Z. Lv : On the F.Smarandache function and its mean val...

Description Details
We have used the 2-adaptive fuzzy model having the two fuzzy models, fuzzy matrices model and BAMs viz. model to analyze the views of public about HIV/ AIDS disease, patient and the awareness program. This book has five chapters and 6 appendices. The first chapter just recalls the definition of four fuzzy models used in this book and gives illustration of some of them. Chapter two introduces the new n-adaptive fuzzy models. Chapter three uses for the first time 2 adaptive fuzzy models to study psychological and sociological problems about HIV/AIDS. Chapter four gives an outline of the interviews. Chapter five gives the suggestions and conclusion based on our study. Of the 6 appendices four of them are C-program made to make the working of the fuzzy model simple....

Excerpt Details
In this chapter for the first time we introduce the new class of n-adaptive fuzzy models (n a positive integer and n ≥ 2) and illustrate it. These n-adaptive fuzzy models can analyze a problem using different models so one can get in one case the hidden pattern, in one case the maximum time period in some case output state vector for a given input vector and so on. So this new model has the capacity to analyze the problem in different angles, which can give multiple suggestions and solutions about the problem. This chapter has two sections. Section one defines the new model gives illustrations and section two defines some special n-adaptive models and proposes some problems....

Table of Contents Details
Chapter One SOME BASIC FUZZY MODELS WITH ILLUSTRATIONS 1.1 Fuzzy matrices and their applications 9 1.2 Definition and illustration of Fuzzy Relational Maps (FRMs) 16 1.3 Some basic concepts of BAM with illustration 20 1.3.1 Some basic concepts of BAM 22 1.3.2 Use of BAM Model to study the cause of vulnerability to HIV/AIDS and factors for migration 28 1.4 Introduction to Fuzzy Associative Memories (FAM) 35 Chapter Two ON A NEW CLASS OF N-ADAPTIVE FUZZY MODELS WITH ILLUSTRATIONS 2.1 On a new class of n-adaptive fuzzy models with illustrations 39 2.2 Some special n-adaptive models 49 Chapter Three USE OF 2-ADAPTIVE FUZZY MODEL TO ANALYZE THE PUBLIC AWARENESS OF HIV/AIDS 3.1 Study of the psychological and social problems the public have about HIV/AIDS patients using CETD matrix 52 3.2 Use of 2 adaptive fuzzy model to analyze the problem 72 Chapter Four PUBLIC ATTITUDE AND AWARENESS ABOUT HIV/AIDS 4.1 Introduction 77 4.2 Interviews 81 Chapter Five CONCLUSIONS 167 Appendix 1. Questionnaire 177 2. Table of Statistics 191 3. C-program for CETD and RTD Matrix 198 4. C-program for FRM 202 5. C-program for CFRM 2...

Description Details
The new concept of fuzzy interval matrices has been introduced in this book for the first time. The authors have not only introduced the notion of fuzzy interval matrices, interval neutrosophic matrices and fuzzy neutrosophic interval matrices but have also demonstrated some of its applications when the data under study is an unsupervised one and when several experts analyze the problem....

Excerpt Details
1.2 Definition of Fuzzy Cognitive Maps In this section we recall the notion of Fuzzy Cognitive Maps (FCMs), which was introduced by Bart Kosko in the year 1986. We also give several of its interrelated definitions. FCMs have a major role to play mainly when the data concerned is an unsupervised one. Further this method is most simple and an effective one as it can analyse the data by directed graphs and connection matrices. DEFINITION 1.2.1: An FCM is a directed graph with concepts like policies, events etc. as nodes and causalities as edges. It represents causal relationship between concepts. Example 1.2.1: In Tamil Nadu (a southern state in India) in the last decade several new engineering colleges have been approved and started. The resultant increase in the production of engineering graduates in these years is disproportionate with the need of engineering graduates. ...

Table of Contents Details
Dedication 5 Preface 6 Chapter One BASIC CONCEPTS 1.1 Definition of Interval Matrices and Examples 8 1.2 Definition of Fuzzy Cognitive Maps 9 1.3 An Introduction to Neutrosophy 13 1.4 Some Basic Neutrosophic Structures 16 1.5 Some Basic Notions about Neutrosophic Graphs 22 1.6 On Neutrosophic Cognitive Maps with Examples 28 1.7 Definition and Illustration of Fuzzy Relational Maps (FRMs) 33 1.8 Introduction to Fuzzy Associative Memories 40 1.9 Some Basic Concepts of BAM 43 1.10 Properties of Fuzzy Relations and FREs 49 1.11 Binary Neutrosophic Relations and their Properties 56 Chapter Two INTRODUCTION TO FUZZY INTERVAL MATRICES AND NEUTROSOPHIC INTERVAL MATRICES AND THEIR GENERALIZATIONS 2.1 Fuzzy Interval Matrices 68 2.2 Interval Bimatrices and their Generalizations 76 2.3 Neutrosophic Interval Matrices and their Generalizations 92 Chapter Three FUZZY MODELS AND NEUTROSOPHIC MODELS USING FUZZY INTERVAL MATRICES AND NEUTROSOPHIC INTERVAL MATRICES 3.1 Description of FCIMs Model 118 3.2 Description and Illustration of FRIM Model 129 3.3 Description of FCIBM model and its Generalization 139 3.4 FRIBM model and i...

Description Details
Scientia Magna is published annually in 200-300 pages per volume and 1,000 copies on topics such as mathematics, physics, philosophy, psychology, sociology, and linguistics....

Excerpt Details
An identity involving the function ep(n) Abstract The main purpose of this paper is to study the relationship between the Riemann zeta-function and an in¯nite series involving the Smarandache function ep(n) by using the elementary method, and give an interesting identity. Keywords Riemann zeta-function, in¯nite series, identity. x1. Introduction and Results Let p be any fixed prime, n be any positive integer, ep(n) denotes the largest exponent of power p in n. That is, ep(n) = m, if pm j n and pm+1 - n. In problem 68 of [1], Professor F.Smarandache asked us to study the properties of the sequence fep(n)g. About the elementary properties of this function, many scholars have studied it (see reference [2]-[7]), and got some useful results. For examples, Liu Yanni [2] studied the mean value properties of ep(bk(n)), where bk(n) denotes the k-th free part of n, and obtained an interesting mean value formula for it. That is, let p be a prime, k be any fixed positive integer, then for any real number x ¸ 1, we have the asymptotic formula....

Table of Contents Details
F. Ayatollah, etc. : Some faces of Smarandache semigroups' concept in transformation semigroups' approach 1 G. Feng : On the F.Smarandache LCM function 5 N. Quang and P. Tuan : An extension of Davenport's theorem 9 M. Zhu : On the hybrid power mean of the character sums and the general Kloosterman sums 14 H. Yang and R. Fu : An equation involving the square sum of natural numbers and Smarandache primitive function 18 X. Pan and P. Zhang : An identity involving the Smarandache function ep(n) 26 A.A.K. Majumdar : A note on the Smarandache inversion sequence 30 F. Li : Some Dirichlet series involving special sequences 36 Y. Wang : An asymptotic formula of Sk(n!) 40 S. Gao and Z. Shao : A fuzzy relaxed approach for multi-objective transportation problem 44 J. Li : An infinity series involving the Smarandache-type function 52 B.E. Carvajal-Gamez, etc. : On the Lorentz matrix in terms of Infeld-van der Waerden symbols 56 X. Li : On the mean value of the Smarandache LCM function 58 K. Ran and S. Gao : Ishikawa iterative approximation of fixed points for multi-valued Ástrongly pseudo-contract mappings 63 X. Fan : On the divisi...

Description Details
This issue of the journal is devoted to the proceedings of the third International Conference on Number Theory and Smarandache Problems. The conference was a great success and will give a strong impact on the development of number theory in general and Smarandache problems in particular. In this volume we assemble not only those papers which were presented at the conference but also those papers which were submitted later and are concerned with the Smarandache type problems or other mathematical problems. Other papers are concerned with the number-theoretic Smarandache problems and will enrich the already rich stock of results on them. Readers can learn various techniques used in number theory and will get familiar with the beautiful identities and sharp asymptotic formulas obtained in the volume....

Excerpt Details
Abstract : Let k be any ¯xed positive integer, n be any positive integer, Sk(n) denotes the smallest positive integer m such that m! is divisible by kn: In this paper, we use the elementary methods to study the asymptotic properties of Sk(n), and give an interesting asymptotic formula for it. Keywords : F. Smarandache problem, primitive numbers, asymptotic formula. ...

Table of Contents Details
J. Wang : Cube-free integers as sums of two squares 1 G. Liu and H. Li : Recurrences for generalized Euler numbers 9 H. Li and Q. Yang : Some properties of the LCM sequence 14 M. Liu : On the generalization of the primitive number function 18 Z. Lv : On the F. Smarandache LCM function and its mean value 22 Q. Wu : A conjecture involving the F. Smarandache LCM function 26 S. Xue : On the Smarandache dual function 29 N. Yuan : A new arithmetical function and its asymptotic formula 33 A. Muktibodh, etc. : Sequences of pyramidal numbers 39 R. Zhang and S. Ma : An e±cient hybrid genetic algorithm for continuous optimization problems 46 L. Mao : An introduction to Smarandache multi-spaces and mathematical combinatorics 54 M. Selariu : Smarandache stepped functions 81 X. Zhang and Y. Zhang : Sequences of numbers with alternate common di®erences 93 Y. Zhang : On the near pseudo Smarandache function 98 A. Muktibodh : Smarandache mukti-squares 102...

Description Details
Scientia Magna is published annually in 200-300 pages per volume and 1,000 copies on topics such as mathematics, physics, philosophy, psychology, sociology, and linguistics....

Excerpt Details
0. In 1999, the second author of this remarks published a book over 30 of Smarandache's problems in area of elementary number theory (see [1, 2]). After this, we worked over new 20 problems that we collected in our book [28]. These books contain Smarandache's problems, described in [10, 16]. The present paper contains some of the results from [28]. In [16] Florentin Smarandache formulated 105 unsolved problems, while in [10] C.Dumitresu and V. Seleacu formulated 140 unsolved problems of his. The second book contains almost all the problems from [16], but now each problem has unique number and by this reason in [1, 28] and here the authors use the numeration of the problems from [10]. In the text below the following notations are used....

Table of Contents Details
V. Mladen and T. Krassimir : Remarks on some of the Smarandache's problem. Part 2 1 W. Kandasamy : Smarandache groupoids 27 L. Ding : On the primitive numbers of power P and its mean value properties 36 D. Torres and V. Teca : Consecutive, reversed, mirror, and symmetric Smarandache sequence of triangular numbers 39 D. Ren : On the square-free number sequence 46 T. Ramaraj and N. Kannappa : On ¯nite Smarandache near-rings 49 X. Kang : Some interesting properties of the Smarandache function 52 L. Mao : On Automorphism Groups of Maps, Surfaces and Smarandache Geometries 55 L. Ding : On the mean value of Smarandache ceil function 74 M. Le : An equation concerning the Smarandache function 78 M. Bayat, H. Teimoori and M. Hassani : An extension of ABC-theorem 81 J. Ma : An equation involving the Smarandache function 89 C. Chen : Inequalities for the polygamma functions with application 91 W. Vasantha and M. Chetry : On the number of Smarandache zero-divisors and Smarandache weak zero-divisors in loop rings 96 M. Le : The function equation S(n) = Z(n) 109 Z. Li : On the Smarandache Pseudo-number Sequences 111 D. Mehendale :...

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
In The 2nd Conference on Combinatorics and Graph Theory of China (Aug. 16-19, 2006, Tianjing), I formally presented a combinatorial conjecture on mathematical sciences (abbreviated to CC Conjecture), i.e., a mathematical science can be reconstructed from or made by combinatorialization, implicated in the foreword of Chapter 5 of my book Automorphism groups of Maps, Surfaces and Smarandache Geometries (USA, 2005). This conjecture is essentially a philosophic notion for developing mathematical sciences of 21st century, which means that we can combine different fields into a union one and then determines its behavior quantitatively. It is this notion that urges me to research mathematics and physics by combinatorics, i.e., mathematical combinatorics beginning in 2004 when I was a post-doctor of Chinese Academy of Mathematics and System Science. It finally brought about me one self-contained book, the first edition of this book, published by InfoQuest Publisher in 2009. This edition is a revisited edition, also includes the development of a few topics discussed in the first edition....

Excerpt Details
1.5 ENUMERATION TECHNIQUES 1.5.1 Enumeration Principle. The enumeration problem on a finite set is to count and find closed formula for elements in this set. A fundamental principle for solving this problem in general is on account of the enumeration principle: For finite sets X and Y , the equality |X| = |Y | holds if and only if there is a bijection f : X → Y . Certainly, if the set Y can be easily countable, then we can find a closed formula for elements in X....

Table of Contents Details
Contents Preface to the Second Edition . . . . . . . . . . . . . . . . . . . i Chapter 1. Combinatorial Principle with Graphs . . . . . . . . . . 1 1.1 Multi-sets with operations. . . . . . . . . . . . . . . . . . . . .2 1.1.1 Set . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Operation . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Boolean algebra . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.1.4 Multi-Set . . . . . . . . . . . . . . . . . . . . . . . . . .8 1.2 Multi-posets . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.2.1 Partially ordered set . . . . . . . . . . . . . . . . . . . . .11 1.2.2 Multi-Poset . . . . . . . . . . . . . . . . . . . . . . 13 1.3 Countable sets . . . . . . . . . . . . . . . . . . . . . . . . 15 1.3.1 Mapping . . . . . . . . . . . . . . . . . . . . . . . . . 15 1.3.2 Countable set . . . . . . . . . . . . . . . . . . . . 16 1.4 Graphs . . . . . . . . . . . . . . . . . . . . . . . . 18 1.4.1 Graph. . . . . . . . . . . . . . . . . . . . . . . . . . . .18 1.4.2 Subgraph . . . . . . . . . . . . . . . . . . . . . . . . 21 1.4.3 Labeled graph. . . . . . ...