{"created":"2025-01-18T22:49:28.279050+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00016107","sets":["581:899:905"]},"path":["905"],"owner":"1","recid":"16107","title":["分散記憶法における探索頻度を考慮した探索路長とその評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"1983-01-15"},"_buckets":{"deposit":"9dabbd28-d6a1-4c7b-995c-426b14d17055"},"_deposit":{"id":"16107","pid":{"type":"depid","value":"16107","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":"The Number of Probes Considering the Frequency Distributions and Its Evaluations","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1983-01-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"熊本大学電子計算機室"},{"subitem_text_value":"熊本大学"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"University of Kumamoto","subitem_text_language":"en"},{"subitem_text_value":"University of Kumamoto","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/16107/files/IPSJ-JNL2401016.pdf"},"date":[{"dateType":"Available","dateValue":"1985-01-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL2401016.pdf","filesize":[{"value":"327.2 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":"ec50b1bf-6d0a-4e4c-bf8a-cf12d4cde773","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1983 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中村, 良三"},{"creatorName":"松山, 公一"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryozo, Nakamura","creatorNameLang":"en"},{"creatorName":"Kimikazu, Matsuyama","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":"分散記憶法はその衝突の処理の方法によって連鎖法と計算法に大別される.これらの手法における探索路長は見出しの探索頻度が一様であると仮定したときにはすでに求められているが 現実の問題では各見出しの探索頻度は個々に異なるものである.それゆえ 各見出しの探索頻度を考慮した探索路長を求めることができれば より厳密な探索路長の評価を行うことができる.本論文では 各見出しが探索される確率を考慮に入れた観点から 分離連鎖法における探索路長について議論し その表現式を導き出す。次に この表現式で 探索頻度に具体的な確率分布を与えたときの探索路長を示すとともに従来の表現式と比較検討する.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"130","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"125","bibliographicIssueDates":{"bibliographicIssueDate":"1983-01-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"24"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"links":{},"id":16107,"updated":"2025-01-23T00:01:45.087600+00:00"}