By Topic

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Date 26-29 Sept. 2006

Filter Results

Displaying Results 1 - 25 of 80
  • Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing [Cover]

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

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

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

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

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

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

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

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

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

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

    Publication Year: 2006, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Mathematical Theory Exploration

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

    Summary form only given. Mathematics is characterized by its method of gaining knowledge, namely reasoning. The automation of reasoning has seen significant advances over the past decades and, thus, the expectation was that these advances would also have significant impact on the practice of doing mathematics. However, so far, this impact is small. We think that the reason for this is the fact tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Emergence in Problem Solving, Classification and Machine Learning

    Publication Year: 2006, Page(s):5 - 9
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (273 KB) | HTML iconHTML

    Emergence is usually the way in which a collective organisation behaves differently than the sum of its elements. We propose here an overview of different ways this paradigm is used in several fields of artificial intelligence and we propose some theoretical tracks relying on some works in the field of machine learning View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adventures of a Logician-Engineer: A Journey through Logic, Engineering, Medicine, Biology, and Statistics

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

    Summary form only given. Whenever a programmer writes a loop, or a mathematician does a proof by induction, an invariant is involved. The discovery and understanding of invariants often underlies problem solving in many domains. The author discusses his search for powerful invariants over the past decade. This search was/is motivated by a broad spectrum of problems: understanding query languages, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tiers of webOrigami Programming

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

    Summary form only given. The World Wide Web is an important knowledge repository for our daily activities, and moreover it is transforming itself to service repository. Many scientists not only publish their results on the Web but offer services that accrue from their scientific discoveries and inventions. The WebOrigami, under development by SCORE at University of Tsukuba, is one such science ser... View full abstract»

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

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

    Summary form only given. Pen-based user interfaces offer tantalizing potential for mathematical software systems. In contrast to normal text, entering and editing mathematical formulae with a digital pen can be much more natural than using a keyboard. Machine recognition of mathematical handwriting, however, is more complex than recognizing natural language text. In this context it is necessary to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tuning Evolutionary Algorithm Performance Using Nature Inspired Heuristics

    Publication Year: 2006, Page(s): 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (54 KB) | HTML iconHTML

    Summary form only given. Evolutionary algorithms have become an important problem solving methodology among many researchers working in the area of computational intelligence. The population based collective learning process; self adaptation and robustness are some of the key features of evolutionary algorithm when compared to other global optimization techniques. Due to its simplicity, evolutiona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MATHsAiD: A Mathematical Theorem Discovery Tool

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

    In the field of automated reasoning, one of the most challenging (even if perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst all the truths that can be discovered and proved, those which are either useful or interesting enough to be worth recording. As for human reasoning, mathematicians are well known for their predilection towards designating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheme-Based Systematic Exploration of Natural Numbers

    Publication Year: 2006, Page(s):23 - 34
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by Bruno Buchberger. We illustrate with examples from the exploration: (i) the invention of new concepts (functions, relations) in the theory, using knowledge scheme;, (ii) the invention of new propositions, using propositio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing Parameterized Type Algorithm Definitions in Mathematica

    Publication Year: 2006, Page(s):35 - 40
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advantage of systematically dealing with domains, categories, operators over them by creating general contexts of expressing algorithms, which can be applied by parameterizing them with various domains, using the same algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Level Programming Approach to Volume Propagation in Higher-Dimensional Spaces

    Publication Year: 2006, Page(s):41 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    A set of algorithms designed for the analysis of phase-space perturbation propagation in dynamical systems is presented. The most important tasks are approximate volume estimation and determining the subset of the perturbation surface that is tangent to current lines. The algorithms are developed in a generic, dimension-independent fashion, but they can be partially evaluated with respect to the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Doing Numerical Cosmology with the Cactus Code

    Publication Year: 2006, Page(s):47 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    The article presents some aspects concerning the construction of a new thorn for the Cactus code, a complete 3-dimensional machinery in numerical relativity. This thorn is dedicated to numerical simulations in cosmology, that means it can provide evolutions of different cosmological models, mainly based on Friedman-Robertson-Walker metric. Some numerical results are presented, testing the converge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Use of Maple Platform for the Study of Geodesic Motion on Curved Spacetimes

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

    The article illustrates the graphical study of geodesic motion on curved space-times (mainly exact solutions of Einstein equations) using the symbolic, numerical and graphical computation facilities of Maple platform. The example of null geodesics on Schwarzschild solution is completely processed. The geodesic curves are plotted directly using DEtools package in Schwarzs child coordinates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Quality Measure for Multi-Level Community Structure

    Publication Year: 2006, Page(s):63 - 68
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (181 KB) | HTML iconHTML

    Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one another. The clusters themselves are sometimes terms "communities" and the way clusters relate to one another is often referred to as a "community structure". We study a modularity criterion MQ introduced by Mancoridis et al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New k-means Based Clustering Algorithm in Aspect Mining

    Publication Year: 2006, Page(s):69 - 74
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    Clustering is a division of data into groups of similar objects. Aspect mining is a process that tries to identify cross-cutting concerns in existing software systems. The goal is to refactor the existing systems to use aspect oriented programming, in order to make them easier to maintain and to evolve. This paper aims at presenting a new k-means based clustering algorithm used in aspect mining. C... View full abstract»

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