Journal for Academic Computing and Networking
Online ISSN : 2433-7595
Print ISSN : 1343-2915
Volume 1 , Issue 1
Showing 1-3 articles out of 3 articles from the selected issue
Original paper
  • Takeshi Wada, Takashi Yasuda, Matsu-taro Noda
    Type: research-article
    1997 Volume 1 Issue 1 Pages 3-15
    Published: October 03, 1997
    Released: September 25, 2019
    JOURNALS FREE ACCESS

    A prototype of an automated system to aid users in selecting mathematical software is presented. Given an input problem, the system selects an appropriate algorithm in a library stored in a database and executes the problem and finally gives results. A computer algebra system, MAPLE, is used to extract specific features of the problem. Users use the system through web browsers such as the Netscape Navigator etc. As an mathematical software, the SSL-II, Fujitsu Co., is considered.

    Download PDF (1534K)
  • F. Tachibana
    Type: research-article
    1997 Volume 1 Issue 1 Pages 16-24
    Published: October 03, 1997
    Released: September 25, 2019
    JOURNALS FREE ACCESS

    A new method for analyzing of problem (SMAP method) is proposed. Markov Chain is applied to SMAP method to get time steps. SMAP method is compared with SAD method proposed by Mori. Though SMAP method is simple and easy to analyze problem, results by SMAP method are similar to those by SAD method.

    Download PDF (1010K)
  • Mitsue Den, Kazuyuki Yamashita, Ryoji Matsumoto
    Type: research-article
    1997 Volume 1 Issue 1 Pages 25-34
    Published: October 03, 1997
    Released: September 25, 2019
    JOURNALS FREE ACCESS

    We present a new data compression algorithm, useful for a visualization and a rough analysis of multi-dimensional numerical simulation results with mesh code. The algorithm consists of a classification or a quantization of single or double precision real data at each mesh point, and a subsequent compression by using a conventional compression algorithm. We describe a data compression method in detail, showing this method does work for several typical problems existing in the numerical simulation in astrophysics by counting a compression efficiency. We also investigate a relation of the compression efficiency and simplicity or complexity of the data distribution. When single precision real data on mesh points are compressed by using 8-bit quantization, the compression rate is at least 75% for complex distribution and more than 93% for simple distribution. A source program based on our compression algorithm written in FORTRAN language is now available for interests.

    Download PDF (1297K)
feedback
Top