Non Associative Algebraic Structures Using Finite Complex Numbers,
2012
University of New Mexico
Non Associative Algebraic Structures Using Finite Complex Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Authors in this book for the first time have constructed nonassociative structures like groupoids, quasi loops, non associative semirings and rings using finite complex modulo integers. The Smarandache analogue is also carried out. We see the nonassociative complex modulo integers groupoids satisfy several special identities like Moufang identity, Bol identity, right alternative and left alternative identities. P-complex modulo integer groupoids and idempotent complex modulo integer groupoids are introduced and characterized. This book has six chapters. The first one is introductory in nature. Second chapter introduces complex modulo integer groupoids and complex modulo integer loops.
Quasi Set Topological Vector Subspaces,
2012
University of New Mexico
Quasi Set Topological Vector Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors introduce four types of topological vector subspaces. All topological vector subspaces are defined depending on a set. We define a quasi set topological vector subspace of a vector space depending on the subset S contained in the field F over which the vector space V is defined. These quasi set topological vector subspaces defined over a subset can be of finite or infinite dimension. An interesting feature about these spaces is that there can be several quasi set topological vector subspaces of a given vector space. This property helps one to construct several spaces with …
The Geometry Of Homological Triangles,
2012
University of New Mexico
The Geometry Of Homological Triangles, Florentin Smarandache, Ion Patrascu
Branch Mathematics and Statistics Faculty and Staff Publications
This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of triangles as a “filter” through which remarkable notions and theorems from the geometry of the triangle are unitarily passed. Our research is structured in seven chapters, the first four are dedicated to the homology of the triangles while the last ones to their applications. In the first chapter one proves the theorem of homological triangles (Desargues, 1636), one survey the remarkable pairs of homological …
Applications Of Extenics To 2d-Space And 3d-Space,
2012
University of New Mexico
Applications Of Extenics To 2d-Space And 3d-Space, Florentin Smarandache, Victor Vladareanu
Branch Mathematics and Statistics Faculty and Staff Publications
In this article one proposes several numerical examples for applying the extension set to 2D- and 3D-spaces. While rectangular and prism geometrical figures can easily be decomposed from 2D and 3D into 1D linear problems, similarly for the circle and the sphere, it is not possible in general to do the same for other geometrical figures.
Cardinal Functions And Integral Functions,
2012
University of New Mexico
Cardinal Functions And Integral Functions, Florentin Smarandache, Mircea Selariu, Marian Nitu
Branch Mathematics and Statistics Faculty and Staff Publications
This paper presents the correspondences of the eccentric mathematics of cardinal and integral functions and centric mathematics, or ordinary mathematics. Centric functions will also be presented in the introductory section, because they are, although widely used in undulatory physics, little known. In centric mathematics, cardinal sine and cosine are dened as well as the integrals. Both circular and hyperbolic ones. In eccentric mathematics, all these central functions multiplies from one to innity, due to the innity of possible choices where to place a point. This point is called eccenter S(s;") which lies in the plane of unit circle UC(O;R = …
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion,
2012
University of New Mexico
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.
Special Dual Like Numbers And Lattices,
2012
University of New Mexico
Special Dual Like Numbers And Lattices, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors introduce a new type of dual numbers called special dual like numbers. These numbers are constructed using idempotents in the place of nilpotents of order two as new element. That is x = a + bg is a special dual like number where a and b are reals and g is a new element such that g2 =g. The collection of special dual like numbers forms a ring. Further lattices are the rich structures which contributes to special dual like numbers. These special dual like numbers x = a + bg; when a and b …
Fuzzy Linguistic Topological Spaces,
2012
University of New Mexico
Fuzzy Linguistic Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Amal
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
Set Ideal Topological Spaces,
2012
University of New Mexico
Set Ideal Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors for the first time introduce a new type of topological spaces called the set ideal topological spaces using rings or semigroups, or used in the mutually exclusive sense. This type of topological spaces use the class of set ideals of a ring (semigroups). The rings or semigroups can be finite or infinite order. By this method we get complex modulo finite integer set ideal topological spaces using finite complex modulo integer rings or finite complex modulo integer semigroups. Also authors construct neutrosophic set ideal toplogical spaces of both finite and infinite order as well as …
Verifying Harder's Conjecture For Classical And Siegel Modular Forms,
2012
Bucknell University
Verifying Harder's Conjecture For Classical And Siegel Modular Forms, Davia Sulon
Honors Theses
A conjecture by Harder shows a surprising congruence between the coefficients of “classical” modular forms and the Hecke eigenvalues of corresponding Siegel modular forms, contigent upon “large primes” dividing the critical values of the given classical modular form.
Harder’s Conjecture has already been verified for one-dimensional spaces of classical and Siegel modular forms (along with some two-dimensional cases), and for primes p 37. We verify the conjecture for higher-dimensional spaces, and up to a comparable prime p.
Lagrange's Theory Of Analytical Functions And His Ideal Of Purity Of Method,
2011
Università del Molise
Lagrange's Theory Of Analytical Functions And His Ideal Of Purity Of Method, Giovanni Ferraro, Marco Panza
MPP Published Research
We reconstruct essential features of Lagrange’s theory of analytical functions by exhibiting its structure and basic assumptions, as well as its main shortcomings. We explain Lagrange’s notions of function and algebraic quantity, and we concentrate on power-series expansions, on the algorithm for derivative functions, and the remainder theorem—especially on the role this theorem has in solving geometric and mechanical problems. We thus aim to provide a better understanding of Enlightenment mathematics and to show that the foundations of mathematics did not, for Lagrange, concern the solidity of its ultimate bases, but rather purity of method—the generality and internal organization of …
A New Algorithm For Solving Shortest Path Problem On A Network With Imprecise Edge Weight,
2011
Thapar University
A New Algorithm For Solving Shortest Path Problem On A Network With Imprecise Edge Weight, Amit Kumar, Manjot Kumar
Applications and Applied Mathematics: An International Journal (AAM)
Nayeem and Pal (Shortest path problem on a network with imprecise edge weight, Fuzzy Optimization and Decision Making 4, 293-312, 2005) proposed a new algorithm for solving shortest path problem on a network with imprecise edge weight. In this paper the shortcomings of the existing algorithm, (Nayeem and Pal, 2005) are pointed out and to overcome these shortcomings a new algorithm is proposed. To show the advantages of the proposed algorithm over existing algorithm the numerical examples presented in (Nayeem and Pal, 2005) are solved using the proposed algorithm and obtained results are discussed.
Reliability Analysis Of A Series And Parallel Network Using Triangular Intuitionistic Fuzzy Sets,
2011
C.C.S. University
Reliability Analysis Of A Series And Parallel Network Using Triangular Intuitionistic Fuzzy Sets, D. Pandey, S. K. Tyagi, Vinesh Kumar
Applications and Applied Mathematics: An International Journal (AAM)
This paper describes a novel approach, based on intuitionistic fuzzy set theory for reliability analysis of series and parallel network. The triangular intuitionistic fuzzy sets are used to represent the failure possibility of each basic (terminal) event to get more comprehensive results for the failure possibility of the top event. The proposed technique is demonstrated on a web server LOG data used to illustrate HTTP (Hyper Text Transfer Protocol) failure
Exact Optimal Solution Of Fuzzy Critical Path Problems,
2011
Thapar University
Exact Optimal Solution Of Fuzzy Critical Path Problems, Amit Kumar, Parmpreet Kumar
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, a fuzzy critical path problem is chosen to show that the results, obtained by using the existing method [Liu, S.T.: Fuzzy activity times in critical path and project crashing problems. Cybernetics and Systems 34 (2), 161-172 (2003)], could be improved to reflect, more appropriate real life situations. To obtain more accurate results of fuzzy critical path problems, a new method that modifies the existing one is proposed here. To demonstrate the advantages of the proposed method it is used to solve a specific fuzzy critical path problem.
Relocatable Field Programmable Gate Array Bitstreams For Fault Tolerance,
2011
Air Force Institute of Technology
Relocatable Field Programmable Gate Array Bitstreams For Fault Tolerance, David P. Montminy, Rusty O. Baldwin, Paul D. Williams
AFIT Patents
A Field Programmable Gate Array (FPGA) circuit capable of operating through at least one fault. The FPGA circuit includes a configuration memory and an embedded microprocessor. The embedded microprocessor having access to the configuration memory, static modules, at least one relocatable module, and at least one spare module. The relocatable module being relocatable from a first target area to a second target area. The relocatable module being relocatable by manipulating a partial bitstream with the embedded microprocessor. The microprocessor calculating a plurality of bitstream changes, to relocate the at least one relocatable module using at least triple modular redundancy (TMR).
Modal Logic And Its Applications, Explained Using Puzzles And Examples,
2011
Portland State University
Modal Logic And Its Applications, Explained Using Puzzles And Examples, Marek Perkowski
Systems Science Friday Noon Seminar Series
The talk introduces Modal Logic as an extension of classical propositional and First Order Logics. We discuss motivations of Lewis to create modal logic system, axioms and rules of proof. Several examples illustrate deriving theorems from axioms. "Muddy Children" puzzle is used to explain the principles of dealing with uncertainty problems where a temporal lack of response is used as additional information. Other examples include "Narrow Bridge" problem/game which relates to the problem of necessary evil in the world, robot planning and law and robot morality problems, especially related to military robots and use of force by police. Kripke semantics …
Statistical Properties Of A Convoluted Beta-Weibull Distribution,
2011
Marshall University
Statistical Properties Of A Convoluted Beta-Weibull Distribution, Jianan Sun
Theses, Dissertations and Capstones
A new class of distributions recently developed involves the logit of the beta distribution. Among this class of distributions are the beta-normal (Eugene et.al. (2002)); beta-Gumbel (Nadarajah and Kotz (2004)); beta-exponential (Nadarajah and Kotz (2006)); beta-Weibull (Famoye et al. (2005)); beta-Rayleigh (Akinsete and Lowe (2008)); beta-Laplace (Kozubowski and Nadarajah (2008)); and beta-Pareto (Akinsete et al. (2008)), among a few others. Many useful statistical properties arising from these distributions and their applications to real life data have been discussed in the literature. One approach by which a new statistical distribution is generated is by the transformation of random variables having known …
Relation Liftings On Preorders And Posets,
2011
Academy of Sciences of the Czech Republic
Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Engineering Faculty Articles and Research
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.
Generic Trace Logics,
2011
University of Leicester
Generic Trace Logics, Christian Kissig, Alexander Kurz
Engineering Faculty Articles and Research
We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.
Towards Nominal Formal Languages,
2011
Chapman University
Towards Nominal Formal Languages, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
Engineering Faculty Articles and Research
We introduce formal languages over infinite alphabets where words may contain binders.We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
