By Topic

Multiple-Valued Logic (ISMVL), 2014 IEEE 44th International Symposium on

Date 19-21 May 2014

Filter Results

Displaying Results 1 - 25 of 55
  • [Front cover]

    Publication Year: 2014 , Page(s): C4
    Request Permissions | PDF file iconPDF (1238 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2014 , Page(s): i
    Request Permissions | PDF file iconPDF (110 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2014 , Page(s): iii
    Request Permissions | PDF file iconPDF (145 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2014 , Page(s): iv
    Request Permissions | PDF file iconPDF (122 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2014 , Page(s): v - viii
    Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • Message from the Symposium Chair

    Publication Year: 2014 , Page(s): ix
    Request Permissions | PDF file iconPDF (70 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2014 , Page(s): x
    Request Permissions | PDF file iconPDF (70 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Committee Members

    Publication Year: 2014 , Page(s): xi
    Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2014 , Page(s): xii
    Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE
  • An Update Method for a CAM Emulator Using an LUT Cascade Based on an EVMDD (K)

    Publication Year: 2014 , Page(s): 1 - 6
    Request Permissions | Click to expandAbstract | PDF file iconPDF (238 KB) |  | HTML iconHTML  

    Core routers perform longest prefix matching (LPM) using content addressable memories (CAMs). With the rapid growth of the Internet, LPM has become the bottleneck in network traffic management. In a previous publication, we have proposed an area-efficient and high-performance CAM emulator using an LUT cascade based on an edge-valued multi-valued decision diagram (EVMDD (k)). In the inter-net, regi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lower Bound on the Number of Variables to Represent Incompletely Specified Index Generation Functions

    Publication Year: 2014 , Page(s): 7 - 12
    Request Permissions | Click to expandAbstract | PDF file iconPDF (214 KB) |  | HTML iconHTML  

    Given an incompletely specified index generation function, the number of variables to represent the function can often be reduced by properly assigning don't care values. In this paper, we derive a lower bound on the number of variables necessary to represent a given incompletely specified index generation function. We also derive three properties of incompletely specified index generation functio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Number of S-Threshold Functions on Not Necessarily Binary Input

    Publication Year: 2014 , Page(s): 13 - 18
    Request Permissions | Click to expandAbstract | PDF file iconPDF (204 KB) |  | HTML iconHTML  

    In this paper we consider S-threshold functions defined on not necessarily binary input. By S-threshold function, in an arbitrary dimension we mean a function which can be written as a linear combination of monomials from a predefined set. First, we determine sets of discrete moments which uniquely determine such functions. Based on these, we derive a generic formula for the upper bound of the fun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Maiorana Method to Generate Multiple-Valued Bent Functions Revisited

    Publication Year: 2014 , Page(s): 19 - 24
    Request Permissions | Click to expandAbstract | PDF file iconPDF (213 KB) |  | HTML iconHTML  

    A matrix-based formal representation of the Maiorana Method to generate MV-bent functions is introduced and a proof of correctness is given. The generation of bent, and strict bent multiple-valued functions is analyzed. It is shown that all bent functions generated with the Maiorana method are strict bent. Finally it is shown that the number of ternary bent functions of 4 arguments is at least 708... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Valued Problem Solvers -- Comparison of Several Approaches

    Publication Year: 2014 , Page(s): 25 - 31
    Request Permissions | Click to expandAbstract | PDF file iconPDF (198 KB) |  | HTML iconHTML  

    Solving a multiple-valued problem means to assign values to a given set of multiple-valued variables such that certain conditions are satisfied. The solution of a multiple-valued problem is a subset of vk v-valued tuples of the length k, where k is the number of variables and v is the number of their possible values. This paper compares several approaches which solve such problems. These ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-Valued MinSAT Solving

    Publication Year: 2014 , Page(s): 32 - 37
    Request Permissions | Click to expandAbstract | PDF file iconPDF (176 KB) |  | HTML iconHTML  

    Solving combinatorial optimization problems via their reduction to Boolean MinSAT is an emerging generic problem solving approach. In this paper we extend MinSAT with many-valued variables, and refer to the new formalism as Many-Valued MinSAT. For Many-Valued MinSAT, we describe an exact solver, Mv-MinSatz, which builds on the Boolean branch-and-bound solver MinSatz, and exploits the domain inform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic Games with Backtracking for Fuzzy Logics

    Publication Year: 2014 , Page(s): 38 - 43
    Request Permissions | Click to expandAbstract | PDF file iconPDF (203 KB) |  | HTML iconHTML  

    Hintikka's game theoretic semantics for classical connectives and quantifiers has been generalized to many-valued logics in various ways. After providing a short overview, we introduce a new type of semantic games: backtracking games, where a stack of formulas is used to store information on how to continue the game even after reaching an atomic formula. We present backtracking games for the three... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural Spike Compression Using Feature Extraction and a Fuzzy C-Means Codebook

    Publication Year: 2014 , Page(s): 44 - 48
    Request Permissions | Click to expandAbstract | PDF file iconPDF (726 KB) |  | HTML iconHTML  

    The live implantation of micro-electrode arrays allows the observation of populations of neural activity. There is a strong need for unsupervised adaptable neural spike extraction and spike-sorting methods, which would significantly reduce data throughput and allow for implantation and wireless transmission. We present a method for neural spike feature-extraction that involves the generation and u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concrete Dualities and Essential Arities

    Publication Year: 2014 , Page(s): 49 - 54
    Request Permissions | Click to expandAbstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    Many dualities arise in the same way: they are induced by dualizing objects. We show that these dualities are connected to a question occurring in universal algebra. Indeed, they cause a strong interplay between the essential arity of finitary operations in one category and the concrete form of the copowers in the other. We elaborate on this connection and its usefulness for universal algebra and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximal and Minimal Closed Classes in Multiple-Valued Logic

    Publication Year: 2014 , Page(s): 55 - 60
    Request Permissions | Click to expandAbstract | PDF file iconPDF (197 KB) |  | HTML iconHTML  

    We consider classes of operations in multiple-valued logic that are closed under composition as well as under permutation of variables, identification of variables (diagonalization) and introduction of inessential variables (cylindrification). Such closed classes on a given finite set form a complete lattice that includes the lattice of clones as the principal filter above the trivial clone. We de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Key Relations Preserved by a Weak Near-Unanimity Function

    Publication Year: 2014 , Page(s): 61 - 66
    Request Permissions | Click to expandAbstract | PDF file iconPDF (193 KB) |  | HTML iconHTML  

    In the paper we introduce a notion of a key relation, which almost coincides with the notion of a critical relation introduced by Keith A. Kearnes and Ágnes Szendrei. We show that we need only key relations to describe all clones on finite sets. We describe the set of all key relations on 2 elements, this set consists of all relations that can be defined as a disjunction of linear equation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a Quaternary Single-Ended Current-Mode Circuit for an Energy-Efficient Inter-chip Asynchronous Communication Link

    Publication Year: 2014 , Page(s): 67 - 72
    Request Permissions | Click to expandAbstract | PDF file iconPDF (439 KB) |  | HTML iconHTML  

    A single-ended-style current-mode circuit with quaternary current signaling is proposed for an energy-efficient asynchronous communication link. The use of quaternary-encoded current signaling and dynamic current-feedback mechanism makes information density twice per wire because of small signal-voltage swing with maintaining high-speed switching capability, which resulting in energy-efficient asy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-binary Successive Approximation Analog-to-Digital Converters: A Survey

    Publication Year: 2014 , Page(s): 73 - 78
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (493 KB) |  | HTML iconHTML  

    Low-power successive-approximation (SA) analog-to-digital converters (ADCs) are attracting increasing attention these days in biomedical and sensor network applications. The binary search algorithm is one of the basic idea behind how they obtain a binary code representing an analog input. In practice, the imperfectness of analog circuit elements sometimes results in decision errors and decreases t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant Geometry Algorithms for Galois Field Expressions and Their Implementation on GPUs

    Publication Year: 2014 , Page(s): 79 - 84
    Request Permissions | Click to expandAbstract | PDF file iconPDF (206 KB) |  | HTML iconHTML  

    Galois field (GF) expressions are analytical representations of multiple-valued functions. For practical applications it is important to provide fast algorithms for computing coefficients in these expressions. From the FFT-theory point of view, these algorithms are Cooley-Tukey type algorithms based on the Good-Thomas factorization derived from the Kronecker product structure of the GF-transform m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomially Closed Co-clones

    Publication Year: 2014 , Page(s): 85 - 90
    Request Permissions | Click to expandAbstract | PDF file iconPDF (227 KB) |  | HTML iconHTML  

    Two well-studied closure operators for relations are based on primitive positive (p.p.) definitions and quantifier free p.p. definitions. The latter do however have limited expressiveness and the corresponding lattice of strong partial clones is uncountable. We consider implementations allowing polynomially many existentially quantified variables and obtain a dichotomy for co-clones where such imp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial R-Clones

    Publication Year: 2014 , Page(s): 91 - 96
    Request Permissions | Click to expandAbstract | PDF file iconPDF (232 KB) |  | HTML iconHTML  

    In [11] the first author introduced a type of partial clones as the intersection of some special infinite descending chains similar to I. Rosenberg [12] in the case of total clones. We provide a characterization of these clones in terms of their invariants, and propose a generalization of such clones, which we call partial R-clones. We show that there are only finitely many partial R-clones. Furth... View full abstract»

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