2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

26-29 Sept. 2012

Filter Results

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

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

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

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

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

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

    Publication Year: 2012, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (135 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees and reviewers

    Publication Year: 2012, Page(s):xiii - xvii
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Enabling Distributed Intelligent Systems in Open Environments through Agreement Technologies

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

    This paper summarises an invited talk given at the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'12). It first delineates the emerging field of Agreement Technologies, sketching its main technological building blocks and relating them to each other. A scheme is proposed to organise these building blocks outside of the traditional Agreement Technol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive vs. automated proofs in computational origami

    Publication Year: 2012, Page(s): 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (154 KB) | HTML iconHTML

    This talk focuses on two important and subtle aspects in the specification of geometrical modeling. These aspects concern the so-called non-degeneracy and incident conditions. Non-degeneracy ensures that the specification can preclude the possibility that the model in question does not collapse into a degenerate version of the original one. On the other hand, an incident condition specifies that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis from Examples: Interaction Models and Algorithms

    Publication Year: 2012, Page(s):8 - 14
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    Examples are often a natural way to specify various computational artifacts such as programs, queries, and sequences. Synthesizing such artifacts from example based specifications has various applications in the domains of end-user programming and intelligent tutoring systems. Synthesis from examples involves addressing two key technical challenges: (i) design of a user interaction model to deal w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing with Free Algebras

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

    We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers. Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What is an Equation?

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

    The equation concept is one of the most fundamental in mathematics, yet the word "equation" means different things to different people. It is used not only with various precise technical meanings, but also as a metaphor for complex situations. We review some of the history of the equation and its present meaning and use in a variety of settings. Although some languages make distinctions among idea... View full abstract»

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

    Publication Year: 2012, Page(s):30 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    In this manifesto, we develop the "Flexiformalist Program". This may be thought of as a modern extension of Hilbert's "Formalist Program", which solved the foundational crisis of mathematics but remained purely theoretical: Even though formal representations are a prerequisite for computer support in mathematics, formalization is a possibility that is usually unconsummated and thus does not have a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences in Symbolic Computations for Matrix Problems

    Publication Year: 2012, Page(s):39 - 44
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB)

    We review our recent results concerning several computer algebra aspects of determining canonical forms, performing a decomposition and deciding the isomorphism question for matrix problems. We consider them in the language of finite dimensional modules over algebra and the language of square block matrices with an action of elements from some sub algebra of the full matrix algebra. We present an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proposal of Singularization of Approximately Singular Polynomial Systems

    Publication Year: 2012, Page(s):45 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (326 KB) | HTML iconHTML

    By "approximately singular system" we mean a system of multivariate polynomials the dimension of whose variety is increased by small amounts of perturbations. By "singularization" we mean determining small perturbations such that the dimension of the variety of the perturbed system increases. We prove a theorem which says, roughly speaking, that the existence of approximately linear-dependent rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Robust Glucose-Insulin Control by Dixon Resultant Computations

    Publication Year: 2012, Page(s):53 - 61
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    We present a symbolic approach towards solving the Bergman three-state minimal patient model of glucose metabolism. Our work first translates the Bergman three state minimal patient model into the modified control algebraic Riccati equation. Next, the modified control algebraic Ricatti equation is reduced to a system of polynomial equations, and an optimal (minimal) solution of these polynomials i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational Properties of Two P Systems Solving the 3-colouring Problem

    Publication Year: 2012, Page(s):62 - 69
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    Membrane computing, the research field initiated by Gheorghe Paun in 1998, defines computational models, called P systems, inspired by the behavior and structure of the living cell. Many variants of P systems have been introduced and also used as formal modeling and verification tools. Recently, kernel P systems were introduced as an unifying framework for P systems, which integrates many features... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic Theory Exploration: A Comparison of Technologies

    Publication Year: 2012, Page(s):70 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    We present a case study in comparing tools for theory exploration in finite algebra. Our aim is to compare experimentally diverse technologies for generating finite algebraic structures. In particular, we compare the performance of model generators, constraint solvers and satisfiability solvers in their ability to generate large algebraic structures, in our case quasigroups, that exhibit some desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Model Reference Type Algorithm Using Importance Resampling

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

    We describe a new version of Model Reference Adaptive Search algorithm which uses a sampling importance resampling phase. This method has in background a sequence of reference distributions introduced mainly for theoretical purposes - at each step is considered the closest distribution to the corresponding reference distribution. Our main contribution is to resample using this references, i.e., th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc

    Publication Year: 2012, Page(s):83 - 88
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    In considering the reliability of numerical programs, it is normal to ``limit our study to the semantics dealing with numerical precision'' (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that essentially ignores the numerics. The thesis of this paper is that there is a class of problems that fall between these two, which could be described as ``does... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Computing Mesh Root Systems and the Isotropy Group for Simply-laced Dynkin Diagrams

    Publication Year: 2012, Page(s):91 - 97
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11, Timisoara, September 2011 [6]) of the root systems in the sense of Bourbaki [4], the mesh geometries Γ(RΔ, ΦA) of roots of Δ in the sense of [20], and matrix morsifications A ∈ MorΔ, for simply-laced Dynkin diagrams Δ ∈... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Homotopy Asymptotic Method for Solving a Nonlinear Problem in Elasticity

    Publication Year: 2012, Page(s):98 - 102
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    In this paper a homotopy approach, called the optimal homotopy asymptotic method (OHAM) is presented as a new and powerful technique for analytical treatment of a nonlinear problem related to the stress and deformation state of a thin elastic plate. This technique combines the features of the homotopy concept with an efficient computational algorithm which provides a simple and rigorous procedure ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experimental Study on Parallel Methods for Solving Systems of Equations

    Publication Year: 2012, Page(s):103 - 107
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    The paper presents experimental results on parallel variants of some classical methods for solving systems of equations. The following four methods are studied: Newton method, Chebyshev method, Gradient method with Fridman control sequence, a method of conjugate gradient type. The main conclusion is that the precondition of the sparse systems (both linear and nonlinear) improves in a great extent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Labelled Tableaux for Temporal Logic with Cardinality Constraints

    Publication Year: 2012, Page(s):111 - 118
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (811 KB) | HTML iconHTML

    Frequently when formalising systems that change over time, we must represent statements, coming from physical constraints or representational issues, stating that exactly n literals (or less than n literals) of a set hold. While we can write temporal formulae to represent this information, such formulae both complicate and increase the size of the specification and adversely affect the performance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving, Reasoning, and Programming in Common Logic

    Publication Year: 2012, Page(s):119 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    Common Logic (CL) is a recent ISO standard for exchanging logic-based information between disparate computer systems. Sharing and reasoning upon knowledge represented in CL require equation solving over terms of this language. We study computationally well-behaved fragments of such solving problems and show how they can influence reasoning in CL and transformations of CL expressions. View full abstract»

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