{"created":"2025-01-18T23:01:09.784360+00:00","updated":"2025-01-22T16:24:02.469958+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031954","sets":["1164:2592:2633:2634"]},"path":["2634"],"owner":"1","recid":"31954","title":["1 ビット・セルラオートマトンにおける最適時間一斉射撃アルゴリズムの実現"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-11-08"},"_buckets":{"deposit":"1695cfb7-376f-45f4-880f-b0b3b4334d16"},"_deposit":{"id":"31954","pid":{"type":"depid","value":"31954","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"1 ビット・セルラオートマトンにおける最適時間一斉射撃アルゴリズムの実現","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"1 ビット・セルラオートマトンにおける最適時間一斉射撃アルゴリズムの実現"},{"subitem_title":"A Realization of Optimum - Time Firing Squad Synchronization Algorithm on 1 - Bit Cellular Automaton","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-11-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社メガチップス"},{"subitem_text_value":"株式会社インターネットイニシアティブ"},{"subitem_text_value":"大阪電気通信大学総合情報学部情報工学科大阪電気通信大学大学院情報工学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"MegaChips Co., LTD.","subitem_text_language":"en"},{"subitem_text_value":"Internet Initiative Japan Inc.,","subitem_text_language":"en"},{"subitem_text_value":"Osaka Electro - Communication Univ., Faculty of Information Science and Technology, Osaka Electro-Communication Univ., Graduate School of Engineering","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/31954/files/IPSJ-AL02087009.pdf"},"date":[{"dateType":"Available","dateValue":"2004-11-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL02087009.pdf","filesize":[{"value":"240.5 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1fc8fe33-fd5e-4b9b-bacf-6a4379c8f9a4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"西村, 順"},{"creatorName":"曽我部, 崇"},{"creatorName":"梅尾, 博司"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Jun, Nishimura","creatorNameLang":"en"},{"creatorName":"Takashi, Sogabe","creatorNameLang":"en"},{"creatorName":"Hiroshi, Umeo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"n 個のセルからなるセル空間の同期を2n - 2 ステップの最適時間で実現するセルラ・オートマトン(CA)は従来から数多く提案されている．これらのセルラ・オートマトンにおいて，隣接するセル間の1 ステップ当たりの通信量はO(1)ビットであるが，セル間通信量は有限状態記述というオートマトンの定義には明示的に現れず，セル間通信量に関する研究はこれまであまりなされていない．本稿では，1 ステップあたりのセル間通信量を1 ビットに制限したセルラ・オートマトン・モデルCA1-bit を定義し，CA1-bit 上で最適時間で動作する一斉射撃アルゴリズムを提案する．我々のアルゴリズムは，すでに正当性が示されているWaksman のアルゴリズム[7 8](セル間通信量はO(1)ビットである)をベースとしており，セルの内部状態数は78 ，遷移規則数は208 である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the long history of the study of cellular automata, the amounts of bit-information exchanged at one step between neighboring cells have been assumed to be O(1)-bit. In this paper we introduce a new class of cellular automata, CA1-bit, whose inter-cell communication is restricted to 1-bit and propose an optimum-time (2n -2)-step firing squad synchronization algorithms for n cells on CA1-bit. The number of internal states in each cell is 78 and the total number of transition rules is 208. The algorithm we propose is based on Waksman’s optimum-time algorithm which has been shown valid for any n.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"66","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"59","bibliographicIssueDates":{"bibliographicIssueDate":"2002-11-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"103(2002-AL-087)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":31954,"links":{}}