{"created":"2023-05-15T12:25:43.717068+00:00","id":1042,"links":{},"metadata":{"_buckets":{"deposit":"7f5d8b98-82c5-4d10-85ce-9fe5c353705b"},"_deposit":{"created_by":4,"id":"1042","owners":[4],"pid":{"revision_id":0,"type":"depid","value":"1042"},"status":"published"},"_oai":{"id":"oai:kait.repo.nii.ac.jp:00001042","sets":["2:16:42:123"]},"author_link":[],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-03-20","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"72","bibliographicPageStart":"67","bibliographicVolumeNumber":"33","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":"In a certain group, if you can assign everyone in two or more frames one by one as decided capacity of each frame. It is simple. However, when you reflect the hope of everyone where they want to be transferred, it becomes not simple, because of it is bias their hope. Then, I propose to two methods. One is esteeming their opinions as much as possible, and the other is esteeming their opinions a little in the cause of making the capacity of each frame changeable a little. I show results of practicing each method.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10002_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.34411/00001035","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":"Kurokawa, Masaki","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Seki, Yasuo","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2012-03-01"}],"displaytype":"detail","filename":"kkb-033-013.pdf","filesize":[{"value":"2.7 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"kkb-033-013.pdf","objectType":"fulltext","url":"https://kait.repo.nii.ac.jp/record/1042/files/kkb-033-013.pdf"},"version_id":"3d49dd1a-96df-4073-b4a7-540ef65ec528"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"assign","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"capacity","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"bias","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":"複数枠への応募者の希望順の調整 アルゴリズムの1提案","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"複数枠への応募者の希望順の調整 アルゴリズムの1提案","subitem_title_language":"ja"},{"subitem_title":"A Suggestion about adjustment algorithm of orders hoped applicants to a number of frames adjustment algorithm","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"4","path":["123"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2020-11-24"},"publish_date":"2020-11-24","publish_status":"0","recid":"1042","relation_version_is_last":true,"title":["複数枠への応募者の希望順の調整 アルゴリズムの1提案"],"weko_creator_id":"4","weko_shared_id":-1},"updated":"2023-08-04T09:17:56.218254+00:00"}