WEKO3
アイテム
{"_buckets": {"deposit": "536733ae-6d8c-450d-a071-58b47a76ca20"}, "_deposit": {"id": "48968", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "48968"}, "status": "published"}, "_oai": {"id": "oai:repository.dl.itc.u-tokyo.ac.jp:00048968", "sets": ["15", "96"]}, "item_2_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2015-06-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "6", "bibliographicPageEnd": "1312", "bibliographicPageStart": "1310", "bibliographicVolumeNumber": "E98-A", "bibliographic_titles": [{"bibliographic_title": "IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences"}]}]}, "item_2_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In this letter, we derive two lower bounds for the number of terms in a double-base number system (DBNS), when the digit set is {1}. For a positive integer n, we show that the number of terms obtained from the greedy algorithm proposed by Dimitrov, Imbert, and Mishra [1] is $Thetaleft(rac{log n}{log log n} ight)$. Also, we show that the number of terms in the shortest double-base chain is Θ(log n).", "subitem_description_type": "Abstract"}]}, "item_2_description_6": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "LETTER", "subitem_description_type": "Other"}]}, "item_2_publisher_20": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers"}]}, "item_2_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1587/transfun.E98.A.1310", "subitem_relation_type_select": "DOI"}}]}, "item_2_relation_25": {"attribute_name": "関係URI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/", "subitem_relation_type_select": "URI"}}]}, "item_2_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "copyright©2015 IEICE"}]}, "item_2_select_14": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_2_text_4": {"attribute_name": "著者所属", "attribute_value_mlt": [{"subitem_text_value": "the Department of Algorithms and Complexity, Max-Planck-Institut für Informatik"}, {"subitem_text_value": "the Graduate School of Information Science and Technology, The University of Tokyo, Tokyo"}, {"subitem_text_value": "Global Research Center for Big Data Mathematics, National Institute of Informatics"}, {"subitem_text_value": "JST, ERATO Kawarabayashi Large Graph Project"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "CHALERMSOOK, Parinya"}], "nameIdentifiers": [{"nameIdentifier": "145505", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "IMAI, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "145506", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SUPPAKITPAISARN, Vorapong"}], "nameIdentifiers": [{"nameIdentifier": "145507", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-12-15"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "Two Lower Bounds for Shortest Double-Base Number System 2015.pdf", "filesize": [{"value": "82.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 82400.0, "url": {"label": "Two Lower Bounds for Shortest Double-Base Number System 2015.pdf", "url": "https://repository.dl.itc.u-tokyo.ac.jp/record/48968/files/Two Lower Bounds for Shortest Double-Base Number System 2015.pdf"}, "version_id": "3c12f999-e513-4743-9e62-bc9a2e7134a9"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Two Lower Bounds for Shortest Double-Base Number System", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Two Lower Bounds for Shortest Double-Base Number System"}]}, "item_type_id": "2", "owner": "1", "path": ["15", "96"], "permalink_uri": "http://hdl.handle.net/2261/00074093", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-12-14"}, "publish_date": "2017-12-14", "publish_status": "0", "recid": "48968", "relation": {}, "relation_version_is_last": true, "title": ["Two Lower Bounds for Shortest Double-Base Number System"], "weko_shared_id": null}
Two Lower Bounds for Shortest Double-Base Number System
http://hdl.handle.net/2261/00074093
http://hdl.handle.net/2261/000740938d5f3b69-c35c-4cb3-bbe5-f430386b536c
名前 / ファイル | ライセンス | アクション |
---|---|---|
Two Lower Bounds for Shortest Double-Base Number System 2015.pdf (82.4 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-12-14 | |||||
タイトル | ||||||
タイトル | Two Lower Bounds for Shortest Double-Base Number System | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
CHALERMSOOK, Parinya
× CHALERMSOOK, Parinya× IMAI, Hiroshi× SUPPAKITPAISARN, Vorapong |
|||||
著者所属 | ||||||
著者所属 | the Department of Algorithms and Complexity, Max-Planck-Institut für Informatik | |||||
著者所属 | ||||||
著者所属 | the Graduate School of Information Science and Technology, The University of Tokyo, Tokyo | |||||
著者所属 | ||||||
著者所属 | Global Research Center for Big Data Mathematics, National Institute of Informatics | |||||
著者所属 | ||||||
著者所属 | JST, ERATO Kawarabayashi Large Graph Project | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | In this letter, we derive two lower bounds for the number of terms in a double-base number system (DBNS), when the digit set is {1}. For a positive integer n, we show that the number of terms obtained from the greedy algorithm proposed by Dimitrov, Imbert, and Mishra [1] is $Thetaleft(rac{log n}{log log n} ight)$. Also, we show that the number of terms in the shortest double-base chain is Θ(log n). | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | LETTER | |||||
書誌情報 |
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences 巻 E98-A, 号 6, p. 1310-1312, 発行日 2015-06-01 |
|||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1587/transfun.E98.A.1310 | |||||
権利 | ||||||
権利情報 | copyright©2015 IEICE | |||||
著者版フラグ | ||||||
値 | publisher | |||||
出版者 | ||||||
出版者 | Institute of Electronics, Information and Communication Engineers | |||||
関係URI | ||||||
識別子タイプ | URI | |||||
関連識別子 | https://search.ieice.org/ |