{"_buckets": {"deposit": "f9534d87-81ed-47bc-b491-1097d35358c1"}, "_deposit": {"id": "13167", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "13167"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00013167", "sets": ["322"]}, "author_link": ["41550", "41551"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2001-05-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "5", "bibliographicPageEnd": "1165", "bibliographicPageStart": "1161", "bibliographicVolumeNumber": "E84-A", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In this paper, we consider the net assignment problem in the logic emulation system. This problem is also known as the board-level-routing problem. There are field programmable logic arrays (FPGAs) and crossbars on an emulator board. Each FPGA is connected to each crossbar. Connection requests between FPGAs are called nets, and FPGAs are interconnected through crossbars. We are required to assign each net to the suitable crossbar. This problem is known to be NP-complete in general. A polynomial time algorithm is known for a certain restricted case, in which we treat only 2-terminal nets. In this paper we propose a new polynomial time algorithm for this case.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://www.ieice.org/jpn/trans_online/index.html"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/15062"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers", "subitem_publisher_language": "en"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 2001 IEICE", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0916-8508", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ONO, Takao", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41550", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "HIRATA, Tomio", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41551", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "461.pdf", "filesize": [{"value": "258.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 258399.99999999997, "url": {"label": "461.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/13167/files/461.pdf"}, "version_id": "73d9806b-25c1-4d28-84c1-e091844c6209"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "logic emulator", "subitem_subject_scheme": "Other"}, {"subitem_subject": "net assignment problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "edge coloring", "subitem_subject_scheme": "Other"}, {"subitem_subject": "nearly equitable edge coloring", "subitem_subject_scheme": "Other"}]}, "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": "An Improved Algorithm for the Net Assignment Problem", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An Improved Algorithm for the Net Assignment Problem", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["322"], "permalink_uri": "http://hdl.handle.net/2237/15062", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2011-07-13"}, "publish_date": "2011-07-13", "publish_status": "0", "recid": "13167", "relation": {}, "relation_version_is_last": true, "title": ["An Improved Algorithm for the Net Assignment Problem"], "weko_shared_id": -1}