{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00213555","sets":["1164:3206:10513:10738"]},"path":["10738"],"owner":"44499","recid":"213555","title":["コンカレント・プログラミングでのアルゴリズムの可視化のためのグラフ・レイアウトの評価基準"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-10-29"},"_buckets":{"deposit":"9d670edd-fed3-4783-b464-a5b61a59e512"},"_deposit":{"id":"213555","pid":{"type":"depid","value":"213555","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"コンカレント・プログラミングでのアルゴリズムの可視化のためのグラフ・レイアウトの評価基準","author_link":["546656","546657"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"コンカレント・プログラミングでのアルゴリズムの可視化のためのグラフ・レイアウトの評価基準"},{"subitem_title":"Graph Layout Criterion for Visualizing Concurrent Programming Algorithms","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-10-29","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"岩手大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Iwate University","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/213555/files/IPSJ-CG21184025.pdf","label":"IPSJ-CG21184025.pdf"},"date":[{"dateType":"Available","dateValue":"2023-10-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CG21184025.pdf","filesize":[{"value":"515.7 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":"28"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a63cd47f-34b2-490a-93be-119d19b963b0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤, 信"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Makoto, Satoh","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10100541","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":"2188-8949","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では,コンカレント・プログラミングでのアルゴリズムの可視化のためのグラフ・レイアウトの評価基準を提案する.コンカレント・プログラミングは複数のエンティティ (プロセスまたはスレッド) を連携動作させるための手法であり,対話的なグラフィックス・ソフトウエアなどでもよく用いられる.そのアルゴリズムの各ステップの処理は集中することが多いことから,アルゴリズムを可視化すると表示が重なる部分が多いグラフが作成される.そのようなグラフを分かり易く作成するために,レイアウトの評価基準を基にグラフを選択するための手法について検討する.グラフィックスにより視覚的に表現することは,アルゴリズムのメンタル・モデルの構築を容易にするために有効である.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes a graph layout criterion for visualizing algorithms used in concurrent programming. Concurrent programming is a method for cooperative operation among multiple entities (processes and threads), used often in interactive graphics software. Graphs with many overlays are generated by visualizing the algorithms, because the processes of the each algorithm step often localize. A method for selecting graphs based on the layout criterion is considered so as to generate such a graphs in an easy-to-understand manner. Visual representations with graphics are effective to construct the mental models of the algorithms.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータグラフィックスとビジュアル情報学(CG)"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-10-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"25","bibliographicVolumeNumber":"2021-CG-184"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":213555,"updated":"2025-01-19T17:07:13.229089+00:00","links":{},"created":"2025-01-19T01:14:25.601939+00:00"}