{"created":"2023-07-27T06:52:25.102157+00:00","id":46316,"links":{},"metadata":{"_buckets":{"deposit":"e73875c0-b023-49eb-aece-4b9428997fb8"},"_deposit":{"created_by":18,"id":"46316","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"46316"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00046316","sets":["2812:2813:2817"]},"author_link":["80231","614"],"item_9_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2017-05-17","bibliographicIssueDateType":"Issued"},"bibliographicPageStart":"4p.","bibliographicVolumeNumber":"2014-04-01 - 2017-03-31","bibliographic_titles":[{"bibliographic_title":"平成28(2016)年度 科学研究費補助金 基盤研究(C) 研究成果報告書"},{"bibliographic_title":"2016 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":"We studied the page migration problem, which is well known in the area of online algorithms, and obtained the following results. First, we mathematically disproved a previous conjecture about an optimal online algorithm for this problem. Then, we designed online algorithms on the Euclidean space and ring networks. We proved that, under the condition that the page size is minimum, both of these algorithms have performance better than previous results that has not been improved for many years.","subitem_description_type":"Abstract"}]},"item_9_description_22":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"研究課題/領域番号:26330008, 研究期間(年度):2014-04-01 - 2017-03-31","subitem_description_type":"Other"},{"subitem_description":"出典：「仕事関数の解析的取扱いによるページ移動予想の解決」研究成果報告書　課題番号26330008\n（KAKEN：科学研究費助成事業データベース（国立情報学研究所）） \n（https://kaken.nii.ac.jp/report/KAKENHI-PROJECT-26330008/26330008seika/）を加工して作成","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/00052649","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=10282378"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/search/?qm=10282378","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-26330008/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-26330008/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/report/KAKENHI-PROJECT-26330008/26330008seika/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/report/KAKENHI-PROJECT-26330008/26330008seika/","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":"2018-11-05"}],"displaytype":"detail","filename":"TE-PR-MATSUBAYASHI-A-kaken 2017-4p.pdf","filesize":[{"value":"159.5 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"TE-PR-MATSUBAYASHI-A-kaken 2017-4p.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/46316/files/TE-PR-MATSUBAYASHI-A-kaken 2017-4p.pdf"},"version_id":"231a1331-4acf-40c6-b304-a4e00a642053"}]},"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":"Settling Page Migration Conjecture by Analytical Estimation of Work Functions","subitem_title_language":"en"}]},"item_type_id":"9","owner":"18","path":["2817"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-11-05"},"publish_date":"2018-11-05","publish_status":"0","recid":"46316","relation_version_is_last":true,"title":["仕事関数の解析的取扱いによるページ移動予想の解決"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2023-07-27T11:08:54.351734+00:00"}