Description Details
In this book the authors study dual numbers in a special way. The main aim of this book is to find rich sources of new elements g such that g2 = 0. The main sources of such new elements are from Zn, n a composite number. We give algebraic structures on them. This book is organized into six chapters. The final chapter suggests several research level problems. Fifth chapter indicates the applications of dual numbers. The forth chapter introduces the concept of interval dual numbers, we also extend it to the concept of neutrosophic and 8 fuzzy dual numbers. Higher dimensional dual numbers are defined, described and developed in chapter three. Chapter two gives means and methods to construct the new element g such that g2 = 0. The authors feel Zn (n a composite positive integer) is a rich source for getting new element, the main component of the dual number x = a + bg....

Table of Contents Details
Dedication 5 Preface 7 Chapter One INTRODUCTION 9 Chapter Two DUAL NUMBERS 11 Chapter Three HIGHER DIMENSIONAL DUAL NUMBERS 55 Chapter Four DUAL INTERVAL NUMBERS AND INTERVAL DUAL NUMBERS 89 Chapter Five APPLICATION OF THESE NEW TYPES OF DUAL NUMBERS 129 Chapter Six SUGGESTED PROBLEMS 131 FURTHER READING 153 INDEX 156 ABOUT THE AUTHORS 159...

Description Details
In this paper we defme a function L with will allowus to generalize (separately or simultaneously) some theorems from Numbers Theory obtained by Wilson, Fermat, Euler, Gauss, Lagrange, Leibnitz, Moser, Sierpinski. (Some papers not included in the volume were confiscated by the Secret Police in September 1988, when the author left Romania. He spent 19 months in a Turkish political refugee camp, and emigrated to the United Stales in March 1990. Despite efforts by his fric; is, the papers were not rcncvcred ...)...

Description Details
This book extends the natural operations defined on intervals, finite complex numbers and matrices. Secondly the authors introduce the new notion of finite complex modulo numbers just defined as for usual reals. Finally we introduced the notion of natural product Xn on matrices. This enables one to define product of two column matrices of same order. We can find also product of m*n matrices even if m not does equal n. This natural product Xn is nothing but the usual product performed on the row matrices. So we have extended this type of product to all types of matrices....

Excerpt Details
In this chapter we just give a analysis of why we need the natural operations on intervals and if we have to define natural operations existing on reals to the intervals what changes should be made in the definition of intervals. Here we redefine the structure of intervals to adopt or extend to the operations on reals to these new class of intervals....

Table of Contents Details
Dedication 4 Preface 5 Chapter One INTRODUCTION 7 Chapter two EXTENSION OF NATURAL OPERATIONS TO INTERVALS 9 Chapter Three FINITE COMPLEX NUMBERS 41 Chapter Four NATURAL PRODUCT ON MATRICES 81 FURTHER READING 147 INDEX 148 ABOUT THE AUTHORS 150...

Description Details
In the first chapter of this book we discuss Einstein’s thought experiment with atomic clocks.

Excerpt Details
Preface (Many Relativities ) In the first chapter of this book we discuss Einstein’s thought experiment with atomic clocks: A rocket travels at a constant speed v with respect to the earth. In the rocket, a light pulse is emitted by a source from A to a mirror B that reflects it back to A where it is detected. The rocket’s movement and the light pulse’s movement are orthogonal. There is an observer in the rocket (the astronaut) and an observer on the earth. The trajectory of light pulse (and implicitly the distance traveled by the light pulse), the elapsed time it needs to travel this distance, and the speed of the light pulse at which is travels are perceived differently by the two observers {depending on the theories used in this book}....

Table of Contents Details
C O N T E N T S Preface (Many Relativities): 7 Chapter 1. On Einstein’s Thought Experiment with the Light Clocks: 19 1.1. Einstein’s Thought Experiment with the Light Clocks: 20 1.2. Relativistic Addition of Velocities: 23 1.3. Counter-Intuitive Results of the Relativistic Addition of Velocities: 23 1.4. Contradictory Results of the Relativistic Addition of Velocities: 24 1.5. Relativistic Addition of Superluminal Velocities: 26 1.6. Extension of Relativistic Formula for the Addition of Many Subluminal Velocities: 27 1.7. Generalization of Einstein’s Thought Experiment with the Light Clocks for Arbitrary Ultimate Velocity K: 35 1.8. Generalization of the Relativistic Addition Formula for Arbitrary Ultimate Velocity K: 37 1.9. Generalized Lorentz Factor: 39 1.10. Generalized Minkowski Norm: 39 1.11. Generalized Time Dilation: 39 1.12. Generalized Length Contraction: 40 1.13. Generalized Relativistic Momentum: 40 1.14. Generalized Energy: 40 1.15. The Generalized Total Energy: 40 1.16. Generalized Kinetic Energy: 41 Chapter 2. A Hypothesis: There is No Speed Barrier in the Universe and One Can Construct Arbitrary ...

Description Details
This book has five chapters. Chapter one is introductory in nature. Fuzzy linguistic spaces are introduced in chapter two. Fuzzy linguistic vector spaces are introduced in chapter three. Chapter four introduces fuzzy linguistic models. The final chapter suggests over 100 problems and some of them are at research level....

