Other Mathematics Commons^™

Neutrosophic Hough Transform, Florentin Smarandache, Umit Budak, Yanhui Guo, Abdulkadir Sengur

Branch Mathematics and Statistics Faculty and Staff Publications

Hough transform (HT) is a useful tool for both pattern recognition and image processing communities. In the view of pattern recognition, it can extract unique features for description of various shapes, such as lines, circles, ellipses, and etc. In the view of image processing, a dozen of applications can be handled with HT, such as lane detection for autonomous cars, blood cell detection in microscope images, and so on. As HT is a straight forward shape detector in a given image, its shape detection ability is low in noisy images. To alleviate its weakness on noisy images and improve its …

Neutrosophic N -Structures And Their Applications In Semigroups, Florentin Smarandache, Madad Khan, Saima Anis, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of neutrosophic N -structure is introduced, and applied it to semigroup. The notions of neutrosophic N -subsemigroup, neutrosophic N -product and ε-neutrosophic N -subsemigroup are introduced, and several properties are investigated. Conditions for neutrosophic N -structure to be neutrosophic N -subsemigroup are provided. Using neutrosophic N -product, characterization of neutrosophic N -subsemigroup is discussed. Relations between neutrosophic N -subsemigroup and εneutrosophic N -subsemigroup are discussed. We show that the homomorphic preimage of neutrosophic N -subsemigroup is a neutrosophic N - subsemigroup, and the onto homomorphic image of neutrosophic N - subsemigroup is a neutrosophic N -subsemigroup.

Neutrosophic Commutative N-Ideals In Bck-Algebras, Florentin Smarandache, Seok-Zun Song, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of a neutrosophic commutative N -ideal in BCK-algebras is introduced, and several properties are investigated. Relations between a neutrosophic N -ideal and a neutrosophic commutative N -ideal are discussed. Characterizations of a neutrosophic commutative N -ideal are considered.

Neutrosophic N -Structures Applied To Bck/Bci-Algebras, Florentin Smarandache, Young Bae Jun, Hashem Bordbar

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic N -structures with applications in BCK/BC I-algebras is discussed. The notions of a neutrosophic N -subalgebra and a (closed) neutrosophic N -ideal in a BCK/BC I-algebra are introduced, and several related properties are investigated. Characterizations of a neutrosophic N -subalgebra and a neutrosophic N -ideal are considered, and relations between a neutrosophic N -subalgebra and a neutrosophic N -ideal are stated. Conditions for a neutrosophic N -ideal to be a closed neutrosophic N -ideal are provided.

Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo

Branch Mathematics and Statistics Faculty and Staff Publications

k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for improving its precision. The neutrosophic set (NS) defines three memberships namely T, I and F. T, I, and F shows the truth membership degree, the false membership degree, and the indeterminacy membership degree, respectively. In this paper, the NS …

Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Complex Neutrosophic Soft Set, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mumtaz Ali, Ganeshsree Selvachandran

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we propose the complex neutrosophic soft set model, which is a hybrid of complex fuzzy sets, neutrosophic sets and soft sets. The basic set theoretic operations and some concepts related to the structure of this model are introduced, and illustrated. An example related to a decision making problem involving uncertain and subjective information is presented, to demonstrate the utility of this model.

Complex Neutrosophic Graphs Of Type 1, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we introduced a new neutrosophic graphs called complex neutrosophic graphs of type1 (CNG1) and presented a matrix representation for it and studied some properties of this new concept. The concept of CNG1 is an extension of generalized fuzzy graphs of type 1 (GFG1) and generalized single valued neutrosophic graphs of type 1 (GSVNG1).

Neutrosophy, A Sentiment Analysis Model, Florentin Smarandache, Mirela Teodorescu, Daniela Gifu

Branch Mathematics and Statistics Faculty and Staff Publications

This paper describes the importance of Neutrosophy Theory in order to find a method that could solve the uncertainties arising on discursive analysis. The aim of this pilot study is to find a procedure to diminish the uncertainties from public discourse induced, especially, by humans (politicians, journalists, etc.). We consider that Neutrosophy Theory is a sentiment analysis specific case regarding processing of the three states: positive, negative, and neutral. The study is intended to identify a method to answer to uncertainties solving in order to support politician's staff, NLP specialists, artificial intelligence researchers and generally the electors.

Mcdm Method For N-Wise Criteria Comparisons And Inconsistent Problems, Florentin Smarandache, Azeddine Elhassouny

Branch Mathematics and Statistics Faculty and Staff Publications

