{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T19:16:12Z","timestamp":1771787772560,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T00:00:00Z","timestamp":1516406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"SFI","award":["13\/RC\/2094"],"award-info":[{"award-number":["13\/RC\/2094"]}]},{"name":"UK EPSRC"},{"name":"National High Technology Development 863 Program of China","award":["2015AA01A203"],"award-info":[{"award-number":["2015AA01A203"]}]},{"name":"ERC Advanced","award":["291652 (ASAP)"],"award-info":[{"award-number":["291652 (ASAP)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"<jats:p>\n            Some user needs can only be met by leveraging the capabilities of others to undertake particular tasks that require intelligence and labor. Crowdsourcing such capabilities is one way to achieve this. But providing a service that leverages crowd intelligence and labor is a challenge, since various factors need to be considered to enable reliable service provisioning. For example, the selection of an optimal set of workers from those who bid to perform a task needs to be made based on their reliability, expected reward, and distance to the target locations. Moreover, for an application involving multiple services, the overall cost and time constraints must be optimally allocated to each involved service. In this article, we develop a framework, named C\n            <jats:sc>rowd<\/jats:sc>\n            S\n            <jats:sc>ervice<\/jats:sc>\n            , that supplies crowd intelligence and labor as publicly accessible crowd services via mobile crowdsourcing. The article extends our earlier work by providing an approach for constraints synthesis and worker selection. It employs a genetic algorithm to dynamically synthesize and update near-optimal cost and time constraints for each crowd service involved in a composite service and selects a near-optimal set of workers for each crowd service to be executed. We implement the proposed framework on Android platforms and evaluate its effectiveness, scalability, and usability in both experimental and user studies.\n          <\/jats:p>","DOI":"10.1145\/3108935","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T13:22:59Z","timestamp":1516627379000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["CrowdService"],"prefix":"10.1145","volume":"18","author":[{"given":"Xin","family":"Peng","sequence":"first","affiliation":[{"name":"School of Computer Science, Fudan University, China; Shanghai Key Laboratory of Data Science, Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingxiao","family":"Gu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, China; Shanghai Key Laboratory of Data Science, Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian Huat","family":"Tan","sequence":"additional","affiliation":[{"name":"Acronis, Singapore, Mapex, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Sun","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijun","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computing and Communications, The Open University, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bashar","family":"Nuseibeh","sequence":"additional","affiliation":[{"name":"Department of Computing and Communications, The Open University, UK; Lero\u2014The Irish Software Research Centre, University of Limerick, Limerick, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyun","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, China; Shanghai Key Laboratory of Data Science, Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526828"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772693"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2016.59"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2047196.2047201"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488403"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068189"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2012.70"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41202-8_21"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733047"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187900"},{"key":"e_1_2_1_11_1","volume-title":"Genetic algorithms -- Principles of natural selection applied to computation. Science 261, 5123","author":"Forrest Stephanie","year":"1993","unstructured":"Stephanie Forrest and others. 1993. Genetic algorithms -- Principles of natural selection applied to computation. Science 261, 5123 ( 1993 ), 872--878. Stephanie Forrest and others. 1993. Genetic algorithms -- Principles of natural selection applied to computation. Science 261, 5123 (1993), 872--878."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989331"},{"key":"e_1_2_1_13_1","volume-title":"Evolutionary Computation","author":"Gen Mitsuo","unstructured":"Mitsuo Gen , Runwei Cheng , and Dingwei Wang . 1997. Genetic algorithms for solving shortest path problems . In Evolutionary Computation . IEEE , 401--406. Mitsuo Gen, Runwei Cheng, and Dingwei Wang. 1997. Genetic algorithms for solving shortest path problems. In Evolutionary Computation. IEEE, 401--406."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213880"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567988"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/WETICE.2015.31"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-008-0212-5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642918.2647349"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568033"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SERVICES.2007.67"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486963"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2008.92"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2012.189"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2014.31"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970334"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983830"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979148"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2307636.2307668"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2008.98"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2820116.2820120"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568249"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486860"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884861"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544865"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187969"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2423636.2423649"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465280"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2014.10"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ESEM.2015.7321192"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2015.26"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI\u201915)","author":"Yu Han","year":"2015","unstructured":"Han Yu , Chunyan Miao , Zhiqi Shen , Cyril Leung , Yiqiang Chen , and Qiang Yang . 2015 . Efficient task sub-delegation for crowdsourcing . In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI\u201915) . AAAI Press, 1305--1311. Han Yu, Chunyan Miao, Zhiqi Shen, Cyril Leung, Yiqiang Chen, and Qiang Yang. 2015. Efficient task sub-delegation for crowdsourcing. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI\u201915). AAAI Press, 1305--1311."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2307636.2307671"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3108935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3108935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:44Z","timestamp":1750212824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3108935"}},"subtitle":["Optimizing Mobile Crowdsourcing and Service Composition"],"short-title":[],"issued":{"date-parts":[[2018,1,20]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3108935"],"URL":"https:\/\/doi.org\/10.1145\/3108935","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,20]]},"assertion":[{"value":"2016-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}