{"created":"2025-01-19T01:27:41.711220+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228551","sets":["1164:10193:11168:11346"]},"path":["11346"],"owner":"44499","recid":"228551","title":["モデル差分を用いたQUBO行列の高速生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-10-19"},"_buckets":{"deposit":"026540e5-9311-47e8-97c4-1e7980c7d5bd"},"_deposit":{"id":"228551","pid":{"type":"depid","value":"228551","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"モデル差分を用いたQUBO行列の高速生成","author_link":["610136","610137"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"モデル差分を用いたQUBO行列の高速生成"}]},"item_type_id":"4","publish_date":"2023-10-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日本電気株式会社データサイエンスラボラトリー"},{"subitem_text_value":"日本電気株式会社データサイエンスラボラトリー"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/228551/files/IPSJ-QS23010003.pdf","label":"IPSJ-QS23010003.pdf"},"date":[{"dateType":"Available","dateValue":"2025-10-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS23010003.pdf","filesize":[{"value":"1.7 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"53"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f7020ba2-f18b-455b-ba09-c3e651461405","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"土井, 龍太郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鷹野, 芙美代"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12894105","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2435-6492","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"QUBO (quadratic unconstrained binary optimization) を用いて組合せ最適化問題を扱うためには，定式化した問題を表現する QUBO 行列を生成する必要がある．しかし，大規模な問題では QUBO 行列のサイズが増大し，生成時間が長期化する課題が存在する．本稿では，特に類似した問題を連続して扱う状況を想定し，モデル差分を活用して必要な行列要素のみを更新することで生成時間を高速化する手法を提案する．また，提案手法における QUBO 行列の保持方式や並列化といった高速化効果に影響を与える事項についても議論する．巡回セールスマン問題を用いた評価実験の結果，QUBO 行列を最初から作り直す従来手法と比較して，提案手法によって最大 54 倍の高速化を達成した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-10-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2023-QS-10"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228551,"updated":"2025-01-19T11:48:50.239510+00:00","links":{}}