大規模な数理情報システムのスパースなデータ構造

URI http://harp.lib.hiroshima-u.ac.jp/pu-hiroshima/metadata/8382
ファイル
タイトル
大規模な数理情報システムのスパースなデータ構造
別タイトル
Sparse and Large-Scale Data Structure for Mathematical Information Systems
著者
氏名 錦織 昭峰
ヨミ ニシコリ アキミネ
別名 Nishikori Akimine
抄録

This paper presents sparse and large-scale data structure for mathematical information systems. A lot of studies previously researched are discussed from the various points of view,which mean information systems,software engineering,artificial intelligence and knowledge information systems. This paper proposes three kinds of sparse data structures,that is,a matrix with rows and columns,the spread sheets and search trees. The first structure is used for the constrained load (power) flow of practical electric power systems. This is an optimization problem which obtains a feasible solution with considering priority orders. The problem becomes large-scale in applying to real cases. The second exploits display expression of too large-scale spread sheet with sparse data structure which is impossible to show the whole sheet on one screen. The display expression of a computer only shows cells with data after automatically dropping other cells of no data. The third is for desirable constraint satisfaction in the field of artificial intelligence. The constraint satisfaction means large-scale assignment problems with priority orders. The solution technique is to search state space by using several search trees. All of the three data structures treat sparse and large-scale in searching and

or its data stored.

掲載雑誌名
県立広島大学経営情報学部論集
2
開始ページ
11
終了ページ
24
出版年月日
2010-2
出版者
県立広島大学
ISSN
1882-7985
NCID
AA12388008
本文言語
日本語
資料タイプ
紀要論文
著者版フラグ
出版社版
ソートキー
03
旧URI
区分
pu-hiroshima