{"created":"2021-03-01T06:17:19.129438+00:00","id":10488,"links":{},"metadata":{"_buckets":{"deposit":"f65a4284-a01a-4afd-870a-167b3b84fb74"},"_deposit":{"id":"10488","owners":[],"pid":{"revision_id":0,"type":"depid","value":"10488"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00010488","sets":["312:313:314"]},"author_link":["31798","31799"],"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-05","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"61","bibliographicPageStart":"52","bibliographic_titles":[{"bibliographic_title":"Mobile Data Management: Systems, Services and Middleware, 2009. MDM '09. Tenth International Conference on","bibliographic_titleLang":"en"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"A nearest neighbor query is an important notion inspatial databases and moving object databases. In the emergingapplication fields of moving object technologies, such as mobilesensors and mobile robotics, the location of an object is oftenimprecise due to noise and estimation errors. We proposetechniques for processing a nearest neighbor query when thelocation of the query object is specified by an imprecise Gaussiandistribution. First, we consider two query processing strategiesfor pruning candidate objects, which can reduce the numberof objects that require numerical integration for computing thequalification probabilities. In addition, we consider a hybridapproach that combines the two strategies. The performance ofthe proposed methods is evaluated using test data.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10_identifier_60":{"attribute_name":"URI","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/2237/12311"},{"subitem_identifier_type":"DOI","subitem_identifier_uri":"http://dx.doi.org/10.1109/MDM.2009.16"}]},"item_10_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEEE CS Press.","subitem_publisher_language":"en"}]},"item_10_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1109/MDM.2009.16","subitem_relation_type_select":"DOI"}}]},"item_10_relation_8":{"attribute_name":"ISBN","attribute_value_mlt":[{"subitem_relation_type":"isPartOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"978-1-4244-4153-2","subitem_relation_type_select":"ISBN"}}]},"item_10_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright © 2009 IEEE. Reprinted from Mobile Data Management: Systems, Services and Middleware, 2009. MDM '09. Tenth International Conference on. 2009, p.52-61.<br/> This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Nagoya University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.","subitem_rights_language":"en"}]},"item_10_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_10_text_14":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_text_value":"application/pdf"}]},"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":"Iijima, Yuichi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"31798","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Ishikawa, Yoshiharu","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"31799","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-02-20"}],"displaytype":"detail","filename":"mdm.pdf","filesize":[{"value":"814.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"mdm.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/10488/files/mdm.pdf"},"version_id":"541b4355-9c8e-4308-837c-5e629cb28066"}]},"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":"Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations","subitem_title_language":"en"}]},"item_type_id":"10","owner":"1","path":["314"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2009-10-29"},"publish_date":"2009-10-29","publish_status":"0","recid":"10488","relation_version_is_last":true,"title":["Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T04:32:52.320957+00:00"}