{"id":11202,"updated":"2025-01-23T02:21:38.634581+00:00","links":{},"created":"2025-01-18T22:45:53.931268+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00011202","sets":["581:651:658"]},"path":["658"],"owner":"1","recid":"11202","title":["モバイルエージェントの経路記述と選択機構"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-06-15"},"_buckets":{"deposit":"74528c8b-21b4-4616-b5b3-fd6baf21a5c2"},"_deposit":{"id":"11202","pid":{"type":"depid","value":"11202","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":"Specification and Selection for Agent Mobility","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：オブジェクト指向技術","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2003-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"国立情報学研究所／科学技術振興事業団"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"National Institute of Informatics/Japan Science and Technology Corporation","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/11202/files/IPSJ-JNL4406005.pdf"},"date":[{"dateType":"Available","dateValue":"2005-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4406005.pdf","filesize":[{"value":"533.4 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1c69ab8e-baf6-4a3a-b98a-de5e3e0d8972","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2003 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤一郎"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ichiro, Satoh","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","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_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"モバイルエージェントに処理を依頼する際には，複数のモバイルエージェントの中から移動先ホストにおける動作内容だけでなく，移動経路についても処理要求を満足するエージェントを選ぶ必要がある．そこで本論文では移動経路を基準とするモバイルエージェントの選択手法を提案していく．この手法は移動経路を記述する言語と，その言語により記述された式を比較する代数的順序関係から定式化される．前者はプロセス代数をもとにした仕様記述言語であり，後者はモバイルエージェントが所定のホストに効率的かつ要求された順序で移動できるかを判定するものとなる．そして，この手法のプロトタイプシステムをJava言語によるモバイルエージェントシステム上に実装した．モバイルエージェントはこの言語による経路記述を実行して移動可能となり，さらにモバイルエージェントへのタスク割当て方法として，タスク依頼の要求経路を満足するモバイルエージェントを選択する機構をこの順序関係を利用して実現した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"When assigning a task to mobile agents,one of the agents has to be selected according to not only their application-specific behavior but also their itineraries.This paper presents an approach for selecting mobile agents according to their itineraries.The approach offers a process algebra-based language for specifying the itinerary of mobile agents and an algebraic order relation between two itineraries specified as terms of the language.The relation can decide whether or not mobile agents can satisfy the itinerary required by a given task,in the sense that the agents can migrate to all the hosts required by the task in a permissible order specified by the task.A prototype implementation of this approach was built on a Java-based mobile agent system.It enables each mobile agent to specify its itinerary as a term of the language and to migrate over a network according to only the itinerary.Also, when it receives the request of a task,it can select a suitable mobile agent to perform the task by using the order relation.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1482","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1473","bibliographicIssueDates":{"bibliographicIssueDate":"2003-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"44"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"モバイルエージェント"}]},"weko_creator_id":"1"}}