发布求助
文献互助 智能选刊 最新文献

38th International Symposium on Multiple Valued Logic (ismvl 2008)最新文献

筛选
英文 中文
On Maximal Hyperclones on {0, 1} A New Approach 关于{0,1}上的极大超克隆的一个新方法
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.44
Hajime Machida, J. Pantović
{"title":"On Maximal Hyperclones on {0, 1} A New Approach","authors":"Hajime Machida, J. Pantović","doi":"10.1109/ISMVL.2008.44","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.44","url":null,"abstract":"The set of clones of operations on {0,1} forms a countable lattice which was classified by Post. The cardinality of the lattice of hyperclones on {0,1} was proved by Machida to be of the continuum. The hypercore of a clone C is zeta- closure of the set of hyperoperations whose extended operations belong to C. For every clone C which is intersection of the clone B5 and another submaximal clone of B2, we investigate hypercores. The interval of hyperclones on {0,1} generated by unary hyperoperations is also completely determined.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123788678","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}
引用次数: 2
Classification of Fastest Quaternary Linearly Independent Arithmetic Transforms 最快的四元线性无关算术变换的分类
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.10
B. Falkowski, Cheng Fu
{"title":"Classification of Fastest Quaternary Linearly Independent Arithmetic Transforms","authors":"B. Falkowski, Cheng Fu","doi":"10.1109/ISMVL.2008.10","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.10","url":null,"abstract":"Classification of novel fastest quaternary linearly independent transforms has been presented. They are recursively defined and have consistent formulas relating their forward and inverse transform matrices. Their transform matrices' properties and calculation example have been shown. The computational costs of the calculation for presented transforms are also discussed. The experimental results are shown and compared with the well known quaternary arithmetic transform.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134349124","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}
引用次数: 3
On the Data Structure Metrics of Quantum Multiple-Valued Decision Diagrams 量子多值决策图的数据结构度量
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.28
D. Y. Feinstein, Mitchell A. Thornton, D. M. Miller
{"title":"On the Data Structure Metrics of Quantum Multiple-Valued Decision Diagrams","authors":"D. Y. Feinstein, Mitchell A. Thornton, D. M. Miller","doi":"10.1109/ISMVL.2008.28","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.28","url":null,"abstract":"This paper describes new metrics for the data structure referred to as quantum multiple-valued decision diagrams (QMDD) which are used to represent the matrices describing reversible and quantum gates and circuits. These metrics provide information about QMDD that allows for improvement of minimization techniques. We explore metrics related to the frequency of edges with non-zero weight for the entire QMDD data structure and their histograms with respect to each variable. We observe some unique regularity particular to the methodology of the QMDD. We develop new heuristics for QMDD dynamic variable ordering (DVO) that are guided by the proposed metrics. Experimental results show the effectiveness of the proposed techniques.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123842342","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}
引用次数: 5
Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID) 基于不相交素蕴涵的叠加量子态初始化
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.24
David J. Rosenbaum, M. Perkowski
{"title":"Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID)","authors":"David J. Rosenbaum, M. Perkowski","doi":"10.1109/ISMVL.2008.24","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.24","url":null,"abstract":"The problem of initializing a quantum superposition is important for Grover's algorithm, quantum neural networks and other applications. The purpose of the algorithm presented here is to generate a quantum array that initializes a desired quantum superposition on n qubits. The SQUID algorithm almost always creates quantum arrays that perform better than those created by existing algorithms such as the Ventura-Martinez and Long-Sun algorithms. The best case performance for the quantum arrays created by the SQUID algorithm is O(n) when the superposition contains all possible states which is an exponential improvement over all existing algorithms. Also, the worst case performance of the quantum array created by the SQUID algorithm is never worse than the performance of existing algorithms. The SQUID algorithm represents a vast improvement over previous quantum superposition initialization algorithms and allows quantum superpositions to be initialized much more efficiently than with other algorithms.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127694289","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}
引用次数: 5
Time-Domain Pre-Emphasis Techniques for Equalization of Multiple-Valued Data 多值数据均衡化的时域预强调技术
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.40
Y. Yuminaka, Yasunori Takahashi
{"title":"Time-Domain Pre-Emphasis Techniques for Equalization of Multiple-Valued Data","authors":"Y. Yuminaka, Yasunori Takahashi","doi":"10.1109/ISMVL.2008.40","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.40","url":null,"abstract":"This paper presents a new equalization technique based on a pulse-width modulation (PWM) pre-emphasis method which utilizes time-domain information processing to increase the data rate for a given bandwidth of VLSI interconnection. The pre-emphasis method does not change the pulse amplitude as for conventional FIR pre-emphasis, but instead exploits timing resolution. This fits well with recent CMOS technology trends toward higher switching speeds and lower voltage headroom. We discuss new time-domain pre-emphasis techniques especially for multiple-valued data transmission in order to achieve high-speed data transmission in VLSI systems.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123518468","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}
引用次数: 7
MDD with Added Null-Value and All-Value Edges 添加了空值边和全值边的MDD
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.20
C. Files, M. Nodine
{"title":"MDD with Added Null-Value and All-Value Edges","authors":"C. Files, M. Nodine","doi":"10.1109/ISMVL.2008.20","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.20","url":null,"abstract":"This paper presents an MDD that has additional null-value and all-value edges. The MDD is based on a multi-valued algebra that augments multi-valued variables to allow a null- output value. A null-output value is a value that cannot be computed but represents the lack of any valid value for a given input combination (akin to an output don't care, but its value cannot be changed). A side effect of the null-value edge is that the MDD is capable of representing 1-valued variables. Plus, the null-value is used in representing mutexes (a concept that defines an input don't care condition). While there have been publications that have created BDDs with a third (all-value) edge, to the authors' knowledge, this is the first time an all-value edge has been added to an MDD. This MDD data structure is the foundation for Intrinsity's multi-valued logic synthesis algorithms.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132966019","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}
引用次数: 2
Soft Computing Methods for Prediction of Replication Origins in Caudoviruses 预测尾状病毒复制起点的软计算方法
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.29
R. Cruz-Cano, I. Aizenberg
{"title":"Soft Computing Methods for Prediction of Replication Origins in Caudoviruses","authors":"R. Cruz-Cano, I. Aizenberg","doi":"10.1109/ISMVL.2008.29","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.29","url":null,"abstract":"Prediction methods that can be reduced to learning of partially defined multiple-valued functions have become very popular. In this paper, we consider a prediction problem related to DNA replication, which is essential for the reproduction of many viruses. Procedures to find replication origins are important for controlling such viruses. This paper focuses on the order of caudovirales and proposes a new prediction approach based on least-squares support vector machine (LS-SVM) and a multilayer feedforward neural network with multi-valued neurons (MLMVN). The results suggest that this method will be a useful tool for the prediction of viral replication origins.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134579996","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}
引用次数: 0
High-Level Design of Multiple-Valued Arithmetic Circuits Based on Arithmetic Description Language 基于算术描述语言的多值算术电路高级设计
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.39
Yuki Watanabe, N. Homma, K. Degawa, T. Aoki, T. Higuchi
{"title":"High-Level Design of Multiple-Valued Arithmetic Circuits Based on Arithmetic Description Language","authors":"Yuki Watanabe, N. Homma, K. Degawa, T. Aoki, T. Higuchi","doi":"10.1109/ISMVL.2008.39","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.39","url":null,"abstract":"This paper proposes a high-level design method of multiple-valued arithmetic circuits. The proposed method uses a cell-based approach with a dedicated hardware description language called ARITH. By using ARITH, we can describe and verify any binary/multiple-valued arithmetic circuits in a formal manner. The ARITH description can be transformed into a technology-dependent netlist in binary/multiple-valued fused logic. The process of transforming the netlist into a physical layout pattern is automatically performed by an off-the-shelfplace-and-route tool. In this paper, we present a specific cell library containing a multiple-valued signed-digit adder and its related circuits with a 0.35mum CMOS technology, and demonstrate that the proposed method can synthesize a 32times 32-bit parallel multiplier in multiple-valued current-mode logic from an ARITH description.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165135","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}
引用次数: 1
Default Reasoning with Imperfect Information in Multivalued Logics 多值逻辑中不完全信息的默认推理
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.45
D. Stamate
{"title":"Default Reasoning with Imperfect Information in Multivalued Logics","authors":"D. Stamate","doi":"10.1109/ISMVL.2008.45","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.45","url":null,"abstract":"The work provides an approach to default reasoning with imperfect information using extended logic programs in multivalued logics given by bilattices. The paper introduces the default semantics of an extended program using a set of operators with interesting properties elegantly expressed in terms of lattice theory, including the ultimate evaluation based consequence operator and the default operator corresponding to two types of inference in presence of imperfect information. We provide a computational approach for the default semantics and relate our framework to relevant work.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125175074","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}
引用次数: 1
On the Complexity of Classification Functions 论分类函数的复杂性
38th International Symposium on Multiple Valued Logic (ismvl 2008) Pub Date : 2008-05-22 DOI: 10.1109/ISMVL.2008.18
Tsutomu Sasao
{"title":"On the Complexity of Classification Functions","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL.2008.18","DOIUrl":"https://doi.org/10.1109/ISMVL.2008.18","url":null,"abstract":"A classification function is a multiple-valued input function specified by a set of rules, where each rule is a conjunction of range functions. The function is useful for packet classification for internet, network intrusion detection system, etc. This paper considers the complexity of range functions and classification functions represented by sum-of-products expressions of binary variables. It gives tighter upper bounds on the number of products for range functions.","PeriodicalId":243752,"journal":{"name":"38th International Symposium on Multiple Valued Logic (ismvl 2008)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130963638","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}
引用次数: 24
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信