[{"status":"public","extern":"1","abstract":[{"lang":"eng","text":"Although collective cell motion plays an important role, for example during wound healing, embryogenesis, or cancer progression, the fundamental rules governing this motion are still not well understood, in particular at high cell density. We study here the motion of human bronchial epithelial cells within a monolayer, over long times. We observe that, as the monolayer ages, the cells slow down monotonously, while the velocity correlation length first increases as the cells slow down but eventually decreases at the slowest motions. By comparing experiments, analytic model, and detailed particle-based simulations, we shed light on this biological amorphous solidification process, demonstrating that the observed dynamics can be explained as a consequence of the combined maturation and strengthening of cell-cell and cell-substrate adhesions. Surprisingly, the increase of cell surface density due to proliferation is only secondary in this process. This analysis is confirmed with two other cell types. The very general relations between the mean cell velocity and velocity correlation lengths, which apply for aggregates of self-propelled particles, as well as motile cells, can possibly be used to discriminate between various parameter changes in vivo, from noninvasive microscopy data."}],"citation":{"short":"S. García, E.B. Hannezo, J. Elgeti, J. Joanny, P. Silberzan, N. Gov, PNAS 112 (2015) 15314–15319.","ama":"García S, Hannezo EB, Elgeti J, Joanny J, Silberzan P, Gov N. Physics of active jamming during collective cellular motion in a monolayer. PNAS. 2015;112(50):15314-15319. doi:10.1073/pnas.1510973112","apa":"García, S., Hannezo, E. B., Elgeti, J., Joanny, J., Silberzan, P., & Gov, N. (2015). Physics of active jamming during collective cellular motion in a monolayer. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1510973112","chicago":"García, Simón, Edouard B Hannezo, Jens Elgeti, Jean Joanny, Pascal Silberzan, and Nir Gov. “Physics of Active Jamming during Collective Cellular Motion in a Monolayer.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1510973112.","ista":"García S, Hannezo EB, Elgeti J, Joanny J, Silberzan P, Gov N. 2015. Physics of active jamming during collective cellular motion in a monolayer. PNAS. 112(50), 15314–15319.","mla":"García, Simón, et al. “Physics of Active Jamming during Collective Cellular Motion in a Monolayer.” PNAS, vol. 112, no. 50, National Academy of Sciences, 2015, pp. 15314–19, doi:10.1073/pnas.1510973112.","ieee":"S. García, E. B. Hannezo, J. Elgeti, J. Joanny, P. Silberzan, and N. Gov, “Physics of active jamming during collective cellular motion in a monolayer,” PNAS, vol. 112, no. 50. National Academy of Sciences, pp. 15314–15319, 2015."},"intvolume":" 112","day":"15","publication_status":"published","oa":1,"title":"Physics of active jamming during collective cellular motion in a monolayer","_id":"933","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":112,"date_created":"2018-12-11T11:49:16Z","year":"2015","quality_controlled":"1","page":"15314 - 15319","date_updated":"2021-01-12T08:22:01Z","pmid":1,"main_file_link":[{"open_access":"1","url":"https://www.pnas.org/content/pnas/112/50/15314.full.pdf"}],"language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1073/pnas.1510973112","publisher":"National Academy of Sciences","issue":"50","publication":"PNAS","publist_id":"6511","author":[{"first_name":"Simón","full_name":"García, Simón","last_name":"García"},{"orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B"},{"first_name":"Jens","full_name":"Elgeti, Jens","last_name":"Elgeti"},{"first_name":"Jean","full_name":"Joanny, Jean","last_name":"Joanny"},{"full_name":"Silberzan, Pascal","first_name":"Pascal","last_name":"Silberzan"},{"full_name":"Gov, Nir","first_name":"Nir","last_name":"Gov"}],"oa_version":"None","external_id":{"pmid":["26627719"]},"date_published":"2015-12-15T00:00:00Z"},{"publication_identifier":{"issn":["1098-0121","1550-235X"]},"intvolume":" 92","citation":{"chicago":"Yu, Jing Fei, B. J. Ramshaw, I. Kokanović, Kimberly A Modic, N. Harrison, James Day, Ruixing Liang, et al. “Magnetization of Underdoped YBa2Cu3Oy above the Irreversibility Field.” Physical Review B. APS, 2015. https://doi.org/10.1103/physrevb.92.180509.","ista":"Yu JF, Ramshaw BJ, Kokanović I, Modic KA, Harrison N, Day J, Liang R, Hardy WN, Bonn DA, McCollam A, Julian SR, Cooper JR. 2015. Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. 92(18), 180509.","apa":"Yu, J. F., Ramshaw, B. J., Kokanović, I., Modic, K. A., Harrison, N., Day, J., … Cooper, J. R. (2015). Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. APS. https://doi.org/10.1103/physrevb.92.180509","ieee":"J. F. Yu et al., “Magnetization of underdoped YBa2Cu3Oy above the irreversibility field,” Physical Review B, vol. 92, no. 18. APS, 2015.","mla":"Yu, Jing Fei, et al. “Magnetization of Underdoped YBa2Cu3Oy above the Irreversibility Field.” Physical Review B, vol. 92, no. 18, 180509, APS, 2015, doi:10.1103/physrevb.92.180509.","short":"J.F. Yu, B.J. Ramshaw, I. Kokanović, K.A. Modic, N. Harrison, J. Day, R. Liang, W.N. Hardy, D.A. Bonn, A. McCollam, S.R. Julian, J.R. Cooper, Physical Review B 92 (2015).","ama":"Yu JF, Ramshaw BJ, Kokanović I, et al. Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. 2015;92(18). doi:10.1103/physrevb.92.180509"},"day":"23","article_processing_charge":"No","article_number":"180509","status":"public","volume":92,"abstract":[{"lang":"eng","text":"Torque magnetization measurements on YBa2Cu3Oy (YBCO) at doping y=6.67 (p=0.12), in dc fields (B) up to 33 T and temperatures down to 4.5 K, show that weak diamagnetism persists above the extrapolated irreversibility field Hirr(T=0)≈24 T. The differential susceptibility dM/dB, however, is more rapidly suppressed for B≳16 T than expected from the properties of the low field superconducting state, and saturates at a low value for fields B≳24 T. In addition, torque measurements on a p=0.11 YBCO crystal in pulsed field up to 65 T and temperatures down to 8 K show similar behavior, with no additional features at higher fields. We offer two candidate scenarios to explain these observations: (a) superconductivity survives but is heavily suppressed at high field by competition with charge-density-wave (CDW) order; (b) static superconductivity disappears near 24 T and is followed by a region of fluctuating superconductivity, which causes dM/dB to saturate at high field. The diamagnetic signal observed above 50 T for the p=0.11 crystal at 40 K and below may be caused by changes in the normal state susceptibility rather than bulk or fluctuating superconductivity. There will be orbital (Landau) diamagnetism from electron pockets and possibly a reduction in spin susceptibility caused by the stronger three-dimensional ordered CDW."}],"extern":"1","quality_controlled":"1","date_created":"2019-11-19T13:22:06Z","year":"2015","date_updated":"2021-01-12T08:11:42Z","issue":"18","publication":"Physical Review B","author":[{"full_name":"Yu, Jing Fei","first_name":"Jing Fei","last_name":"Yu"},{"first_name":"B. J.","full_name":"Ramshaw, B. J.","last_name":"Ramshaw"},{"last_name":"Kokanović","first_name":"I.","full_name":"Kokanović, I."},{"orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic","first_name":"Kimberly A","full_name":"Modic, Kimberly A"},{"full_name":"Harrison, N.","first_name":"N.","last_name":"Harrison"},{"last_name":"Day","full_name":"Day, James","first_name":"James"},{"last_name":"Liang","first_name":"Ruixing","full_name":"Liang, Ruixing"},{"last_name":"Hardy","first_name":"W. N.","full_name":"Hardy, W. N."},{"first_name":"D. A.","full_name":"Bonn, D. A.","last_name":"Bonn"},{"last_name":"McCollam","full_name":"McCollam, A.","first_name":"A."},{"full_name":"Julian, S. R.","first_name":"S. R.","last_name":"Julian"},{"last_name":"Cooper","first_name":"J. R.","full_name":"Cooper, J. R."}],"oa_version":"None","date_published":"2015-11-23T00:00:00Z","title":"Magnetization of underdoped YBa2Cu3Oy above the irreversibility field","language":[{"iso":"eng"}],"publication_status":"published","article_type":"original","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","_id":"7070","doi":"10.1103/physrevb.92.180509","publisher":"APS"},{"citation":{"ama":"Caruntu D, Rostamzadeh T, Costanzo T, Salemizadeh Parizi S, Caruntu G. Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. 2015;7(30):12955-12969. doi:10.1039/c5nr00737b","short":"D. Caruntu, T. Rostamzadeh, T. Costanzo, S. Salemizadeh Parizi, G. Caruntu, Nanoscale 7 (2015) 12955–12969.","ieee":"D. Caruntu, T. Rostamzadeh, T. Costanzo, S. Salemizadeh Parizi, and G. Caruntu, “Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals,” Nanoscale, vol. 7, no. 30. RSC, pp. 12955–12969, 2015.","mla":"Caruntu, Daniela, et al. “Solvothermal Synthesis and Controlled Self-Assembly of Monodisperse Titanium-Based Perovskite Colloidal Nanocrystals.” Nanoscale, vol. 7, no. 30, RSC, 2015, pp. 12955–69, doi:10.1039/c5nr00737b.","ista":"Caruntu D, Rostamzadeh T, Costanzo T, Salemizadeh Parizi S, Caruntu G. 2015. Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. 7(30), 12955–12969.","chicago":"Caruntu, Daniela, Taha Rostamzadeh, Tommaso Costanzo, Saman Salemizadeh Parizi, and Gabriel Caruntu. “Solvothermal Synthesis and Controlled Self-Assembly of Monodisperse Titanium-Based Perovskite Colloidal Nanocrystals.” Nanoscale. RSC, 2015. https://doi.org/10.1039/c5nr00737b.","apa":"Caruntu, D., Rostamzadeh, T., Costanzo, T., Salemizadeh Parizi, S., & Caruntu, G. (2015). Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. RSC. https://doi.org/10.1039/c5nr00737b"},"intvolume":" 7","day":"14","status":"public","extern":"1","abstract":[{"text":"The rational design of monodisperse ferroelectric nanocrystals with controlled size and shape and their organization into hierarchical structures has been a critical step for understanding the polar ordering in nanoscale ferroelectrics, as well as the design of nanocrystal-based functional materials which harness the properties of individual nanoparticles and the collective interactions between them. We report here on the synthesis and self-assembly of aggregate-free, single-crystalline titanium-based perovskite nanoparticles with controlled morphology and surface composition by using a simple, easily scalable and highly versatile colloidal route. Single-crystalline, non-aggregated BaTiO3 colloidal nanocrystals, used as a model system, have been prepared under solvothermal conditions at temperatures as low as 180 °C. The shape of the nanocrystals was tuned from spheroidal to cubic upon changing the polarity of the solvent, whereas their size was varied from 16 to 30 nm for spheres and 5 to 78 nm for cubes by changing the concentration of the precursors and the reaction time, respectively. The hydrophobic, oleic acid-passivated nanoparticles exhibit very good solubility in non-polar solvents and can be rendered dispersible in polar solvents by a simple process involving the oxidative cleavage of the double bond upon treating the nanopowders with the Lemieux–von Rudloff reagent. Lattice dynamic analysis indicated that regardless of their size, BaTiO3 nanocrystals present local disorder within the perovskite unit cell, associated with the existence of polar ordering. We also demonstrate for the first time that, in addition to being used for fabricating large area, crack-free, highly uniform films, BaTiO3 nanocubes can serve as building blocks for the design of 2D and 3D mesoscale structures, such as superlattices and superparticles. Interestingly, the type of superlattice structure (simple cubic or face centered cubic) appears to be determined by the type of solvent in which the nanocrystals were dispersed. This approach provides an excellent platform for the synthesis of other titanium-based perovskite colloidal nanocrystals with controlled chemical composition, surface structure and morphology and for their assembly into complex architectures, therefore opening the door for the design of novel mesoscale functional materials/nanocomposites with potential applications in energy conversion, data storage and the biomedical field.","lang":"eng"}],"publication_status":"published","title":"Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals","article_type":"original","_id":"7456","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2040-3364","2040-3372"]},"pmid":1,"article_processing_charge":"No","volume":7,"date_created":"2020-02-05T14:16:37Z","year":"2015","quality_controlled":"1","page":"12955-12969","date_updated":"2023-02-23T13:08:24Z","publication":"Nanoscale","issue":"30","author":[{"last_name":"Caruntu","first_name":"Daniela","full_name":"Caruntu, Daniela"},{"full_name":"Rostamzadeh, Taha","first_name":"Taha","last_name":"Rostamzadeh"},{"id":"D93824F4-D9BA-11E9-BB12-F207E6697425","orcid":"0000-0001-9732-3815","full_name":"Costanzo, Tommaso","first_name":"Tommaso","last_name":"Costanzo"},{"last_name":"Salemizadeh Parizi","full_name":"Salemizadeh Parizi, Saman","first_name":"Saman"},{"first_name":"Gabriel","full_name":"Caruntu, Gabriel","last_name":"Caruntu"}],"external_id":{"pmid":["26168304"]},"oa_version":"None","date_published":"2015-08-14T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1039/c5nr00737b","publisher":"RSC"},{"publisher":"RSC","_id":"7457","month":"09","doi":"10.1039/c5ra11347d","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_status":"published","title":"Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors","date_published":"2015-09-01T00:00:00Z","oa_version":"Submitted Version","author":[{"last_name":"Parizi","full_name":"Parizi, Saman Salemizadeh","first_name":"Saman Salemizadeh"},{"full_name":"Conley, Gavin","first_name":"Gavin","last_name":"Conley"},{"id":"D93824F4-D9BA-11E9-BB12-F207E6697425","orcid":"0000-0001-9732-3815","full_name":"Costanzo, Tommaso","first_name":"Tommaso","last_name":"Costanzo"},{"last_name":"Howell","first_name":"Bob","full_name":"Howell, Bob"},{"full_name":"Mellinger, Axel","first_name":"Axel","last_name":"Mellinger"},{"last_name":"Caruntu","first_name":"Gabriel","full_name":"Caruntu, Gabriel"}],"issue":"93","publication":"RSC Advances","date_updated":"2023-02-23T13:08:26Z","year":"2015","date_created":"2020-02-05T14:17:26Z","quality_controlled":"1","page":"76356-76362","extern":"1","volume":5,"abstract":[{"lang":"eng","text":"A new organic–inorganic ferroelectric hybrid capacitor designed by uniformly incorporating surface modified monodisperse 15 nm ferroelectric BaTiO3 nanocubes into non-polar polymer blends of poly(methyl methacrylate) (PMMA) polymer and acrylonitrile-butadiene-styrene (ABS) terpolymer is described. The investigation of spatial distribution of nanofillers via a non-distractive thermal pulse method illustrates that the surface functionalization of nanocubes plays a key role in the uniform distribution of charge polarization within the polymer matrix. The discharged energy density of the nanocomposite with 30 vol% BaTiO3 nanocubes is ∼44 × 10−3 J cm−3, which is almost six times higher than that of the neat polymer. The facile processing, along with the superior mechanical and electrical properties of the BaTiO3/PMMA–ABS nanocomposites make them suitable for implementation into capacitive electrical energy storage devices."}],"status":"public","article_processing_charge":"No","day":"01","intvolume":" 5","citation":{"ista":"Parizi SS, Conley G, Costanzo T, Howell B, Mellinger A, Caruntu G. 2015. Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. 5(93), 76356–76362.","chicago":"Parizi, Saman Salemizadeh, Gavin Conley, Tommaso Costanzo, Bob Howell, Axel Mellinger, and Gabriel Caruntu. “Fabrication of Barium Titanate/Acrylonitrile-Butadiene Styrene/Poly(Methyl Methacrylate) Nanocomposite Films for Hybrid Ferroelectric Capacitors.” RSC Advances. RSC, 2015. https://doi.org/10.1039/c5ra11347d.","apa":"Parizi, S. S., Conley, G., Costanzo, T., Howell, B., Mellinger, A., & Caruntu, G. (2015). Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. RSC. https://doi.org/10.1039/c5ra11347d","mla":"Parizi, Saman Salemizadeh, et al. “Fabrication of Barium Titanate/Acrylonitrile-Butadiene Styrene/Poly(Methyl Methacrylate) Nanocomposite Films for Hybrid Ferroelectric Capacitors.” RSC Advances, vol. 5, no. 93, RSC, 2015, pp. 76356–62, doi:10.1039/c5ra11347d.","ieee":"S. S. Parizi, G. Conley, T. Costanzo, B. Howell, A. Mellinger, and G. Caruntu, “Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors,” RSC Advances, vol. 5, no. 93. RSC, pp. 76356–76362, 2015.","short":"S.S. Parizi, G. Conley, T. Costanzo, B. Howell, A. Mellinger, G. Caruntu, RSC Advances 5 (2015) 76356–76362.","ama":"Parizi SS, Conley G, Costanzo T, Howell B, Mellinger A, Caruntu G. Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. 2015;5(93):76356-76362. doi:10.1039/c5ra11347d"},"publication_identifier":{"issn":["2046-2069"]}},{"publisher":"Wiley","_id":"7739","month":"12","doi":"10.1111/mec.13452","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_type":"original","publication_status":"published","language":[{"iso":"eng"}],"title":"Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations","oa":1,"date_published":"2015-12-10T00:00:00Z","oa_version":"Published Version","author":[{"last_name":"Santure","first_name":"Anna W.","full_name":"Santure, Anna W."},{"full_name":"Poissant, Jocelyn","first_name":"Jocelyn","last_name":"Poissant"},{"last_name":"De Cauwer","full_name":"De Cauwer, Isabelle","first_name":"Isabelle"},{"last_name":"van Oers","first_name":"Kees","full_name":"van Oers, Kees"},{"orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard"},{"first_name":"John L.","full_name":"Quinn, John L.","last_name":"Quinn"},{"full_name":"Groenen, Martien A. M.","first_name":"Martien A. M.","last_name":"Groenen"},{"full_name":"Visser, Marcel E.","first_name":"Marcel E.","last_name":"Visser"},{"last_name":"Sheldon","first_name":"Ben C.","full_name":"Sheldon, Ben C."},{"last_name":"Slate","first_name":"Jon","full_name":"Slate, Jon"}],"publication":"Molecular Ecology","date_updated":"2021-01-12T08:15:12Z","date_created":"2020-04-30T10:51:01Z","year":"2015","quality_controlled":"1","page":"6148-6162","extern":"1","volume":24,"abstract":[{"lang":"eng","text":"Currently, there is much debate on the genetic architecture of quantitative traits in wild populations. Is trait variation influenced by many genes of small effect or by a few genes of major effect? Where is additive genetic variation located in the genome? Do the same loci cause similar phenotypic variation in different populations? Great tits (Parus major) have been studied extensively in long‐term studies across Europe and consequently are considered an ecological ‘model organism’. Recently, genomic resources have been developed for the great tit, including a custom SNP chip and genetic linkage map. In this study, we used a suite of approaches to investigate the genetic architecture of eight quantitative traits in two long‐term study populations of great tits—one in the Netherlands and the other in the United Kingdom. Overall, we found little evidence for the presence of genes of large effects in either population. Instead, traits appeared to be influenced by many genes of small effect, with conservative estimates of the number of contributing loci ranging from 31 to 310. Despite concordance between population‐specific heritabilities, we found no evidence for the presence of loci having similar effects in both populations. While population‐specific genetic architectures are possible, an undetected shared architecture cannot be rejected because of limited power to map loci of small and moderate effects. This study is one of few examples of genetic architecture analysis in replicated wild populations and highlights some of the challenges and limitations researchers will face when attempting similar molecular quantitative genetic studies in free‐living populations."}],"status":"public","article_processing_charge":"No","day":"10","main_file_link":[{"url":"https://doi.org/10.1111/mec.13452","open_access":"1"}],"citation":{"short":"A.W. Santure, J. Poissant, I. De Cauwer, K. van Oers, M.R. Robinson, J.L. Quinn, M.A.M. Groenen, M.E. Visser, B.C. Sheldon, J. Slate, Molecular Ecology 24 (2015) 6148–6162.","ama":"Santure AW, Poissant J, De Cauwer I, et al. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 2015;24:6148-6162. doi:10.1111/mec.13452","ista":"Santure AW, Poissant J, De Cauwer I, van Oers K, Robinson MR, Quinn JL, Groenen MAM, Visser ME, Sheldon BC, Slate J. 2015. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 24, 6148–6162.","apa":"Santure, A. W., Poissant, J., De Cauwer, I., van Oers, K., Robinson, M. R., Quinn, J. L., … Slate, J. (2015). Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.13452","chicago":"Santure, Anna W., Jocelyn Poissant, Isabelle De Cauwer, Kees van Oers, Matthew Richard Robinson, John L. Quinn, Martien A. M. Groenen, Marcel E. Visser, Ben C. Sheldon, and Jon Slate. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology. Wiley, 2015. https://doi.org/10.1111/mec.13452.","ieee":"A. W. Santure et al., “Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations,” Molecular Ecology, vol. 24. Wiley, pp. 6148–6162, 2015.","mla":"Santure, Anna W., et al. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology, vol. 24, Wiley, 2015, pp. 6148–62, doi:10.1111/mec.13452."},"intvolume":" 24","publication_identifier":{"issn":["0962-1083"]}},{"publication_status":"published","title":"Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird","oa":1,"article_type":"original","month":"07","_id":"7741","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 282","citation":{"mla":"Adams, Mark James, et al. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810, 20150689, The Royal Society, 2015, doi:10.1098/rspb.2015.0689.","ieee":"M. J. Adams, M. R. Robinson, M.-E. Mannarelli, and B. J. Hatchwell, “Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird,” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810. The Royal Society, 2015.","apa":"Adams, M. J., Robinson, M. R., Mannarelli, M.-E., & Hatchwell, B. J. (2015). Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. The Royal Society. https://doi.org/10.1098/rspb.2015.0689","ista":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. 2015. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 282(1810), 20150689.","chicago":"Adams, Mark James, Matthew Richard Robinson, Maria-Elena Mannarelli, and Ben J. Hatchwell. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences. The Royal Society, 2015. https://doi.org/10.1098/rspb.2015.0689.","ama":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 2015;282(1810). doi:10.1098/rspb.2015.0689","short":"M.J. Adams, M.R. Robinson, M.-E. Mannarelli, B.J. Hatchwell, Proceedings of the Royal Society B: Biological Sciences 282 (2015)."},"day":"07","status":"public","article_number":"20150689","extern":"1","abstract":[{"lang":"eng","text":"Phenotypes expressed in a social context are not only a function of the individual, but can also be shaped by the phenotypes of social partners. These social effects may play a major role in the evolution of cooperative breeding if social partners differ in the quality of care they provide and if individual carers adjust their effort in relation to that of other carers. When applying social effects models to wild study systems, it is also important to explore sources of individual plasticity that could masquerade as social effects. We studied offspring provisioning rates of parents and helpers in a wild population of long-tailed tits Aegithalos caudatus using a quantitative genetic framework to identify these social effects and partition them into genetic, permanent environment and current environment components. Controlling for other effects, individuals were consistent in their provisioning effort at a given nest, but adjusted their effort based on who was in their social group, indicating the presence of social effects. However, these social effects differed between years and social contexts, indicating a current environment effect, rather than indicating a genetic or permanent environment effect. While this study reveals the importance of examining environmental and genetic sources of social effects, the framework we present is entirely general, enabling a greater understanding of potentially important social effects within any ecological population."}],"issue":"1810","publication":"Proceedings of the Royal Society B: Biological Sciences","author":[{"first_name":"Mark James","full_name":"Adams, Mark James","last_name":"Adams"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","last_name":"Robinson"},{"last_name":"Mannarelli","full_name":"Mannarelli, Maria-Elena","first_name":"Maria-Elena"},{"last_name":"Hatchwell","full_name":"Hatchwell, Ben J.","first_name":"Ben J."}],"oa_version":"Published Version","external_id":{"pmid":["26063846"]},"date_published":"2015-07-07T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1098/rspb.2015.0689","publisher":"The Royal Society","publication_identifier":{"issn":["0962-8452","1471-2954"]},"pmid":1,"main_file_link":[{"url":"https://doi.org/10.1098/rspb.2015.0689","open_access":"1"}],"article_processing_charge":"No","volume":282,"date_created":"2020-04-30T10:58:07Z","year":"2015","quality_controlled":"1","date_updated":"2021-01-12T08:15:12Z"},{"article_processing_charge":"No","day":"14","intvolume":" 47","citation":{"mla":"Robinson, Matthew Richard, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics, vol. 47, no. 11, Springer Nature, 2015, pp. 1357–62, doi:10.1038/ng.3401.","ieee":"M. R. Robinson et al., “Population genetic differentiation of height and body mass index across Europe,” Nature Genetics, vol. 47, no. 11. Springer Nature, pp. 1357–1362, 2015.","ista":"Robinson MR, Hemani G, Medina-Gomez C, Mezzavilla M, Esko T, Shakhbazov K, Powell JE, Vinkhuyzen A, Berndt SI, Gustafsson S, Justice AE, Kahali B, Locke AE, Pers TH, Vedantam S, Wood AR, van Rheenen W, Andreassen OA, Gasparini P, Metspalu A, Berg LH van den, Veldink JH, Rivadeneira F, Werge TM, Abecasis GR, Boomsma DI, Chasman DI, de Geus EJC, Frayling TM, Hirschhorn JN, Hottenga JJ, Ingelsson E, Loos RJF, Magnusson PKE, Martin NG, Montgomery GW, North KE, Pedersen NL, Spector TD, Speliotes EK, Goddard ME, Yang J, Visscher PM. 2015. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 47(11), 1357–1362.","chicago":"Robinson, Matthew Richard, Gibran Hemani, Carolina Medina-Gomez, Massimo Mezzavilla, Tonu Esko, Konstantin Shakhbazov, Joseph E Powell, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics. Springer Nature, 2015. https://doi.org/10.1038/ng.3401.","apa":"Robinson, M. R., Hemani, G., Medina-Gomez, C., Mezzavilla, M., Esko, T., Shakhbazov, K., … Visscher, P. M. (2015). Population genetic differentiation of height and body mass index across Europe. Nature Genetics. Springer Nature. https://doi.org/10.1038/ng.3401","ama":"Robinson MR, Hemani G, Medina-Gomez C, et al. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 2015;47(11):1357-1362. doi:10.1038/ng.3401","short":"M.R. Robinson, G. Hemani, C. Medina-Gomez, M. Mezzavilla, T. Esko, K. Shakhbazov, J.E. Powell, A. Vinkhuyzen, S.I. Berndt, S. Gustafsson, A.E. Justice, B. Kahali, A.E. Locke, T.H. Pers, S. Vedantam, A.R. Wood, W. van Rheenen, O.A. Andreassen, P. Gasparini, A. Metspalu, L.H. van den Berg, J.H. Veldink, F. Rivadeneira, T.M. Werge, G.R. Abecasis, D.I. Boomsma, D.I. Chasman, E.J.C. de Geus, T.M. Frayling, J.N. Hirschhorn, J.J. Hottenga, E. Ingelsson, R.J.F. Loos, P.K.E. Magnusson, N.G. Martin, G.W. Montgomery, K.E. North, N.L. Pedersen, T.D. Spector, E.K. Speliotes, M.E. Goddard, J. Yang, P.M. Visscher, Nature Genetics 47 (2015) 1357–1362."},"publication_identifier":{"issn":["1061-4036","1546-1718"]},"date_updated":"2021-01-12T08:15:13Z","quality_controlled":"1","page":"1357-1362","date_created":"2020-04-30T10:58:23Z","year":"2015","abstract":[{"lang":"eng","text":"Across-nation differences in the mean values for complex traits are common1,2,3,4,5,6,7,8, but the reasons for these differences are unknown. Here we find that many independent loci contribute to population genetic differences in height and body mass index (BMI) in 9,416 individuals across 14 European countries. Using discovery data on over 250,000 individuals and unbiased effect size estimates from 17,500 sibling pairs, we estimate that 24% (95% credible interval (CI) = 9%, 41%) and 8% (95% CI = 4%, 16%) of the captured additive genetic variance for height and BMI, respectively, reflect population genetic differences. Population genetic divergence differed significantly from that in a null model (height, P < 3.94 × 10−8; BMI, P < 5.95 × 10−4), and we find an among-population genetic correlation for tall and slender individuals (r = −0.80, 95% CI = −0.95, −0.60), consistent with correlated selection for both phenotypes. Observed differences in height among populations reflected the predicted genetic means (r = 0.51; P < 0.001), but environmental differences across Europe masked genetic differentiation for BMI (P < 0.58)."}],"volume":47,"extern":"1","status":"public","date_published":"2015-09-14T00:00:00Z","oa_version":"None","author":[{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","last_name":"Robinson","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard"},{"first_name":"Gibran","full_name":"Hemani, Gibran","last_name":"Hemani"},{"first_name":"Carolina","full_name":"Medina-Gomez, Carolina","last_name":"Medina-Gomez"},{"first_name":"Massimo","full_name":"Mezzavilla, Massimo","last_name":"Mezzavilla"},{"first_name":"Tonu","full_name":"Esko, Tonu","last_name":"Esko"},{"last_name":"Shakhbazov","first_name":"Konstantin","full_name":"Shakhbazov, Konstantin"},{"full_name":"Powell, Joseph E","first_name":"Joseph E","last_name":"Powell"},{"full_name":"Vinkhuyzen, Anna","first_name":"Anna","last_name":"Vinkhuyzen"},{"first_name":"Sonja I","full_name":"Berndt, Sonja I","last_name":"Berndt"},{"last_name":"Gustafsson","first_name":"Stefan","full_name":"Gustafsson, Stefan"},{"last_name":"Justice","full_name":"Justice, Anne E","first_name":"Anne E"},{"last_name":"Kahali","full_name":"Kahali, Bratati","first_name":"Bratati"},{"last_name":"Locke","first_name":"Adam E","full_name":"Locke, Adam E"},{"full_name":"Pers, Tune H","first_name":"Tune H","last_name":"Pers"},{"first_name":"Sailaja","full_name":"Vedantam, Sailaja","last_name":"Vedantam"},{"first_name":"Andrew R","full_name":"Wood, Andrew R","last_name":"Wood"},{"last_name":"van Rheenen","first_name":"Wouter","full_name":"van Rheenen, Wouter"},{"last_name":"Andreassen","first_name":"Ole A","full_name":"Andreassen, Ole A"},{"last_name":"Gasparini","first_name":"Paolo","full_name":"Gasparini, Paolo"},{"full_name":"Metspalu, Andres","first_name":"Andres","last_name":"Metspalu"},{"last_name":"Berg","first_name":"Leonard H van den","full_name":"Berg, Leonard H van den"},{"first_name":"Jan H","full_name":"Veldink, Jan H","last_name":"Veldink"},{"last_name":"Rivadeneira","full_name":"Rivadeneira, Fernando","first_name":"Fernando"},{"first_name":"Thomas M","full_name":"Werge, Thomas M","last_name":"Werge"},{"last_name":"Abecasis","first_name":"Goncalo R","full_name":"Abecasis, Goncalo R"},{"last_name":"Boomsma","first_name":"Dorret I","full_name":"Boomsma, Dorret I"},{"first_name":"Daniel I","full_name":"Chasman, Daniel I","last_name":"Chasman"},{"first_name":"Eco J C","full_name":"de Geus, Eco J C","last_name":"de Geus"},{"last_name":"Frayling","first_name":"Timothy M","full_name":"Frayling, Timothy M"},{"full_name":"Hirschhorn, Joel N","first_name":"Joel N","last_name":"Hirschhorn"},{"last_name":"Hottenga","full_name":"Hottenga, Jouke Jan","first_name":"Jouke Jan"},{"full_name":"Ingelsson, Erik","first_name":"Erik","last_name":"Ingelsson"},{"last_name":"Loos","full_name":"Loos, Ruth J F","first_name":"Ruth J F"},{"full_name":"Magnusson, Patrik K E","first_name":"Patrik K E","last_name":"Magnusson"},{"last_name":"Martin","first_name":"Nicholas G","full_name":"Martin, Nicholas G"},{"full_name":"Montgomery, Grant W","first_name":"Grant W","last_name":"Montgomery"},{"last_name":"North","first_name":"Kari E","full_name":"North, Kari E"},{"last_name":"Pedersen","first_name":"Nancy L","full_name":"Pedersen, Nancy L"},{"first_name":"Timothy D","full_name":"Spector, Timothy D","last_name":"Spector"},{"first_name":"Elizabeth K","full_name":"Speliotes, Elizabeth K","last_name":"Speliotes"},{"last_name":"Goddard","full_name":"Goddard, Michael E","first_name":"Michael E"},{"last_name":"Yang","full_name":"Yang, Jian","first_name":"Jian"},{"last_name":"Visscher","full_name":"Visscher, Peter M","first_name":"Peter M"}],"publication":"Nature Genetics","issue":"11","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7742","doi":"10.1038/ng.3401","month":"09","article_type":"original","type":"journal_article","title":"Population genetic differentiation of height and body mass index across Europe","publication_status":"published","language":[{"iso":"eng"}]},{"title":"The SprayList: A scalable relaxed priority queue","publication_status":"published","language":[{"iso":"eng"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"776","doi":"10.1145/2688500.2688523","month":"01","publisher":"ACM","publist_id":"6878","author":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"last_name":"Li","full_name":"Li, Jerry","first_name":"Jerry"},{"last_name":"Shavit","full_name":"Shavit, Nir","first_name":"Nir"}],"oa_version":"None","conference":{"name":"PPoPP: Principles and Practice of Parallel Pogramming"},"date_published":"2015-01-24T00:00:00Z","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle\r\nand Intel corporations.","status":"public","abstract":[{"text":"High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by "spraying" themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(plog3p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log3p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. Furthermore, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.","lang":"eng"}],"volume":"2015-January","extern":"1","page":"11 - 20","year":"2015","date_created":"2018-12-11T11:48:26Z","date_updated":"2023-02-23T13:16:43Z","citation":{"ama":"Alistarh D-A, Kopinsky J, Li J, Shavit N. The SprayList: A scalable relaxed priority queue. In: Vol 2015-January. ACM; 2015:11-20. doi:10.1145/2688500.2688523","short":"D.-A. Alistarh, J. Kopinsky, J. Li, N. Shavit, in:, ACM, 2015, pp. 11–20.","mla":"Alistarh, Dan-Adrian, et al. The SprayList: A Scalable Relaxed Priority Queue. Vol. 2015–January, ACM, 2015, pp. 11–20, doi:10.1145/2688500.2688523.","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2015, vol. 2015–January, pp. 11–20.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015. https://doi.org/10.1145/2688500.2688523.","ista":"Alistarh D-A, Kopinsky J, Li J, Shavit N. 2015. The SprayList: A scalable relaxed priority queue. PPoPP: Principles and Practice of Parallel Pogramming vol. 2015–January, 11–20.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., & Shavit, N. (2015). The SprayList: A scalable relaxed priority queue (Vol. 2015–January, pp. 11–20). Presented at the PPoPP: Principles and Practice of Parallel Pogramming, ACM. https://doi.org/10.1145/2688500.2688523"},"day":"24","article_processing_charge":"No"},{"day":"04","article_processing_charge":"No","publication_identifier":{"issn":["0031-9007","1079-7114"]},"citation":{"ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior,” Physical Review Letters, vol. 114, no. 22. American Physical Society, 2015.","mla":"Goodrich, Carl Peter, et al. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters, vol. 114, no. 22, 225501, American Physical Society, 2015, doi:10.1103/physrevlett.114.225501.","apa":"Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.114.225501","ista":"Goodrich CP, Liu AJ, Nagel SR. 2015. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 114(22), 225501.","chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/physrevlett.114.225501.","ama":"Goodrich CP, Liu AJ, Nagel SR. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 2015;114(22). doi:10.1103/physrevlett.114.225501","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 114 (2015)."},"intvolume":" 114","quality_controlled":"1","date_created":"2020-04-30T11:41:08Z","year":"2015","date_updated":"2021-01-12T08:15:23Z","article_number":"225501","status":"public","volume":114,"abstract":[{"lang":"eng","text":"We introduce a principle unique to disordered solids wherein the contribution of any bond to one global perturbation is uncorrelated with its contribution to another. Coupled with sufficient variability in the contributions of different bonds, this “independent bond-level response” paves the way for the design of real materials with unusual and exquisitely tuned properties. To illustrate this, we choose two global perturbations: compression and shear. By applying a bond removal procedure that is both simple and experimentally relevant to remove a very small fraction of bonds, we can drive disordered spring networks to both the incompressible and completely auxetic limits of mechanical behavior."}],"extern":"1","oa_version":"None","date_published":"2015-06-04T00:00:00Z","publication":"Physical Review Letters","issue":"22","author":[{"last_name":"Goodrich","full_name":"Goodrich, Carl Peter","first_name":"Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425"},{"first_name":"Andrea J.","full_name":"Liu, Andrea J.","last_name":"Liu"},{"last_name":"Nagel","first_name":"Sidney R.","full_name":"Nagel, Sidney R."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/physrevlett.114.225501","_id":"7765","month":"06","publisher":"American Physical Society","title":"The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior","language":[{"iso":"eng"}],"publication_status":"published","article_type":"original","type":"journal_article"},{"date_published":"2015-02-15T00:00:00Z","oa_version":"None","author":[{"first_name":"Daniel M.","full_name":"Sussman, Daniel M.","last_name":"Sussman"},{"full_name":"Goodrich, Carl Peter","first_name":"Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074"},{"full_name":"Liu, Andrea J.","first_name":"Andrea J.","last_name":"Liu"},{"first_name":"Sidney R.","full_name":"Nagel, Sidney R.","last_name":"Nagel"}],"publication":"Soft Matter","issue":"14","publisher":"Royal Society of Chemistry","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1039/c4sm02905d","_id":"7766","month":"02","article_type":"original","type":"journal_article","title":"Disordered surface vibrations in jammed sphere packings","publication_status":"published","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"15","citation":{"mla":"Sussman, Daniel M., et al. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter, vol. 11, no. 14, Royal Society of Chemistry, 2015, pp. 2745–51, doi:10.1039/c4sm02905d.","ieee":"D. M. Sussman, C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Disordered surface vibrations in jammed sphere packings,” Soft Matter, vol. 11, no. 14. Royal Society of Chemistry, pp. 2745–2751, 2015.","ista":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. 2015. Disordered surface vibrations in jammed sphere packings. Soft Matter. 11(14), 2745–2751.","chicago":"Sussman, Daniel M., Carl Peter Goodrich, Andrea J. Liu, and Sidney R. Nagel. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter. Royal Society of Chemistry, 2015. https://doi.org/10.1039/c4sm02905d.","apa":"Sussman, D. M., Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). Disordered surface vibrations in jammed sphere packings. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/c4sm02905d","ama":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. Disordered surface vibrations in jammed sphere packings. Soft Matter. 2015;11(14):2745-2751. doi:10.1039/c4sm02905d","short":"D.M. Sussman, C.P. Goodrich, A.J. Liu, S.R. Nagel, Soft Matter 11 (2015) 2745–2751."},"intvolume":" 11","publication_identifier":{"issn":["1744-683X","1744-6848"]},"date_updated":"2021-01-12T08:15:23Z","quality_controlled":"1","page":"2745-2751","date_created":"2020-04-30T11:41:23Z","year":"2015","volume":11,"abstract":[{"text":"We study the vibrational properties near a free surface of disordered spring networks derived from jammed sphere packings. In bulk systems, without surfaces, it is well understood that such systems have a plateau in the density of vibrational modes extending down to a frequency scale ω*. This frequency is controlled by ΔZ = 〈Z〉 − 2d, the difference between the average coordination of the spheres and twice the spatial dimension, d, of the system, which vanishes at the jamming transition. In the presence of a free surface we find that there is a density of disordered vibrational modes associated with the surface that extends far below ω*. The total number of these low-frequency surface modes is controlled by ΔZ, and the profile of their decay into the bulk has two characteristic length scales, which diverge as ΔZ−1/2 and ΔZ−1 as the jamming transition is approached.","lang":"eng"}],"extern":"1","status":"public"},{"article_type":"original","type":"journal_article","title":"Collective dynamics of soft active particles","language":[{"iso":"eng"}],"publication_status":"published","publisher":"American Physical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/physreve.91.032706","_id":"7767","month":"03","author":[{"first_name":"Ruben","full_name":"van Drongelen, Ruben","last_name":"van Drongelen"},{"first_name":"Anshuman","full_name":"Pal, Anshuman","last_name":"Pal"},{"orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter","last_name":"Goodrich"},{"first_name":"Timon","full_name":"Idema, Timon","last_name":"Idema"}],"issue":"3","publication":"Physical Review E","date_published":"2015-03-01T00:00:00Z","oa_version":"None","abstract":[{"text":"We present a model of soft active particles that leads to a rich array of collective behavior found also in dense biological swarms of bacteria and other unicellular organisms. Our model uses only local interactions, such as Vicsek-type nearest-neighbor alignment, short-range repulsion, and a local boundary term. Changing the relative strength of these interactions leads to migrating swarms, rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble motion, alternating between migration and either rotating or jammed states. Interestingly, although a migrating swarm moves slower than an individual particle, the diffusion constant can be up to three orders of magnitude larger, suggesting that collective motion can be highly advantageous, for example, when searching for food.","lang":"eng"}],"volume":91,"extern":"1","article_number":"032706","status":"public","date_updated":"2021-01-12T08:15:24Z","quality_controlled":"1","date_created":"2020-04-30T11:41:38Z","year":"2015","citation":{"chicago":"Drongelen, Ruben van, Anshuman Pal, Carl Peter Goodrich, and Timon Idema. “Collective Dynamics of Soft Active Particles.” Physical Review E. American Physical Society, 2015. https://doi.org/10.1103/physreve.91.032706.","ista":"van Drongelen R, Pal A, Goodrich CP, Idema T. 2015. Collective dynamics of soft active particles. Physical Review E. 91(3), 032706.","apa":"van Drongelen, R., Pal, A., Goodrich, C. P., & Idema, T. (2015). Collective dynamics of soft active particles. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.91.032706","ieee":"R. van Drongelen, A. Pal, C. P. Goodrich, and T. Idema, “Collective dynamics of soft active particles,” Physical Review E, vol. 91, no. 3. American Physical Society, 2015.","mla":"van Drongelen, Ruben, et al. “Collective Dynamics of Soft Active Particles.” Physical Review E, vol. 91, no. 3, 032706, American Physical Society, 2015, doi:10.1103/physreve.91.032706.","short":"R. van Drongelen, A. Pal, C.P. Goodrich, T. Idema, Physical Review E 91 (2015).","ama":"van Drongelen R, Pal A, Goodrich CP, Idema T. Collective dynamics of soft active particles. Physical Review E. 2015;91(3). doi:10.1103/physreve.91.032706"},"intvolume":" 91","publication_identifier":{"issn":["1539-3755","1550-2376"]},"article_processing_charge":"No","day":"01"},{"date_published":"2015-01-01T00:00:00Z","conference":{"name":"NIPS: Neural Information Processing Systems"},"oa_version":"None","author":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Iglesias","full_name":"Iglesias, Jennifer","first_name":"Jennifer"},{"full_name":"Vojnović, Milan","first_name":"Milan","last_name":"Vojnović"}],"publist_id":"6879","publisher":"Neural Information Processing Systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","_id":"777","type":"conference","title":"Streaming min-max hypergraph partitioning","publication_status":"published","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"01","main_file_link":[{"url":"http://papers.nips.cc/paper/5897-streaming-min-max-hypergraph-partitioning"}],"citation":{"ieee":"D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph partitioning,” presented at the NIPS: Neural Information Processing Systems, 2015, vol. 2015–January, pp. 1900–1908.","mla":"Alistarh, Dan-Adrian, et al. Streaming Min-Max Hypergraph Partitioning. Vol. 2015–January, Neural Information Processing Systems, 2015, pp. 1900–08.","chicago":"Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.","apa":"Alistarh, D.-A., Iglesias, J., & Vojnović, M. (2015). Streaming min-max hypergraph partitioning (Vol. 2015–January, pp. 1900–1908). Presented at the NIPS: Neural Information Processing Systems, Neural Information Processing Systems.","ista":"Alistarh D-A, Iglesias J, Vojnović M. 2015. Streaming min-max hypergraph partitioning. NIPS: Neural Information Processing Systems vol. 2015–January, 1900–1908.","ama":"Alistarh D-A, Iglesias J, Vojnović M. Streaming min-max hypergraph partitioning. In: Vol 2015-January. Neural Information Processing Systems; 2015:1900-1908.","short":"D.-A. Alistarh, J. Iglesias, M. Vojnović, in:, Neural Information Processing Systems, 2015, pp. 1900–1908."},"date_updated":"2023-02-23T13:17:09Z","page":"1900 - 1908","date_created":"2018-12-11T11:48:27Z","year":"2015","abstract":[{"text":"In many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges. Equivalently, we are given an input bipartite graph with two types of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items into a given number of components such that the maximum number of topics covered by a component is minimized. This is a clustering problem with various applications, e.g. partitioning of a set of information objects such as documents, images, and videos, and load balancing in the context of modern computation platforms.Inthis paper, we focus on the streaming computation model for this problem, in which items arrive online one at a time and each item must be assigned irrevocably to a component at its arrival time. Motivated by scalability requirements, we focus on the class of streaming computation algorithms with memory limited to be at most linear in the number of components. We show that a greedy assignment strategy is able to recover a hidden co-clustering of items under a natural set of recovery conditions. We also report results of an extensive empirical evaluation, which demonstrate that this greedy strategy yields superior performance when compared with alternative approaches.","lang":"eng"}],"volume":"2015-January","extern":"1","status":"public"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7779","month":"10","title":"Unearthing the anticrystal: Criticality in the linear response of disordered solids","oa":1,"publication_status":"published","arxiv":1,"language":[{"iso":"eng"}],"type":"preprint","oa_version":"Preprint","external_id":{"arxiv":["1510.08820"]},"date_published":"2015-10-29T00:00:00Z","publication":"arXiv:1510.08820","author":[{"last_name":"Goodrich","full_name":"Goodrich, Carl Peter","first_name":"Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425"}],"page":"242","date_created":"2020-04-30T12:16:18Z","year":"2015","date_updated":"2021-01-12T08:15:28Z","status":"public","abstract":[{"text":"The fact that a disordered material is not constrained in its properties in\r\nthe same way as a crystal presents significant and yet largely untapped\r\npotential for novel material design. However, unlike their crystalline\r\ncounterparts, disordered solids are not well understood. One of the primary\r\nobstacles is the lack of a theoretical framework for thinking about disorder\r\nand its relation to mechanical properties. To this end, we study an idealized\r\nsystem of frictionless athermal soft spheres that, when compressed, undergoes a\r\njamming phase transition with diverging length scales and clean power-law\r\nsignatures. This critical point is the cornerstone of a much larger \"jamming\r\nscenario\" that has the potential to provide the essential theoretical\r\nfoundation necessary for a unified understanding of the mechanics of disordered\r\nsolids. We begin by showing that jammed sphere packings have a valid linear\r\nregime despite the presence of \"contact nonlinearities.\" We then investigate\r\nthe critical nature of the transition, focusing on diverging length scales and\r\nfinite-size effects. Next, we argue that jamming plays the same role for\r\ndisordered solids as the perfect crystal plays for crystalline solids. Not only\r\ncan it be considered an idealized starting point for understanding disordered\r\nmaterials, but it can even influence systems that have a relatively high amount\r\nof crystalline order. The behavior of solids can thus be thought of as existing\r\non a spectrum, with the perfect crystal and the jamming transition at opposing\r\nends. Finally, we introduce a new principle wherein the contribution of an\r\nindividual bond to one global property is independent of its contribution to\r\nanother. This principle allows the different global responses of a disordered\r\nsystem to be manipulated independently and provides a great deal of flexibility\r\nin designing materials with unique, textured and tunable properties.","lang":"eng"}],"extern":"1","day":"29","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1510.08820","open_access":"1"}],"citation":{"ama":"Goodrich CP. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:151008820. 2015.","short":"C.P. Goodrich, ArXiv:1510.08820 (2015).","ieee":"C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response of disordered solids,” arXiv:1510.08820. 2015.","mla":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","chicago":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","apa":"Goodrich, C. P. (2015). Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:1510.08820.","ista":"Goodrich CP. 2015. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:1510.08820, ."}},{"status":"public","extern":"1","abstract":[{"text":"Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed to complement the fast, but best-effort nature of Hardware Transactional Memory (HTM) with a slow, reliable software backup. However, the costs of providing concurrency between hardware and software transactions in HyTM are still not well understood. In this paper, we propose a general model for HyTM implementations, which captures the ability of hardware transactions to buffer memory accesses. The model allows us to formally quantify and analyze the amount of overhead (instrumentation) caused by the potential presence of software transactions.We prove that (1) it is impossible to build a strictly serializable HyTM implementation that has both uninstrumented reads and writes, even for very weak progress guarantees, and (2) the instrumentation cost incurred by a hardware transaction in any progressive opaque HyTM is linear in the size of the transaction’s data set.We further describe two implementations which exhibit optimal instrumentation costs for two different progress conditions. In sum, this paper proposes the first formal HyTM model and captures for the first time the trade-off between the degree of hardware-software TM concurrency and the amount of instrumentation overhead.","lang":"eng"}],"day":"01","intvolume":" 9363","citation":{"ama":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13","short":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 185–199.","ieee":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent limitations of hybrid transactional memory,” presented at the DISC: Distributed Computing, 2015, vol. 9363, pp. 185–199.","mla":"Alistarh, Dan-Adrian, et al. Inherent Limitations of Hybrid Transactional Memory. Vol. 9363, Springer, 2015, pp. 185–99, doi:10.1007/978-3-662-48653-5_13.","apa":"Alistarh, D.-A., Kopinsky, J., Kuznetsov, P., Ravi, S., & Shavit, N. (2015). Inherent limitations of hybrid transactional memory (Vol. 9363, pp. 185–199). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-662-48653-5_13","ista":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. 2015. Inherent limitations of hybrid transactional memory. DISC: Distributed Computing, LNCS, vol. 9363, 185–199.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99. Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13."},"_id":"778","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Inherent limitations of hybrid transactional memory","oa":1,"acknowledgement":"P. Kuznetsov-The author is supported by the Agence Nationale de la Recherche, ANR-14-CE35-0010-01, project DISCMAT. N. Shavit-Support is gratfeully acknowledgedfrom the National Science Foundation under grants CCF-1217921, CCF-1201926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.","alternative_title":["LNCS"],"year":"2015","date_created":"2018-12-11T11:48:27Z","quality_controlled":"1","page":"185 - 199","date_updated":"2023-02-23T13:17:35Z","volume":9363,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.5689"}],"doi":"10.1007/978-3-662-48653-5_13","publisher":"Springer","arxiv":1,"language":[{"iso":"eng"}],"type":"conference","oa_version":"None","external_id":{"arxiv":["1405.5689"]},"conference":{"name":"DISC: Distributed Computing"},"date_published":"2015-01-01T00:00:00Z","publist_id":"6880","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"last_name":"Kuznetsov","full_name":"Kuznetsov, Petr","first_name":"Petr"},{"last_name":"Ravi","full_name":"Ravi, Srivatsan","first_name":"Srivatsan"},{"last_name":"Shavit","full_name":"Shavit, Nir","first_name":"Nir"}]},{"acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle corporation. In particular, we would like to thank Dave Dice, Alex Kogan, and Mark Moir from the Oracle Scalable Synchronization Research Group for very useful feedback on earlier drafts of this paper.","date_published":"2015-06-13T00:00:00Z","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"oa_version":"None","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Matveev","full_name":"Matveev, Alexander","first_name":"Alexander"},{"last_name":"Leiserson","first_name":"William","full_name":"Leiserson, William"},{"last_name":"Shavit","full_name":"Shavit, Nir","first_name":"Nir"}],"publist_id":"6876","publisher":"ACM","_id":"779","month":"06","doi":"10.1145/2755573.2755600","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","language":[{"iso":"eng"}],"publication_status":"published","title":"ThreadScan: Automatic and scalable memory reclamation","related_material":{"record":[{"relation":"later_version","status":"public","id":"6001"}]},"article_processing_charge":"No","day":"13","citation":{"short":"D.-A. Alistarh, A. Matveev, W. Leiserson, N. Shavit, in:, ACM, 2015, pp. 123–132.","ama":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. ThreadScan: Automatic and scalable memory reclamation. In: Vol 2015-June. ACM; 2015:123-132. doi:10.1145/2755573.2755600","chicago":"Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM, 2015. https://doi.org/10.1145/2755573.2755600.","ista":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. 2015. ThreadScan: Automatic and scalable memory reclamation. SPAA: Symposium on Parallelism in Algorithms and Architectures vol. 2015–June, 123–132.","apa":"Alistarh, D.-A., Matveev, A., Leiserson, W., & Shavit, N. (2015). ThreadScan: Automatic and scalable memory reclamation (Vol. 2015–June, pp. 123–132). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2755573.2755600","ieee":"D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.","mla":"Alistarh, Dan-Adrian, et al. ThreadScan: Automatic and Scalable Memory Reclamation. Vol. 2015–June, ACM, 2015, pp. 123–32, doi:10.1145/2755573.2755600."},"date_updated":"2023-02-23T12:35:42Z","date_created":"2018-12-11T11:48:27Z","year":"2015","page":"123 - 132","extern":"1","volume":"2015-June","abstract":[{"lang":"eng","text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU, are either prohibitively expensive or require significant programming expertise, to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated. In this paper, we take a new approach to concurrent memory reclamation: instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads. Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free."}],"status":"public"},{"publist_id":"6877","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"}],"external_id":{"arxiv":["1502.05745"]},"oa_version":"Preprint","conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"},"acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.”","date_published":"2015-01-01T00:00:00Z","arxiv":1,"publication_status":"published","language":[{"iso":"eng"}],"title":"Polylogarithmic-time leader election in population protocols","oa":1,"type":"conference","doi":"10.1007/978-3-662-47666-6_38","_id":"780","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","main_file_link":[{"url":"https://arxiv.org/abs/1502.05745","open_access":"1"}],"citation":{"ieee":"D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in population protocols,” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2015, vol. 9135, pp. 479–491.","mla":"Alistarh, Dan-Adrian, and Rati Gelashvili. Polylogarithmic-Time Leader Election in Population Protocols. Vol. 9135, Springer, 2015, pp. 479–91, doi:10.1007/978-3-662-47666-6_38.","apa":"Alistarh, D.-A., & Gelashvili, R. (2015). Polylogarithmic-time leader election in population protocols (Vol. 9135, pp. 479–491). Presented at the ICALP: International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-662-47666-6_38","ista":"Alistarh D-A, Gelashvili R. 2015. Polylogarithmic-time leader election in population protocols. ICALP: International Colloquium on Automota, Languages and Programming vol. 9135, 479–491.","chicago":"Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38.","ama":"Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38","short":"D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491."},"intvolume":" 9135","day":"01","status":"public","extern":"1","volume":9135,"abstract":[{"text":"Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computational constructions. Yet, the fastest currently known population protocol for electing a leader only has linear convergence time, and it has recently been shown that no population protocol using a constant number of states per node may overcome this linear bound. In this paper, we give the first population protocol for leader election with polylogarithmic convergence time, using polylogarithmic memory states per node. The protocol structure is quite simple: each node has an associated value, and is either a leader (still in contention) or a minion (following some leader). A leader keeps incrementing its value and “defeats” other leaders in one-to-one interactions, and will drop from contention and become a minion if it meets a leader with higher value. Importantly, a leader also drops out if it meets a minion with higher absolute value. While these rules are quite simple, the proof that this algorithm achieves polylogarithmic convergence time is non-trivial. In particular, the argument combines careful use of concentration inequalities with anti-concentration bounds, showing that the leaders’ values become spread apart as the execution progresses, which in turn implies that straggling leaders get quickly eliminated. We complement our analysis with empirical results, showing that our protocol converges extremely fast, even for large network sizes.","lang":"eng"}],"date_created":"2018-12-11T11:48:28Z","year":"2015","page":"479 - 491","date_updated":"2023-02-23T13:18:11Z"},{"publist_id":"6873","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"last_name":"Vojnović","full_name":"Vojnović, Milan","first_name":"Milan"}],"conference":{"name":"PODC: Principles of Distributed Computing"},"oa_version":"None","date_published":"2015-07-21T00:00:00Z","publication_status":"published","language":[{"iso":"eng"}],"title":"Fast and exact majority in population protocols","type":"conference","_id":"781","doi":"10.1145/2767386.2767429","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","citation":{"ama":"Alistarh D-A, Gelashvili R, Vojnović M. Fast and exact majority in population protocols. In: Vol 2015-July. ACM; 2015:47-56. doi:10.1145/2767386.2767429","short":"D.-A. Alistarh, R. Gelashvili, M. Vojnović, in:, ACM, 2015, pp. 47–56.","ieee":"D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority in population protocols,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 47–56.","mla":"Alistarh, Dan-Adrian, et al. Fast and Exact Majority in Population Protocols. Vol. 2015–July, ACM, 2015, pp. 47–56, doi:10.1145/2767386.2767429.","apa":"Alistarh, D.-A., Gelashvili, R., & Vojnović, M. (2015). Fast and exact majority in population protocols (Vol. 2015–July, pp. 47–56). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767429","ista":"Alistarh D-A, Gelashvili R, Vojnović M. 2015. Fast and exact majority in population protocols. PODC: Principles of Distributed Computing vol. 2015–July, 47–56.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429."},"day":"21","article_processing_charge":"No","status":"public","extern":"1","volume":"2015-July","abstract":[{"text":"Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states; the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority. Despite considerable research effort, known protocols for this problem are either exact but slow (taking linear parallel time to converge), or fast but approximate (with non-zero probability of error). In this paper, we show that this trade-off between preciasion and speed is not inherent. We present a new protocol called Average and Conquer (AVC) that solves majority ex-actly in expected parallel convergence time O(log n/(sε) + log n log s), where n is the number of nodes, εn is the initial node advantage of the majority state, and s = Ω(log n log log n) is the number of states the protocol employs. This shows that the majority problem can be solved exactly in time poly-logarithmic in n, provided that the memory per node is s = Ω(1/ε + lognlog1/ε). On the negative side, we establish a lower bound of Ω(1/ε) on the expected paraallel convergence time for the case of four memory states per node, and a lower bound of Ω(logn) parallel time for protocols using any number of memory states per node.per node, and a lower bound of (log n) parallel time for protocols using any number of memory states per node.","lang":"eng"}],"date_created":"2018-12-11T11:48:28Z","year":"2015","page":"47 - 56","date_updated":"2023-02-23T13:18:35Z"},{"publisher":"ACM","doi":"10.1145/2767386.2767430","_id":"782","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication_status":"published","language":[{"iso":"eng"}],"title":"Lock-Free algorithms under stochastic schedulers","date_published":"2015-07-21T00:00:00Z","conference":{"name":"PODC: Principles of Distributed Computing"},"oa_version":"None","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"first_name":"Thomas","full_name":"Sauerwald, Thomas","last_name":"Sauerwald"},{"first_name":"Milan","full_name":"Vojnović, Milan","last_name":"Vojnović"}],"publist_id":"6874","date_updated":"2023-02-23T13:18:50Z","year":"2015","date_created":"2018-12-11T11:48:28Z","page":"251 - 260","extern":"1","volume":"2015-July","abstract":[{"text":"In this work, we consider the following random process, mo- Tivated by the analysis of lock-free concurrent algorithms under high memory contention. In each round, a new scheduling step is allocated to one of n threads, according to a distribution p = (p1; p2; : : : ; pn), where thread i is scheduled with probability pi. When some thread first reaches a set threshold of executed steps, it registers a win, completing its current operation, and resets its step count to 1. At the same time, threads whose step count was close to the threshold also get reset because of the win, but to 0 steps, being penalized for almost winning. We are interested in two questions: how often does some thread complete an operation (system latency), and how often does a specific thread complete an operation (individual latency)? We provide asymptotically tight bounds for the system and individual latency of this general concurrency pattern, for arbitrary scheduling distributions p. Surprisingly, a sim- ple characterization exists: in expectation, the system will complete a new operation every Θ(1/p 2) steps, while thread i will complete a new operation every Θ(1/2=p i ) steps. The proof is interesting in its own right, as it requires a careful analysis of how the higher norms of the vector p inuence the thread step counts and latencies in this random process. Our result offers a simple connection between the scheduling distribution and the average performance of concurrent algorithms, which has several applications.","lang":"eng"}],"status":"public","article_processing_charge":"No","day":"21","citation":{"apa":"Alistarh, D.-A., Sauerwald, T., & Vojnović, M. (2015). Lock-Free algorithms under stochastic schedulers (Vol. 2015–July, pp. 251–260). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767430","chicago":"Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430.","ista":"Alistarh D-A, Sauerwald T, Vojnović M. 2015. Lock-Free algorithms under stochastic schedulers. PODC: Principles of Distributed Computing vol. 2015–July, 251–260.","mla":"Alistarh, Dan-Adrian, et al. Lock-Free Algorithms under Stochastic Schedulers. Vol. 2015–July, ACM, 2015, pp. 251–60, doi:10.1145/2767386.2767430.","ieee":"D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under stochastic schedulers,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 251–260.","short":"D.-A. Alistarh, T. Sauerwald, M. Vojnović, in:, ACM, 2015, pp. 251–260.","ama":"Alistarh D-A, Sauerwald T, Vojnović M. Lock-Free algorithms under stochastic schedulers. In: Vol 2015-July. ACM; 2015:251-260. doi:10.1145/2767386.2767430"}},{"abstract":[{"text":"The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper, we answer this question in the affirmative, improving on a decades-old upper bound. We introduce two new algorithmic ideas to reduce the time complexity of electing a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application of our algorithm is a new upper bound for the tight renaming problem, assigning n items to the n participants in expected O(log2 n) time and O(n2) messages. We complement our results with lower bound of Ω(n2) messages for solving these two problems, closing the question of their message complexity.","lang":"eng"}],"volume":"2015-July","extern":"1","status":"public","date_updated":"2023-02-23T13:18:55Z","page":"365 - 374","date_created":"2018-12-11T11:48:28Z","year":"2015","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.1001"}],"citation":{"mla":"Alistarh, Dan-Adrian, et al. How to Elect a Leader Faster than a Tournament. Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420.","ieee":"D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.","ista":"Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.","apa":"Alistarh, D.-A., Gelashvili, R., & Vladu, A. (2015). How to elect a leader faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420","ama":"Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament. In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420","short":"D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374."},"article_processing_charge":"No","day":"21","type":"conference","title":"How to elect a leader faster than a tournament","oa":1,"language":[{"iso":"eng"}],"publication_status":"published","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","_id":"783","doi":"10.1145/2767386.2767420","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"full_name":"Vladu, Adrian","first_name":"Adrian","last_name":"Vladu"}],"publist_id":"6875","date_published":"2015-07-21T00:00:00Z","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926,\r\nand IIS-1447786, the Department of Energy under grant\r\nER26116/DE-SC0008923, and the Oracle and Intel corporations.\r\nThe authors would like to thank Prof. Nir Shavit for ad-\r\nvice and encouragement during this work, and the anonymous reviewers for their very useful suggestions.","oa_version":"None","conference":{"name":"PODC: Principles of Distributed Computing"}},{"author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"},{"first_name":"Hitesh","full_name":"Ballani, Hitesh","last_name":"Ballani"},{"full_name":"Costa, Paolo","first_name":"Paolo","last_name":"Costa"},{"first_name":"Adam","full_name":"Funnell, Adam","last_name":"Funnell"},{"last_name":"Benjamin","first_name":"Joshua","full_name":"Benjamin, Joshua"},{"first_name":"Philip","full_name":"Watts, Philip","last_name":"Watts"},{"first_name":"Benn","full_name":"Thomsen, Benn","last_name":"Thomsen"}],"publist_id":"6872","date_published":"2015-01-01T00:00:00Z","oa_version":"None","conference":{"name":"SIGCOMM: Special Interest Group on Data Communication","start_date":"2015-08-17","location":"London, United Kindgdom","end_date":"2015-08-21"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","title":"A high-radix, low-latency optical switch for data centers","publisher":"ACM","month":"01","_id":"784","doi":"10.1145/2785956.2790035","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"D.-A. Alistarh et al., “A high-radix, low-latency optical switch for data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom, 2015, pp. 367–368.","mla":"Alistarh, Dan-Adrian, et al. A High-Radix, Low-Latency Optical Switch for Data Centers. ACM, 2015, pp. 367–68, doi:10.1145/2785956.2790035.","ista":"Alistarh D-A, Ballani H, Costa P, Funnell A, Benjamin J, Watts P, Thomsen B. 2015. A high-radix, low-latency optical switch for data centers. SIGCOMM: Special Interest Group on Data Communication, 367–368.","apa":"Alistarh, D.-A., Ballani, H., Costa, P., Funnell, A., Benjamin, J., Watts, P., & Thomsen, B. (2015). A high-radix, low-latency optical switch for data centers (pp. 367–368). Presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom: ACM. https://doi.org/10.1145/2785956.2790035","chicago":"Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035.","ama":"Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035","short":"D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 2015, pp. 367–368."},"publication_identifier":{"isbn":["978-1-4503-3542-3"]},"day":"01","extern":"1","abstract":[{"lang":"eng","text":"We demonstrate an optical switch design that can scale up to a thousand ports with high per-port bandwidth (25 Gbps+) and low switching latency (40 ns). Our design uses a broadcast and select architecture, based on a passive star coupler and fast tunable transceivers. In addition we employ time division multiplexing to achieve very low switching latency. Our demo shows the feasibility of the switch data plane using a small testbed, comprising two transmitters and a receiver, connected through a star coupler."}],"status":"public","date_updated":"2023-02-23T13:18:57Z","date_created":"2018-12-11T11:48:29Z","year":"2015","quality_controlled":"1","page":"367 - 368"}]