Table of Contents Details
Preface 5 Chapter One Introduction 7 Chapter Two Fuzzy Linguistic Spaces 9 Chapter Three Fuzzy Linguistic Set Vector Spaces 23 Chapter Four Fuzzy Linguistic Models 129 4.1 Operations on Fuzzy Linguistics Matrices 129 4.2 Fuzzy Linguistic Cognitive Models 139 4.3 Fuzzy Linguistic Relational Map Model 148 Chapter Five Suggested Problems 165 Further Reading 187 Index 189 About the Authors 192...

Description Details
Generally, combinatorics deals with twofold: Question 1.1. to determine or find structures or properties of configurations, such as those structure results appeared in graph theory, combinatorial maps and design theory,..., etc.. Question 1.2. to enumerate configurations, such as those appeared in the enumeration of graphs, labeled graphs, rooted maps, unrooted maps and combinatorial designs,...,etc.....

Table of Contents Details
Combinatorial Speculation and Combinatorial Conjecture for Mathematics BY LINFAN MAO. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Structures of Cycle Bases with Some Extremal Properties BY HAN REN and YUN BAI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .20 The Crossing Number of K1,5,n BY HANFEI MEI and YUANQIU HUANG. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 Pseudo-manifold Geometries with Applications BY LINFAN MAO. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 Minimum Cycle Base of Graphs Identified by Two Planar Graphs BY DENGJU MA and HAN REN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 A Combinatorially generalized Stokes Theorem on Integrations BY LINFAN MAO. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 A No...

Description Details
This book is organized into 5 chapters. The first chapter introduces real neutrosophic complex numbers. Chapter two introduces the notion of finite complex numbers; algebraic structures like groups, rings etc are defined using them. Matrices and polynomials are constructed using these finite complex numbers. Chapter three introduces the notion of neutrosophic complex modulo integers. Algebraic structures using neutrosophic complex modulo integers are built and around 90 examples are given. Some probable applications are suggested in chapter four and chapter five suggests around 160 problems some of which are at research level....

Excerpt Details
In this chapter we for the first time we define the notion of integer neutrosophic complex numbers, rational neutrosophic complex numbers and real neutrosophic complex numbers and derive interesting properties related with them....

Table of Contents Details
Preface 5 Chapter One REAL NEUTROSOPHIC COMPLEX NUMBERS 7 Chapter Two FINITE COMPLEX NUMBERS 89 Chapter Three NEUTROSOPHIC COMPLEX MODULO INTEGERS 125 Chapter Four APPLICATIONS OF COMPLEX NEUTROSOPHIC NUMBERS AND ALGEBRAIC STRUCTURES USING THEM 175 Chapter Five SUGGESTED PROBLEMS 177 FURTHER READING 215 INDEX 217 ABOUT THE AUTHORS 220...

Description Details
F. Smarandache has defined many sequences of integers formed by concatenating the positive integers in specific ways. A question that is often asked about most of these sequences concerns the number of primes in the sequence. As Paul Erdos pointed out, determining how many primes are in sequences of this type is a problem that the current state of mathematical knowledge is unprepared to solve. In general, the sequences grow rather fast, so after a very short time, the terms are too large for modern computers to determine if they are prime. The only hope is to find some property of the elements of the sequence that can be used to very quickly determine if it can be factored....

Excerpt Details
Using the bases from three through nine to form new sequences, we can then ask the same question regarding the number of primes in the sequence. That appears to be a question just as difficult as the one for base ten numbers, and is summarized in the following statement....

Table of Contents Details
Preface.3 -- Table of Contents.4 -- Chapter 1 Sequences Formed by Concatenating All the Positive Integers.5 -- Chapter 2 Sequences Formed by Concatenating Selected Natural Numbers .44 -- Chapter 3 Smarandache Stereograms .70 3.1 -- The Stereogram.70 -- 3.2 Altering the Background.87 -- 3.3 Additional Stereograms .91 -- 3.4 Possibilities for Additional Figures .92 -- Chapter 4 Constants Involving the Smarandache Function .95 -- Index.133 --...

Description Details
Surfing on the Ocean of Numbers - why this title? Because this little book does not attempt to give theorems and rigorous proofs in the theory of numbers. Instead it will attempt to throw light on some properties of numbers, nota bene integers, through a study of the behaviour of large numbers of integers in order to draw some reasonably certain conclusions or support already made conjectures. But no matter how far we extend our search or increase our samples in these studies we are in fact, in spite of more and more powerful technologies, merely skimming the surface of the immense sea of numbers. - Hence the title....

Description Details
Number theory is an ancient subject, but we still cannot answer many simplest and most natural questions about the integers. Some old problems have been solved, but more arise. All the research for these ancient or new problems implicated and are still promoting the development of number theory and mathematics....

