{"title":"Evaluation of the Hierarchical Temporal Memory as Soft Computing Platform and its VLSI Architecture","authors":"W. Melis, Shuhei Chizuwa, M. Kameyama","doi":"10.1109/ISMVL.2009.11","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.11","url":null,"abstract":"A large number of real world applications, like user support systems, can still not be performed easily by conventional algorithms in comparison with the human brain. Recently, such intelligence has often been reached by using probability based systems. This paper presents results on the implementation of one such user support system, namely an intention estimation information appliance system, on a Bayesian Network as well as Hierarchical Temporal Memory. The latter is a new and quite promising soft computing platform modelling the human brain, though currently only available as a software model. A second part of the paper therefore focuses on a possible VLSI architecture for Hierarchical Temporal Memory. Since it models the human brain, communication as well as memory are of high importance for this VLSI architecture.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127563074","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}
{"title":"A Study of Practical Causality Acquisition among Vital Signals","authors":"N. Tsuchiya, H. Nakajima","doi":"10.1109/ISMVL.2009.54","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.54","url":null,"abstract":"According to increase in the number of sensors, the target system could be effectively controlled such as monitor and maintenance. Additionally, transparent causality among sensor signals should be importantly prerequisite for realizing that kind of solution. However, it is very hard to acquire the cause-effect structure among huge number of sensors. In this article, cause-effect structure acquisition is studied and discussed by employing visceral fat estimation of human body as an application. Cause-effect acquisition methods could be mainly classified into two types. One is based on human experts’ knowledge and the other is using sensory data. They have different effectiveness and ineffectiveness each other. The authors propose the combinational method of them based on the notion of human-machine collaboration.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131411286","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}
{"title":"Representing the Genetic Code as a Function on a Galois Field Using the Reed-Muller Expansion","authors":"Hosam A. Aleem, D. Green, F. Mavituna","doi":"10.1109/ISMVL.2009.59","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.59","url":null,"abstract":"The information needed for the biotic activities of an organism is stored in a coded form in its DNA. This code is universal for all organisms and uses three units called nucleotides, each of which can take one of four possible values to code for twenty different amino acids. Thus it is a mapping from N3 toP, where N is the set of nucleotides and P is the set of Amino acids. The genetic code has been studied from the points of view of Coding Theory and Information Theory. Here we study it from the point of view of Switching Theory where it is considered as a logic function on a finite field and represented by its Reed-Muller expansion. We first present the genetic code, then develop its Reed-Muller expansion. Potential applications for this approach are also discussed.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131644028","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}
{"title":"Optimization of Fuzzy If-Then Rule Bases by Evolutionary Tuning of the Operations","authors":"C. Moraga, M. Sugeno, E. Trillas","doi":"10.1109/ISMVL.2009.39","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.39","url":null,"abstract":"This paper discusses optimization of fuzzy if-then rule bases by an evolutionary adjustment of the operations considered to use the rules. Adjustment of the operations is made by first parameterizing the operations with the help of either a contracting function or an order automorphism, followed by evolutionary tuning of the parameters. Optimization of a system based on Takagi-Sugeno rules and its distributed implementation are discussed in detail.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114167641","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}
{"title":"Computational Neuroscience and Multiple-Valued Logic","authors":"M. Kawato","doi":"10.1109/ISMVL.2009.70","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.70","url":null,"abstract":"Ten years have passed since the Japanese “Century of the Brain” was promoted, and its most notable objective, the unique “Creating the Brain” approach, has led us to apply a humanoid robot as a neuroscience tool. Here, I explain possible communications between computational neuroscience and multiple-valued logic. I postulate that this “Understanding the Brain by Creating the Brain” approach is the only way to fully understand neural mechanisms in a rigorous sense. Even if we could create an artificial brain, we could not investigate its functions, such as vision or motor control, if we just let it float in incubation fluid in a jar. The brain must be connected to sensors and a motor apparatus so that it can interact with its environment. A humanoid robot controlled by an artificial brain, which is implemented as software based on computational models of brain functions, seems to be the most plausible candidate for this purpose, given currently available technology. With the slogan of “Understanding the Brain by Creating the Brain”, in the mid-80s we started to use robots for brain research (Miyamoto & Kawato 1988), and about 10 different kinds of robots have been used by our group at Osaka University’s Department of Biophysical Engineering, ATR Laboratories, ERATO Kawato Dynamic Brain Project (ERATO 1996-2001), and ICORP Kawato Computational Brain Project (ICOPR 2004-2009).","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344827","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}
{"title":"Equivalence Checking of Reversible Circuits","authors":"R. Wille, Daniel Große, D. Miller, R. Drechsler","doi":"10.1109/ISMVL.2009.19","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.19","url":null,"abstract":"Determining the equivalence of reversible circuits designed to meet a common specification is considered. The circuits' primary inputs and outputs must be in pure logic states but the circuits may include elementary quantum gates in addition to reversible logic gates. The specification can include don't-cares arising from constant inputs, garbage outputs, and total or partial don't-cares in the underlying target function. The paper explores well-known techniques from irreversible equivalence checking and how they can be applied in the domain of reversible circuits. Two approaches are considered. The first employs decision diagram techniques and the second uses Boolean satisfiability. Experimental results show that for both methods, circuits with up to 27,000 gates, as well as adders with more than 100 inputs and outputs, are handled in under three minutes with reasonable memory requirements.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126359095","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}
{"title":"Generalized Discrete Hartley Transforms","authors":"C. Moraga","doi":"10.1109/ISMVL.2009.38","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.38","url":null,"abstract":"R.V. Hartley disclosed a real–valued transform closely related to the Fourier transform in 1942. Besides having interesting properties of its own, the transform introduced by Hartley allows an indirect computation of the Fourier power spectrum of a given function only using real arithmetic. In the last decade some new discrete real–valued orthogonal transforms have been proposed, which are Hartley–related to other known complex–valued ones. The present paper studies (1) the necessary conditions for the existence of a Hartley mate for any complex–valued orthogonal transform and (2) the relationship between the 2D–spectrum of a real–valued Matrix using the complex–valued and the corresponding Hartley transform. 2D transforms are used for picture processing and pattern analysis.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129805246","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}
M. Nii, T. Yamaguchi, Yutaka Takahashi, A. Uchinuno, R. Sakashita
{"title":"Fuzzy Rule Extraction from Nursing-Care Texts","authors":"M. Nii, T. Yamaguchi, Yutaka Takahashi, A. Uchinuno, R. Sakashita","doi":"10.1109/ISMVL.2009.61","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.61","url":null,"abstract":"The nursing care quality improvement is very important for our life. Currently, nursing-care freestyle texts (nursing-care data) are collected from many hospitals in Japan by using Web applications. The collected nursing-care data are stored into the database. To evaluate nursing-care data, we have already proposed a fuzzy classification system, a neural network based system, a support vector machine (SVM) based classification system. Then, in order to improve the classification performance, we have proposed a genetic algorithm (GA) based feature selection method for generating numerical data from collected nursing-care texts.In this paper, we propose a fuzzy rule extraction method from the nursing-care text data. First, features of nursing-care texts are selected by a genetic algorithm based feature selection method. Next, numerical training data are generated by using selected features. Then we train neural networks using generated training data. Finally, fuzzy if-then rules are extracted from the trained neural networks by the parallelized rule extraction method.From computer simulation results, we show the effectiveness of our proposed method.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829955","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}
Takashi Matsuura, H. Shirahama, M. Natsui, T. Hanyu
{"title":"Timing-Variation-Aware Multiple-Valued Current-Mode Circuit for a Low-Power Pipelined System","authors":"Takashi Matsuura, H. Shirahama, M. Natsui, T. Hanyu","doi":"10.1109/ISMVL.2009.52","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.52","url":null,"abstract":"A dynamic current-source control technique in multiplevalued current-mode (MVCM) circuits is proposed for a power-aware pipelined system. An output monitor in each pipeline stage detects that the combinational logic block has completed a computation for a particular piece of input data and its result has been stored into the pipeline register, and generates “operation-completion” signal. All the current sources in the pipeline stage are cut off by using this control signal. The use of this current-source control technique makes it possible to completely eliminate wasted steady current flow during the rest of clock period, which greedily reduces the power dissipation with maintaining the operating frequency. The efficiency of the proposed technique in a simple MVCM circuit is confirmed using HSPICE simulation under 90nm CMOS. The power dissipation of the MVCM circuit using the proposed technique is always less than that of a corresponding CMOS implementation at the operating frequency of 0.8GHz and more.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336200","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}
{"title":"Fixed Polarity Quaternary Transforms Derived from Linearly Independent Transform over GF(2) Structure","authors":"C. C. Lozano, B. Falkowski, T. Luba","doi":"10.1109/ISMVL.2009.30","DOIUrl":"https://doi.org/10.1109/ISMVL.2009.30","url":null,"abstract":"A fixed polarity quaternary linearly independent (FPQLI) transform is introduced in this paper where the basic transforms are derived from the recursive structure of some linearly independent transforms over Galois Field (2) (GF(2)). For some polarities the FPQLI transform for n-variable quaternary functions directly corresponds to the binary fixed polarity Reed-Muller (FPRM) transforms for 2n-variable binary functions. In this paper, the fast flow graph and recursive equations for the FPQLI transform are given together with the underlying basis functions. Formulae for converting the FPQLI spectral coefficient vector from one polarity to another are also given and used to generate a recursive algorithm to obtain the optimal FPQLI expansion with reduced computational cost. Experimental results of the FPQLI transform have been obtained for a set of quaternary test files. Comparison of the obtained results with FPRM over GF(4) as well as the existing recursive quaternary linearly independent transforms show the advantage of applying the concept of fixed polarity to the basic transforms for function minimization in terms of smaller number of nonzero spectral coefficients.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130120715","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}