{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:14Z","timestamp":1740169154974,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2985103","type":"journal-article","created":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T21:14:38Z","timestamp":1585862078000},"page":"70664-70675","source":"Crossref","is-referenced-by-count":1,"title":["Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems"],"prefix":"10.1109","volume":"8","author":[{"given":"Junwen","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8980-4950","authenticated-orcid":false,"given":"Guanfeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianmei","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2015.45"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62127-2_48"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2944007"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487625"},{"key":"ref37","article-title":"Security-critical energy-aware task scheduling for heterogeneous real-time MPSoCs in IoT","author":"zhou","year":"2019","journal-title":"IEEE Trans Services Comput"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2935042"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IDEAS.2002.1029666"},{"key":"ref34","first-page":"73","article-title":"New bounds for range closest-pair problems","volume":"99","author":"xue","year":"2018","journal-title":"34th International Symposium on Computational Geometry (SoCG)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1966865.1966870"},{"key":"ref11","first-page":"1222","article-title":"Trust transitivity in complex social networks","author":"liu","year":"2011","journal-title":"Proc 21st AAAI Conf Artif Intell"},{"key":"ref12","first-page":"1575","article-title":"Optimal social trust path selection in complex social networks","author":"liu","year":"2010","journal-title":"Proc 24th AAAI Conf Artif Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2011.58"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.09.012"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11988-5_10"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2019.2944783"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01452-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04298-5_42"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3330139"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45227-0_48"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3323926"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335414"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0383-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1700360"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41062-8_13"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366104"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5681"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2016.44"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732981"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335428"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783321"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00034"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245293"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1800192"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749456"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09055019.pdf?arnumber=9055019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:31Z","timestamp":1642002991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9055019\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2985103","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}