{"updated":"2025-01-19T20:39:20.829496+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00203136","sets":["581:10023:10025"]},"path":["10025"],"owner":"44499","recid":"203136","title":["内容アドレッシングを用いた多粒度漢字構造情報表現の試み"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-02-15"},"_buckets":{"deposit":"db8ac5dc-1126-4cd4-9ab1-18c39a26e099"},"_deposit":{"id":"203136","pid":{"type":"depid","value":"203136","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"内容アドレッシングを用いた多粒度漢字構造情報表現の試み","author_link":["499789","499788"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"内容アドレッシングを用いた多粒度漢字構造情報表現の試み"},{"subitem_title":"An Attempt of Multiple Granularity Hanzi Structure Representation Using Content Addressing","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：人文科学とコンピュータ] 漢字，包摂規準，IDS，内容アドレッシング，IPLD，IPFS","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2020-02-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学人文科学研究所附属東アジア人文情報学研究センター"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Center for Informatics in East Asian Studies, Institute for Research in Humanities, Kyoto University","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/203136/files/IPSJ-JNL6102008.pdf","label":"IPSJ-JNL6102008.pdf"},"date":[{"dateType":"Available","dateValue":"2022-02-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6102008.pdf","filesize":[{"value":"436.7 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":"3d68422f-075c-4556-bb03-e77728f7778e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"守岡, 知彦"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tomohiko, Morioka","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":"複数の包摂粒度を許容する漢字構造記述を内容アドレッシングを用いた分散データモデルの1つであるIPLDに基づいて実現する試みについて述べる．IPLDはMerkle DAGというデータ構造を用いている．これは暗号学的ハッシュを用いてラベル付けされた不変オブジェクトをノードとする有向非巡回グラフであり，オブジェクト間の関係は片方向しか表現できない．この制約の下で編集可能な文字知識を表現するために，不変性の高い基礎的オブジェクトへのリンクを含む複合的なオブジェクトによって可変性のある文字オブジェクトを表現するための形式を提案する．また，IPLDグラフの逆リンクや場所アドレッシングの実現手法について検討するとともに，既存のグラフストレージでの試験的実装についても述べる．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper describes an attempt to realize content addressed representation of Hanzi structure description to support multiple unification granularity using IPLD which is one of distributed data models. IPLD uses a data structure called Merkle DAG. This is a directed acyclic graph in which every node is labeled with the cryptographic hash of its content. As its name implies, relationships between objects can be expressed only in one direction. In order to realize editable character knowledge under this restriction, we propose a format to represent a variable character object by a complex object including links to basic objects that are highly invariant. We also examine a method to realize reverse links and location addressing of the IPLD graph, and describe an experimental implementation using an existing graph storage.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"178","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"171","bibliographicIssueDates":{"bibliographicIssueDate":"2020-02-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"61"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:05:35.022912+00:00","id":203136,"links":{}}