{"created":"2025-01-19T00:06:43.002634+00:00","updated":"2025-01-21T01:27:18.357740+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00127166","sets":["6504:8078:8080"]},"path":["8080"],"owner":"1","recid":"127166","title":["整列法評価のためのランダム順列の生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"1995-03-15"},"_buckets":{"deposit":"9073d705-72a7-4283-8eaf-a67c8f96887d"},"_deposit":{"id":"127166","pid":{"type":"depid","value":"127166","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"整列法評価のためのランダム順列の生成","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"整列法評価のためのランダム順列の生成"},{"subitem_title":"Random Permutation Generator for Evaluating Sorting Algorithms","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1995-03-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学理工学部"},{"subitem_text_value":"早稲田大学理工学部"},{"subitem_text_value":"早稲田大学理工学部"},{"subitem_text_value":"早稲田大学理工学部"},{"subitem_text_value":"早稲田大学理工学部"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"School of Science and Engineering, Waseda 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/127166/files/KJ00001333543.pdf"},"date":[{"dateType":"Available","dateValue":"1995-03-15"}],"format":"application/pdf","filename":"KJ00001333543.pdf","filesize":[{"value":"240.1 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"ca6b998c-b148-49b6-b805-4a96f1978a26","displaytype":"detail","licensetype":"license_note"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"整列法(ソーティングアルゴリズム)の性能評価のための入力列として、従来は多くの場合に一様乱数列が利用されてきた。しかし現実の問題としてソーティングを扱う場合には、与えられた数列はほとんど整列済みであることが多いと言われている。従って、ソーティングアルゴリズムの性能評価をする際には、入力列の整列度合を表す各種の事前整列性測度を制御しながら入力列を生成する必要がある。実際ある種の整列性測度で見ると一様乱数は非常に偏った値を持ち、整列法の性能評価には不適である。本稿では(1)事前整列性測度のうち、葉数(数列内で隣接する要素より小さい要素の個数)を制御し、任意に与えられた葉数mを持つ順列を一様に生成する方法、(2)生成された順列の一様性を検定する方法および(3)検定結果について報告する。葉数の事前整列性測度としての妥当性については[4]で述べた。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"130","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"129","bibliographicIssueDates":{"bibliographicIssueDate":"1995-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"基礎理論及び基礎技術","bibliographicVolumeNumber":"第50回"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":127166,"links":{}}