| Project/Area Number |
10205210
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research on Priority Areas (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Institution | Toyohashi University of Technology |
|---|
Principal Investigator |
MASUYAMA Shigeru TOYOHASHI UNIVERSITY OF TECHNOLOGY, FACULTY OF ENGINEERING, Professor, 工学部, 教授 (60173762)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MIWA Hiroyoshi NTT, Service Integration Research Laboratories, Chief Researcher, サービスインテグレーション研究所, 研究主任
ICHIKAWA Shuichi TOYOHASHI UNIVERSITY OF TECHNOLOGY, FACULTY OF ENGINEERING, Associate Professor, 工学部, 助教授 (70262855)
ITO Hiro TOYOHASHI UNIVERSITY OF TECHNOLOGY, FACULTY OF ENGINEERING, Lecturer, 工学部, 講師 (50283487)
|
|---|
| Project Period (FY) |
1998 – 2000
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥10,900,000 (Direct Cost: ¥10,900,000)
Fiscal Year 2000: ¥2,700,000 (Direct Cost: ¥2,700,000)
Fiscal Year 1999: ¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 1998: ¥4,600,000 (Direct Cost: ¥4,600,000)
|
|---|
| Keywords | Graph and Networks / Communication Network / Network Design / Parallel Graph Algorithms / Discrete Geometry / Distributed Load Balancing Problem / Knowledge-Acquisition from Corpus / Special-Porpose hardware / 離散最適化 / インターネット / 移動体通信 / 高度通信網 / 並列処理 / 分散処理 / テキスト自動要約 / 構文解析 / GLR構文解析 / LC構文解析 / データ再配置問題 / 静的負荷分散 / 離散構造 / 効率的アルゴリズム / 並列LR構文解析 / UGLR構文解析 / ハムサンドイッチ定理の拡張 / 舞台照明問題 / 画像の傷の修復 / 計算幾何学 |
|---|
| Research Abstract |
A number of problems which have emerged due to the recent rapid progress of Internet, multimedia networks, mobile and wireless networks and computer technology have a discrete structure in nature. Thus we first formalize some of such problems as graph and/or network problems and tried to obtain efficient solution methods by elucidating their structural feature. As a result, efficient algorithms, either parallel or sequential, for Hamiltonian circuit problem on an in-tournament graph, two edge-disjoint paths problem on tournament graph, hinge vertex problem in an interval graph and a trapezoid graph were obtained in the field of network reliability. Moreover, some results on location problems of servers and mirrors on multimedia networks and area assignment to base stations in mobile and wireless networks are also obtained. In discrete geometry, generalization of the 2-dimension ham sandwich problem which was an open problem was solved and NP-completeness of stage illumination problem was also clarified. On discrete games and puzzles, NP-hardness of rotation type cell-mazes and PSPACE-completeness of generarized Tsume-Shogi with a given number of moves were proved. Hardware accelerator for subgraph isomorphism problem was developed and static load balancing of parallel PDE solver for distributed computing environment is also investigated. As technologies for supporting users to utilize a large amount of information now available via Internet, etc, some results on automatic text summarization, a retrieval method for relevant documents and knowledge-acquisition from corpus were also obtained.
|
