By Topic

Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on

Date 26-29 Sept. 2008

Filter Results

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

    Publication Year: 2008 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (529 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (22 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (68 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (104 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008 , Page(s): v - xi
    Save to Project icon | Request Permissions | PDF file iconPDF (176 KB)  
    Freely Available from IEEE
  • Preface and Conference Organization

    Publication Year: 2008 , Page(s): xii - xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (108 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Multi-Domain Logic and its Applications to SAT

    Publication Year: 2008 , Page(s): 3 - 8
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (186 KB) |  | HTML iconHTML  

    We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the satisfiability problem (SAT). A multi-domain logic (MDL) formula is quantifier-free and contains only atoms of the form x isin A, where x is a variable and A is a constant set. For formulae in conjunctive normal form, we are interested in finding sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communicating Mathematics via Pen-Based Interfaces

    Publication Year: 2008 , Page(s): 9 - 18
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2375 KB) |  | HTML iconHTML  

    We address the question of how to organize pen-based interfaces for mathematical software systems, both for computational mathematics packages and document processing software. Our architecture includes components for ink collection, mathematically-oriented recognizers, portability support and interfaces to applications. We summarize aspects of mathematical handwriting recognition and discuss the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Numbers for Quantum Key Distribution

    Publication Year: 2008 , Page(s): 19
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (124 KB)  

    Quantum key distribution (QKD) has seen an important development for the last ten years. Nowadays, different companies offer commercial solutions and key exchanges at pulse rates of up to 1 GHz and over distances of up to 200 km have been demonstrated in research labs. However, the generation of random bit strings has often been neglected and it remains a technical problem, as physical random numb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Rewriting in Computational Origami

    Publication Year: 2008 , Page(s): 20 - 27
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (292 KB) |  | HTML iconHTML  

    We give graph-theoretic formalization of origami, the art of paper folding. Starting from the abstract origami system, we model origami construction as are write sequence of abstract origami's. To reason about the entire origami construction for the computational purposes, we define a labeled hypergraph for origami and give the abstraction of origami fold as a set of algebraic graph rewrite rules.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Triangular Decomposition for Algebraic and Geometric Computing

    Publication Year: 2008 , Page(s): 28
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (124 KB)  

    In this talk, we present several algorithms for decomposing systems of multivariate polynomials into triangular systems of various kinds. The algorithms have been efficiently implemented and successfully applied to numerous problems of scientific computing, ranging over computational polynomial algebra, automated geometric reasoning, solving systems of nonlinear equations, qualitative analysis of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expansions and Equivalence of Queries Using Views with Parameters and Negation

    Publication Year: 2008 , Page(s): 31 - 38
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (279 KB) |  | HTML iconHTML  

    In this paper we represent a class of queries that contain sub-formulas with universally quantified variables using views. The queries and views considered can contain input parameters. Both views and queries are expressed as unions of conjunctive formulas, where the predicates of literals are views or database relations. The negation is allowed in body views or body queries. We study the equivale... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi

    Publication Year: 2008 , Page(s): 39 - 46
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (246 KB) |  | HTML iconHTML  

    A unified approach is developed for constructing first-order cut-free sequent calculi without equality representing two classes of modal logics in dependence of whether classical logic or intuitionistic one is taken as a basis. It uses the original notions of admissibility and compatibility, which, in general, permits to avoid skolemization being a forbidden operation for the logics under consider... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatization of Credulous Reasoning in Default Logics using Sequent Calculus

    Publication Year: 2008 , Page(s): 47 - 53
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (269 KB) |  | HTML iconHTML  

    The family of default logics formalize the default reasoning using nonmonotonic inference rules called defaults. In this paper we propose a uniform abstract characterization of credulous default inference associated to all versions (classical, justified, constrained, rational) of propositional default logic using the credulous default sequent calculi. These axiomatic systems combine sequent and an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-Well-Founded Probabilities and Coinductive Probability Logic

    Publication Year: 2008 , Page(s): 54 - 57
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (182 KB) |  | HTML iconHTML  

    One of the most useful computer algebra used today is calgebra and its versions, e.g. stream calculus. In the paper I show that p-adic arithmetic can be regarded as one of the natural interpretation of stream calculus on a finite set of positive integers. Further, I define probabilities on streams using bisimulation and construct probability logic with non-well-founded syntax and non-well-founded ... View full abstract»

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

    Publication Year: 2008 , Page(s): 61 - 68
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (239 KB)  

    We present an approach to basic arithmetic between abstract matrices, i.e., matrices of symbolic dimension with underspecified components. We define a simple basis function that enables the representation of abstract matrices composed of arbitrary regions in a single term that supports matrix addition and multiplication by regular arithmetic on terms. This can, in particular, be exploited to obtai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter

    Publication Year: 2008 , Page(s): 69 - 76
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (241 KB) |  | HTML iconHTML  

    We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. We are looking for the pointwise solutions, i.e., the solutions for the unknowns in dependence of the value of the parameter. Solving Diophantine equations is central to computing the data dependences of certain codes (loops with certain array accesses) which often occur in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Groebner Bases and Solutions to Diophantine Equations

    Publication Year: 2008 , Page(s): 77 - 80
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (201 KB) |  | HTML iconHTML  

    The aim of this paper is to discuss a novel application of Grobner bases in the study of Diophantine equations. The idea appeared during some work on the number of solutions of systems of Pell equations, but can be useful in other circumstances as well. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complementaries of Greek Means with Respect to the Logarithmic Mean

    Publication Year: 2008 , Page(s): 81 - 84
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (182 KB) |  | HTML iconHTML  

    The mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in some families of means. Most of the computations are performed with the symbolic capabilities of the Maple computer algebra system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rewrite Stack Machine for ROC!

    Publication Year: 2008 , Page(s): 85 - 91
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (261 KB) |  | HTML iconHTML  

    ROC! is a deterministic rewrite strategy language which includes the rewrite rules as basic operators, and the deterministic choice and the repetition as high-level strategy operators. In this paper we present a method which, for a given term Rewriting system (TRS) R, constructs a new TRS Rmacr such that R-rewriting is equivalent (sound and complete) with Rmacr-rewriting constrained by ROC!. Since... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lexical Chains Segmentation in Summarization

    Publication Year: 2008 , Page(s): 95 - 101
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (202 KB) |  | HTML iconHTML  

    In this paper we propose a new method of linear text segmentation based on lexical cohesion of a text. The usual steps (to compute the lexical chains according to relatedness criteria, to score the chains after different parameters,to select the strong chains, to obtain the segments) are replaced by a single procedure. Namely, a single chain of disambiguated words in a text is established and the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supply Chain Risk Management by Mining Business Dependencies

    Publication Year: 2008 , Page(s): 102 - 109
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (407 KB) |  | HTML iconHTML  

    Current supply chain risk management techniques rely on the integration of the business information systems of the entities forming the supply chain. The method is well-suited for small and medium entities, but large Entities are rather reticent in integrating Information Systems with the ones of SMEs. This article presents a risk-reduction mechanism based on mining Business Dependencies that were... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grammar-Based Automatic Extraction of Definitions

    Publication Year: 2008 , Page(s): 110 - 115
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (249 KB) |  | HTML iconHTML  

    The paper describes the development and usage of a grammar developed to extract definitions from documents. One of the most important practical usages of the developed grammar is the automatic extraction of definitions from web documents. Three evaluation scenarios were run, the results of these experiments being the main focus of the paper. One scenario uses an e-learning context and previously a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building a Textual Entailment System for the RTE3 Competition. Application to a QA System

    Publication Year: 2008 , Page(s): 116 - 122
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (185 KB) |  | HTML iconHTML  

    Textual entailment recognition (RTE) is the task of deciding, when given two text fragments, whether the meaning of one text is entailed (can be inferred) from the other text. Last year, we built our first Textual Entailment (TE) system, with which we participated in the RTE3 competition. The main idea of this system is to transform the hypothesis making use of extensive semantic knowledge from so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering Heterogeneous Web Data using Clustering by Compression. Cluster Validity

    Publication Year: 2008 , Page(s): 123 - 126
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (316 KB) |  | HTML iconHTML  

    The expansive nature of the Internet produced a vast quantity of unstructured data, compared to our conception of a conventional data base. The application of clustering on the World Wide Web is essential to get structured information from this sea of information. In this paper, we intend to test the results of a new clustering technique - clustering by compression - when applied to heterogeneous ... View full abstract»

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