{"created":"2023-05-15T12:25:37.370248+00:00","id":925,"links":{},"metadata":{"_buckets":{"deposit":"371d3678-16d7-4fef-9a1f-a3a80693da2e"},"_deposit":{"created_by":4,"id":"925","owners":[4],"pid":{"revision_id":0,"type":"depid","value":"925"},"status":"published"},"_oai":{"id":"oai:kait.repo.nii.ac.jp:00000925","sets":["2:16:41:116"]},"author_link":[],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2002-03-20","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"57","bibliographicPageStart":"49","bibliographicVolumeNumber":"26","bibliographic_titles":[{"bibliographic_title":"神奈川工科大学研究報告.B,理工学編"}]}]},"item_10002_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper describes a new algorithm to calculate availabilities of communication networks by using principle of optimality of dynamic programing (DP). It is wel known that state space decomposition method to calculate availabilities of communication networks is one of problems of NP-hard. Therefore, it is important to reduce computationalco mplexity. The proposed algorithm gives a procedure to save the size of binary tree on the way of state space decomposition. In the algorithm, the calculation of a part consisting of high network availability is taken place prior to other parts. From the feature of this algorithm, this paper also proposes the method to calculate the lower bound of network availability, and decomposition and reduction method to apply this algorithm to large scale networks.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10002_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.34411/00000918","subitem_identifier_reg_type":"JaLC"}]},"item_10002_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"神奈川工科大学"}]},"item_10002_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10074179","subitem_source_identifier_type":"NCID"}]},"item_10002_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09161902","subitem_source_identifier_type":"PISSN"}]},"item_10002_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"荒木, 智行","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"山本, 富士男","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"Araki, Tomoyuki","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yamamoto, Fujio","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2010-02-03"}],"displaytype":"detail","filename":"kkb-026-010.pdf","filesize":[{"value":"3.1 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"kkb-026-010.pdf","objectType":"fulltext","url":"https://kait.repo.nii.ac.jp/record/925/files/kkb-026-010.pdf"},"version_id":"4646de3a-5650-40b2-bf78-85c50dd2a1e7"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Network availability","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Network of mesh type","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Dinanlic programing","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"State space decomposition","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"2端子ネットワーク信頼性解析と近似解析法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"2端子ネットワーク信頼性解析と近似解析法","subitem_title_language":"ja"},{"subitem_title":"Analyzing Two-terminal Networks Availability and their Approximate Estimation","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"4","path":["116"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2020-11-24"},"publish_date":"2020-11-24","publish_status":"0","recid":"925","relation_version_is_last":true,"title":["2端子ネットワーク信頼性解析と近似解析法"],"weko_creator_id":"4","weko_shared_id":-1},"updated":"2023-08-04T09:07:02.780960+00:00"}