{"title":"A Novel Weighted Hierarchical Adaptive Voting Ensemble Machine Learning Method for Breast Cancer Detection","authors":"Clemen Deng, M. Perkowski","doi":"10.1109/ISMVL.2015.27","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.27","url":null,"abstract":"A novel Weighted Hierarchical Adaptive Voting Ensemble (WHAVE) machine learning (ML) method was developed for breast cancer detection. It was constructed using three individual ML methods based on Multiple-Valued Logic: Disjunctive Normal Form (DNF) rule based method, Decision Trees, Naïve Bays, and one method based on continuous representation: Support Vector Machines (SVM). Results were compared with other methods and show that the WHAVE method accuracy was noticeably higher than the individual ML methods tested. This paper demonstrates that the WHAVE method proposed outperforms all methods researched, and shows the advantage of using WHAVE method for ML in breast cancer detection.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127724658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Miguel Couceiro, L. Haddad, M. Pouzet, Karsten Schölzel
{"title":"Hereditarily Rigid Relations: Dedicated to Professor I.G. Rosenberg on the Occasion of His 80-th Birthday","authors":"Miguel Couceiro, L. Haddad, M. Pouzet, Karsten Schölzel","doi":"10.1109/ISMVL.2015.34","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.34","url":null,"abstract":"An h-ary relation ρ on a finite set A is said to be hereditarily rigid if the unary partial functions on A that preserve ρ are the subfunctions of the identity map or of constant maps. A family of relations F is said to be hereditarily strongly rigid if the partial functions on A that preserve every ρ ∈ F are the subfunctions of projections or constant functions. In this paper we show that hereditarily rigid relations exist and we give a lower bound on their arities. We also prove that no finite hereditarily strongly rigid families of relations exist and we also construct an infinite hereditarily strongly rigid family of relations.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127783857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Clones of Pivotally Decomposable Functions","authors":"Miguel Couceiro, B. Teheux","doi":"10.1109/ISMVL.2015.9","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.9","url":null,"abstract":"This paper is a contribution to the understanding of the relation between pivotal decompositions of operations on a set and clones on the same set. In this preliminary study we establish sufficient conditions on a pivotal operation II so that the corresponding class of II decomposable operations constitutes a clone, and discuss the normal form representations that such pivotal operations induce. We also outline several open questions, providing directions for further research.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122199227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lazy Clones and Essentially Minimal Groupoids","authors":"Hajime Machida, Tamás Waldhauser","doi":"10.1109/ISMVL.2015.11","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.11","url":null,"abstract":"We determine idempotent lazy operations and binary lazy operations, and apply the latter to characterize groupies with an essentially minimal clone of a certain type.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132897862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cut-Down Operations on Bilattices","authors":"T. M. Ferguson","doi":"10.1109/ISMVL.2015.14","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.14","url":null,"abstract":"In this paper, Melvin Fitting's notion of a \"cut-down\" operation on a bilattice is considered. It is shown that the logic of cut-down operations on bilattices is equivalent to Harry Deutsch's four-valued Sfde, demonstrating that Sfde is as intimately connected to the theory of bilattices as is the Dunn-Belnap logic Efde. The paper concludes by observing that the \"not ¬\" operation of Carlos Damásio and Luís Pereira serves as a cut-down in Fitting's sense and that the logic of Damásio-Pereira cut-down operations on the bilattice NINE is equivalent to Richard Angell's AC.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130298344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Efficient Reduction of Common Control Lines for Reversible Circuit Optimization","authors":"Arighna Deb, R. Wille, R. Drechsler, D. K. Das","doi":"10.1109/ISMVL.2015.26","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.26","url":null,"abstract":"New prospects in several emerging technologies such as quantum computation and certain aspects of low-power design motivated an intensive consideration of the design of reversible circuits. Since most of the existing synthesis approaches usually generate circuits of high costs, post-synthesis optimization is frequently applied. Here, the reduction of control line connections is a major focus as they are a main reason for high quantum costs in the respective reversible circuits. Previous approaches aimed for exploiting so-called common control lines for this purpose. However, while these solutions indeed lead to substantial improvements in the costs, they inherit some drawbacks and restrictions. In this work, we propose an alternative approach for the reduction of common control lines in reversible circuits, which (1) is based in the concepts of previously proposed solutions, but (2) combines them in a new fashion. This enables us to achieve the same or even better improvements, while - at the same time - overcome their drawbacks. Experimental evaluations confirm these benefits, i.e. significant improvements compared to the previous methods can often be achieved without the need to deal with their drawbacks.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129839306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"System for Automatic Generation of Parallel Multipliers over Galois Fields","authors":"Yukihiro Sugawara, Rei Ueno, N. Homma, T. Aoki","doi":"10.1109/ISMVL.2015.15","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.15","url":null,"abstract":"This paper presents a system for the automatic generation of Galois-field (GF) arithmetic circuits, named the GF Arithmetic Module Generator (GF-AMG). The proposed system employs a graph-based circuit description called the GF Arithmetic Circuit Graph (GF-ACG). First, we present an extension of the GF-ACG to handle GF(pm) (p ≥ 3) arithmetic circuits, which can be efficiently implemented by multiple-valued logic circuits in addition to the conventional binary circuits. We then show the validity of the generation system through the experimental design of GF(3m) multipliers for a ternary logic circuit. In addition, we evaluate the performance of typical GF(2m) multipliers empirically generated by our system. We confirm from the results that the proposed system can generate a variety of GF parallel multipliers, including practical multipliers over GF(2m) and GF(3m) having degrees greater than 128.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133112816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design of a Compact Ternary Parallel Adder/Subtractor Circuit in Quantum Computing","authors":"N. J. Lisa, H. Babu","doi":"10.1109/ISMVL.2015.23","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.23","url":null,"abstract":"In this paper, we present an optimized design for the quantum ternary adder/subtract or circuit. We propose the design of quantum Ternary Peres Gate (TPG). The design of our proposed quantum ternary adder/subtract or circuit consists of two parts: a) Firstly, it has the design of a quantum ternary full-adder circuit using the proposed TPG gates, and b) Secondly, it designs the proposed adder/subtract or circuit by using the constructed full-adder in a) and M-S gates. We also propose a heuristic to design a compact ternary adder/subtract or circuit. Our circuits perform much better than the existing ones.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Standard Completeness for Uninorm-Based Logics","authors":"P. Baldi, A. Ciabattoni","doi":"10.1109/ISMVL.2015.20","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.20","url":null,"abstract":"We provide a uniform proof of standard completeness for a large class of axiomatic extensions of Uniform Logic.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116389049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some Classes of Centralizing Monoids on a Three-Element Set","authors":"M. Goldstern, Hajime Machida, I. Rosenberg","doi":"10.1109/ISMVL.2015.29","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.29","url":null,"abstract":"Commutation is defined for multi-variable functions on a non-empty set A. A centralizing mooned M is a set of unary functions which commute with all members of some set F of multi-variable functions. In such a case, we call F a witness of M. In this paper, we consider the case where A is a three-element set and determine all centralizing monodies which have ternary majority functions or ternary semi projections as their witnesses.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127448450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}