{"created":"2024-09-26T02:08:00.821610+00:00","id":2000959,"links":{},"metadata":{"_buckets":{"deposit":"909fdc0d-b709-4fbb-b5ef-bff235d24347"},"_deposit":{"created_by":43,"id":"2000959","owner":"42","owners":[43],"pid":{"revision_id":0,"type":"depid","value":"2000959"},"status":"published"},"_oai":{"id":"oai:seikei.repo.nii.ac.jp:02000959","sets":["1709599294504:1710723692721:1710723732009"]},"author_link":[],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2021-06-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"10","bibliographicPageStart":"5","bibliographicVolumeNumber":"58","bibliographic_titles":[{"bibliographic_title":"成蹊大学理工学研究報告","bibliographic_titleLang":"ja"},{"bibliographic_title":"The journal of the Faculty of Science and Technology, Seikei University","bibliographic_titleLang":"en"}]}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Since task scheduling problems belong to a class of the strong NP-hard combinatorial optimization problem, the required scheduling time increases exponentially as the number of tasks increases. Therefore, we find some small subtask graphs that can be optimally scheduled in the overall task graph, and solve them individually as a scheduling problem. Then, each subtask graph can be treated as one macro task in the whole task graph. This reduces the apparent number of tasks in the overall task graph, reduces the scale of the task graph, and significantly reduces the search time that depends on the number of tasks. We call this hierarchical scheduling. However, this partial task graph detection has a drawback that it becomes a combinatorial optimization problem by itself. Therefore, in this paper, we construct and evaluate a method for detecting partial task graphs using deep learning.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10002_identifier_registration":{"attribute_name":"identifier_registration","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15018/00000994","subitem_identifier_reg_type":"JaLC"}]},"item_10002_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"成蹊大学理工学部","subitem_publisher_language":"ja"}]},"item_10002_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1880-2265","subitem_source_identifier_type":"PISSN"}]},"item_1710996587908":{"attribute_name":"item_1710996587908","attribute_value_mlt":[{"subitem_source_identifier":"AA1203510X","subitem_source_identifier_type":"NCID"}]},"item_1720066799756":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_1720422722709":{"attribute_name":"その他 資源タイプ","attribute_value":"Article"},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田邑, 大雅","creatorNameLang":"ja"},{"creatorName":"TAMURA, Taiga","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"甲斐, 宗徳","creatorNameLang":"ja"},{"creatorName":"KAI, Munenori","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2021-10-18"}],"displaytype":"detail","filename":"rikougaku-58-1_5-10.pdf","filesize":[{"value":"981.7 KB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://seikei.repo.nii.ac.jp/record/2000959/files/rikougaku-58-1_5-10.pdf"},"version_id":"d40c8d9e-da07-4233-8dbf-4a92a705b0e5"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Task scheduling","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Deep Learning","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Convolutional Neural Network","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"item_resource_type","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Deep Learningを用いた階層的な部分タスクグラフ検出法の構築","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Deep Learningを用いた階層的な部分タスクグラフ検出法の構築","subitem_title_language":"ja"},{"subitem_title":"Construction of Hierarchical Partial Task Graph Detection Method Using Deep Learning","subitem_title_language":"en"}]},"item_type_id":"40001","owner":"43","path":["1710723732009"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2021-10-18"},"publish_date":"2021-10-18","publish_status":"0","recid":"2000959","relation_version_is_last":true,"title":["Deep Learningを用いた階層的な部分タスクグラフ検出法の構築"],"weko_creator_id":"43","weko_shared_id":-1},"updated":"2025-02-21T05:16:49.695132+00:00"}