乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:18Z","timestamp":1740136158720,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1353089","CCF-1422603"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["REU-026935"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHE 1592\/3-1"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11047-017-9658-6","type":"journal-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T15:49:16Z","timestamp":1511884156000},"page":"81-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["On the runtime of universal coating for programmable matter"],"prefix":"10.1007","volume":"17","author":[{"given":"Joshua J.","family":"Daymude","sequence":"first","affiliation":[]},{"given":"Zahra","family":"Derakhshandeh","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Gmyr","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Porter","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9a W.","family":"Richa","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]},{"given":"Thim","family":"Strothmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"issue":"4","key":"9658_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235\u2013253","journal-title":"Distrib Comput"},{"key":"9658_CR2","doi-asserted-by":"crossref","unstructured":"Bl\u00e1zovics L, Csorba K, Forstner B, Charaf H (2012a) Target tracking and surrounding with swarm robots. In: Proceedings of the 19th IEEE international conference and workshops on the engineering of computer based systems (ECBS \u201912), pp 135\u2013141","DOI":"10.1109\/ECBS.2012.41"},{"key":"9658_CR3","doi-asserted-by":"crossref","unstructured":"Bl\u00e1zovics L, Lukovszki T, Forstner B (2012b) Target surrounding solution for swarm robots. In: Information and communication technologies (EUNICE \u201912), pp 251\u2013262","DOI":"10.1007\/978-3-642-32808-4_23"},{"key":"9658_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jtbi.2012.06.017","volume":"309","author":"V Bonifaci","year":"2012","unstructured":"Bonifaci V, Mehlhorn K, Varma G (2012) Physarum can compute shortest paths. J Theor Biol 309:121\u2013133","journal-title":"J Theor Biol"},{"issue":"1","key":"9658_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11721-012-0075-2","volume":"7","author":"M Brambilla","year":"2013","unstructured":"Brambilla M, Ferrante E, Birattari M, Dorigo M (2013) Swarm robotics: a review from the swarm engineering perspective. Swarm Intell 7(1):1\u201341","journal-title":"Swarm Intell"},{"issue":"2","key":"9658_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11047-014-9432-y","volume":"14","author":"M Chen","year":"2015","unstructured":"Chen M, Xin D, Woods D (2015) Parallel computation using active self-assembly. Nat Comput 14(2):225\u2013250","journal-title":"Nat Comput"},{"key":"9658_CR7","unstructured":"Daymude JJ, Derakhshandeh Z, Gmyr R, Strothmann T, Bazzi RA, Richa AW, Scheideler C (2015) Leader election and shape formation with self-organizing programmable matter. CoRR, abs\/1503.07991, 2016. A preliminary version of this work appeared in DNA21, pp 117\u2013132"},{"key":"9658_CR8","doi-asserted-by":"crossref","unstructured":"Daymude JJ, Gmyr R, Richa AW, Scheideler C, Strothmann T (2017) Improved leader election for self-organizing programmable matter. Appeared at the 13th international symposium for algorithms and experiments for wireless networks (ALGOSENSORS \u201917). Available at CoRR:abs\/1701.03616","DOI":"10.1007\/978-3-319-72751-6_10"},{"key":"9658_CR9","doi-asserted-by":"crossref","unstructured":"Derakhshandeh Z, Dolev S, Gmyr R, Richa AW, Scheideler C, Strothmann T (2014) Brief announcement: amoebot\u2014a new model for programmable matter. In: Proceedings of the 26th ACM symposium on parallelism in algorithms and architectures (SPAA \u201914), pp 220\u2013222","DOI":"10.1145\/2612669.2612712"},{"key":"9658_CR10","doi-asserted-by":"crossref","unstructured":"Derakhshandeh Z, Gmyr R, Richa AW, Scheideler C, Strothmann T (2015) An algorithmic framework for shape formation problems in self-organizing particle systems. In: Proceedings of the 2nd international conference on nanoscale computing and communication (NanoCom \u201915), pp 21:1\u201321:2","DOI":"10.1145\/2800795.2800829"},{"key":"9658_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2016.02.039","volume":"671","author":"Z Derakhshandeh","year":"2017","unstructured":"Derakhshandeh Z, Gmyr R, Richa AW, Scheideler C, Strothmann T (2017) Universal coating for programmable matter. Theor Comput Sci 671:56\u201368","journal-title":"Theor Comput Sci"},{"issue":"12","key":"9658_CR12","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty D (2012) Theory of algorithmic self-assembly. Commun ACM 55(12):78\u201388","journal-title":"Commun ACM"},{"key":"9658_CR13","unstructured":"Kumar GP, Berman S (2014) Statistical analysis of stochastic multi-robot boundary coverage. In: Proceedings of the 2014 IEEE international conference on robotics and automation (ICRA \u201914), pp 74\u201381"},{"key":"9658_CR14","doi-asserted-by":"crossref","unstructured":"Li K, Thomas K, Torres C, Rossi L, Shen C-C (2010) Slime mold inspired path formation protocol for wireless sensor networks. In: Proceedings of the 7th international conference on swarm intelligence (ANTS \u201910), pp 299\u2013311","DOI":"10.1007\/978-3-642-15461-4_26"},{"key":"9658_CR15","volume-title":"Distributed algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch N (1996) Distributed algorithms. Morgan Kauffman, San Francisco"},{"issue":"3","key":"9658_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00446-015-0257-4","volume":"29","author":"O Michail","year":"2016","unstructured":"Michail O, Spirakis PG (2016) Simple and efficient local codes for distributed stable network construction. Distrib Comput 29(3):207\u2013237","journal-title":"Distrib Comput"},{"issue":"2","key":"9658_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11047-013-9379-4","volume":"13","author":"MJ Patitz","year":"2014","unstructured":"Patitz MJ (2014) An introduction to tile-based self-assembly and a survey of recent results. Nat Comput 13(2):195\u2013224","journal-title":"Nat Comput"},{"key":"9658_CR18","first-page":"631","volume-title":"Robotics research, Springer tracts in advanced robotics, vol 114","author":"TP Pavlic","year":"2016","unstructured":"Pavlic TP, Wilson S, Kumar GP, Berman S (2016) An enzyme-inspired approach to stochastic allocation of robotic swarms around boundaries. In: Inaba M, Corke P (eds) Robotics research, Springer tracts in advanced robotics, vol 114. Springer, Cham, pp 631\u2013647"},{"key":"9658_CR19","unstructured":"Self-organizing particle systems. \n https:\/\/sops.engineering.asu.edu\/simulations\/"},{"issue":"4","key":"9658_CR20","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11721-014-0100-8","volume":"8","author":"S Wilson","year":"2014","unstructured":"Wilson S, Pavlic T, Kumar G, Buffin A, Pratt SC, Berman S (2014) Design of ant-inspired stochastic control policies for collective transport by robotic swarms. Swarm Intell 8(4):303\u2013327","journal-title":"Swarm Intell"},{"key":"9658_CR21","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2014.0214","author":"D Woods","year":"2015","unstructured":"Woods D (2015) Intrinsic universality and the computational power of self-assembly. Philos Trans R Soc A Math Phys Eng Sci. \n https:\/\/doi.org\/10.1098\/rsta.2014.0214","journal-title":"Philos Trans R Soc A Math Phys Eng Sci"},{"key":"9658_CR22","doi-asserted-by":"crossref","unstructured":"Woods D, Chen H-L, Goodfriend S, Dabby N, Winfree E, Yin P (2013) Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Proceedings of the 4th conference on innovations in theoretical computer science (ITCS \u201913), pp 353\u2013354","DOI":"10.1145\/2422436.2422476"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-017-9658-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-017-9658-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-017-9658-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:22:09Z","timestamp":1589415729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-017-9658-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["9658"],"URL":"https:\/\/doi.org\/10.1007\/s11047-017-9658-6","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2017,11,28]]},"assertion":[{"value":"28 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}