# 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

## Filter Results

Displaying Results 1 - 25 of 85
• ### [Front cover]

Publication Year: 2013, Page(s): C4
| |PDF (371 KB)
• ### [Title page i]

Publication Year: 2013, Page(s): i
| |PDF (17 KB)
• ### [Title page iii]

Publication Year: 2013, Page(s): iii
| |PDF (109 KB)

Publication Year: 2013, Page(s): iv
| |PDF (126 KB)

Publication Year: 2013, Page(s):v - x
| |PDF (198 KB)
• ### Preface

Publication Year: 2013, Page(s):xi - xii
| |PDF (133 KB) | HTML
• ### SYNASC 2013 Chairs and Committees

Publication Year: 2013, Page(s):xiii - xiv
| |PDF (153 KB)
• ### Reviewers

Publication Year: 2013, Page(s):xv - xix
| |PDF (245 KB)
• ### Reducing Energy Consumption by Using Clouds

Publication Year: 2013, Page(s):3 - 4
Cited by:  Papers (1)
| |PDF (262 KB) | HTML

Cloud computing is a promising technology for the realization of large, scalable, and on-demand provisioned computing infrastructures. Currently, many enterprises are adopting Clouds to achieve high performance and scalability for their applications while maintaining low costs. Service provisioning in the Cloud is based on a set of predefined nonfunctional properties specified and negotiated by me... View full abstract»

• ### TiMo: Timed Mobility in Distributed Systems

Publication Year: 2013, Page(s):5 - 10
| |PDF (186 KB) | HTML

A simple and expressive formalism called TiMo is presented as a simplified version of timed distributed pi-calculus. TiMo aims to bridge the gap between the existing theoretical approach of process calculi and forthcoming realistic languages for multi-agent systems. View full abstract»

• ### Model-Driven Decision Procedures for Arithmetic

Publication Year: 2013, Page(s): 11
| |PDF (215 KB)

Summary form only given, as follows. Considering the theoretical hardness of SAT, the astonishing adeptness of SAT solvers when attacking practical problems has changed the way we perceive the limits of algorithmic reasoning. Modern SAT solvers are based on the idea of conflict driven clause learning (CDCL). The CDCL algorithm is a combination of an explicit backtracking search for a satisfying as... View full abstract»

• ### Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification

Publication Year: 2013, Page(s):12 - 19
| |PDF (463 KB) | HTML

We present computer-assisted construction of regular polygons by knot paper fold. The construction is completed with an automated proof based on algebraic methods. Given a rectangular origami or a finite tape, both of an adequate length, we can construct the simplest knot by making three folds. The shape of the knot is made to be a regular pentagon if we fasten the tape tightly without destroying ... View full abstract»

• ### Survey of Covering Arrays

Publication Year: 2013, Page(s):20 - 27
Cited by:  Papers (6)
| |PDF (446 KB) | HTML

Covering Arrays(CA) are combinatorial objects that have been used succesfully to automate the generation of test cases for software testing. The CAs have the features of being of minimal cardinality (i.e. minimize the number of test cases), and maximum coverage (i.e. they guarantee to cover all combinations of certain size between the input parameters). Only in few cases there is known an optimal ... View full abstract»

• ### Specifying Languages and Verifying Programs with K

Publication Year: 2013, Page(s):28 - 31
Cited by:  Papers (1)
| |PDF (259 KB) | HTML

K is a rewrite-based executable semantic framework for defining languages. The K framework is designed to allow implementing a variety of generic tools that can be used with any language defined in K, such as parsers, interpreters, symbolic execution engines, semantic debuggers, test-case generators, state-space explorers, model checkers, and even deductive program verifiers. The latter are based ... View full abstract»

• ### Minability through Compression

Publication Year: 2013, Page(s):32 - 36
| |PDF (330 KB) | HTML

We offer an experimental proof that the application of compression to data files can be used as a evaluation technique for minability of the data. This is based on the fact that the presence of patterns embedded in data has an influence of compressibility. View full abstract»

• ### Stepping Up

Publication Year: 2013, Page(s):37 - 41
| |PDF (506 KB) | HTML

Computational simulation is an important research tool for modern scientists. There are a range of different scales of high performance computing (HPC) resources available to scientists, from laptop and desktop machines, to small institutional clusters, to national HPC resources, and the largest parallel computers in the world. This paper outlines the challenges that developers and users face movi... View full abstract»

• ### Computing Origami Universal Molecules with Cyclic Tournament Forests

