Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- 62-07 (1)
- 62-09 (1)
- 68-04 (1)
- Binary (1)
- Boolean algebra (1)
-
- Coalgebraic logic (1)
- Coalgebras (1)
- DPSO (1)
- Data analysis (1)
- Decision diagram (1)
- Digits (1)
- Discrete Swarm Particle Optimization (1)
- Distributive lattice (1)
- Enriched category theory (1)
- Exact Pos-category (1)
- Explicit machine computation and programs (1)
- Graph (1)
- Graphical methods (1)
- Image segmentation; neutrosophic set; graph cut; indeterminate filtering (1)
- Integer factorization (1)
- Library Acqusitions (1)
- Library Budgets (1)
- Monotone modal logic (1)
- Ordered algebra (1)
- Polynomials (1)
- Positive modal logic (1)
- Quasivariety (1)
- Regular Pos-category (1)
- Scout Particles (1)
- Triangular fuzzy neutrosophic sets; score function; Shortest path problem (1)
- Publication
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Other Mathematics
An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut, Florentin Smarandache, Yanhui Guo, Yaman Akbulut, Abdulkadir Sengur, Rong Xia
An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut, Florentin Smarandache, Yanhui Guo, Yaman Akbulut, Abdulkadir Sengur, Rong Xia
Branch Mathematics and Statistics Faculty and Staff Publications
Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC). An image is presented in neutrosophic set, and an indeterminacy filter is constructed using the indeterminacy value of the input image, which is defined by combining the spatial information and intensity information. The indeterminacy filter reduces the indeterminacy of the spatial and intensity information. A graph is defined on the image and the weight for …
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log2(α)3 + 16.5log2(α)2 + …
Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu
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.
The Document Similarity Network: A Novel Technique For Visualizing Relationships In Text Corpora, Dylan Baker
The Document Similarity Network: A Novel Technique For Visualizing Relationships In Text Corpora, Dylan Baker
HMC Senior Theses
With the abundance of written information available online, it is useful to be able to automatically synthesize and extract meaningful information from text corpora. We present a unique method for visualizing relationships between documents in a text corpus. By using Latent Dirichlet Allocation to extract topics from the corpus, we create a graph whose nodes represent individual documents and whose edge weights indicate the distance between topic distributions in documents. These edge lengths are then scaled using multidimensional scaling techniques, such that more similar documents are clustered together. Applying this method to several datasets, we demonstrate that these graphs are …
A Novel Approach For Library Materials Acquisition Using Discrete Particle Swarm Optimization, Daniel A. Sabol
A Novel Approach For Library Materials Acquisition Using Discrete Particle Swarm Optimization, Daniel A. Sabol
Publications and Research
The academic library materials acquisition problem is a challenge for librarian, since library cannot get enough funding from universities and the price of materials inflates greatly. In this paper, we analyze an integer mathematical model by considering the selection of acquired materials to maximize the average preference value as well as the budget execution rate under practical restrictions. The objective is to improve the Discrete Particle Swarm Optimization (DPSO) algorithm by adding a Simulate Annealing algorithm to reduce premature convergence. Furthermore, the algorithm is implemented in multiple threaded environment. The experimental results show the efficiency of this approach.
Quasivarieties And Varieties Of Ordered Algebras: Regularity And Exactness, Alexander Kurz
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
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
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
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 …