[{"extern":"1","article_number":"20150689","author":[{"last_name":"Adams","first_name":"Mark James","full_name":"Adams, Mark James"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson","full_name":"Robinson, Matthew Richard"},{"full_name":"Mannarelli, Maria-Elena","first_name":"Maria-Elena","last_name":"Mannarelli"},{"full_name":"Hatchwell, Ben J.","last_name":"Hatchwell","first_name":"Ben J."}],"volume":282,"date_created":"2020-04-30T10:58:07Z","date_updated":"2021-01-12T08:15:12Z","pmid":1,"year":"2015","publisher":"The Royal Society","publication_status":"published","publication_identifier":{"issn":["0962-8452","1471-2954"]},"month":"07","doi":"10.1098/rspb.2015.0689","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1098/rspb.2015.0689","open_access":"1"}],"external_id":{"pmid":["26063846"]},"oa":1,"quality_controlled":"1","issue":"1810","abstract":[{"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.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7741","intvolume":" 282","status":"public","title":"Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird","article_processing_charge":"No","day":"07","date_published":"2015-07-07T00:00:00Z","citation":{"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.","short":"M.J. Adams, M.R. Robinson, M.-E. Mannarelli, B.J. Hatchwell, Proceedings of the Royal Society B: Biological Sciences 282 (2015).","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.","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"},"publication":"Proceedings of the Royal Society B: Biological Sciences","article_type":"original"},{"article_processing_charge":"No","publication_identifier":{"issn":["0962-1083"]},"month":"12","day":"10","page":"6148-6162","quality_controlled":"1","article_type":"original","citation":{"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.","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.","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.","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","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."},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1111/mec.13452","open_access":"1"}],"publication":"Molecular Ecology","language":[{"iso":"eng"}],"date_published":"2015-12-10T00:00:00Z","doi":"10.1111/mec.13452","type":"journal_article","extern":"1","abstract":[{"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.","lang":"eng"}],"intvolume":" 24","publisher":"Wiley","publication_status":"published","status":"public","title":"Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations","_id":"7739","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","oa_version":"Published Version","volume":24,"date_created":"2020-04-30T10:51:01Z","date_updated":"2021-01-12T08:15:12Z","author":[{"last_name":"Santure","first_name":"Anna W.","full_name":"Santure, Anna W."},{"full_name":"Poissant, Jocelyn","last_name":"Poissant","first_name":"Jocelyn"},{"last_name":"De Cauwer","first_name":"Isabelle","full_name":"De Cauwer, Isabelle"},{"full_name":"van Oers, Kees","first_name":"Kees","last_name":"van Oers"},{"orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"},{"first_name":"John L.","last_name":"Quinn","full_name":"Quinn, John L."},{"last_name":"Groenen","first_name":"Martien A. M.","full_name":"Groenen, Martien A. M."},{"full_name":"Visser, Marcel E.","first_name":"Marcel E.","last_name":"Visser"},{"first_name":"Ben C.","last_name":"Sheldon","full_name":"Sheldon, Ben C."},{"first_name":"Jon","last_name":"Slate","full_name":"Slate, Jon"}]},{"citation":{"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.","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.","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","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.","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"},"page":"11 - 20","date_published":"2015-01-24T00:00:00Z","doi":"10.1145/2688500.2688523","conference":{"name":"PPoPP: Principles and Practice of Parallel Pogramming"},"language":[{"iso":"eng"}],"article_processing_charge":"No","day":"24","month":"01","_id":"776","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","year":"2015","publisher":"ACM","publication_status":"published","title":"The SprayList: A scalable relaxed priority queue","status":"public","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"}],"volume":"2015-January","oa_version":"None","date_updated":"2023-02-23T13:16:43Z","date_created":"2018-12-11T11:48:26Z","type":"conference","publist_id":"6878","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"}],"extern":"1"},{"publication_identifier":{"issn":["0031-9007","1079-7114"]},"article_processing_charge":"No","month":"06","day":"04","citation":{"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","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.","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","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.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 114 (2015).","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."},"publication":"Physical Review Letters","quality_controlled":"1","article_type":"original","doi":"10.1103/physrevlett.114.225501","date_published":"2015-06-04T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","article_number":"225501","issue":"22","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","year":"2015","_id":"7765","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Physical Society","intvolume":" 114","status":"public","title":"The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior","publication_status":"published","author":[{"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"},{"full_name":"Nagel, Sidney R.","first_name":"Sidney R.","last_name":"Nagel"}],"oa_version":"None","volume":114,"date_created":"2020-04-30T11:41:08Z","date_updated":"2021-01-12T08:15:23Z"},{"language":[{"iso":"eng"}],"doi":"10.1103/physreve.91.032706","date_published":"2015-03-01T00:00:00Z","article_type":"original","quality_controlled":"1","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.","short":"R. van Drongelen, A. Pal, C.P. Goodrich, T. Idema, Physical Review E 91 (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.","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.","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","ista":"van Drongelen R, Pal A, Goodrich CP, Idema T. 2015. Collective dynamics of soft active particles. Physical Review E. 91(3), 032706.","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"},"publication":"Physical Review E","publication_identifier":{"issn":["1539-3755","1550-2376"]},"article_processing_charge":"No","day":"01","month":"03","volume":91,"oa_version":"None","date_updated":"2021-01-12T08:15:24Z","date_created":"2020-04-30T11:41:38Z","author":[{"full_name":"van Drongelen, Ruben","first_name":"Ruben","last_name":"van Drongelen"},{"first_name":"Anshuman","last_name":"Pal","full_name":"Pal, Anshuman"},{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","last_name":"Goodrich","first_name":"Carl Peter"},{"full_name":"Idema, Timon","first_name":"Timon","last_name":"Idema"}],"intvolume":" 91","publisher":"American Physical Society","status":"public","title":"Collective dynamics of soft active particles","publication_status":"published","_id":"7767","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","issue":"3","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"}],"type":"journal_article","article_number":"032706"},{"publication_identifier":{"issn":["1744-683X","1744-6848"]},"article_processing_charge":"No","month":"02","day":"15","doi":"10.1039/c4sm02905d","date_published":"2015-02-15T00:00:00Z","language":[{"iso":"eng"}],"citation":{"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","ista":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. 2015. Disordered surface vibrations in jammed sphere packings. Soft Matter. 11(14), 2745–2751.","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","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.","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.","short":"D.M. Sussman, C.P. Goodrich, A.J. Liu, S.R. Nagel, Soft Matter 11 (2015) 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."},"publication":"Soft Matter","page":"2745-2751","article_type":"original","quality_controlled":"1","issue":"14","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","type":"journal_article","author":[{"full_name":"Sussman, Daniel M.","last_name":"Sussman","first_name":"Daniel M."},{"full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","last_name":"Goodrich"},{"full_name":"Liu, Andrea J.","last_name":"Liu","first_name":"Andrea J."},{"full_name":"Nagel, Sidney R.","first_name":"Sidney R.","last_name":"Nagel"}],"volume":11,"oa_version":"None","date_updated":"2021-01-12T08:15:23Z","date_created":"2020-04-30T11:41:23Z","_id":"7766","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publisher":"Royal Society of Chemistry","intvolume":" 11","title":"Disordered surface vibrations in jammed sphere packings","status":"public","publication_status":"published"},{"citation":{"chicago":"Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.","short":"D.-A. Alistarh, J. Iglesias, M. Vojnović, in:, Neural Information Processing Systems, 2015, 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.","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.","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.","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."},"main_file_link":[{"url":"http://papers.nips.cc/paper/5897-streaming-min-max-hypergraph-partitioning"}],"page":"1900 - 1908","conference":{"name":"NIPS: Neural Information Processing Systems"},"date_published":"2015-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","day":"01","article_processing_charge":"No","_id":"777","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Streaming min-max hypergraph partitioning","status":"public","publication_status":"published","publisher":"Neural Information Processing Systems","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Iglesias","first_name":"Jennifer","full_name":"Iglesias, Jennifer"},{"last_name":"Vojnović","first_name":"Milan","full_name":"Vojnović, Milan"}],"date_created":"2018-12-11T11:48:27Z","date_updated":"2023-02-23T13:17:09Z","volume":"2015-January","oa_version":"None","type":"conference","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"}],"publist_id":"6879","extern":"1"},{"extern":"1","publist_id":"6880","publisher":"Springer","publication_status":"published","year":"2015","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.","volume":9363,"date_updated":"2023-02-23T13:17:35Z","date_created":"2018-12-11T11:48:27Z","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"first_name":"Petr","last_name":"Kuznetsov","full_name":"Kuznetsov, Petr"},{"full_name":"Ravi, Srivatsan","last_name":"Ravi","first_name":"Srivatsan"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"}],"month":"01","quality_controlled":"1","external_id":{"arxiv":["1405.5689"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.5689"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48653-5_13","conference":{"name":"DISC: Distributed Computing"},"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","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."}],"intvolume":" 9363","status":"public","title":"Inherent limitations of hybrid transactional memory","_id":"778","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","article_processing_charge":"No","day":"01","page":"185 - 199","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","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.","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","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.","short":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 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."},"date_published":"2015-01-01T00:00:00Z"},{"external_id":{"arxiv":["1510.08820"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1510.08820","open_access":"1"}],"citation":{"chicago":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","short":"C.P. Goodrich, ArXiv:1510.08820 (2015).","mla":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","ieee":"C. P. Goodrich, “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, .","ama":"Goodrich CP. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:151008820. 2015."},"publication":"arXiv:1510.08820","page":"242","date_published":"2015-10-29T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"10","day":"29","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7779","year":"2015","status":"public","publication_status":"published","title":"Unearthing the anticrystal: Criticality in the linear response of disordered solids","author":[{"full_name":"Goodrich, Carl Peter","first_name":"Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074"}],"oa_version":"Preprint","date_created":"2020-04-30T12:16:18Z","date_updated":"2021-01-12T08:15:28Z","type":"preprint","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"},{"abstract":[{"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.","lang":"eng"}],"publist_id":"6876","extern":"1","type":"conference","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Matveev, Alexander","last_name":"Matveev","first_name":"Alexander"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"6001"}]},"date_created":"2018-12-11T11:48:27Z","date_updated":"2023-02-23T12:35:42Z","oa_version":"None","volume":"2015-June","_id":"779","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","year":"2015","publication_status":"published","title":"ThreadScan: Automatic and scalable memory reclamation","status":"public","publisher":"ACM","month":"06","day":"13","article_processing_charge":"No","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"date_published":"2015-06-13T00:00:00Z","doi":"10.1145/2755573.2755600","language":[{"iso":"eng"}],"citation":{"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","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.","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.","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","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.","short":"D.-A. Alistarh, A. Matveev, W. Leiserson, N. Shavit, in:, ACM, 2015, pp. 123–132.","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."},"page":"123 - 132"},{"language":[{"iso":"eng"}],"conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"},"date_published":"2015-01-01T00:00:00Z","doi":"10.1007/978-3-662-47666-6_38","page":"479 - 491","oa":1,"citation":{"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.","short":"D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, 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.","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.","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.","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"},"external_id":{"arxiv":["1502.05745"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.05745"}],"month":"01","day":"01","date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:11Z","oa_version":"Preprint","volume":9135,"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"}],"status":"public","publication_status":"published","title":"Polylogarithmic-time leader election in population protocols","publisher":"Springer","intvolume":" 9135","_id":"780","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.”","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","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"}],"publist_id":"6877","type":"conference"},{"author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"first_name":"Milan","last_name":"Vojnović","full_name":"Vojnović, Milan"}],"oa_version":"None","volume":"2015-July","date_updated":"2023-02-23T13:18:35Z","date_created":"2018-12-11T11:48:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"781","year":"2015","publisher":"ACM","status":"public","publication_status":"published","title":"Fast and exact majority in population protocols","publist_id":"6873","abstract":[{"lang":"eng","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."}],"extern":"1","type":"conference","date_published":"2015-07-21T00:00:00Z","doi":"10.1145/2767386.2767429","conference":{"name":"PODC: Principles of Distributed Computing"},"language":[{"iso":"eng"}],"citation":{"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.","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.","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","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","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.","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.","short":"D.-A. Alistarh, R. Gelashvili, M. Vojnović, in:, ACM, 2015, pp. 47–56."},"page":"47 - 56","article_processing_charge":"No","month":"07","day":"21"},{"month":"07","day":"21","article_processing_charge":"No","page":"251 - 260","citation":{"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","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","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.","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.","short":"D.-A. Alistarh, T. Sauerwald, M. Vojnović, in:, ACM, 2015, pp. 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.","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."},"language":[{"iso":"eng"}],"conference":{"name":"PODC: Principles of Distributed Computing"},"doi":"10.1145/2767386.2767430","date_published":"2015-07-21T00:00:00Z","type":"conference","extern":"1","abstract":[{"lang":"eng","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."}],"publist_id":"6874","title":"Lock-Free algorithms under stochastic schedulers","status":"public","publication_status":"published","publisher":"ACM","_id":"782","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:50Z","volume":"2015-July","oa_version":"None","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Thomas","last_name":"Sauerwald","full_name":"Sauerwald, Thomas"},{"full_name":"Vojnović, Milan","first_name":"Milan","last_name":"Vojnović"}]},{"page":"365 - 374","citation":{"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","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.","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.","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","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.","short":"D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.","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."},"main_file_link":[{"url":"https://arxiv.org/abs/1411.1001","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"PODC: Principles of Distributed Computing"},"doi":"10.1145/2767386.2767420","date_published":"2015-07-21T00:00:00Z","month":"07","day":"21","article_processing_charge":"No","status":"public","title":"How to elect a leader faster than a tournament","publication_status":"published","publisher":"ACM","year":"2015","_id":"783","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","date_updated":"2023-02-23T13:18:55Z","date_created":"2018-12-11T11:48:28Z","volume":"2015-July","oa_version":"None","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"},{"full_name":"Vladu, Adrian","first_name":"Adrian","last_name":"Vladu"}],"type":"conference","extern":"1","abstract":[{"lang":"eng","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."}],"publist_id":"6875"},{"type":"conference","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."}],"publist_id":"6872","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"784","year":"2015","title":"A high-radix, low-latency optical switch for data centers","publication_status":"published","status":"public","publisher":"ACM","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Ballani","first_name":"Hitesh","full_name":"Ballani, Hitesh"},{"full_name":"Costa, Paolo","last_name":"Costa","first_name":"Paolo"},{"full_name":"Funnell, Adam","last_name":"Funnell","first_name":"Adam"},{"full_name":"Benjamin, Joshua","first_name":"Joshua","last_name":"Benjamin"},{"first_name":"Philip","last_name":"Watts","full_name":"Watts, Philip"},{"full_name":"Thomsen, Benn","first_name":"Benn","last_name":"Thomsen"}],"date_updated":"2023-02-23T13:18:57Z","date_created":"2018-12-11T11:48:29Z","oa_version":"None","day":"01","month":"01","publication_identifier":{"isbn":["978-1-4503-3542-3"]},"citation":{"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","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.","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","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.","short":"D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 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.","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."},"quality_controlled":"1","page":"367 - 368","conference":{"name":"SIGCOMM: Special Interest Group on Data Communication","end_date":"2015-08-21","start_date":"2015-08-17","location":"London, United Kindgdom"},"date_published":"2015-01-01T00:00:00Z","doi":"10.1145/2785956.2790035","language":[{"iso":"eng"}]},{"scopus_import":1,"day":"01","month":"12","page":"1423 - 1430","quality_controlled":"1","citation":{"ama":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430. doi:10.1093/glycob/cwv059","ista":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 25(12), 1423–1430.","apa":"Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., & Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059","ieee":"J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier, “Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology, vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.","mla":"Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30, doi:10.1093/glycob/cwv059.","short":"J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier, Glycobiology 25 (2015) 1423–1430.","chicago":"Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059."},"external_id":{"pmid":["26306635"]},"publication":"Glycobiology","language":[{"iso":"eng"}],"doi":"10.1093/glycob/cwv059","date_published":"2015-12-01T00:00:00Z","type":"journal_article","issue":"12","publist_id":"6851","abstract":[{"text":"Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at the plasma membrane of various eukaryotes with the important exception of mammals. In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man) linked at position 2 of the inositol. However, several pathogenic fungi additionally synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC, which is the most abundant GIPC synthesized by this fungus. In this study, we identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted deletion of the gene encoding GntA in A. fumigatus resulted in complete absence of zwitterionic GIPC; a phenotype that could be reverted by episomal expression of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid product resistant to saponification and to digestion by phosphatidylinositol-phospholipase C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.","lang":"eng"}],"publisher":"Oxford University Press","department":[{"_id":"CaHe"}],"intvolume":" 25","status":"public","publication_status":"published","title":"Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis","pmid":1,"year":"2015","_id":"802","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":25,"oa_version":"None","date_created":"2018-12-11T11:48:35Z","date_updated":"2021-01-12T08:16:33Z","author":[{"full_name":"Engel, Jakob","first_name":"Jakob","last_name":"Engel"},{"id":"309D50DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5795-0133","first_name":"Philipp S","last_name":"Schmalhorst","full_name":"Schmalhorst, Philipp S"},{"last_name":"Kruger","first_name":"Anke","full_name":"Kruger, Anke"},{"last_name":"Muller","first_name":"Christina","full_name":"Muller, Christina"},{"full_name":"Buettner, Falk","last_name":"Buettner","first_name":"Falk"},{"last_name":"Routier","first_name":"Françoise","full_name":"Routier, Françoise"}]},{"page":"10294 - 10302","quality_controlled":"1","citation":{"ama":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 2015;89(20):10294-10302. doi:10.1128/JVI.01502-15","ieee":"F. K. Schur, R. Dick, W. Hagen, V. Vogt, and J. Briggs, “The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly,” Journal of Virology, vol. 89, no. 20. ASM, pp. 10294–10302, 2015.","apa":"Schur, F. K., Dick, R., Hagen, W., Vogt, V., & Briggs, J. (2015). The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. ASM. https://doi.org/10.1128/JVI.01502-15","ista":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. 2015. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 89(20), 10294–10302.","short":"F.K. Schur, R. Dick, W. Hagen, V. Vogt, J. Briggs, Journal of Virology 89 (2015) 10294–10302.","mla":"Schur, Florian KM, et al. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology, vol. 89, no. 20, ASM, 2015, pp. 10294–302, doi:10.1128/JVI.01502-15.","chicago":"Schur, Florian KM, Robert Dick, Wim Hagen, Volker Vogt, and John Briggs. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology. ASM, 2015. https://doi.org/10.1128/JVI.01502-15."},"external_id":{"pmid":["26223638"]},"publication":"Journal of Virology","language":[{"iso":"eng"}],"date_published":"2015-09-22T00:00:00Z","doi":"10.1128/JVI.01502-15","day":"22","month":"09","intvolume":" 89","publisher":"ASM","publication_status":"published","status":"public","title":"The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly","pmid":1,"year":"2015","_id":"815","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":89,"date_updated":"2021-01-12T08:17:09Z","date_created":"2018-12-11T11:48:39Z","author":[{"full_name":"Schur, Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","first_name":"Florian","last_name":"Schur"},{"last_name":"Dick","first_name":"Robert","full_name":"Dick, Robert"},{"last_name":"Hagen","first_name":"Wim","full_name":"Hagen, Wim"},{"full_name":"Vogt, Volker","last_name":"Vogt","first_name":"Volker"},{"full_name":"Briggs, John","last_name":"Briggs","first_name":"John"}],"type":"journal_article","extern":"1","issue":"20","publist_id":"6837","abstract":[{"text":"The polyprotein Gag is the primary structural component of retroviruses. Gag consists of independently folded domains connected by flexible linkers. Interactions between the conserved capsid (CA) domains of Gag mediate formation of hexameric protein lattices that drive assembly of immature virus particles. Proteolytic cleavage of Gag by the viral protease (PR) is required for maturation of retroviruses from an immature form into an infectious form. Within the assembled Gag lattices of HIV-1 and Mason- Pfizer monkey virus (M-PMV), the C-terminal domain of CA adopts similar quaternary arrangements, while the N-terminal domain of CA is packed in very different manners. Here, we have used cryo-electron tomography and subtomogram averaging to study in vitro-assembled, immature virus-like Rous sarcoma virus (RSV) Gag particles and have determined the structure of CA and the surrounding regions to a resolution of ~8 Å. We found that the C-terminal domain of RSV CA is arranged similarly to HIV-1 and M-PMV, whereas the N-terminal domain of CA adopts a novel arrangement in which the upstream p10 domain folds back into the CA lattice. In this position the cleavage site between CA and p10 appears to be inaccessible to PR. Below CA, an extended density is consistent with the presence of a six-helix bundle formed by the spacer-peptide region. We have also assessed the affect of lattice assembly on proteolytic processing by exogenous PR. The cleavage between p10 and CA is indeed inhibited in the assembled lattice, a finding consistent with structural regulation of proteolytic maturation.\r\n","lang":"eng"}]},{"type":"journal_article","abstract":[{"text":"Human immunodeficiency virus type 1 (HIV-1) assembly proceeds in two stages. First, the 55 kilodalton viral Gag polyprotein assembles into a hexameric protein lattice at the plasma membrane of the infected cell, inducing budding and release of an immature particle. Second, Gag is cleaved by the viral protease, leading to internal rearrangement of the virus into the mature, infectious form. Immature and mature HIV-1 particles are heterogeneous in size and morphology, preventing high-resolution analysis of their protein arrangement in situ by conventional structural biology methods. Here we apply cryo-electron tomography and sub-tomogram averaging methods to resolve the structure of the capsid lattice within intact immature HIV-1 particles at subnanometre resolution, allowing unambiguous positioning of all α-helices. The resulting model reveals tertiary and quaternary structural interactions that mediate HIV-1 assembly. Strikingly, these interactions differ from those predicted by the current model based on in vitro-assembled arrays of Gag-derived proteins from Mason-Pfizer monkey virus. To validate this difference, we solve the structure of the capsid lattice within intact immature Mason-Pfizer monkey virus particles. Comparison with the immature HIV-1 structure reveals that retroviral capsid proteins, while having conserved tertiary structures, adopt different quaternary arrangements during virus assembly. The approach demonstrated here should be applicable to determine structures of other proteins at subnanometre resolution within heterogeneous environments.","lang":"eng"}],"publist_id":"6836","issue":"7535","extern":1,"year":"2015","_id":"814","acknowledgement":"This study was supported by Deutsche Forschungsgemeinschaft grants BR 3635/2-1 to J.A.G.B., KR 906/7-1 to H.-G.K. and by Grant Agency of the Czech Republic 14-15326S to M.R. The Briggs laboratory acknowledges financial support from the European Molecular Biology Laboratory and from the Chica und Heinz Schaller Stiftung. We thank B. Glass, M. Anders and S. Mattei for preparation of samples, and R. Hadravova, K. H. Bui, F. Thommen, M. Schorb, S. Dodonova, S. Glatt, P. Ulbrich and T. Bharat for technical support and/or discussion. This study was technically supported by the European Molecular Biology Laboratory IT services unit.","title":"Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution","status":"public","publication_status":"published","intvolume":" 517","publisher":"Nature Publishing Group","author":[{"full_name":"Florian Schur","last_name":"Schur","first_name":"Florian","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hagen","first_name":"Wim","full_name":"Hagen, Wim J"},{"last_name":"Rumlová","first_name":"Michaela","full_name":"Rumlová, Michaela"},{"full_name":"Ruml, Tomáš","last_name":"Ruml","first_name":"Tomáš"},{"first_name":"B","last_name":"Müller","full_name":"Müller B"},{"full_name":"Kraüsslich, Hans Georg","first_name":"Hans","last_name":"Kraüsslich"},{"first_name":"John","last_name":"Briggs","full_name":"Briggs, John A"}],"date_created":"2018-12-11T11:48:39Z","date_updated":"2021-01-12T08:17:08Z","volume":517,"day":"22","month":"01","publication":"Nature","citation":{"mla":"Schur, Florian KM, et al. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature, vol. 517, no. 7535, Nature Publishing Group, 2015, pp. 505–08, doi:10.1038/nature13838.","short":"F.K. Schur, W. Hagen, M. Rumlová, T. Ruml, B. Müller, H. Kraüsslich, J. Briggs, Nature 517 (2015) 505–508.","chicago":"Schur, Florian KM, Wim Hagen, Michaela Rumlová, Tomáš Ruml, B Müller, Hans Kraüsslich, and John Briggs. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature13838.","ama":"Schur FK, Hagen W, Rumlová M, et al. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 2015;517(7535):505-508. doi:10.1038/nature13838","ista":"Schur FK, Hagen W, Rumlová M, Ruml T, Müller B, Kraüsslich H, Briggs J. 2015. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 517(7535), 505–508.","ieee":"F. K. Schur et al., “Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution,” Nature, vol. 517, no. 7535. Nature Publishing Group, pp. 505–508, 2015.","apa":"Schur, F. K., Hagen, W., Rumlová, M., Ruml, T., Müller, B., Kraüsslich, H., & Briggs, J. (2015). Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. Nature Publishing Group. https://doi.org/10.1038/nature13838"},"quality_controlled":0,"page":"505 - 508","date_published":"2015-01-22T00:00:00Z","doi":"10.1038/nature13838"},{"month":"02","day":"01","article_processing_charge":"No","publication_identifier":{"issn":["0091-6749"]},"publication":"Journal of Allergy and Clinical Immunology","citation":{"chicago":"Einhorn, Lukas, Judit Singer, Martina Muhr, Alexandra Schoos, Kumiko Oida, Josef Singer, Lucia Panakova, Krisztina Manzano-Szalai, and Erika Jensen-Jarolim. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology. Elsevier, 2015. https://doi.org/10.1016/j.jaci.2014.12.1263.","short":"L. Einhorn, J. Singer, M. Muhr, A. Schoos, K. Oida, J. Singer, L. Panakova, K. Manzano-Szalai, E. Jensen-Jarolim, Journal of Allergy and Clinical Immunology 135 (2015).","mla":"Einhorn, Lukas, et al. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology, vol. 135, no. 2, AB101, Elsevier, 2015, doi:10.1016/j.jaci.2014.12.1263.","ieee":"L. Einhorn et al., “Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients,” Journal of Allergy and Clinical Immunology, vol. 135, no. 2. Elsevier, 2015.","apa":"Einhorn, L., Singer, J., Muhr, M., Schoos, A., Oida, K., Singer, J., … Jensen-Jarolim, E. (2015). Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. Elsevier. https://doi.org/10.1016/j.jaci.2014.12.1263","ista":"Einhorn L, Singer J, Muhr M, Schoos A, Oida K, Singer J, Panakova L, Manzano-Szalai K, Jensen-Jarolim E. 2015. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 135(2), AB101.","ama":"Einhorn L, Singer J, Muhr M, et al. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 2015;135(2). doi:10.1016/j.jaci.2014.12.1263"},"article_type":"original","quality_controlled":"1","doi":"10.1016/j.jaci.2014.12.1263","date_published":"2015-02-01T00:00:00Z","language":[{"iso":"eng"}],"article_number":"AB101","type":"journal_article","issue":"2","extern":"1","_id":"8242","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients","intvolume":" 135","publisher":"Elsevier","author":[{"full_name":"Einhorn, Lukas","first_name":"Lukas","last_name":"Einhorn"},{"first_name":"Judit","last_name":"Fazekas","id":"36432834-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8777-3502","full_name":"Fazekas, Judit"},{"full_name":"Muhr, Martina","last_name":"Muhr","first_name":"Martina"},{"full_name":"Schoos, Alexandra","last_name":"Schoos","first_name":"Alexandra"},{"first_name":"Kumiko","last_name":"Oida","full_name":"Oida, Kumiko"},{"full_name":"Singer, Josef","last_name":"Singer","first_name":"Josef"},{"full_name":"Panakova, Lucia","last_name":"Panakova","first_name":"Lucia"},{"first_name":"Krisztina","last_name":"Manzano-Szalai","full_name":"Manzano-Szalai, Krisztina"},{"full_name":"Jensen-Jarolim, Erika","first_name":"Erika","last_name":"Jensen-Jarolim"}],"date_updated":"2021-01-12T08:17:42Z","date_created":"2020-08-10T11:54:09Z","oa_version":"None","volume":135},{"publication":"Bio-protocol","citation":{"chicago":"Marhavý, Peter, and Eva Benková. “Real Time Analysis of Lateral Root Organogenesis in Arabidopsis.” Bio-Protocol. Bio-protocol LLC, 2015. https://doi.org/10.21769/BioProtoc.1446.","short":"P. Marhavý, E. Benková, Bio-Protocol 5 (2015).","mla":"Marhavý, Peter, and Eva Benková. “Real Time Analysis of Lateral Root Organogenesis in Arabidopsis.” Bio-Protocol, vol. 5, no. 8, Bio-protocol LLC, 2015, doi:10.21769/BioProtoc.1446.","apa":"Marhavý, P., & Benková, E. (2015). Real time analysis of lateral root organogenesis in arabidopsis. Bio-Protocol. Bio-protocol LLC. https://doi.org/10.21769/BioProtoc.1446","ieee":"P. Marhavý and E. Benková, “Real time analysis of lateral root organogenesis in arabidopsis,” Bio-protocol, vol. 5, no. 8. Bio-protocol LLC, 2015.","ista":"Marhavý P, Benková E. 2015. Real time analysis of lateral root organogenesis in arabidopsis. Bio-protocol. 5(8).","ama":"Marhavý P, Benková E. Real time analysis of lateral root organogenesis in arabidopsis. Bio-protocol. 2015;5(8). doi:10.21769/BioProtoc.1446"},"quality_controlled":0,"date_published":"2015-04-20T00:00:00Z","doi":"10.21769/BioProtoc.1446","day":"20","month":"04","_id":"832","year":"2015","acknowledgement":"European Research Council with a Starting Independent Research grant: ERC-2007-Stg-207362-HCPO, Czech Science Foundation: GA13-39982S\nWe thank Matyas Fendrych for critical reading and comments. The protocol was developed based on previously published work of De Rybel et al. (2010) and Laskowski et al. (2008). ","publication_status":"published","title":"Real time analysis of lateral root organogenesis in arabidopsis","status":"public","intvolume":" 5","publisher":"Bio-protocol LLC","author":[{"first_name":"Peter","last_name":"Marhavy","id":"3F45B078-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5227-5741","full_name":"Peter Marhavy"},{"full_name":"Eva Benková","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"}],"date_created":"2018-12-11T11:48:44Z","date_updated":"2021-01-12T08:18:07Z","volume":5,"type":"journal_article","abstract":[{"text":"Plants maintain capacity to form new organs such as leaves, flowers, lateral shoots and roots throughout their postembryonic lifetime. Lateral roots (LRs) originate from a few pericycle cells that acquire attributes of founder cells (FCs), undergo series of anticlinal divisions, and give rise to a few short initial cells. After initiation, coordinated cell division and differentiation occur, giving rise to lateral root primordia (LRP). Primordia continue to grow, emerge through the cortex and epidermal layers of the primary root, and finally a new apical meristem is established taking over the responsibility for growth of mature lateral roots [for detailed description of the individual stages of lateral root organogenesis see Malamy and Benfey (1997)]. To examine this highly dynamic developmental process and to investigate a role of various hormonal, genetic and environmental factors in the regulation of lateral root organogenesis, the real time imaging based analyses represent extremely powerful tools (Laskowski et al., 2008; De Smet et al., 2012; Marhavy et al., 2013 and 2014). Herein, we describe a protocol for real time lateral root primordia (LRP) analysis, which enables the monitoring of an onset of the specific gene expression and subcellular protein localization during primordia organogenesis, as well as the evaluation of the impact of genetic and environmental perturbations on LRP organogenesis.","lang":"eng"}],"publist_id":"6816","issue":"8","extern":1}]