{"created":"2023-06-19T12:05:32.423326+00:00","id":400,"links":{},"metadata":{"_buckets":{"deposit":"c8b55c4e-af22-4c06-9d34-4a0af0c20215"},"_deposit":{"created_by":15,"id":"400","owners":[15],"pid":{"revision_id":0,"type":"depid","value":"400"},"status":"published"},"_oai":{"id":"oai:u-nagano.repo.nii.ac.jp:00000400","sets":["6:32"]},"author_link":["144"],"item_7_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1993-12","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"64","bibliographicPageStart":"57","bibliographicVolumeNumber":"48","bibliographic_titles":[{"bibliographic_title":"長野県短期大学紀要"},{"bibliographic_title":"Journal of Nagano Prefectural College","bibliographic_titleLang":"en"}]}]},"item_7_description_12":{"attribute_name":"論文ID（NAID）","attribute_value_mlt":[{"subitem_description":"40002771520","subitem_description_type":"Other"}]},"item_7_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_7_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We show one-one correspondence between all binary trees with n internal nodes and certain bit strings, and the number of the bit strings. We then show the algorithms of ranking and unranking for the bit strings. As one of application problem, algorithms for drawing of all binary trees with n nodes are discussed.","subitem_description_type":"Abstract"}]},"item_7_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"長野県短期大学"}]},"item_7_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00179035","subitem_source_identifier_type":"NCID"}]},"item_7_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0286-1178","subitem_source_identifier_type":"ISSN"}]},"item_7_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"清水, 道夫"},{"creatorName":"シミズ, ミチオ","creatorNameLang":"ja-Kana"},{"creatorName":"Shimizu, Michio","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"144","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"9000003183524","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/9000003183524"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2014-02-14"}],"displaytype":"detail","filename":"kentan_kiyo-48-07.pdf","filesize":[{"value":"469.6 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"kentan_kiyo-48-07","url":"https://u-nagano.repo.nii.ac.jp/record/400/files/kentan_kiyo-48-07.pdf"},"version_id":"d3fdac76-119c-4de6-9e54-71b7b0911d61"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"2分木の符号化とその応用","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"2分木の符号化とその応用"},{"subitem_title":"Coding of binary trees and its application","subitem_title_language":"en"}]},"item_type_id":"7","owner":"15","path":["32"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-02-14"},"publish_date":"2014-02-14","publish_status":"0","recid":"400","relation_version_is_last":true,"title":["2分木の符号化とその応用"],"weko_creator_id":"15","weko_shared_id":-1},"updated":"2023-12-19T06:44:53.567709+00:00"}