{"created":"2023-07-27T06:24:55.207777+00:00","id":8007,"links":{},"metadata":{"_buckets":{"deposit":"2a109da9-dd46-42dc-a016-8b88c9ea7583"},"_deposit":{"created_by":3,"id":"8007","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"8007"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00008007","sets":["934:935:936"]},"author_link":["11046","614"],"item_4_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-12-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicPageEnd":"2421","bibliographicPageStart":"2416","bibliographicVolumeNumber":"92-D","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Information and Systems"}]}]},"item_4_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We study the online file allocation problem on ring networks. In this paper, we present a 7-competitive randomized algorithm against an adaptive online adversary on uniform cactus graphs. The algorithm is deterministic if the size is 1. Moreover, we obtain lower bounds of 4.25 and 3.833 for a deterministic algorithm and a randomized algorithm against an adaptive online adversary, respetively, on ring networks.","subitem_description_type":"Abstract"}]},"item_4_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学大学院自然科学研究科電子情報科学専攻","subitem_description_type":"Other"}]},"item_4_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEICE Institute of Electronics, Information and Communication Engineers = 電子情報通信学会"}]},"item_4_relation_12":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1587/transinf.E92.D.2416","subitem_relation_type_select":"DOI"}}]},"item_4_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright (C) 2009 Institute of Electronics, Information and Communication Engineers"}]},"item_4_source_id_11":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AA10826272","subitem_source_identifier_type":"NCID"}]},"item_4_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0916-8532","subitem_source_identifier_type":"ISSN"}]},"item_4_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kawamura, Yasuyuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Matsubayashi, Akira"}],"nameIdentifiers":[{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-10-03"}],"displaytype":"detail","filename":"TE-PR-MATSUBAYASHI-A-2416.pdf","filesize":[{"value":"187.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"TE-PR-MATSUBAYASHI-A-2416.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/8007/files/TE-PR-MATSUBAYASHI-A-2416.pdf"},"version_id":"db80baf5-94ec-4708-849e-960389b0871e"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Randomized Online File Allocation on Uniform Cactus Graphs","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Randomized Online File Allocation on Uniform Cactus Graphs"}]},"item_type_id":"4","owner":"3","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-10-03"},"publish_date":"2017-10-03","publish_status":"0","recid":"8007","relation_version_is_last":true,"title":["Randomized Online File Allocation on Uniform Cactus Graphs"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-07-28T02:15:52.949555+00:00"}