Publication Year: 2013, Page(s):42 - 49
Cited by:  Papers (2)
| |PDF (1101 KB) | HTML

Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a convex polygonal region (the "paper") having a certain metric relationship with the tree. It computes a crease- pattern which allows for the paper to "fold" to a uniaxial base, which is a 3-dimensional shape projecting onto the given tree. Lang's universal molecule algorithm ... View full abstract»

• ### A "Piano Movers" Problem Reformulated

Publication Year: 2013, Page(s):53 - 60
| |PDF (386 KB) | HTML

It has long been known that cylindrical algebraic decompositions (CADs) can in theory be used for robot motion planning. However, in practice even the simplest examples can be too complicated to tackle. We consider in detail a Piano Mover's Problem'' which considers moving an infinitesimally thin piano (or ladder) through a right-angled corridor. Producing a CAD for the original formulation of t... View full abstract»

• ### Identifying Features via Homotopy on Handwritten Mathematical Symbols

Publication Year: 2013, Page(s):61 - 67
| |PDF (658 KB) | HTML

In handwritten mathematics, it is common to have characters in various sizes and for writing not to follow simple baselines. For example, subscripts and superscripts appear relatively smaller than normal text and are written slightly below or above it. Rather than use the location, features and size to identify the character, it may be more effective to do the reverse --- to use knowledge about sp... View full abstract»

• ### On Computing Non-negative Loop-Free Edge-Bipartite Graphs

Publication Year: 2013, Page(s):68 - 75
Cited by:  Papers (1)
| |PDF (346 KB) | HTML

We continue the Coxeter spectral study of finite connected loop-free edge-bipartite graphs Δ, with n ≥ 2 vertices (a class of signed graphs), started in [SIAM J. Discrete Math., 27(2013), 827-854] by means of the complex Coxeter spectrum speccΔ ⊆ ℂ. Here, we discuss Coxeter spectral analysis problems of non-negative edge-bipartite graphs of corank s &#... View full abstract»

• ### Common Factors in Fraction-Free Matrix Reduction

Publication Year: 2013, Page(s):76 - 80
| |PDF (229 KB) | HTML

We consider LU factoring of matrices in the context of exact and symbolic computation, as opposed to floating-point computation. Although initially developed for Gaussian elimination, fraction-free methods have been extended to LU factoring and related forms. We present surprising evidence that the rows and columns of the three matrices in the fraction-free form contain more common factors than on... View full abstract»

• ### On Algebraic Preprocessing of Floating-Point DAEs for Numerical Model Simulation

Publication Year: 2013, Page(s):81 - 88
Cited by:  Papers (1)
| |PDF (290 KB) | HTML

This paper investigates the cancellation errors which may occur in algebraic preprocessing with floating-point numbers, of numerical model simulation. We consider two operations, the substitution of a polynomial for terms of other polynomials and solving system of parametric linear equations. For the first operation, we clarify that the "gsystematic term-cancellation" may cause large errors and pr... View full abstract»

• ### Deciding Conjugacy in Thompson's Group F in Linear Time

Publication Year: 2013, Page(s):89 - 96
| |PDF (345 KB) | HTML

We present an efficient implementation of the solution to the conjugacy problem in Thompson's group F, a certain infinite group whose elements are piecewise-linear homeomorphisms of the unit interval. This algorithm checks for conjugacy by constructing and comparing directed graphs called strand diagrams. We provide a comprehensive description of our solution algorithm, including the data structur... View full abstract»

• ### On Ladder Operators for Little q-Jacobi Polynomials and Their Generalizations

Publication Year: 2013, Page(s):97 - 103
| |PDF (245 KB) | HTML

In this paper we study the ladder operators for little q-Jacobi polynomials and for polynomials orthogonal with respect to a generalized q-Jacobi weight. We also briefly discuss the computational aspects in the computer algebra system Mathematica (www.wolfram.com). View full abstract»

• ### Efficient Computation of the Isotropy Group of a Finite Graph: A Combinatorial Approach

Publication Year: 2013, Page(s):104 - 111
Cited by:  Papers (4)
| |PDF (354 KB) | HTML

We continue a Coxeter spectral study of finite posets and edge-bipartite graphs (a class of signed graphs in the sense of Harary and Zaslavsky). Here we are interested in two problems. First: whether the incidence matrices CI and CJ of two connected positive posets I and J are Z-congruent if and only if the Coxeter spectra of I and J coincide. Second: the problem if any square integer matrix A E M... View full abstract»