By Topic

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)

Date 25-29 Sept. 2005

Filter Results

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

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

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

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing - Table of contents

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

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

    Publication Year: 2005, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • ACSys 2005

    Publication Year: 2005, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • CAVIS 2005

    Publication Year: 2005, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • NCA 2005

    Publication Year: 2005, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • PN & WM 2005

    Publication Year: 2005, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • TAPS 2005

    Publication Year: 2005, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Natural computation for business intelligence from Web usage mining

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    Web usage mining attempts to discover useful knowledge from the secondary data obtained from the interactions of the users with the Web. Web usage mining has become very critical for effective Web site management, creating adaptive Web sites, business and support services, personalization, network traffic flow analysis and so on. This paper introduces the various ingredients of natural computation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Membrane computing as a framework for modeling economic processes

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    This paper is a first step towards a systematic evaluation of the possibilities to use membrane computing as a modeling framework for economics. We start by a simple interpretation of several basic ingredients of membrane computing in economic terms, thus proving that the (conceptual, formal, graphical) language of membrane computing can be useful for economics, and then we introduce a class of P ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory and practice of programming applied to membrane systems

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Following the knowledge provided by the theory of programming, we present an abstract syntax of the membrane systems, and their semantics. We define an appropriate notion of configurations, and sets of inference rules corresponding to the three stages of an evolution step in membrane systems. A notion of bisimulation is defined; bisimulation relations allow to compare the evolution behaviour of tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rule-based programming with ρLog

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    We describe the current capabilities of a system for rule-based programming which is being developed by us. The system is called ρLog and consists of a pattern matching system and a strategic programming system embedded into a powerful system for symbolic and numeric computation. Matching with context and sequence variables, possibly constrained by regular constraints, is an elegant mechanism ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A direct products of fields approach to comprehensive Grobner bases over finite fields

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    In this paper we describe comprehensive Grobner bases over finite fields by direct product of fields. In general, representations of comprehensive Grobner bases have some conditions on parameters. However, in finite fields we can construct comprehensive Grobner bases without conditions by the theory of von Neumann regular rings. Our comprehensive Grobner bases are defined as Grobner bases in polyn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking RSC criteria for extended Dixon resultant by interpolation method

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    Dixon resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon resultant vanishes identically yielding no information about solutions for many algebraic and geometry problems. So, extended Dixon method (KSY method) was proposed for the case when the Dixon matrix is singular, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A connectivity analysis approach in geometric constraint solving

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    In this paper, we analyze the relationship between the structurally geometric well-constrained graphs and the complete graphs firstly. Then we propose the base configurations in 2D and 3D which are based on these relationships. After that, we present the property which the minimal cut graphs of structurally well-constrained graphs satisfy with, than obtain the lower limit of connectivity of struct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic modelling of database representations

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    The paper proposes a symbolic model for tackling the theoretical basis of the transformations between the relational database form and its XML representation. The model we propose aims at proving the consistency of such transformations, which are often used in software applications that process databases. On a more abstract level, our aim is to show that the categorial theory developed in symbolic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Archeology of code duplication: recovering duplication chains from small duplication fragments

    Publication Year: 2005
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    Code duplication is a common problem, and a well-known sign of bad design. As a result of that, in the last decade, the issue of detecting code duplication led to various solutions and tools that can automatically find duplicated blocks of code. However, duplicated fragments rarely remain identical after they are copied; they are oftentimes modified here and there. This adaptation usually "scatter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating role activity diagrams and hybrid IDEF for business process modeling using MDA

    Publication Year: 2005
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    Business process modeling is an important phase during requirements collection. Usually functional, dynamic and role models are needed. We propose to integrate role activity diagrams and hybrid IDEF for business process modeling within model driven architecture. Our proposal is demonstrated with a sample implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new core-based method for hierarchical incremental clustering

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    Clustering is a data mining activity that aims to differentiate groups inside a given set of objects, with respect to a set of relevant attributes of the analyzed objects. Generally, existing clustering methods start with a known set of objects, measured against a known set of attributes. But there are numerous applications where the attribute set characterizing the objects evolves. We propose in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using R-trees in content-based region query with spatial bounds

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    This paper presents both theoretically and experimentally the advantages of using R-trees in content-based region query with spatial bounds. This advantage consists in the minimizing of the execution time. This process supposes that the user gives a rectangle by its coordinates in order to retrieve the images that are within these spatial bounds. The color regions of the images together with the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of generics in scientific computing

    Publication Year: 2005
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    This paper studies the performance of generics, or templates as they are sometimes called, for scientific computing in various programming languages. In order to understand the cost of using generics, we develop a test suite for generics based on a standard numeric benchmark. We compare the results of this new benchmark for generics in C++, C# and Java, both between language implementations and ag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building an object oriented computational algebra system based on design patterns

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Object oriented programming and design patterns introduce a high level of abstraction that allows us to implement and work with mathematical abstractions. Classic algebraic libraries, based on imperative programming, contain subalgorithms for working with polynomials, matrices, vectors, etc. Their main inconvenience is the dependency on types. In this paper we analyze and design the kernel for an ... View full abstract»

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