By Topic

2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

21-24 Sept. 2015

Filter Results

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

    Publication Year: 2015, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (249 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2015, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2015, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (118 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2015, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2015, Page(s):v - xii
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2015, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (142 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2015, Page(s):xv - xvi
    Request permission for commercial reuse | PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • Program Committees

    Publication Year: 2015, Page(s):xvii - xix
    Request permission for commercial reuse | PDF file iconPDF (138 KB)
    Freely Available from IEEE
  • Additional Reviewers

    Publication Year: 2015, Page(s): xx
    Request permission for commercial reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • From Decision Procedures to Synthesis Procedures

    Publication Year: 2015, Page(s):3 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (370 KB) | HTML iconHTML

    Software synthesis is a technique for automatically generating code from a given specification. The goal of software synthesis is to make software development easier while increasing both the productivity of the programmer and the correctness of the produced code. In this paper we present an approach to synthesis that relies on the use of automated reasoning and decision procedures. First we descr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Creative Telescoping via Hermite Reduction

    Publication Year: 2015, Page(s): 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (110 KB) | HTML iconHTML

    We give an overview over various techniques forcreative telescoping, starting from the classical algorithms andending with the most recent approaches based on Hermite reduction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic Logic-Based Verification with SeaHorn

    Publication Year: 2015, Page(s):12 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    In this tutorial, I will present SeaHorn, a software verification framework. The key distinguishing feature of SeaHorn is its modular design that separates the concerns of the syntax of the programming language, its operational semantics, and the verification semantics. SeaHorn encompasses several novelties: it (a) encodes verification conditions using an efficient yet precise inter-procedural tec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web Application Security Using JSFlow

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

    Web applications are often vulnerable to code injection attacks and to attacks through buggy or malicious libraries. Unfortunately, the current protection mechanisms are frequently ad-hoc, as a response to attacks after the fact. This had lead to a plethora of specialized protection mechanisms that are often brittle and insufficient to guarantee security. This extended abstract accompanies a tutor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building a Nature-Inspired Computer

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

    Summary form only given. Since the before birth of computers we have strived to make intelligent machines that share some of the properties of our own brains. We have tried to make devices that quickly solve problems that we find time consuming, that adapt to our needs, and that learn and derive new information. In more recent years we have tried to add new capabilities to our devices: self-adapta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned

    Publication Year: 2015, Page(s): 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB) | HTML iconHTML

    Many prominent NP-hard problems have been shown tractable for bounded treewidth. To put these results to practice, dynamic programming (DP) via a traversal of the nodes of a tree decomposition is the standard technique. However, the concrete implementation of suitable efficient algorithms is often tedious. To this end, we have developed the D-FLAT system, which [1]-[4] allows the user to specify t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic Derivation of Mean-Field PDEs from Lattice-Based Models

    Publication Year: 2015, Page(s):27 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    Transportation processes, which play a prominent role in the life and social sciences, are typically described by discrete models on lattices. For studying their dynamics a continuous formulation of the problem via partial differential equations (PDE) is employed. In this paper we propose a symbolic computation approach to derive mean-field PDEs from a lattice-based model. We start with the micros... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction

    Publication Year: 2015, Page(s):34 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    Let F(x, u1,..., uℓ) be a squarefree multivariate polynomial in main variable x and sub-variables u1,..., uℓ. We say that the leading coefficient (LC) of F is singular if it vanishes at the origin of sub-variables. A representative algorithm for nonsparse multivariate polynomial GCD is the EZ-GCD algorithm, which is based on the generalized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lagrange Inversion and Lambert W

    Publication Year: 2015, Page(s):42 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    We show that Lagrange inversion can be used to obtain closed-form expressions for a number of series expansions of the Lambert W function. Equivalently, we obtain expressions for the nth derivative. Various integer sequences related to the series expansions now can be expressed in closed form. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards an Automatic Tool for Multi-scale Model Derivation Illustrated with a Micro-mirror Array

    Publication Year: 2015, Page(s):47 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    This paper reports recent advances in the development of a symbolic asymptotic modeling software package, called MEMSALab, which will be used for automatic generation of asymptotic models for arrays of micro and nanosystems. More precisely, a model is a partial differential equation and an asymptotic method approximate it by another partial differential equation which can be numerically simulated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of Stirling Numbers and Generalizations

    Publication Year: 2015, Page(s):57 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (151 KB) | HTML iconHTML

    We consider the computation of Stirling numbers and generalizations for positive and negative arguments. We describe computational schemes for Stirling Partition and Stirling Cycle numbers, and for their generalizations to associated Stirling numbers. The schemes use recurrence relations and are more efficient than the current method used in Maple for cycle numbers, which is based on an algebraic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic Petri Nets Emulator

    Publication Year: 2015, Page(s):61 - 65
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    Petri Nets (PN) are a consolidated formal model for distributed systems. Classical PNs however are inadequate to model structural changes in systems' lifecycle. Many different attempts to face this issue have lead to lot of PN extensions, of particular concern are those matching the so called "nets within nets" paradigm. We present an alternative to this paradigm rigorously based on classical SP E... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rigorous Generic Branch and Bound Solver for Nonlinear Problems

    Publication Year: 2015, Page(s):71 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    Recursive branch and bound algorithms are often used, either rigorouslyor non-rigorously, to refine and isolate solutions to global optimizationproblems or systems of equations and inequalities involving nonlinearfunctions. The presented software library, Kodiak, integrates numericand symbolic computation into a generic framework for the solution of suchproblems over hyper-rectangular variable and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifiability and Noise Robustness for l1-Analysis Regularizations in Compressive Sensing

    Publication Year: 2015, Page(s):79 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    We use several geometric techniques to characterize identifiability and to estimate noise robustness in the framework of l1-analysis regularization. This extends several recent theoretical results and algorithms that deal with the same issues in the less complex case of l1-synthesis regularizations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical Investigations of Equilibriums in a Flight with High Angle of Attack

    Publication Year: 2015, Page(s):85 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB) | HTML iconHTML

    This paper is a case study which presents numericalinvestigations based on the theoretical background developed in [1]. The purpose is to numerically investigate the existence and the stability of equilibriums, as well as the existence of possible bifurcation at an equilibrium point for a set of given aero-dynamic data. The computations are performed in the framework of the non-simplified Aero-Dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Arithmetic of Even-Odd Trees

    Publication Year: 2015, Page(s):90 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    Even-Odd Trees are a canonical tree-based number representation derived from a bijection between trees defined by the data type equation T = 1+T *T* +T *T* and positive natural numbers seen as iterated applications of o(x) = 2x and i(x) = 2x + 1 starting from 1. This paper introduces purely functional arithmetic algorithms for operations on Even-Odd Trees. While within constant factors from their ... View full abstract»

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