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
In part 1, we have defined a fuzzy utility system, with different financial goals, different levels of risk tolerance and different personal preferences, liquid assets, etc. In part 2, we have defined a computational model for a simple portfolio insurance strategy using a protective put and computationally derive the investor’s governing utility structures underlying such a strategy under alternative market scenarios. In Part 3, it is proposed an artificial classification scheme to isolate truly benign tumors from those that initially start off as benign but subsequently show metastases. In part 4, an alternative methodological approach has been proposed for quantifying utility in terms of expected information content of the decision-maker’s choice set....

Excerpt Details
In this paper we have designed our fuzzy system so that customers are classified to belong to any one of the following three categories: *Conservative and security-oriented (risk shy) *Growth-oriented and dynamic (risk neutral) *Chance-oriented and progressive (risk happy) A neutrosophic system has three components – that’s why it may be considered as just a generalization of a fuzzy system which has only two components. Besides being useful for clients, investor classification has benefits for the professional investment consultants as well. Most brokerage houses would value this information as it gives them a way of targeting clients with a range of financial products more effectively - including insurance, saving schemes, mutual funds, and so forth. Overall, many responsible brokerage houses realize that if they provide an effective service that is tailored to individual needs, in the long-term there is far more chance that they will retain their clients no matter whether the market is up or down....

Description Details
Relocation is often defined as a stressful and nerve-racking experience that eats up too much time and money, leaving you emotionally and physically drained. And yet, it doesn’t have to be this way. The key to successfully writing your own happy ending to the grim moving story is to be adequately prepared for Moving day by following the required packing steps. Cleverly structured by esteemed relocation experts and, the purpose of this moving book is to help you organize and execute a smooth and trouble-free move with the least effort on your part. Be well informed. Be a smart decision-maker. Make all the right moves....

Excerpt Details
It is universally known that moving often turns out to be a stressful experience with an insatiable appetite for time and money. The psychological impact of any relocation process cannot be predicted with any certainty and its side effects may last from a couple of weeks to a few years depending on what type of person you are. Being well prepared for the upcoming move is fundamental not only for your emotional well-being, but for that of the people around you as well....

Table of Contents Details
Introduction How To Mentally Prepare For A Move “Plans are nothing; planning is everything” It’s time to say goodbye You are what matters most A change might do you good Top 10 Best Organizing Ideas For Moving Be prudent when choosing your moving service Box it in and pack it up Devise a clever sorting system Make a survival kit Guard your valuables Get rid of excess stuff Accept any help you can get Let your camera be your pal Spread the word Make it children and pet safe Bonus idea: Start early and don’t rush yourself Top 10 Moving Mistakes And How To Avoid Them 1. Not planning your move 2. Failing to ask for an in-house estimate 3. Not obtaining multiple moving quotes 4. Not researching the moving companies 5. Choosing the company with the lowest quote 6. Bypassing items during the estimate 7. Packing poorly the day before the move 8. Failing to understand your insurance options 9. Entrusting irreplaceable valuables in the hands of the movers 10. Not understanding the moving paperwork Non-Allowable Items: What To Do When Movers Say No Hazardous materials Perishable food Pets and plants Irreplaceab...

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