• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1997 Fiscal Year Final Research Report Summary

Basic Research on Interactive Algorithms

Research Project

Project/Area Number 07680339
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionTokyo University of Agriculture and Technology

Principal Investigator

NAKAMORI Mario  Department of Computer Sceince, Tokyo University of Agriculture and Technology, Professor, 工学部, 教授 (00111633)

Co-Investigator(Kenkyū-buntansha) UEMURA Shunsuke  Advanced Institute of Science and Technology Nara Department of Computer Science, 情報科学研究科, 教授 (00203480)
IKEDA Satoshi  Department of Computer Science, Tokyo University of Agriculture and Technology,, 工学部, 助手 (70282796)
IWASAWA Kyoko  Department of Computer Science, Tokyo University of Agriculture and Technology,, 工学部, 講師 (80251578)
Project Period (FY) 1995 – 1997
Keywordsinteractive algorithm / algorithm / bilinear programming / parallel algorithm / sorting / internal merge sort / average computational complesity / worst case computational complexity
Research Abstract

Interactive algorithm is an algorithm that allows human solver (user) to interrupt execution and input information, In the present research we investigated methods of algorithm description, relations with bilinear programming, relations with parallel algorithms, from the above point of view. We also obtained a new algorithm of sorting (ordering) data, which is called internal merge sort. Sorting, in general, is an operation of arranging data such that records are in a sequence of ascending or descending order. Our internal merge sort does not require a large working area. We made a theoretical analysis and obtained a theoretical estimation of average computing time of (internal) merge sort, This is a new result, which has not been known before. The computational time of our internal merge sort is twice as much as that of quick sort and merge sort. This result is the same as our theoretical analysis.

  • Research Products

    (8 results)

All Other

All Publications (8 results)

  • [Publications] Kyoko Iwasawa: "Automatic Parallelization Method of Loops by Conditional Region Analysis" Proc.ISTED. 1-3 (1998)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 萩原 斉: "困難な問題の双線形計画問題を用いたモデル化技法" 情報処理学会 技術研究報告. MPS19. 19-24 (1998)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 岩澤京子: "並列化支援システムによるFortran DOループの並列化方法" 情報処理学会 論文誌. 36. 1995-2006 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 岩澤京子: "Fortranの配列記述の最適化方式" 電子情報通信学会論文誌. 78DI. 504-506 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Kyoko Iwasawa: "Automatic Parallelization Method of Loops by conditional Region Analysis" Proc.ISTED. 1-3 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Hitoshi Hagiwara: "Modeling Intractable Problems by Bilinear Programming" IPSJ SIGMPS. 19. 7-12 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Kyoko Iwasawa: "Parallelization Method of Fortran DO Loops by Parallelizing Assist System" Trans.IPSJ. 36-8. 1995-2006 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Kyoko Iwasawa: "Optimizing Method of Array Decomposition in Fortran 90" Trans.IEICE (DI). J78bI-5. 504-506 (1995)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1999-12-08  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi