Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00025
Shinobu Nagayama, Tsutomu Sasao, J. T. Butler
Symmetric multiple-valued functions are a basic class of multiple-valued functions such that function values are unchanged by any permutation of input variable labels. They appear in various situations such as arithmetic operations. A compact representation of symmetric multiple-valued functions benefits many applications. To represent symmetric multiple-valued functions compactly, this paper focuses on functional decomposition and decision diagrams. We propose a method that decomposes a symmetric multiple-valued function into three parts, and represents the three parts using suitable decision diagrams. This paper also derives theorems on sizes of the decision diagrams. Experimental results using randomly generated symmetric multiple-valued functions show the effectiveness of the proposed method.
{"title":"Decomposition-Based Representation of Symmetric Multiple-Valued Functions","authors":"Shinobu Nagayama, Tsutomu Sasao, J. T. Butler","doi":"10.1109/ISMVL57333.2023.00025","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00025","url":null,"abstract":"Symmetric multiple-valued functions are a basic class of multiple-valued functions such that function values are unchanged by any permutation of input variable labels. They appear in various situations such as arithmetic operations. A compact representation of symmetric multiple-valued functions benefits many applications. To represent symmetric multiple-valued functions compactly, this paper focuses on functional decomposition and decision diagrams. We propose a method that decomposes a symmetric multiple-valued function into three parts, and represents the three parts using suitable decision diagrams. This paper also derives theorems on sizes of the decision diagrams. Experimental results using randomly generated symmetric multiple-valued functions show the effectiveness of the proposed method.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308568","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00037
David Clarino, Shohei Kuroda, S. Yamashita
Toffoli gates are an important primitive in reversible Boolean logic. In quantum computation, these Toffoli gates are composed using other elementary gates, most notably the Clifford+T basis. However, in fault-tolerant implementations of quantum circuits, a non-transversal gate like the T gate incurs extra cost relative to transversal gates like the S and CNOT gates. Relative-phase Toffoli Gates (RTOF) have been proposed as a way to minimize this "T-depth" at the cost of incurring a relative phase that could skew the final quantum states. While previous research has proposed a way to use transversal S gates to eliminate this relative phase, this paper proposes a novel form of the RTOF that incorporates S gates in order to simplify generation of the logic to return the phase
{"title":"Using S Gates and Relative Phase Toffoli Gates to Improve T-Count in Quantum Boolean Circuits","authors":"David Clarino, Shohei Kuroda, S. Yamashita","doi":"10.1109/ISMVL57333.2023.00037","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00037","url":null,"abstract":"Toffoli gates are an important primitive in reversible Boolean logic. In quantum computation, these Toffoli gates are composed using other elementary gates, most notably the Clifford+T basis. However, in fault-tolerant implementations of quantum circuits, a non-transversal gate like the T gate incurs extra cost relative to transversal gates like the S and CNOT gates. Relative-phase Toffoli Gates (RTOF) have been proposed as a way to minimize this \"T-depth\" at the cost of incurring a relative phase that could skew the final quantum states. While previous research has proposed a way to use transversal S gates to eliminate this relative phase, this paper proposes a novel form of the RTOF that incorporates S gates in order to simplify generation of the logic to return the phase","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794733","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00028
Y. Yuminaka, Kazuharu Nakajima, Yosuke Iijima
Based on four-level pulse-amplitude modulation (PAM-4) symbol transition, this study investigated a two-dimensional (2D) symbol mapping technique that evaluates the quality of transmission data to set equalizer parameters adaptively. The 2D symbol transition mapping enables visualization of the degree of intersymbol interference (ISI). The simulation results demonstrate that the 2D symbol mapping can evaluate the PAM-4 data transmission quality degraded by ISI and can visualize the effect of equalization. The applications of 2D mapping and the extension of 2D mapping to 3D mapping are also discussed.
{"title":"PAM-4 Data Transmission Quality Evaluation Using Two- and Three-Dimensional Mapping of Received Symbols","authors":"Y. Yuminaka, Kazuharu Nakajima, Yosuke Iijima","doi":"10.1109/ISMVL57333.2023.00028","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00028","url":null,"abstract":"Based on four-level pulse-amplitude modulation (PAM-4) symbol transition, this study investigated a two-dimensional (2D) symbol mapping technique that evaluates the quality of transmission data to set equalizer parameters adaptively. The 2D symbol transition mapping enables visualization of the degree of intersymbol interference (ISI). The simulation results demonstrate that the 2D symbol mapping can evaluate the PAM-4 data transmission quality degraded by ISI and can visualize the effect of equalization. The applications of 2D mapping and the extension of 2D mapping to 3D mapping are also discussed.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130877339","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00014
Tsutomu Sasao
This paper shows that sum-of-product expression (SOP) minimization produces the generalization ability. We show this in three steps. First, various classes SOPs are generated. Second, minterms of SOP are randomly selected to generate partially defined functions. And, third, from the partially defined functions, original functions are reconstructed by SOP minimization. We consider Achilles heel functions, majority functions, monotone increasing cascade functions, functions generated from random SOPs, and monotone increasing random SOPs. As for generalization ability, the presented method is compared with Naive Bayes, multi-level perceptron, support vector machine, JRIP, J48, and random forest.
{"title":"Easily Reconstructable Logic Functions","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL57333.2023.00014","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00014","url":null,"abstract":"This paper shows that sum-of-product expression (SOP) minimization produces the generalization ability. We show this in three steps. First, various classes SOPs are generated. Second, minterms of SOP are randomly selected to generate partially defined functions. And, third, from the partially defined functions, original functions are reconstructed by SOP minimization. We consider Achilles heel functions, majority functions, monotone increasing cascade functions, functions generated from random SOPs, and monotone increasing random SOPs. As for generalization ability, the presented method is compared with Naive Bayes, multi-level perceptron, support vector machine, JRIP, J48, and random forest.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130215356","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00048
C. Fermüller
Classical judgment aggregation has produced several well-known impossibility results that extend to a variety of logics, including many-valued logics. In this paper, we aim to complement these negative results by providing some positive ones, which we develop in response to an analysis of the discursive dilemma. Specifically, we investigate the use of the averaging operator, which is arguably the most natural operator in a many-valued setting, to generate consistent aggregated judgments in either Kleene-Zadeh or Łukasiewicz logic. Our results show that under certain conditions, the averaging operator can yield consistent aggregated judgments for specific types of agendas and judgment profiles.
{"title":"Some Consistency Criteria for Many-Valued Judgment Aggregation","authors":"C. Fermüller","doi":"10.1109/ISMVL57333.2023.00048","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00048","url":null,"abstract":"Classical judgment aggregation has produced several well-known impossibility results that extend to a variety of logics, including many-valued logics. In this paper, we aim to complement these negative results by providing some positive ones, which we develop in response to an analysis of the discursive dilemma. Specifically, we investigate the use of the averaging operator, which is arguably the most natural operator in a many-valued setting, to generate consistent aggregated judgments in either Kleene-Zadeh or Łukasiewicz logic. Our results show that under certain conditions, the averaging operator can yield consistent aggregated judgments for specific types of agendas and judgment profiles.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129303300","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}
Baseball elbow is a kinetic disorder of the elbow caused by repetitive pitching in baseball. Osteochondritis dissecans (OCD), one of the most common forms of baseball elbow, is a disorder of the humeral capitellum of the elbow, and early detection of OCD is important. This study aims to create a model to detect OCD from ultrasound images of the elbow. The model is based on VGG16. The proposed method was validated by using 67 OCD subjects and 91 normal subjects. The results showed that the model achieved an accuracy of 88.5%, a precision of 87.9%, a recall of 97.0%, an F1 score of 0.910, and an AUC of 0.971.
{"title":"Detection of osteochondritis dissecans using convolutional neural networks for computer-aided diagnosis of baseball elbow","authors":"Kenta Sasaki, Daisuke Fujita, Kenta Takatsuji, Yoshihiro Kotoura, Tsuyoshi Sukenari, M. Minami, Yusuke Kobayashi, Yoshikazu Kida, Kenji Takahashi, Syoji Kobashi","doi":"10.1109/ISMVL57333.2023.00022","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00022","url":null,"abstract":"Baseball elbow is a kinetic disorder of the elbow caused by repetitive pitching in baseball. Osteochondritis dissecans (OCD), one of the most common forms of baseball elbow, is a disorder of the humeral capitellum of the elbow, and early detection of OCD is important. This study aims to create a model to detect OCD from ultrasound images of the elbow. The model is based on VGG16. The proposed method was validated by using 67 OCD subjects and 91 normal subjects. The results showed that the model achieved an accuracy of 88.5%, a precision of 87.9%, a recall of 97.0%, an F1 score of 0.910, and an AUC of 0.971.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121630328","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00016
N. Kamide
In this study, new natural deduction systems for intuitionistic, classical, and Gurevich logics are introduced using the new rules of explosion and excluded middle, which correspond to the principle of explosion and the law of excluded middle, respectively. Gurevich logic is an extended three-valued logic obtained from intuitionistic logic by adding strong negation. Theorems for equivalence between these natural deduction systems and the corresponding previously proposed sequent calculi for the logics are proved. Normalization theorems for the proposed natural deduction systems for intuitionistic and Gurevich logics are proved as well.
{"title":"Natural Deduction with Explosion and Excluded Middle","authors":"N. Kamide","doi":"10.1109/ISMVL57333.2023.00016","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00016","url":null,"abstract":"In this study, new natural deduction systems for intuitionistic, classical, and Gurevich logics are introduced using the new rules of explosion and excluded middle, which correspond to the principle of explosion and the law of excluded middle, respectively. Gurevich logic is an extended three-valued logic obtained from intuitionistic logic by adding strong negation. Theorems for equivalence between these natural deduction systems and the corresponding previously proposed sequent calculi for the logics are proved. Normalization theorems for the proposed natural deduction systems for intuitionistic and Gurevich logics are proved as well.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128348946","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00021
Sefatul Wasi, S. Alam, Rashedur M. Rahman, M. A. Amin, Syoji Kobashi
Kidney tumor is a health concern that affects kidney cells and may leads to mortality depending on their type. Benign tumors can be unproblematic whereas malignant tumors pose the threat of kidney cancer. Early detection and diagnosis are possible through kidney tumor recognition based on deep learning techniques. In this paper, a method based on transfer learning using deep convolutional neural network (DCNN) is proposed to recognize kidney tumor from computed tomography (CT) images. The proposed method was evaluated on 5284 images. The final accuracy, precision, recall, specificity and F1 score were 92.54%, 80.45%, 93.02%, 92.38% and 0.8628, respectively.
{"title":"Kidney Tumor Recognition from Abdominal CT Images using Transfer Learning","authors":"Sefatul Wasi, S. Alam, Rashedur M. Rahman, M. A. Amin, Syoji Kobashi","doi":"10.1109/ISMVL57333.2023.00021","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00021","url":null,"abstract":"Kidney tumor is a health concern that affects kidney cells and may leads to mortality depending on their type. Benign tumors can be unproblematic whereas malignant tumors pose the threat of kidney cancer. Early detection and diagnosis are possible through kidney tumor recognition based on deep learning techniques. In this paper, a method based on transfer learning using deep convolutional neural network (DCNN) is proposed to recognize kidney tumor from computed tomography (CT) images. The proposed method was evaluated on 5284 images. The final accuracy, precision, recall, specificity and F1 score were 92.54%, 80.45%, 93.02%, 92.38% and 0.8628, respectively.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123301370","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}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00038
T. Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Y. Nishitani
We present a time-efficient lower bound $tilde sigma $ on the number of gates in Toffoli-based reversible circuits that represent a given reversible logic function. For the characteristic vector s of a reversible logic function, the value of $tilde sigma ({mathbf{s}})$ is almost the same as σ-lb (s), which is known as a relatively-efficient lower bound in terms of the evaluation time and the tightness. By slightly sacrificing the tightness of the lower bound, $tilde sigma $ achieves fast computation. We prove that $tilde sigma $ is a lower bound on σ-lb. Next, we show $tilde sigma $ can be calculated faster than σ-lb. The time complexity of $tilde sigma ({mathbf{s}})$ is О(n2), where n is the dimension of s. Experimental results to compare $tilde sigma $ and σ-lb are also given. The results demonstrate that the values of $tilde sigma ({mathbf{s}})$ are equal to those of σ-lb (s) for most reversible functions and that the computation time of $tilde sigma ({mathbf{s}})$ is much shorter than that of σ-lb(s).
{"title":"Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits","authors":"T. Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Y. Nishitani","doi":"10.1109/ISMVL57333.2023.00038","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00038","url":null,"abstract":"We present a time-efficient lower bound $tilde sigma $ on the number of gates in Toffoli-based reversible circuits that represent a given reversible logic function. For the characteristic vector s of a reversible logic function, the value of $tilde sigma ({mathbf{s}})$ is almost the same as σ-lb (s), which is known as a relatively-efficient lower bound in terms of the evaluation time and the tightness. By slightly sacrificing the tightness of the lower bound, $tilde sigma $ achieves fast computation. We prove that $tilde sigma $ is a lower bound on σ-lb. Next, we show $tilde sigma $ can be calculated faster than σ-lb. The time complexity of $tilde sigma ({mathbf{s}})$ is О(n2), where n is the dimension of s. Experimental results to compare $tilde sigma $ and σ-lb are also given. The results demonstrate that the values of $tilde sigma ({mathbf{s}})$ are equal to those of σ-lb (s) for most reversible functions and that the computation time of $tilde sigma ({mathbf{s}})$ is much shorter than that of σ-lb(s).","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133879612","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：