By Topic

Symbolic and Numeric Algorithms for Scientific Computing, 2007. SYNASC. International Symposium on

Date 26-29 Sept. 2007

Filter Results

Displaying Results 1 - 25 of 89
  • Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (279 KB)
    Freely Available from IEEE
  • Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing - Title page

    Publication Year: 2007, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (151 KB)
    Freely Available from IEEE
  • Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing - Copyright

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing - TOC

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

    Publication Year: 2007, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (257 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2007, Page(s):xii - xvi
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • The Gradual Computerisation of Mathematics in MathLang

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

    The MathLang project aims at computerizing mathematical texts according to various degrees of formalisations, and without any prior commitment to a particular logical framework or to a particular proof checker. In this paper, the MathLang framework, its developments and its current and future aspects, as well as examples of computerization from original mathematical texts to the fully formalised M... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SymGrid: A Framework for Symbolic Computations on the Grid

    Publication Year: 2007, Page(s): 4
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (398 KB) | HTML iconHTML

    Summary form only given. As part of a major EU infrastructure project (SCIEnce: Symbolic Computing Infrastructure in Europe), we are developing SymGrid, a new framework that will, for the first time, allow multiple invocations of symbolic computing applications to interact via the Grid. SymGrid is designed to support the specific needs of symbolic computation, including computational steering (gre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational Declarative Programming with JBoss Drools

    Publication Year: 2007, Page(s): 5
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB) | HTML iconHTML

    Summary form only given. This talk will focus on declarative programming with JBoss Drools 4.0. We will cover all of the advanced Conditional Elements that facilitate declarative programming; including 'exists, 'not', 'collect', 'accumulate' and 'from'. We will discuss why object models should be flattened and expressed relationally to get the most out of declarative programming with rule engines.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P Open Agent Networks for Decision Making

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

    Peer-to-peer (P2P) computing, a recently developed network architecture for distributed systems, is currently receiving ever increasing attention of both academia and industry. It has become a driving force for many new ideas and opportunities in design and implementation of modern large scale applications composed of highly autonomous entities. Recent efforts intended to integrate multi-agent, se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Applications of Weakly Picard Operators

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

    In this paper we present some notions and results from the weakly Picard operator theory. Applications to iterates of linear operators are given. Some open problems are also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Journal as Active Math-Agents: Outline of a Project with a Mathematics Publisher

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

    As in any other scientific field, the quality control (by peer reviewing), archiving and distribution of knowledge in mathematics is organized by journals. Currently, mathematical journals represent huge chunks of knowledge that sit passively on a shelf and wait for a human user to read or query them. In contrast, what we want to achieve in this project is the transformation of the knowledge conta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Origami and Beyond

    Publication Year: 2007, Page(s): 13
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    We discuss some aspects of the computational origami as a new kind of science of shapes. The computational origami is closely linked to paper craft, traditional art, industrial art, geometry of all levels, and furthermore to computer science. In this talk we present models of origami for computer assisted construction of and reasoning about origami. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 'Descente Infinie' Induction-Based Saturation Procedures

    Publication Year: 2007, Page(s):17 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    In [11], we have shown that implicit induction and saturation proof techniques share the same logic, witnessed by an inference system implementing the Fermat's 'Descente Infinie' induction principle. As a case study, a simple paramodulation-based inference system has been proved as an instance of it. In this paper, we detail the instantiation method to treat general saturation-based systems and ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tool for Calculating Exponential Run-Time Properties

    Publication Year: 2007, Page(s):25 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (622 KB) | HTML iconHTML

    Affine size-change analysis has been used for calculating precise polynomial bounds on the run times, and stack depths of affine size-change terminating programs. Such polynomial costs may be discovered by a characterization as a problem in quantifier elimination. In this paper we extend this work to cover a class of exponential cost programs. The tool described allows the calculation of run-time ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability

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

    We show that two notions of information flow, one which is strategy-based and the other knowledge-based, are equivalent. The first notion models the possibilities that a high-level user has to send information to the low-level user by distinctly observable runs, whereas the second notion models information leak as variations in the knowledge of the low-level user during his observation of the syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration

    Publication Year: 2007, Page(s):41 - 47
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (525 KB) | HTML iconHTML

    In the context of a scheme based exploration model proposed by Bruno Buchberger, we investigate the idea of decomposition, applied in the exploration of natural numbers. The free decomposition problem (i.e. whether an element can always be decomposed with respect to an operation) can be arbitrarily difficult, and we illustrate this in the theory of natural numbers. We consider a restriction, the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional-Based Comparison between Two Special Classes of Uni- and Bidirectional Systolic Arrays

    Publication Year: 2007, Page(s):51 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB) | HTML iconHTML

    In this paper we compare two special classes of systolic arrays, namely unidirectional systolic arrays with delayed output and bidirectional systolic arrays with one directional pass-through input. We make use of the results of [5], where we presented a so called functional approach to the synthesis of unidirectional arrays. By analysing the behaviour of arrays with two directional data-flow we de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Multiple Polynomial Quadratic Sieve on Multi-Core Architectures

    Publication Year: 2007, Page(s):59 - 65
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    The ability of multi-core processors to increase application performance depends on the use of multiple threads within applications. Symbolic computations, requiring both CPU power and large memory, are well-suited candidates for deriving advantages from multi-core parallel architectures. This is possible only if the specific libraries and tools are designed to allow multi-threading and multi-proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Branching Programs, Grammar Systems and the NC1 Class

    Publication Year: 2007, Page(s):66 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB) | HTML iconHTML

    Cooperating distributed grammar systems (CDGSs) are sets of Chomsky grammars that work sequentially on a common sentential form according to a specified protocol of cooperation. Branching programs (BPs) are fundamental models of non-uniform computation that simultaneously capture time and space in sequential computation. In this paper we deal with simulations of CDGSs by bounded width branching pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural Properties and Observability in Membrane Systems

    Publication Year: 2007, Page(s):74 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (869 KB) | HTML iconHTML

    We assimilate some notions of the ambient calculus into the formalism of membrane systems. Thus we consider the exhibit of an ambient, its level, the structural congruence, and the contextual bisimulation to define and study in mobile membrane systems the corresponding observation barbs, the depths of a membrane system, and the structural congruence. The relation between these notions is given by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving Behavioral Commutativity with CIRC

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

    CIRC is an automated circular coinductive prover implemented as an extension of Maude. In this paper we extend CIRC with the capability to prove behavioral commutativity and we show that the method is sound. The strength of the extended version of CIRC is illustrated on the example of coinductive calculus of streams. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of Relational Discrepancies between Database Schemas and Source-Code in Enterprise Applications

    Publication Year: 2007, Page(s):93 - 100
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB) | HTML iconHTML

    As enterprise applications become more and more complex, the understanding and quality assurance of these systems become an increasingly important issue. One specific concern of data reverse engineering, a necessary process for this type of applications which tackles the mentioned aspects, is to retrieve constraints which are not explicitly declared in the database schema but verified in the code.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • McC and Mc#: Unified C++ and C# Design Facts Extractors Tools

    Publication Year: 2007, Page(s):101 - 104
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (606 KB) | HTML iconHTML

    In the last years, as object-oriented software systems have become more and more complex, the need of performing automatically reverse engineering upon such systems has significantly increased. It is well known that one step toward a research infrastructure accelerating the progress of reverse engineering is the creation of an intermediate representation of software systems. In the current demonst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing Rules between JBoss and Jena

    Publication Year: 2007, Page(s):105 - 108
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    The actual rule based implementations point to different rule target platforms and languages (object oriented rule languages, semantic Web rule languages, artificial intelligence rule languages) in a business landscape dominated by a limited number of tool vendors as well as competitive open-source platforms and rule interoperability initiatives. This work provides a description of business rules ... View full abstract»

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