Description Details
K.R.Narayanan was a lauded hero and a distinguished victim of his Dalit background. Even in an international platform when he was on an official visit to Paris, the media headlines blazed, ‘An Untouchable at Elysee’. He was visibly upset and it proved that a Dalit who rose up to such heights was never spared from the pangs of outcaste-ness and untouchability, which is based on birth. Thus, if the erstwhile first citizen of India faces such humiliation, what will be the plight of the last man who is a Dalit? As one of the world’s largest socio-economically oppressed, culturally subjugated and politically marginalized group of people, the 138 million Dalits in India suffer not only from the excesses of the traditional oppressor castes, but also from State Oppression— which includes, but is not limited to, authoritarianism, police brutality, economic embargo, criminalization of activists, electoral violence, repressive laws that aim to curb fundamental rights, and the non-implementation of laws that safeguard Dalit rights. The Dalits were considered untouchable for thousands of years by the Hindu society until the Constitution of India...

Description Details
Florentin Smarandache, an American mathematician of Romanian descent has generated a vast variety of mathematical problems. Some problems are easy, others medium, but many are interesting or unsolved and this is the reason why the present book appears. Here, of course, there are problems from various types. Solving these problems is addictive like eating pumpkin seed: having once started, one cannot help doing it over and over again....

Table of Contents Details
Preface 5 Definitions, Problems, Theorems 7 References 76

Description Details
This work covers a substantial mosaic of related concepts in utility theory as applied to financial decision-making. It reviews some of the classical notions of Benthamite utility and the normative utility paradigm offered by the von Neumann-Morgenstern expected utility theory; exploring its major pitfalls before moving into what is postulated as an entropic notion of utility. Extrinsic utility is proposed as a cardinally measurable quantity; measurable in terms of the expected information content of a set of alternative choices. The entropic notion of utility is subsequently used to model the financial behavior of individual investors based on their governing risk-return preferences involving financial structured products manufactured out of complex, multi-asset options. Evolutionary superiority of the Black-Scholes function in dynamic hedging scenarios is computationally demonstrated using a haploid genetic algorithm model programmed in Borland C. The work explores, both theoretically and computationally, the psycho-cognitive factors governing the financial behavior of individual investors both in the presence as well as absence o...

Description Details
Cyclopedia of issues in economics analyzed through the prism of the economies of countries in transition, emerging markets, and developing countries.

Description Details
Critical analysis of the foundations and tenets of capitalism and of the dismal science - economics.

Description Details
This book contains 23 papers, most of which were written by participants to the fifth International Conference on Number Theory and Smarandache Notions held in Shangluo University, China, in March, 2009. In this Conference, several professors gave a talk on Smarandache Notions and many participants lectured on them both extensively and intensively. All these papers are original and have been refereed. The themes of these papers range from the mean value or hybrid mean value of Smarandache type functions, the mean value of some famous number theroretic functions acting on the Smarandache sequences, to the convergence property of some infinite series involving the Smarandache type sequences. ...

Excerpt Details
3. Remarks Sandor [2] has considered the problem of finding the S-perfect and completely S-perfect numbers, but his proof is not complete. He has proved that the only S-perfect of the form n = p q is n = 6 and there is no S-perfect number of the form n = 2kq where k ¸ 2 is an integer and q is an odd prime. On the other hand, Theorem 2.1 gives all the S-perfect numbers. Again, Sandor only proved that, the only completely S-perfect number of the form n = p2q is n = 28, and all completely S-perfect numbers are given by Theorem 2.2. Theorem 2.1 and Theorem 2.2 ¯nd respectively the S-perfect and completely S-perfect numbers when S(1) = 1. The situation is quite different if one adopts the convention that S(0) = 1. In the latter case, as has been proved by Gronas [3], all completely S-perfect numbers are n = p(prime), 9, 16, 24. All that is known about the S-perfect numbers is that, among the ¯rst 106 numbers, n = 12 is the only S-perfect number (see Ashbacher [4]). In exactly the same way, the Z-perfect and completely Z-perfect numbers may be defined. Thus, given an integer n, 1. ...

Table of Contents Details
J. Wang : An equation related to the Smarandache power function 1 X. Lu and J. Hu : On the F.Smarandache 3n-digital sequence 5 B. Cheng : An equation involving the Smarandache double factorial function and Euler function 8 A. A. K. Majumdar : S-perfect and completely S-perfect numbers 12 B. Zhao and S. Wang: Cyclic dualizing elements in Girard quantales 21 P. Chun and Y. Zhao : On an equation involving the Smarandache function and the Dirichlet divisor function 27 F. Li and Y. Wang : An equation involving the Euler function and the Smarandache m-th power residues function 31 H. Gunarto and A. Majumdar : On numerical values of Z(n) 34 K. Nagarajan, etc.: M-graphoidal path covers of a graph 58 H. Liu : On the cubic Gauss sums and its fourth power mean 68 A. A. K. Majumdar : On the dual functions Z¤(n) and S¤(n) 74 S. S. Gupta : Smarandache sequence of Ulam numbers 78 L. Li : A new Smarandache multiplicative function and its arithmetical properties 83 Y. Yang and X. Kang : A predator-prey epidemic model with infected predator 86 R. Fu and H. Yang : An equation involving the Lucas numbers 90 W. Yang : Two rings in IS-a...

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