{"created":"2025-01-18T23:43:58.553493+00:00","updated":"2025-01-21T12:52:13.792234+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097480","sets":["6164:6165:6210:7361"]},"path":["7361"],"owner":"11","recid":"97480","title":["Every Two-times Sorting Sequence Falls onto a Cycle"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-10-26"},"_buckets":{"deposit":"0e364f19-fd7d-4cd5-a943-631bc0939846"},"_deposit":{"id":"97480","pid":{"type":"depid","value":"97480","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Every Two-times Sorting Sequence Falls onto a Cycle","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Every Two-times Sorting Sequence Falls onto a Cycle"},{"subitem_title":"Every Two-times Sorting Sequence Falls onto a Cycle","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2001-10-26","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Shizuoka University"},{"subitem_text_value":"Department of Computer Science, Shizuoka University"},{"subitem_text_value":"Department of Computer Science, Shizuoka University"},{"subitem_text_value":"Department of Computer Science, Shizuoka University"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Shizuoka University","subitem_text_language":"en"}]},"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/97480/files/IPSJ-GPWS2001007.pdf"},"date":[{"dateType":"Available","dateValue":"2001-10-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2001007.pdf","filesize":[{"value":"773.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"56e2d214-9c38-443c-9cc0-7cc7b8dd0a3b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Sakuta, Makoto"},{"creatorName":"Araya, Makoto"},{"creatorName":"Haque, Zahidul"},{"creatorName":"Iida, Hiroyuki"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Sakuta, Makoto","creatorNameLang":"en"},{"creatorName":"Araya, Makoto","creatorNameLang":"en"},{"creatorName":"Haque, Zahidul","creatorNameLang":"en"},{"creatorName":"Iida, Hiroyuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"A two-times sorting sequence is constructed by calculating the next number with doubling the current number and sorting its digits into non-decreasing order. We propose the appropriate representation of a number with the arbitrary length of digits and the algorithms to calculate the sequence. Using this representation, we investigate two important properties of the sequence, i.e., cyclic and inductive. By the examination of the computer program, it is proved that every two-times sorting sequence falls onto a periodic cycle with the cyclic length 1, 2, 3, 4, 5, 6, or 12.","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A two-times sorting sequence is constructed by calculating the next number with doubling the current number and sorting its digits into non-decreasing order. We propose the appropriate representation of a number with the arbitrary length of digits and the algorithms to calculate the sequence. Using this representation, we investigate two important properties of the sequence, i.e., cyclic and inductive. By the examination of the computer program, it is proved that every two-times sorting sequence falls onto a periodic cycle with the cyclic length 1, 2, 3, 4, 5, 6, or 12.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"55","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2001論文集"}],"bibliographicPageStart":"48","bibliographicIssueDates":{"bibliographicIssueDate":"2001-10-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"14","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":97480,"links":{}}