{"created":"2023-07-27T06:58:05.264960+00:00","id":55714,"links":{},"metadata":{"_buckets":{"deposit":"5358a061-15a3-4816-83dc-9e9825b72e10"},"_deposit":{"created_by":18,"id":"55714","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"55714"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00055714","sets":["2812:2813:2833"]},"author_link":["97040"],"item_9_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-09-16","bibliographicIssueDateType":"Issued"},"bibliographicPageStart":"2p.","bibliographicVolumeNumber":"1998 – 2000","bibliographic_titles":[{"bibliographic_title":"平成12(2000)年度 科学研究費補助金 特定領域研究(B) 研究概要"},{"bibliographic_title":"2000 Fiscal Year Final Research Report Summary","bibliographic_titleLang":"en"}]}]},"item_9_creator_33":{"attribute_name":"著者別表示","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{}],"nameIdentifiers":[{},{}]}]},"item_9_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"本研究では,従来アルゴリズム理論で重視されてきた漸近的解析の枠内では計算困難と思われてきた問題に対して積極的に取り組んできた.具体的には最適な網点の形状を設計する問題とクラスタリングに関する問題に取り組んだ.前者に対しては,計算幾何学において精力的に研究されてきたディスクレパンシの理論が適用できることに気がつき,従来の手法とは全く異なる解法を提案することができた.さらに,これをグラフ理論におけるマッチングの概念と結合することにより,さらに解の性能を向上させることに成功した.実験的にも良い結果が得られており,今後論文として発表する予定である.クラスタリングについては,特に画像データベースからの画像検索の問題に取り組み,従来の結果を凌駕する実験結果を得ることが出来た.これについても近いうちに論文として投稿する予定である.","subitem_description_type":"Abstract"},{"subitem_description":"In this study we have been engaged in several problems which were thought to be computationally Hard within the traditional framework of asymptotic analysis popular in the theory of algorithms. More concretely, we have studied the problem of designing optimal dot patterns for printing and that of clustering. For the former problem, we have noticed that the discrepancy theory can be applied to the problem. The discrepancy theory has been rigorously studied and is full of important theoretical results. Combining it with the notion of matching in the graph theory, we have succeeded in improving the performance of the solutions obtained. Since we also had satisfactory experimental results, we intend to submit the result to some journal. For the problem of clustering, we have applied an algorithmic approach to image query system On image database with good experimental results that exceed results by traditional Approaches. We are planning to summarize the results in a paper to be submitted to some International journal in near future.","subitem_description_type":"Abstract"}]},"item_9_description_22":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"研究課題/領域番号:10205207, 研究期間(年度):1998 - 2000","subitem_description_type":"Other"},{"subitem_description":"出典：「理論的には計算困難な問題の現実的解法に関する研究」研究成果報告書　課題番号10205207\n（KAKEN：科学研究費助成事業データベース（国立情報学研究所）） \n（https://kaken.nii.ac.jp/ja/report/KAKENHI-PROJECT-10205207/102052072001kenkyu_seika_hokoku_gaiyo/）を加工して作成","subitem_description_type":"Other"}]},"item_9_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学 / 北陸先端科学技術大学院大学","subitem_description_type":"Other"}]},"item_9_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.24517/00061989","subitem_identifier_reg_type":"JaLC"}]},"item_9_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/search/?qm=90113133"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/search/?qm=90113133","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-10205207/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-10205207/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"https://kaken.nii.ac.jp/ja/report/KAKENHI-PROJECT-10205207/102052072001kenkyu_seika_hokoku_gaiyo/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/ja/report/KAKENHI-PROJECT-10205207/102052072001kenkyu_seika_hokoku_gaiyo/","subitem_relation_type_select":"URI"}}]},"item_9_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2021-12-06"}],"displaytype":"detail","filename":"TE-PR-ASANO-T-kaken 2003-2p.pdf","filesize":[{"value":"81.5 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"TE-PR-ASANO-T-kaken 2003-2p.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/55714/files/TE-PR-ASANO-T-kaken 2003-2p.pdf"},"version_id":"afe82b90-e84d-48c7-944e-d866f548a19e"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"research report","resourceuri":"http://purl.org/coar/resource_type/c_18ws"}]},"item_title":"理論的には計算困難な問題の現実的解法に関する研究","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"理論的には計算困難な問題の現実的解法に関する研究"},{"subitem_title":"Studies on Realistic Solutions to Theoretically Hard Problems","subitem_title_language":"en"}]},"item_type_id":"9","owner":"18","path":["2833"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-12-06"},"publish_date":"2021-12-06","publish_status":"0","recid":"55714","relation_version_is_last":true,"title":["理論的には計算困難な問題の現実的解法に関する研究"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2023-07-27T14:05:48.155047+00:00"}