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

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

筛选
英文 中文
Hyperclones on a finite set 有限集合上的超克隆
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601378
B. A. Romov
{"title":"Hyperclones on a finite set","authors":"B. A. Romov","doi":"10.1109/ISMVL.1997.601378","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601378","url":null,"abstract":"The composition-closed sets of multivalued operations, called hyperclones, defined on the finite set E(k)={0, 1, ..., k-1} (k/spl ges/2) are investigated. It is shown that the lattice of all hyperclones on E(k) is dual atomic and has only the finite number of dual atoms (maximal hyperclones). Some of them are described in this paper. The full list of hyperclones defined on the set E(2) which are closed under an arbitrary restriction of their elements is obtained.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"4 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":"115206880","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}
引用次数: 19
Properties of Lindenmayer fuzzy languages and /spl alpha/-driven Lindenmayer languages 林登梅尔模糊语言和/spl alpha/驱动林登梅尔语言的特性
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601397
E. M. Z. Bexten, Farzad Sajadi, C. Moraga
{"title":"Properties of Lindenmayer fuzzy languages and /spl alpha/-driven Lindenmayer languages","authors":"E. M. Z. Bexten, Farzad Sajadi, C. Moraga","doi":"10.1109/ISMVL.1997.601397","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601397","url":null,"abstract":"This paper introduces Lindenmayer fuzzy languages and studies some of their properties. Lindenmayer languages are characterized by a parallel rewriting generation process. Lindenmayer fuzzy languages are characterized by expressiveness. Closure as well as a non-monotonic development aspects of these languages and their /spl alpha/-cut are discussed.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"236 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":"123175171","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
Application of resonant-tunneling quaternary quantizer to ultrahigh-speed A/D converter 谐振隧穿四元量化器在超高速A/D转换器中的应用
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601371
T. Waho, Masafumi Yamamoto
{"title":"Application of resonant-tunneling quaternary quantizer to ultrahigh-speed A/D converter","authors":"T. Waho, Masafumi Yamamoto","doi":"10.1109/ISMVL.1997.601371","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601371","url":null,"abstract":"An analog-to-quaternary quantizer using resonant-tunneling (RT) devices is applied to an ultrahigh-speed analog-to-digital (A/D) converter. First, transient analysis results for the quaternary quantizer, which consists of six RT diodes and one HEMT, are presented. A 4-bit A/D converter employing this quantizer with multiple-valued logic encoding circuits is then described. The number of transistors is one-fifth of that required for conventional A/D converters. SPICE simulation reveals that the present A/D converter can be operated at sampling rates as high as 4 GS/s.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"31 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":"121128699","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}
引用次数: 21
Completeness criteria in set-valued logic under compositions with union and intersection 集值逻辑在并交组合下的完备性准则
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601377
A. Ngom, C. Reischer, D. Simovici, I. Stojmenovic
{"title":"Completeness criteria in set-valued logic under compositions with union and intersection","authors":"A. Ngom, C. Reischer, D. Simovici, I. Stojmenovic","doi":"10.1109/ISMVL.1997.601377","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601377","url":null,"abstract":"This paper discusses the Boolean completeness problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic circuits. Given a set S of Boolean functions, a set of functions F is S-complete if any set logic function can be composed from F once all Boolean functions from S are added to F. For the special case U=[/spl cup/, /spl cap/], we characterize all U-maximal sets in r-valued set logic. A set F is then U-complete if it is not a subset of any of these U-maximal sets, which is a completeness criterion in r-valued set logic under compositions with U functions.","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":"116695748","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
Mixed discrete optimization of multiple-valued systems 多值系统的混合离散优化
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601409
A. Etzel
{"title":"Mixed discrete optimization of multiple-valued systems","authors":"A. Etzel","doi":"10.1109/ISMVL.1997.601409","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601409","url":null,"abstract":"In this paper, a cutting-plane method is presented that has been applied to mixed multiple-valued optimization problems. In practice, the approach is faster than transforming mixed multiple-valued programs to mixed integer or zero-one integer programs. The approach can be used for fuzzy sets and industrial applications involving discrete intervals of feasible solutions. It has been applied to industrial power plants and flexible manufacturing systems.","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":"126474800","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
Recent developments in DNA-computing dna计算的最新进展
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601366
Diana Rooß
{"title":"Recent developments in DNA-computing","authors":"Diana Rooß","doi":"10.1109/ISMVL.1997.601366","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601366","url":null,"abstract":"L.M. Adleman (1994) published the description of a lab experiment, where he computed an instance of the Hamiltonian path problem with DNA in test tubes. He initiated a flood of further research on computing with molecular means in theoretical computer science. A great number of models was introduced and examined, concerning their computational power (universality as well as time and space complexity), their efficiency and their error resistance. The main results are presented in this survey.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"10 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":"125839097","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
Sympathy-MV: Fast exact minimization of fixed polarity multi-valued linear expressions 同情- mv:快速精确最小化固定极性多值线性表达式
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601376
R. Drechsler, Martin Keim, B. Becker
{"title":"Sympathy-MV: Fast exact minimization of fixed polarity multi-valued linear expressions","authors":"R. Drechsler, Martin Keim, B. Becker","doi":"10.1109/ISMVL.1997.601376","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601376","url":null,"abstract":"In this paper a polynomial time algorithm for the minimization of fixed polarity multi-valued linear expressions (FPMVLs) for totally symmetric functions based on an extension of binary moment diagrams (BMDs) is presented. A generalization to partially symmetric functions is investigated.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"151 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":"126198804","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
Multiple-valued logic minimization by genetic algorithms 遗传算法的多值逻辑最小化
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601380
Y. Hata, Kiyoshi Hayase, Takahiro Hozumi, N. Kamiura, K. Yamato
{"title":"Multiple-valued logic minimization by genetic algorithms","authors":"Y. Hata, Kiyoshi Hayase, Takahiro Hozumi, N. Kamiura, K. Yamato","doi":"10.1109/ISMVL.1997.601380","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601380","url":null,"abstract":"This paper describes an approach to minimize multiple-valued logic expressions by genetic algorithms. We encode a multiple-valued logic expression as a \"chromosome\" whose length allows to change and corresponds to the number of implicants of the expression. Our fitness function evaluates the following three items. 1. How may outputs does the logic expression represent correctly? 2. How many implicants does the logic expression require? 3. How many connections does the logic expression require? Our method employs the fitness function and minimizes sum-of-products expressions, where sum refers to TSUM or MAX and product refers to MIN of set literals or window literals. The simulation results show that our method derives good results for some arithmetic functions and intends to avoid the local minimal solution, compared to neural-computing-based method.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"24 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":"128465486","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}
引用次数: 8
Multiple-valued logic as a programming language 多值逻辑作为一种编程语言
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601402
R. Bignall, M. Spinks
{"title":"Multiple-valued logic as a programming language","authors":"R. Bignall, M. Spinks","doi":"10.1109/ISMVL.1997.601402","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601402","url":null,"abstract":"A method for specifying the computable functions using multiple-valued logics is described. The logics in question provide a uniform environment both for specifying computable functions on the natural numbers and for proving theorems about such specifications. They arise via a generalisation to the countable-valued case of techniques that may be used in specifying multiple-valued switching circuits by finite-valued predicate logics. In this paper a concrete instance of such a language, based on a modification of dual skew Boolean logic, is constructed. The result may be viewed as a a simple functional/logic programming language that is, in principle, executable.","PeriodicalId":206024,"journal":{"name":"Proceedings 1997 27th International Symposium on Multiple- Valued Logic","volume":"14 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":"125946552","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}
引用次数: 6
Multiple-valued immune network model and its simulations 多值免疫网络模型及其仿真
Proceedings 1997 27th International Symposium on Multiple- Valued Logic Pub Date : 1997-05-28 DOI: 10.1109/ISMVL.1997.601403
Zheng Tang, Takayuki Yamaguchi, Koichi Tashima, O. Ishizuka, K. Tanno
{"title":"Multiple-valued immune network model and its simulations","authors":"Zheng Tang, Takayuki Yamaguchi, Koichi Tashima, O. Ishizuka, K. Tanno","doi":"10.1109/ISMVL.1997.601403","DOIUrl":"https://doi.org/10.1109/ISMVL.1997.601403","url":null,"abstract":"This paper describes a new model of multiple-valued immune network based on biological immune response network. The model of multiple-valued immune network is formulated based on the analogy with the interaction between B cells and T cells in immune system. The model has a property that resembles immune response quite well. The immunity of the network is simulated and makes several experimentally testable predictions. Simulation results are given to a letter recognition application of the network and compared with binary ones. The simulations show that, beside the advantages of less categories, improved memory pattern and good memory capacity, the multiple-valued immune network produces a stronger noise immunity than binary one.","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":"114772132","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}
引用次数: 27
首页 上一页 下一页 尾页
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学术官方微信