Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (3)
- Other Mathematics (3)
- Aerospace Engineering (2)
- Applied Mathematics (2)
- Aviation (2)
-
- Logic and Foundations (2)
- Computer Engineering (1)
- Digital Communications and Networking (1)
- Number Theory (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Other Applied Mathematics (1)
- Other Computer Engineering (1)
- Other Engineering (1)
- Other Physical Sciences and Mathematics (1)
- Special Functions (1)
- Systems Engineering (1)
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Set Theory
The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates
The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates
Undergraduate Theses and Capstone Projects
We study graph colorings of the form made popular by the four-color theorem. Proved by Appel and Haken in 1976, the Four-Color Theorem states that all planar graphs can be vertex-colored with at most four colors. We consider an alternate way to prove the Four-Color Theorem, introduced by Hadwiger in 1943 and commonly know as Hadwiger’s Conjecture. In addition, we examine the chromatic number of graphs which are not planar. More specifically, we explore adding edges to a planar graph to create a non-planar graph which has the same chromatic number as the planar graph which we started from.
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …
Towards A Formal Theory Of Interoperability, Saikou Y. Diallo
Towards A Formal Theory Of Interoperability, Saikou Y. Diallo
Computational Modeling & Simulation Engineering Theses & Dissertations
This dissertation proposes a formal theory of interoperability that explains 1) what interoperability is as opposed to how it works, 2) how to tell whether two or more systems can interoperate and 3) how to identify whether systems are interoperating or merely exchanging bits and bytes. The research provides a formal model of data in M&S that captures all possible representations of a real or imagined thing and distinguishes between existential dependencies and transformational dependencies. Existential dependencies capture the relationships within a model while transformational dependencies capture the relationships between interactions with a model. These definitions are used to formally …
Fusion Of Sources Of Evidence With Different Importances And Reliabilities, Florentin Smarandache, Jean Dezert, J.M. Tacnet
Fusion Of Sources Of Evidence With Different Importances And Reliabilities, Florentin Smarandache, Jean Dezert, J.M. Tacnet
Branch Mathematics and Statistics Faculty and Staff Publications
This paper presents a new approach for combining sources of evidences with different importances and reliabilities. Usually, the combination of sources of evidences with different reliabilities is done by the classical Shafer’s discounting approach. Therefore, to consider unequal importances of sources, if any, a similar reliability discounting process is generally used, making no difference between the notion of importance and reliability. In fact, in multicriteria decision context, these notions should be clearly distinguished. This paper shows how this can be done and we provide simple examples to show the differences between both solutions for managing importances and reliabilities of sources. …
Single Valued Neutrosophic Sets, Haibin Wang, Florentin Smarandache, Yanqing Zhang, Rajshekhar Sunderraman
Single Valued Neutrosophic Sets, Haibin Wang, Florentin Smarandache, Yanqing Zhang, Rajshekhar Sunderraman
Branch Mathematics and Statistics Faculty and Staff Publications
Neutrosophic set is a part of neutrosophy which studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. Neutrosophic set is a powerful general formal framework that has been recently proposed. However, neutrosophic set needs to be specified from a technical point of view. To this effect, we define the settheoretic operators on an instance of neutrosophic set, we call it single valued neutrosophic set (SVNS). We provide various properties of SVNS, which are connected to the operations and relations over SVNS.