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

Proceedings 1997 27th International Symposium on Multiple- Valued Logic最新文献

筛选
英文 中文
Comparison of the worst and best sum-of-products expressions for multiple-valued functions 多值函数的最坏和最佳积和表达式的比较
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601374
Tsutomu Sasao, J. T. Butler
{"title":"Comparison of the worst and best sum-of-products expressions for multiple-valued functions","authors":"Tsutomu Sasao, J. T. Butler","doi":"10.1109/ISMVL.1997.601374","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601374","url":null,"abstract":"Because most practical logic design algorithms produce irredundant sum-of-products (ISOP) expressions, the understanding of ISOPs is crucial. We show a class of functions for which Morreale-Minato's ISOP generation algorithm produces worst ISOPs (WSOP), ISOPs with the most product terms. We show this class has the property that the ratio of the number of products in the WSOP to the number in the minimum ISOP (MSOP) is arbitrarily large when the number of variables is unbounded. The ramifications of this are significant; care must be exercised in designing algorithms that produce ISOPs. We also show that 2/sup n-1/ is a firm upper bound on the number of product terms in any ISOP for switching functions on n variables, answering a question that has been open for 30 years. We show experimental data and extend our results to functions of multiple-valued variables.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123179679","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}
引用次数: 13
Properties and applications of unified complex Hadamard transforms 统一复Hadamard变换的性质及应用
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601387
B. Falkowski, S. Rahardja
{"title":"Properties and applications of unified complex Hadamard transforms","authors":"B. Falkowski, S. Rahardja","doi":"10.1109/ISMVL.1997.601387","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601387","url":null,"abstract":"A family of Unified Complex Hadamard Transforms derived from Walsh functions is defined. Newly developed direct matrix operator is introduced which is able to generate different types of Complex Hadamard matrices. Higher dimension matrices of the transforms may also be generated recursively by means of Kronecker product from basic matrices. Sparse matrix factorization or matrix partitioning of the Complex Hadamard matrices leads to the fast algorithms with complexity Nlog/sub 2/N. One of the shown fast algorithms may be implemented as in-place architecture which reduces memory requirements and allows on simple implementation in software or in hardware. Finally, different properties of the new transforms are shown and the performance of the transforms for Wiener filtering is evaluated and compared with the known discrete orthogonal transforms.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116943456","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}
引用次数: 13
On the synthesis of MVL functions using input and output phase assignments 用输入和输出相位赋值法合成MVL函数
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601407
M. Abd-El-Barr, M. N. Hasan, G. A. Hamid
{"title":"On the synthesis of MVL functions using input and output phase assignments","authors":"M. Abd-El-Barr, M. N. Hasan, G. A. Hamid","doi":"10.1109/ISMVL.1997.601407","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601407","url":null,"abstract":"In this paper, a number of decomposition based mapping techniques are proposed. In these techniques, the synthesis problem is formulated as a mapping from an input matrix to an output matrix. The minimization is obtained by constructing a matching-count matrix. The entries of the matching-count matrix MC/sub i,j/ represent the number of entry matches between the input variable number i in the input matrix (X) and the output function number j in the output matrix (Y). It then selects those input-output pairings that give the maximum matching count, thus maximizing the number of switching operations which can be eliminated in the realization of MVL functions. The proposed techniques are classified as: output-phase with complement, input-phase with and without complement. Numerical results are presented to show that the proposed techniques result in significant reduction in the number of switching operators required for the implementation of 5000 randomly generated r-valued functions (for r=3, 4, and 5).","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121355852","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
Many-valuedness and uncertainty 多重价值和不确定性
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601390
E. Orlowska
{"title":"Many-valuedness and uncertainty","authors":"E. Orlowska","doi":"10.1109/ISMVL.1997.601390","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601390","url":null,"abstract":"A generalisation of modal information logics to many-valued modal logics is presented. Information logics are the formalisms for reasoning about uncertain knowledge discovered from incomplete information. In these logics an analysis of information that has the form of descriptions of objects in terms of their properties can be carried on and relationships among objects based on their common properties (referred to as information relations) can be represented and discussed. In the proposed many-valued information logics both properties of objects and relationships among the objects are assumed to be many-valued. A relationship between the calculus of information relations and Aristotelian syllogistic is outlined.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125414706","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}
引用次数: 14
Enzyme transistor circuits for biomolecular computing 用于生物分子计算的酶晶体管电路
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601373
M. Hiratsuka, T. Aoki, T. Higuchi
{"title":"Enzyme transistor circuits for biomolecular computing","authors":"M. Hiratsuka, T. Aoki, T. Higuchi","doi":"10.1109/ISMVL.1997.601373","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601373","url":null,"abstract":"A model of an enzyme transistor, a three-terminal biomolecular switching device, is proposed. Ideally, an enzyme transistor can be regarded as an artificial enzyme whose catalytic activity is controlled by some effector molecule. In this paper, we show that various biomolecular circuits can be constructed with enzyme transistors. Also, a possible approach to the implementation based on electrical control of enzyme reactions is discussed.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122221780","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
A proof method for the six-valued logic for incomplete information 不完全信息六值逻辑的一种证明方法
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601401
S. Akama
{"title":"A proof method for the six-valued logic for incomplete information","authors":"S. Akama","doi":"10.1109/ISMVL.1997.601401","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601401","url":null,"abstract":"O. Garcia and M. Moussavi (1990) proposed a six-valued logic to model incomplete information. Although their logic is promising, it lacks a proof theory to serve as a basis for automated reasoning. We describe a sequent style proof method for the logic and show that the consequence relation in the logic is equivalent to the one by N.D. Belnap's (1977) four-valued logic. We also suggest alternative formal interpretations for the logic.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123362077","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
Training fuzzy logic based software components for reuse 训练基于模糊逻辑的软件组件以实现重用
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601396
Junda Chen, D. Rine
{"title":"Training fuzzy logic based software components for reuse","authors":"Junda Chen, D. Rine","doi":"10.1109/ISMVL.1997.601396","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601396","url":null,"abstract":"A training framework of an effective method for off-line training of a class of control software components (for example, for first-order nonlinear feedback control systems) using combinations of three kinds of adaptation algorithms is presented. Each control software component is represented at the abstract level by means of a set of adaptive fuzzy logic (FL) rules and at the concrete level by means of fuzzy membership functions (MBFs). At the concrete representation level adaptation algorithms specified for use in adapting MBFs are: genetic algorithms, neural net algorithms, and Monte Carlo algorithms. We specify effective combinations of these three existing adaptation algorithms to train an erroneous FL rule-based software component in the tracker problem. In the framework, training consists of two phases: testing and adapting. In this paper, only the adapting phase is addressed. For each fault scenario adaptation algorithms and their combinations are used to modify the MBFs of the component. Effectiveness of the adapting phase is determined in terms of flexibility, adaptability, and stability. We perform experiments using a genetic algorithm. Simulation results are discussed.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128090095","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}
引用次数: 4
Multiple-valued product-of-sums expression with truncated sum 截断和的多值和积表达式
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601381
Y. Hata, N. Kamiura, K. Yamato
{"title":"Multiple-valued product-of-sums expression with truncated sum","authors":"Y. Hata, N. Kamiura, K. Yamato","doi":"10.1109/ISMVL.1997.601381","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601381","url":null,"abstract":"Truncated sum (TSUM for short) can be useful for MV-PLAs realization. This paper introduces multiple-valued product-of-sums expressions where sum refers to TSUM and product does MIN. We investigate the multiple-valued product-of-sums expressions and show the minimization method and the simulation results. We describe the minimization method based on binary Quine-McCluskey algorithm. It is proved that in the minimal product-of-sums expressions, the implicate number of the expressions with TSUM is equivalent to the number of those with MAX. Next, we propose multiple-valued product-of-sums expressions with variables. The expressions involve the TSUM of variables and nonzero constants as the coefficients of the implicates. The minimization method is also proposed. Finally, we show the simulation results for some multiple-valued arithmetic functions. In them, an efficiency of the product-of-sums expressions with variables is shown and some comparisons are made.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133171825","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
Design of an asynchronous digital system with B-ternary logic 基于b -三元逻辑的异步数字系统设计
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601411
Y. Nagata, M. Mukaidono
{"title":"Design of an asynchronous digital system with B-ternary logic","authors":"Y. Nagata, M. Mukaidono","doi":"10.1109/ISMVL.1997.601411","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601411","url":null,"abstract":"Some of the recent digital systems have a serious clock skew problem which comes from huge hardware implementations and high speed operations in VLSI's. To overcome this problem, clock distribution techniques and more notably, asynchronous system design methodologies, have been investigated. Since, the latest asynchronous digital systems use two-rail logic with two-phase data transfer manner, more than two-fold hardware is required in comparison with the synchronous system. In this article, we present design of asynchronous digital system which is based on B-ternary logic so as to process binary data. The system consists of data-path and its controller. We provide B-ternary two-phase binary data processing in the data-path and its control procedure, which is based on shake-hand protocol. The functional units of the system are presented, that is, ternary-in binary-out memory with request/acknowledge detector and control unit. These units are fabricated with ternary NOR, NAND, INVERTER gates and ternary Muller's C-elements.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121911007","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}
引用次数: 11
Cube diagram bundles: a new representation of strongly unspecified multiple-valued functions and relations 多维数据集图束:强未指定多值函数和关系的新表示
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601416
S. Grygiel, M. Perkowski, M. Marek-Sadowska, T. Luba, L. Józwiak
{"title":"Cube diagram bundles: a new representation of strongly unspecified multiple-valued functions and relations","authors":"S. Grygiel, M. Perkowski, M. Marek-Sadowska, T. Luba, L. Józwiak","doi":"10.1109/ISMVL.1997.601416","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601416","url":null,"abstract":"Efficient function representation is very important for speed and memory requirements of multiple-valued decomposers. This paper presents a new representation of multiple-valued relations (functions in particular), called multiple-valued cube diagram bundles (MVCDB). MVCDBs improve on rough partition representation by labeling their blocks with variable values and by representing blocks efficiently. The MVCDB representation is especially efficient for very strongly unspecified multiple-valued input, multiple-valued output functions and relations, typical for machine learning applications.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124624831","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}
引用次数: 14
下一页 尾页
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学术官方微信