{"updated":"2025-01-22T15:46:31.875738+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00033279","sets":["1164:2735:2760:2762"]},"path":["2762"],"owner":"1","recid":"33279","title":["文字数最大しりとり問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2004-09-13"},"_buckets":{"deposit":"03519480-a9ad-47f2-8a1e-e8e42b121ddd"},"_deposit":{"id":"33279","pid":{"type":"depid","value":"33279","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":"Solving the Maximum Character Length Shiritori Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2004-09-13","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学工学部情報コミュニケーション工学科"},{"subitem_text_value":"東京農工大学工学部情報コミュニケーション工学科"},{"subitem_text_value":"東京農工大学工学部情報コミュニケーション工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer, Information and Communication Sciences, Faculty of Engineering, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer, Information and Communication Sciences, Faculty of Engineering, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer, Information and Communication Sciences, Faculty of Engineering, Tokyo University of Agriculture and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/33279/files/IPSJ-MPS04051002.pdf"},"date":[{"dateType":"Available","dateValue":"2006-09-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS04051002.pdf","filesize":[{"value":"143.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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e618f901-5ac8-4377-8d05-5bb48b7169ee","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2004 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"乾, 伸雄"},{"creatorName":"品野, 勇治"},{"creatorName":"小谷, 善行"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nobuo, Inui","creatorNameLang":"en"},{"creatorName":"Yuji, Shinano","creatorNameLang":"en"},{"creatorName":"Yoshiyuki, Kotani","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では、しりとり全体に含まれる文字数を最長とする文字数最大しりとり問題をネットワークフロー問題としてモデル化し、LPベースの分枝限定法による解法および実験結果について述べる。単語数を最大にする最長しりとり問題に対して、問題を記述するための変数が最大単語長に比例して多くなる特徴を持つ。実験は実際の辞書に含まれる単語について行った。実験の結果、最長しりとり問題と同じく文字数最大しりとり問題は現実的な時間で解ける問題であることがわかった。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper describes the maximum character shiritori problem where a shiritori sequence with the maximum number of character is requested. We model this problem as a graph, propose a solution using LP-based branch-and-bound method and show experimental results. Against the longest shiritori problem where a shiritori sequence with the maximum number of words, this problem is characterized by the increased number of variables in proportion to the maximum length of words. We use actual words statistic in Japanese dictionaries for our experiments. From the results, the solution is easy to find as same as the longest shiritori problem.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"5","bibliographicIssueDates":{"bibliographicIssueDate":"2004-09-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"92(2004-MPS-051)","bibliographicVolumeNumber":"2004"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:02:09.573834+00:00","id":33279,"links":{}}