By Topic

35th International Symposium on Multiple-Valued Logic (ISMVL'05)

Date 19-21 May 2005

Filter Results

Displaying Results 1 - 25 of 51
  • Proceedings. 35th International Symposium on Multiple-Valued Logic

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Message from the Symposium Chairs

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (24 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (24 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (18 KB)
    Freely Available from IEEE
  • List of reviewers

    Publication Year: 2005, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Two new awards

    Publication Year: 2005, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (46 KB) | HTML iconHTML
    Freely Available from IEEE
  • Classical vs Quantum Fingerprinting

    Publication Year: 2005, Page(s):2 - 5
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (125 KB) | HTML iconHTML

    When communication is expensive, the important task of testing two binary strings for equality can be achieved by generating relatively short fingerprints of each string and comparing those fingerprints. Quantum fingerprinting, in which the fingerprint is encoded onto qubits (the quantum version of the bit), is significantly less expensive: exponentially better in the case of no shared randomness ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An abstract axiomatization of the notion of entropy

    Publication Year: 2005, Page(s):8 - 13
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    We present an abstract axiomatization of generalized entropy using the notion of ordinal number and the new concept of systemic set of equivalence relations. The axiomatization applies to arbitrary sets and extends previous results obtained for the finite case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Prior's three-valued modal logic Q

    Publication Year: 2005, Page(s):14 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    Prior proposed a three-valued modal logic Q as a "correct" modal logic from his philosophical motivations. Unfortunately, Prior's Q and many-valued modal logic have been neglected in the tradition of many-valued and modal logic. In this paper, we introduce a version of three-valued Kripke semantics for Q, which aims to establish Prior's ideas based on possible worlds. We investigate formal propert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial ring calculus for many-valued logics

    Publication Year: 2005, Page(s):20 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    This paper discusses a new algebraic proof method for general sentential logics, which is particularly apt for finitely-many-valued logics and for PC, based on reducing polynomials over finite fields. The method can also be extended to cover certain non-finitely valued logics and non-truth-functional logics as well, provided they can be characterized by two-valued dyadic semantics. The resulting m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partially ordered set with residuated t-norm

    Publication Year: 2005, Page(s):26 - 29
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (95 KB) | HTML iconHTML

    We consider properties of partially ordered sets with residuated t-norm and show that 1. If (X;T,0,1) is a bounded partially ordered set with residuated t-norm T, then (X;*,0X,1X) is a bounded BCK-algebra with condition (S); 2. Conversely, if (B;*,0B,1B) is a bounded BCK-algebra with (S), then (B;T,0,1) is the bounded partially ordered set with residuate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A two-bit-per-cell content-addressable memory using single-electron transistors

    Publication Year: 2005, Page(s):32 - 38
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    This paper presents a circuit design of a two-bit-per-cell content-addressable memory (CAM) using single-electron transistors (SETs). The key ideas of the proposed CAM architecture are (i) four-level data storage function implementing by a SET-based static memory cell and (ii) four-level data matching function employing periodic drain-current characteristics of SETs with dynamic phase-shift contro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-valued DNA-based electronic nanodevices

    Publication Year: 2005, Page(s):39 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Biomolecules exhibit electronic properties that can be uniquely utilized in new generation of electronic nanodevices. Complex three-dimensional information processing, computing and memory architectures can be designed and fabricated using self-assembled biomolecules. Those biomolecules can be used as functional multi-terminal interconnected electronic nanobiodevices. We examine DNA-based transist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A design of 10-GHz delta-sigma modulator using a 4-level differential resonant-tunneling quantizer

    Publication Year: 2005, Page(s):43 - 47
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    An ultrahigh-speed continuous-time delta-sigma modulator using a 4-level resonant-tunneling quantizer has been investigated. The quantizer consists of four resonant-tunneling diodes (RTDs) and a source-coupled high-electron-mobility transistor (HEMT) pair, and operates in the fully-differential mode. Circuit simulation shows that the present first-order delta-sigma modulator has a signal-to-noise ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-valued nanoelectronics with fullerenes

    Publication Year: 2005, Page(s):48 - 53
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    This paper researches the electronic characteristics of fullerenes as enabling multi-terminal carbon-based electronic nanodevices. The multi-valued I-V characteristics that can be uniquely utilized in novel three-dimensional (3D) computing architectures. This drastically improves the overall performance. Functionality, density, bandwidth, power losses and other critical performance characteristics... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel ternary switching element using CMOS recharge semi floating-gate devices

    Publication Year: 2005, Page(s):54 - 58
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    In this paper we present a novel voltage mode non-inverting CMOS semi floating-gate (SFG) ternary switching element. The design is applicable for reconstructing or refreshing ternary logic signals. The switching points are tuned using capacitive division. A preliminary simulation results from Cadence Spectre with AMS 0.35 /spl mu/m process parameters c35b4 is included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test generation and fault localization for quantum circuits

    Publication Year: 2005, Page(s):62 - 68
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    It is believed that quantum computing will begin to have a practical impact in industry around year 2010. We propose an approach to test generation and fault localization for a wide category of fault models. While in general we follow the methods used in test of standard circuits, there are two significant differences: (2) we use both deterministic and probabilistic tests to detect faults, (2) we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete bi-decomposition of multiple-valued functions using MIN and MAX gates

    Publication Year: 2005, Page(s):69 - 74
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    In this paper we apply the bi-decomposition on multivalued functions and restrict the decomposition to MIN and MAX gates. It is known from (A. Mishchenko et al., 2001) that the MIN and MAX bi-decomposition leads in general to small multi-level circuits, well understandable for humans. Unfortunately, there does not exist a MIN or MAX bi-decomposition for each multi-valued function. In this paper we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware to compute Walsh coefficients

    Publication Year: 2005, Page(s):75 - 81
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    This paper presents a method to compute a fragment of the Walsh coefficients of logic functions using hardware. First, it introduces the Walsh transformation tree, and shows a method to compute Walsh coefficients using the Walsh transformation tree. Next, it shows the hardware realization for the Walsh tree. The amount of hardware to compute a coefficient and the entire coefficients are O(2n<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three dimensional multi-valued design in nanoscale integrated circuits

    Publication Year: 2005, Page(s):82 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    Novel three-dimensional (3D) nanoscale integrated circuits (nanoICs) are examined in this paper. These nanoICs are synthesized utilizing aggregated 3D neuronal-hypercells (ℵ-hypercells) with multi-terminal electronic nanodevices. The proposed nanodevices ensure multi-valued input-output characteristic that lead to a direct technological solution of multi-valued logic synthesis problem. Super... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-valued logic approach for a systolic AB2 circuit in Galois field

    Publication Year: 2005, Page(s):88 - 93
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    In public key cryptosystems and error-correcting codes over Galois fields, the AB2 operation is an efficient basic operation. The current paper presents the use of multiple-valued logic (MVL) approach to minimize the systolic architecture of AB2 algorithm over binary Galois fields. The design is composed of four basic cells connected in a pipelined fashion. The circuit has be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the partial hyperclone lattice

    Publication Year: 2005, Page(s):96 - 100
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    For any finite set A, the partial clone lattice on A is embedded into the partial hyperclone lattice on A. It is shown that there are maximal intervals in the partial hyperclone lattice and there are four minimal partial hyperclones such that their join contains all partial hyperoperations. It is proved in (T. Drescher et al., 2001) that the mapping λ from the lattice of partial hyperclones... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial clones determined by concatenated relations

    Publication Year: 2005, Page(s):101 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Let k≥2, k be a k-element set, ρ1 and ρ2 two relations on k and let ρ1⊖ρ2 be the concatenation of ρ1 and ρ2. We study the link between the partial clones pPol ρ1∩pPol ρ2 and pPol (ρ1⊖ρ2). Using results arising from this study we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semirigid equivalence relations - a new proof method

    Publication Year: 2005, Page(s):107 - 112
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    We show by a purely relational method that the joint-endomorphism of Zadori's three equivalence relations on a set A, |A|>2 is the clone consisting only of trivial functions, i.e., of the projections and constant functions. We use a so called "Wheatstone bridge" which is a device to yield an equivalence relation θ=W(α,β,γ) from a triple α,β,γ of equivalence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.