{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00016463","sets":["934:935:942:943"]},"path":["943"],"owner":"1","recid":"16463","title":["リスト上の最大マーク付け問題を解く並列プログラムの導出"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-03-15"},"_buckets":{"deposit":"ccee4242-0eaa-4d45-a27c-6b256fb31819"},"_deposit":{"id":"16463","pid":{"type":"depid","value":"16463","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"リスト上の最大マーク付け問題を解く並列プログラムの導出","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"リスト上の最大マーク付け問題を解く並列プログラムの導出"},{"subitem_title":"Derivation of Parallel Programs for Maximum Marking Problems on Lists","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"通常論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-03-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"}]},"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/16463/files/IPSJ-TPRO4903003.pdf"},"date":[{"dateType":"Available","dateValue":"2010-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO4903003.pdf","filesize":[{"value":"279.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6776e394-be42-4492-8175-5e8205a83d21","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松崎, 公紀"},{"creatorName":"胡振江"},{"creatorName":"武市, 正人"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kiminori, Matsuzaki","creatorNameLang":"en"},{"creatorName":"Zhenjiang, Hu","creatorNameLang":"en"},{"creatorName":"Masato, Takeichi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"最大マーク付け問題とは，入力として与えられたデータに対し，ある述語を満たし，かつ，重み和が最大となる要素集合を求める問題である．多くの最適化問題は最大マーク付け問題として定式化できることが知られている．本稿では，このうち，データがリスト構造を持つ場合を対象とする．リスト上の最大マーク付け問題の例としては，最大部分列和問題などが知られている．本稿では，最大マーク付け問題における述語の仕様から並列プログラムを導出する手法を提案する．並列プログラムの導出においては，並列計算においてよく利用される処理を抽象化した並列スケルトンを利用する．並列スケルトンを用いた並列プログラムの導出法についてはこれまでにも多くの研究がなされており，それらを利用する．本稿ではさらに，述語の仕様から並列プログラムのコードを生成するシステムについても述べる．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The maximum marking problem is the problem of marking the entries of some given data structure in such a way that a given constraint is satisfied and the sum of the values associated with marked entries is as large as possible. We can formalize many optimization problems as instances of the maximum marking problems. In this paper, we show the derivation of parallel programs for maximum marking problems on lists, which include the well-known maximum segment sum problem. The derivation of parallel programs is based on skeletal parallel programming, where parallel programs are developed by compositions of abstracted parallel computational patterns called skeletons. In this paper, we also discuss a code generator for the maximum marking problems.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"27","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"16","bibliographicIssueDates":{"bibliographicIssueDate":"2008-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG3(PRO36)","bibliographicVolumeNumber":"49"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":16463,"updated":"2025-01-22T23:51:09.711876+00:00","links":{},"created":"2025-01-18T22:49:43.682904+00:00"}