{"created":"2023-07-27T06:58:05.756950+00:00","id":55726,"links":{},"metadata":{"_buckets":{"deposit":"b37cd4ba-00f4-41bb-973e-010432055a4f"},"_deposit":{"created_by":18,"id":"55726","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"55726"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00055726","sets":["2812:2813:2819"]},"author_link":["97040"],"item_9_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2015-06-03","bibliographicIssueDateType":"Issued"},"bibliographicPageStart":"4p.","bibliographicVolumeNumber":"2011 – 2014","bibliographic_titles":[{"bibliographic_title":"平成26(2014)年度 科学研究費補助金 基盤研究(B) 研究成果報告書"},{"bibliographic_title":"2014 Fiscal Year Final Research Report","bibliographic_titleLang":"en"}]}]},"item_9_creator_33":{"attribute_name":"著者別表示","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{}],"nameIdentifiers":[{},{}]}]},"item_9_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"近年の計算機環境は著しい変化を遂げている．計算機の性能が上がるにつれ，より大きな規模の問題が解けるようになり，いわゆるビッグデータ処理が注目を集めているところである．このように問題のサイズは大きくなる一方であるが，データサイズが大きすぎて主記憶に収まりきらないという問題がある．そのために省メモリのアルゴリズムが要求されるが，この分野の研究は始まったばかりである．本研究では，計算幾何学に焦点をあてつつ，グラフ理論の諸問題に対する省メモリアルゴリズム，２値画像処理に対する効率の良いアルゴリズムを開発した．","subitem_description_type":"Abstract"},{"subitem_description":"With recent progressin computer environment,as the performance of computers is improved, people tend to be interested in larger-sized problems such as big-data processing. The problem size is continuously growing, we have a problem of too large memory size to be included in computer main memory. Because of this reason memory-constrained algorithms are requested in many ways, but research on small-memory algorithms has just begun. In this reserch we focus on computational geometry and develop memory-efficient algorithms,but we also developed efficient algorithms for graph problems and binary image processing problems.","subitem_description_type":"Abstract"}]},"item_9_description_22":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"研究課題/領域番号:23300001, 研究期間(年度):2011 - 2014","subitem_description_type":"Other"},{"subitem_description":"出典：研究課題「省メモリ計算モデル上でのアルゴリズム設計技法の開発」課題番号23300001\n（KAKEN：科学研究費助成事業データベース（国立情報学研究所）） \n（https://kaken.nii.ac.jp/ja/report/KAKENHI-PROJECT-23300001/23300001seika/）を加工して作成","subitem_description_type":"Other"}]},"item_9_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学 / 北陸先端科学技術大学院大学","subitem_description_type":"Other"}]},"item_9_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.24517/00062001","subitem_identifier_reg_type":"JaLC"}]},"item_9_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/search/?qm=90113133"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/search/?qm=90113133","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-23300001/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-23300001/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/ja/report/KAKENHI-PROJECT-23300001/23300001seika/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/ja/report/KAKENHI-PROJECT-23300001/23300001seika/","subitem_relation_type_select":"URI"}}]},"item_9_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2021-06-04"}],"displaytype":"detail","filename":"TE-PR-ASANO-T-kaken 2015-4p.pdf","filesize":[{"value":"88.5 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"TE-PR-ASANO-T-kaken 2015-4p.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/55726/files/TE-PR-ASANO-T-kaken 2015-4p.pdf"},"version_id":"e19eb4de-02a6-4e84-859e-f410fd58bbc3"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"research report","resourceuri":"http://purl.org/coar/resource_type/c_18ws"}]},"item_title":"省メモリ計算モデル上でのアルゴリズム設計技法の開発","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"省メモリ計算モデル上でのアルゴリズム設計技法の開発"},{"subitem_title":"Development of Algorithmic Paradigms on Memory-Constrained Computation","subitem_title_language":"en"}]},"item_type_id":"9","owner":"18","path":["2819"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-06-04"},"publish_date":"2021-06-04","publish_status":"0","recid":"55726","relation_version_is_last":true,"title":["省メモリ計算モデル上でのアルゴリズム設計技法の開発"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2023-07-27T10:42:40.969630+00:00"}