The purpose of this paper is to present an e[xtension and alternative of the hybrid method based on Saaty’s Analytical Hierarchy Process and Technique for Order Preference by Similarity to Ideal Solution method (AHP-TOPSIS), that based on the AHP and its use of pairwise comparisons, to a new method called α -D MCDM-TOPSIS( α -Discounting Method for multicriteria decision making-TOPSIS). The new method overcomes limits of AHP which work only for pairwise comparisons of criteria to any-wise (n-wise) comparisons, with crisp coefficients or with interval-valued coefficients. α-D MCDM-TOPSIS is verified by some examples to demonstrate how it allows for consistency, …

On Benacerraf’S Dilemma, Again, Marco Panza

MPP Published Research

In spite of its enormous influence, Benacerraf’s dilemma admits no standard unanimously accepted formulation. This mainly depends on Benacerraf’s having originally presented it in a quite colloquial way, by avoiding any compact, somehow codified, but purportedly comprehensive formulation (Benacerraf 1973 cf. p. 29).

Sudoku Variants On The Torus, Kira A. Wyld

HMC Senior Theses

This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.

Quasivarieties And Varieties Of Ordered Algebras: Regularity And Exactness, Alexander Kurz

Engineering Faculty Articles and Research

We characterise quasivarieties and varieties of ordered algebras categorically in terms of regularity, exactness and the existence of a suitable generator. The notions of regularity and exactness need to be understood in the sense of category theory enriched over posets.

We also prove that finitary varieties of ordered algebras are cocompletions of their theories under sifted colimits (again, in the enriched sense).

Features Of Agent-Based Models, Reiko Heckel, Alexander Kurz, Edmund Chattoe-Brown

Engineering Faculty Articles and Research

The design of agent-based models (ABMs) is often ad-hoc when it comes to defining their scope. In order for the inclusion of features such as network structure, location, or dynamic change to be justified, their role in a model should be systematically analysed. We propose a mechanism to compare and assess the impact of such features. In particular we are using techniques from software engineering and semantics to support the development and assessment of ABMs, such as graph transformations as semantic representations for agent-based models, feature diagrams to identify ingredients under consideration, and extension relations between graph transformation systems to …

Foreword: Special Issue On Coalgebraic Logic, Alexander Kurz

Engineering Faculty Articles and Research

The second Dagstuhl seminar on coalgebraic logics took place from October 7-12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009. From the 44 researchers who attended and the 30 talks presented, this collection highlights some of the progress that has been made in the field. We are grateful to Giuseppe Longo and his interest in a special issue in Mathematical Structures in Computer Science.

The Positivication Of Coalgebraic Logics, Fredrik Dahlqvist, Alexander Kurz

Engineering Faculty Articles and Research

We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically computing a endofunctor T': Pos->Pos from an endofunctor T: Set->Set, in a procedure previously defined by the second author et alii called posetification. On the syntax side, it involves canonically computing a syntax-building functor L': DL->DL from a syntax-building functor L: BA->BA, in a dual procedure which we call positivication. These operations are interesting in their own right and we explicitly compute posetifications and positivications in the case …

Platonismes, Marco Panza

MPP Published Research

Selon la vulgata philosophique, le platonisme concernant un certain domaine de recherche est la thèse affirmant que ce domaine concerne des objets qui lui sont propres, dont l’existence est indépendante de l’activité cognitive humaine. Souvent, dans la même vulgata on parle aussi de platonisme pour se référer à une thèse un peu différente, d’après laquelle ce qu’on dit concernant ce domaine est vrai ou faux indépendamment de toute justification ou réfutation que l’on puisse apporter. Naturellement, si parmi les énoncées ayant trait à ce demain, il y en a qu’on peut prendre comme particulièrement surs du fait d’en avoir une …

Complex Valued Graphs For Soft Computing, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce in a systematic way the notion of complex valued graphs, strong complex valued graphs and complex neutrosophic valued graphs. Several interesting properties are defined, described and developed. Most of the conjectures which are open in case of usual graphs continue to be open problems in case of both complex valued graphs and strong complex valued graphs. We also give some applications of them in soft computing and social networks. At this juncture it is pertinent to keep on record that Dr. Tohru Nitta was the pioneer to use complex valued graphs …

A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mohsin Khan

Branch Mathematics and Statistics Faculty and Staff Publications

In this research paper, the graph of the bipolar single-valued neutrosophic set model (BSVNS) is proposed. The graphs of single valued neutrosophic set models is generalized by this graph. For the BSVNS model, several results have been proved on complete and isolated graphs. Adding, an important and suitable condition for the graphs of the BSVNS model to become an isolated graph of the BSVNS model has been demonstrated.

Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, motivated by the notion of generalized single valued neutrosophic graphs of first type, we defined a new neutrosophic graphs named generalized interval valued neutrosophic graphs of first type (GIVNG1) and presented a matrix representation for it and studied few properties of this new concept. The concept of GIVNG1 is an extension of generalized fuzzy graphs (GFG1) and generalized single valued neutrosophic of first type (GSVNG1).

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.

Curiozităţi Ale Funcţiilor Supermatematice, Florentin Smarandache, Mircea Eugen Selariu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

The Use Of The Pivot Pairwise Relative Criteria Importance Assessment Method For Determining The Weights Of Criteria, Florentin Smarandache, Dragisa Stanujkic, Edmundas Kazimieras Zavadskas, Darjan Karabasevic, Zenonas Turskis

Branch Mathematics and Statistics Faculty and Staff Publications

The weights of evaluation criteria could have a significant impact on the results obtained by applying multiple criteria decision-making methods. Therefore, the two extensions of the SWARA method that can be used in cases when it is not easy, or even is impossible to reach a consensus on the expected importance of the evaluation criteria are proposed in this paper. The primary objective of the proposed extensions is to provide an understandable and easy-to-use approach to the collecting of respondents’ real attitudes towards the significance of evaluation criteria and to also provide an approach to the checking of the reliability …