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

37th International Symposium on Multiple-Valued Logic (ISMVL'07)最新文献

筛选
英文 中文
The Genetic Code as a Multiple-Valued Function and Its Implementation Using Multilayer Neural Network Based on Multi-Valued Neurons 遗传密码作为多值函数及其基于多值神经元的多层神经网络实现
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-13 DOI: 10.1109/ISMVL.2007.54
I. Aizenberg, C. Moraga
{"title":"The Genetic Code as a Multiple-Valued Function and Its Implementation Using Multilayer Neural Network Based on Multi-Valued Neurons","authors":"I. Aizenberg, C. Moraga","doi":"10.1109/ISMVL.2007.54","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.54","url":null,"abstract":"The genetic code is the four-letter nucleic acid code, and it is translated into a 20-letter amino acid code from proteins (each of 20 amino acids is coded by the triplet of four nucleic acids). Thus, it is possible to consider the genetic code as a partially defined multiple-valued function of a 20-valued logic. It is shown in the paper that a model of multiple-valued logic over the field of complex numbers is the most appropriate for the representation of the genetic code. Furthermore, consideration of the genetic code within this model makes it possible to learn it using a multilayer neural network based on multi-valued neurons (MLMVN). The functionality of MLMVN is higher than the ones of the traditional feedforward and kernel-based networks and its backpropagation learning algorithm is derivative-free. It is shown that the genetic code multiple-valued function can be easily trained by a significantly smaller MLMVN in comparison with a classical feedforward neural network.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126534745","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
Automated Reasoning in Some Local Extensions of Ordered Structures 有序结构局部扩展中的自动推理
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-13 DOI: 10.1109/ISMVL.2007.10
Viorica Sofronie-Stokkermans, C. Ihlemann
{"title":"Automated Reasoning in Some Local Extensions of Ordered Structures","authors":"Viorica Sofronie-Stokkermans, C. Ihlemann","doi":"10.1109/ISMVL.2007.10","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.10","url":null,"abstract":"We give a uniform method for automated reasoning in several types of extensions of ordered algebraic structures (definitional extensions, extensions with boundedness axioms or with monotonicity axioms). We show that such extensions are local and, hence, efficient methods for hierarchical reasoning exist in all these cases.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127916149","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}
引用次数: 46
Spectral Analysis of Special Properties of Ternary Functions 三元函数特殊性质的谱分析
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-13 DOI: 10.1109/ISMVL.2007.52
C. Moraga, M. Stankovic, S. Stojkovic
{"title":"Spectral Analysis of Special Properties of Ternary Functions","authors":"C. Moraga, M. Stankovic, S. Stojkovic","doi":"10.1109/ISMVL.2007.52","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.52","url":null,"abstract":"This paper shows that particular classes of linear combinations of the coefficients of the circular Chrestenson-Vilenkin spectrum of ternary functions characterize whether cofactors of the function are constant or balanced. These results may be applied to take decisions related to hardware implementations or to simplify ternary decision diagrams.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127525929","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
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory 量子查询复杂度理论中的低多项式次布尔函数
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-13 DOI: 10.1109/ISMVL.2007.11
R. Freivalds, Liva Garkaje
{"title":"Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory","authors":"R. Freivalds, Liva Garkaje","doi":"10.1109/ISMVL.2007.11","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.11","url":null,"abstract":"The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. This is why Boolean functions are needed with a high number of essential variables and a low polynomial degree. Unfortunately, it is a well-known problem to construct such functions. The best separation between these two complexity measures of a Boolean function was exhibited by Ambai- nis [5]. He constructed functions with polynomial degree M and number of variables Omega(M2). We improve such a separation to become exponential. On the other hand, we use a computerized exhaustive search to prove tightness of this bound.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121635869","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
Quantum Mechanical Model of Emotional Robot Behaviors 情感机器人行为的量子力学模型
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-13 DOI: 10.1109/ISMVL.2007.44
M. Lukac, M. Perkowski
{"title":"Quantum Mechanical Model of Emotional Robot Behaviors","authors":"M. Lukac, M. Perkowski","doi":"10.1109/ISMVL.2007.44","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.44","url":null,"abstract":"In this paper the emotional model of the humanoid Cynthea (cybernetic networked humanoid emotional agent) robot is presented. The model is detailed at two levels: the cognitive level is described by the CRL language, and the emotional level manipulates the language in a data independent way. An emotional mapping is introduced and is used to alter the language words using local energy-based rules. The robot is described as a set of functional agents, each acting on behalf of its own emotional function generating the whole robot emotional state. The cognitive level is applied to describe situations such as dialogues, interactions and behaviors specified in the CRL language. The emotional level is used as a mechanism to introduce behavioral changes in the robot's command execution. The interaction of these levels evolves in alterations to the desired behavior. To allow global effects on the language level with lower level behavioral variations we provide a model of robot-specific emotions based on quantum cellular automata.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116905343","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}
引用次数: 20
Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions 四元固定极性算术展开的高效算法
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-13 DOI: 10.1109/ISMVL.2007.16
B. Falkowski, C. C. Lozano, T. Luba
{"title":"Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions","authors":"B. Falkowski, C. C. Lozano, T. Luba","doi":"10.1109/ISMVL.2007.16","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.16","url":null,"abstract":"A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions' QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lower computational cost for generating the complete polarity matrix than other algorithms.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132986603","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
Towards First-Order Symbolic Trajectory Evaluation 一阶符号轨迹评价
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2007-05-01 DOI: 10.1109/ISMVL.2007.57
Donglin Li, O. Mohamed, Sa'ed Abed
{"title":"Towards First-Order Symbolic Trajectory Evaluation","authors":"Donglin Li, O. Mohamed, Sa'ed Abed","doi":"10.1109/ISMVL.2007.57","DOIUrl":"https://doi.org/10.1109/ISMVL.2007.57","url":null,"abstract":"Symbolic trajectory evaluation (STE) is a symbolic simulation based bounded model checking approach and its computational complexity depends only on the property being checked not on the size of the circuit. In this paper, we study first-order symbolic trajectory evaluation (FSTE). We first present the computation model: abstract state machines (ASMs) combined with a partial order over the state space, in which data and data operations are described using abstract sort and uninterpreted function symbols. Second, we devise an FSTE algorithm which is based on implicit state enumeration of an ASM and implemented using multiway decision graphs (MDGs). Finally, an illustrative example is presented to demonstrate the effectiveness of this approach.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123982814","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
On Designs of Radix Converters Using Arithmetic Decompositions--Binary to Decimal Converters-- 基于算术分解的基数转换器的设计——二进制到十进制转换器
37th International Symposium on Multiple-Valued Logic (ISMVL'07) Pub Date : 2006-05-17 DOI: 10.1109/ISMVL.2006.31
Y. Iguchi, Tsutomu Sasao, M. Matsuura
{"title":"On Designs of Radix Converters Using Arithmetic Decompositions--Binary to Decimal Converters--","authors":"Y. Iguchi, Tsutomu Sasao, M. Matsuura","doi":"10.1109/ISMVL.2006.31","DOIUrl":"https://doi.org/10.1109/ISMVL.2006.31","url":null,"abstract":"In digital signal processing, radixes other than two are often used for high-speed computation. In the computation for finance, decimal numbers are used instead of binary numbers. In such cases, radix converters are necessary. This paper considers design methods for binary to q-nary converters. It introduces a new design technique based on weighted-sum (WS) functions. The method computes a WS function for each digit by an LUT cascade and a binary adder, then adds adjacent digits with q-nary adders. A 16-bit binary to decimal converter is designed to show the method.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129431597","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}
引用次数: 9
首页 上一页
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学术官方微信