{"created":"2023-05-15T12:35:19.017067+00:00","id":226,"links":{},"metadata":{"_buckets":{"deposit":"3ab31d7f-ea5b-4881-a982-c2562fa14f1e"},"_deposit":{"created_by":2,"id":"226","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"226"},"status":"published"},"_oai":{"id":"oai:kutarr.kochi-tech.ac.jp:00000226","sets":["5"]},"author_link":["901","900","902"],"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"133","bibliographicPageStart":"116","bibliographicVolumeNumber":"4","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌 プログラミング"}]}]},"item_2_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"グラフ中の最短経路を求める問題，またはより一般に何らかの意味で最適な経路を求める問題は，非常に多くの応用を持つ重要な問題である．そのため，最短経路問題やその変種はさかんに議論され，様々なアルゴリズムが提案されてきた．しかし，これらの成果はアルゴリズムになじみのない人には利用が難しい．自分の解きたい問題に応じて適切にアルゴリズムを選択するのは一般に難しく，またそれぞれのアルゴリズムに効率の良い実装を与えるのも容易でない．本論文では，領域限定言語に基づいた最適経路問合せ手法を提案する．提案手法では，発見したい最適経路の仕様を領域限定言語によって記述する．この言語は，その記述から最適経路問合せを行う効率の良いアルゴリズムが機械的に導出できるよう設計されている．また，この言語では最適経路問合せに関する既知の問題クラスの多くを自然に記述できる．よって，アルゴリズムに関する知識をまったく要することなく広い範囲の最短経路問合せを効率良く行うことができる．我々は実際に提案手法を実装した．このシステムは，最適経路の仕様記述をもとに，効率の良い最適経路問合せを行うプログラムを出力する．最短経路問題の実装に関する既知の成果を利用し，また最適経路問合せに特有のいくつかの効率化を加えることにより，我々のシステムによる最適経路問合せは，既存のライブラリに比べても，その利用が簡便であるだけでなく実行効率も良いことが確認された．The problem to find the shortest path in a graph, or those to find the optimal path according to some criterion of optimality, are very important because of their numerous applications, and there are many studies on this topic. However, algorithmic results on solving optimal path problems are not very accessible for nonspecialists. It is difficult to choose an algorithm that enables us to achieve our objective, and moreover, its efficient implementation should be nontrivial. In this paper, we propose a method of optimal path querying. Our method is based on a domain specific language. The language is designed so that we can mechanically derive an efficient algorithm to find the described path. Therefore, we can efficiently find the optimal path with little algorithmic knowledge. Describing the specification of desirable paths by the language suffices. We implemented the method as an optimal path querying system. The system generates a program code for optimal path querying from the description of the optimal path. By virtue of a known efficient implementation of shortest path problems and our careful tuning, our system is not only easier to use but also more efficient than an existing library.","subitem_description_type":"Abstract"}]},"item_2_publisher_35":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会"}]},"item_2_rights_14":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。"},{"subitem_rights":"Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof."}]},"item_2_version_type_18":{"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":"森畑, 明昌"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"松崎, 公紀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"武市, 正人"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-02-13"}],"displaytype":"detail","filename":"27-27.pdf","filesize":[{"value":"429.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"27-27.pdf","url":"https://kutarr.kochi-tech.ac.jp/record/226/files/27-27.pdf"},"version_id":"23b533d9-d24e-40f9-8fde-e17a661e5562"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"領域限定言語に基づく最適経路問合せ","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"領域限定言語に基づく最適経路問合せ"}]},"item_type_id":"2","owner":"2","path":["5"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-03-25"},"publish_date":"2016-03-25","publish_status":"0","recid":"226","relation_version_is_last":true,"title":["領域限定言語に基づく最適経路問合せ"],"weko_creator_id":"2","weko_shared_id":-1},"updated":"2023-05-15T13:41:10.206340+00:00"}