{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:09Z","timestamp":1750220949839,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:00:00Z","timestamp":1555372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and communications Technology Promotion","doi-asserted-by":"publisher","award":["No.2014-0-00065"],"award-info":[{"award-number":["No.2014-0-00065"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2013K1A1A2A02078326"],"award-info":[{"award-number":["NRF-2013K1A1A2A02078326"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,16]]},"DOI":"10.1145\/3302509.3313324","type":"proceedings-article","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T18:38:43Z","timestamp":1554403123000},"page":"326-327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Data-based model of metro scheduling for passenger wait-time optimization with constraints"],"prefix":"10.1145","author":[{"given":"Minji","family":"Kim","sequence":"first","affiliation":[{"name":"DGIST, Daegu, Republic of Korea"}]},{"given":"Hee Jung","family":"Yoon","sequence":"additional","affiliation":[{"name":"DGIST, Daegu, Republic of Korea"}]},{"given":"Sang Hyuk","family":"Son","sequence":"additional","affiliation":[{"name":"DGIST, Daegu, Republic of Korea"}]},{"given":"Yongsoon","family":"Eun","sequence":"additional","affiliation":[{"name":"DGIST, Daegu, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2019,4,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester Martin","year":"1996","journal-title":"Kdd"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMARTCOMP.2017.7947021"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/atr.1317"}],"event":{"name":"ICCPS '19: ACM\/IEEE 10th International Conference on Cyber-Physical Systems","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems","IEEE-CS\\TCRT TC on Real-Time Systems"],"location":"Montreal Quebec Canada","acronym":"ICCPS '19"},"container-title":["Proceedings of the 10th ACM\/IEEE International Conference on Cyber-Physical Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3302509.3313324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3302509.3313324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:55Z","timestamp":1750204435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3302509.3313324"}},"subtitle":["WIP abstract"],"short-title":[],"issued":{"date-parts":[[2019,4,16]]},"references-count":3,"alternative-id":["10.1145\/3302509.3313324","10.1145\/3302509"],"URL":"https:\/\/doi.org\/10.1145\/3302509.3313324","relation":{},"subject":[],"published":{"date-parts":[[2019,4,16]]},"assertion":[{"value":"2019-04-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}