[{"citation":{"ista":"Biswas R, Sil J. 2012. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. 4, 820–824.","ama":"Biswas R, Sil J. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. <i>Procedia Technology</i>. 2012;4:820-824. doi:<a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">10.1016/j.protcy.2012.05.134</a>","short":"R. Biswas, J. Sil, Procedia Technology 4 (2012) 820–824.","ieee":"R. Biswas and J. Sil, “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets,” <i>Procedia Technology</i>, vol. 4. Elsevier, pp. 820–824, 2012.","mla":"Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” <i>Procedia Technology</i>, vol. 4, Elsevier, 2012, pp. 820–24, doi:<a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">10.1016/j.protcy.2012.05.134</a>.","apa":"Biswas, R., &#38; Sil, J. (2012). An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. <i>Procedia Technology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">https://doi.org/10.1016/j.protcy.2012.05.134</a>","chicago":"Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” <i>Procedia Technology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">https://doi.org/10.1016/j.protcy.2012.05.134</a>."},"day":"01","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"date_published":"2012-05-01T00:00:00Z","month":"05","language":[{"iso":"eng"}],"date_updated":"2021-01-12T08:03:43Z","publisher":"Elsevier","file_date_updated":"2020-07-14T12:47:12Z","oa":1,"_id":"5839","intvolume":"         4","oa_version":"Published Version","type":"journal_article","has_accepted_license":"1","ddc":["000"],"file":[{"content_type":"application/pdf","file_name":"2012_Procedia_Biswas.pdf","date_created":"2019-01-21T07:28:06Z","creator":"dernst","file_id":"5863","file_size":305426,"date_updated":"2020-07-14T12:47:12Z","checksum":"ba0185986b151d8c11201f48cd505ceb","relation":"main_file","access_level":"open_access"}],"quality_controlled":"1","doi":"10.1016/j.protcy.2012.05.134","publication_identifier":{"issn":["2212-0173"]},"publication":"Procedia Technology","date_created":"2019-01-17T11:54:21Z","year":"2012","title":"An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets","page":"820-824","publication_status":"published","abstract":[{"text":"Canny's edge detection algorithm is a classical and robust method for edge detection in gray-scale images. The two \r\nsignificant features of this method are introduction of NMS (Non-Maximum Suppression) and double thresholding of \r\nthe  gradient  image.  Due  to  poor  illumination,  the  region  boundaries  in  an  image  may  become  vague,  creating  \r\nuncertainties  in  the  gradient  image.  In  this  paper,  we  have  proposed  an  algorithm  based  on  the  concept  of  type-2  fuzzy  sets  to  handle  uncertainties  that  automatically  selects  the  threshold  values  needed  to  segment  the  gradient image using classical Canny’s edge detection algorithm. The results show that our algorithm works significantly well on different benchmark images as well as medical images (hand radiography images). ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita"},{"first_name":"Jaya","last_name":"Sil","full_name":"Sil, Jaya"}],"extern":"1","volume":4},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bernecky","first_name":"Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0893-7036","full_name":"Bernecky, Carrie A"},{"full_name":"Taatjes, Dylan","first_name":"Dylan","last_name":"Taatjes"}],"intvolume":"       417","oa_version":"None","extern":"1","volume":417,"type":"journal_article","publist_id":"7208","_id":"596","article_processing_charge":"No","page":"387 - 394","publication_status":"published","oa":1,"abstract":[{"lang":"eng","text":"The human Mediator complex controls RNA polymerase II (pol II) function in ways that remain incompletely understood. Activator-Mediator binding alters Mediator structure, and these activator-induced structural shifts appear to play key roles in regulating transcription. A recent cryo-electron microscopy (EM) analysis revealed that pol II adopted a stable orientation within a Mediator-pol II-TFIIF assembly in which Mediator was bound to the activation domain of viral protein 16 (VP16). Whereas TFIIF was shown to be important for orienting pol II within this assembly, the potential role of the activator was not assessed. To determine how activator binding might affect pol II orientation, we isolated human Mediator-pol II-TFIIF complexes in which Mediator was not bound to an activator. Cryo-EM analysis of this assembly, coupled with pol II crystal structure docking, revealed that pol II binds Mediator at the same general location; however, in contrast to VP16-bound Mediator, pol II does not appear to stably orient in the absence of an activator. Variability in pol II orientation might be important mechanistically, perhaps to enable sense and antisense transcription at human promoters. Because Mediator interacts extensively with pol II, these results suggest that Mediator structural shifts induced by activator binding help stably orient pol II prior to transcription initiation."}],"date_published":"2012-04-13T00:00:00Z","title":"Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly","month":"04","language":[{"iso":"eng"}],"date_updated":"2021-01-12T08:05:21Z","publisher":"Elsevier","date_created":"2018-12-11T11:47:24Z","year":"2012","doi":"10.1016/j.jmb.2012.02.014","issue":"5","publication":"Journal of Molecular Biology","status":"public","day":"13","citation":{"apa":"Bernecky, C., &#38; Taatjes, D. (2012). Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">https://doi.org/10.1016/j.jmb.2012.02.014</a>","chicago":"Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” <i>Journal of Molecular Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">https://doi.org/10.1016/j.jmb.2012.02.014</a>.","mla":"Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” <i>Journal of Molecular Biology</i>, vol. 417, no. 5, Elsevier, 2012, pp. 387–94, doi:<a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">10.1016/j.jmb.2012.02.014</a>.","ieee":"C. Bernecky and D. Taatjes, “Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly,” <i>Journal of Molecular Biology</i>, vol. 417, no. 5. Elsevier, pp. 387–394, 2012.","short":"C. Bernecky, D. Taatjes, Journal of Molecular Biology 417 (2012) 387–394.","ista":"Bernecky C, Taatjes D. 2012. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. Journal of Molecular Biology. 417(5), 387–394.","ama":"Bernecky C, Taatjes D. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. <i>Journal of Molecular Biology</i>. 2012;417(5):387-394. doi:<a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">10.1016/j.jmb.2012.02.014</a>"},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4582759/","open_access":"1"}]},{"type":"journal_article","intvolume":"        15","oa_version":"Submitted Version","_id":"6136","oa":1,"date_updated":"2021-01-12T08:06:17Z","publisher":"Springer Nature","date_published":"2012-03-04T00:00:00Z","month":"03","language":[{"iso":"eng"}],"status":"public","day":"04","citation":{"chicago":"Busch, Karl Emanuel, Patrick Laurent, Zoltan Soltesz, Robin Joseph Murphy, Olivier Faivre, Berthold Hedwig, Martin Thomas, Heather L Smith, and Mario de Bono. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” <i>Nature Neuroscience</i>. Springer Nature, 2012. <a href=\"https://doi.org/10.1038/nn.3061\">https://doi.org/10.1038/nn.3061</a>.","apa":"Busch, K. E., Laurent, P., Soltesz, Z., Murphy, R. J., Faivre, O., Hedwig, B., … de Bono, M. (2012). Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nn.3061\">https://doi.org/10.1038/nn.3061</a>","mla":"Busch, Karl Emanuel, et al. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” <i>Nature Neuroscience</i>, vol. 15, no. 4, Springer Nature, 2012, pp. 581–91, doi:<a href=\"https://doi.org/10.1038/nn.3061\">10.1038/nn.3061</a>.","ieee":"K. E. Busch <i>et al.</i>, “Tonic signaling from O2 sensors sets neural circuit activity and behavioral state,” <i>Nature Neuroscience</i>, vol. 15, no. 4. Springer Nature, pp. 581–591, 2012.","short":"K.E. Busch, P. Laurent, Z. Soltesz, R.J. Murphy, O. Faivre, B. Hedwig, M. Thomas, H.L. Smith, M. de Bono, Nature Neuroscience 15 (2012) 581–591.","ista":"Busch KE, Laurent P, Soltesz Z, Murphy RJ, Faivre O, Hedwig B, Thomas M, Smith HL, de Bono M. 2012. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. Nature Neuroscience. 15(4), 581–591.","ama":"Busch KE, Laurent P, Soltesz Z, et al. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. <i>Nature Neuroscience</i>. 2012;15(4):581-591. doi:<a href=\"https://doi.org/10.1038/nn.3061\">10.1038/nn.3061</a>"},"volume":15,"author":[{"last_name":"Busch","first_name":"Karl Emanuel","full_name":"Busch, Karl Emanuel"},{"full_name":"Laurent, Patrick","first_name":"Patrick","last_name":"Laurent"},{"full_name":"Soltesz, Zoltan","last_name":"Soltesz","first_name":"Zoltan"},{"full_name":"Murphy, Robin Joseph","first_name":"Robin Joseph","last_name":"Murphy"},{"full_name":"Faivre, Olivier","first_name":"Olivier","last_name":"Faivre"},{"first_name":"Berthold","last_name":"Hedwig","full_name":"Hedwig, Berthold"},{"full_name":"Thomas, Martin","first_name":"Martin","last_name":"Thomas"},{"last_name":"Smith","first_name":"Heather L","full_name":"Smith, Heather L"},{"full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443","last_name":"de Bono","first_name":"Mario"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","pmid":1,"external_id":{"pmid":["22388961"]},"publication_status":"published","abstract":[{"text":"Tonic receptors convey stimulus duration and intensity and are implicated in homeostatic control. However, how tonic homeostatic signals are generated and how they reconfigure neural circuits and modify animal behavior is poorly understood. Here we show that Caenorhabditis elegans O2-sensing neurons are tonic receptors that continuously signal ambient [O2] to set the animal's behavioral state. Sustained signaling relied on a Ca2+ relay involving L-type voltage-gated Ca2+ channels, the ryanodine and the inositol-1,4,5-trisphosphate receptors. Tonic activity evoked continuous neuropeptide release, which helps elicit the enduring behavioral state associated with high [O2]. Sustained O2 receptor signaling was propagated to downstream neural circuits, including the hub interneuron RMG. O2 receptors evoked similar locomotory states at particular O2 concentrations, regardless of previous d[O2]/dt. However, a phasic component of the URX receptors' response to high d[O2]/dt, as well as tonic-to-phasic transformations in downstream interneurons, enabled transient reorientation movements shaped by d[O2]/dt. Our results highlight how tonic homeostatic signals can generate both transient and enduring behavioral change.","lang":"eng"}],"page":"581-591","title":"Tonic signaling from O2 sensors sets neural circuit activity and behavioral state","date_created":"2019-03-20T14:23:30Z","year":"2012","publication":"Nature Neuroscience","publication_identifier":{"issn":["1097-6256","1546-1726"]},"doi":"10.1038/nn.3061","issue":"4","quality_controlled":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3564487/","open_access":"1"}]},{"year":"2012","date_created":"2018-12-11T11:55:04Z","issue":"38","doi":"10.1073/pnas.1206953109","publication":"PNAS","status":"public","day":"18","citation":{"short":"J. Schweizer, M. Loose, M. Bonny, K. Kruse, I. Mönch, P. Schwille, PNAS 109 (2012) 15283–15288.","ieee":"J. Schweizer, M. Loose, M. Bonny, K. Kruse, I. Mönch, and P. Schwille, “Geometry sensing by self-organized protein patterns,” <i>PNAS</i>, vol. 109, no. 38. National Academy of Sciences, pp. 15283–15288, 2012.","ista":"Schweizer J, Loose M, Bonny M, Kruse K, Mönch I, Schwille P. 2012. Geometry sensing by self-organized protein patterns. PNAS. 109(38), 15283–15288.","ama":"Schweizer J, Loose M, Bonny M, Kruse K, Mönch I, Schwille P. Geometry sensing by self-organized protein patterns. <i>PNAS</i>. 2012;109(38):15283-15288. doi:<a href=\"https://doi.org/10.1073/pnas.1206953109\">10.1073/pnas.1206953109</a>","apa":"Schweizer, J., Loose, M., Bonny, M., Kruse, K., Mönch, I., &#38; Schwille, P. (2012). Geometry sensing by self-organized protein patterns. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1206953109\">https://doi.org/10.1073/pnas.1206953109</a>","chicago":"Schweizer, Jakob, Martin Loose, Mike Bonny, Karsten Kruse, Ingolf Mönch, and Petra Schwille. “Geometry Sensing by Self-Organized Protein Patterns.” <i>PNAS</i>. National Academy of Sciences, 2012. <a href=\"https://doi.org/10.1073/pnas.1206953109\">https://doi.org/10.1073/pnas.1206953109</a>.","mla":"Schweizer, Jakob, et al. “Geometry Sensing by Self-Organized Protein Patterns.” <i>PNAS</i>, vol. 109, no. 38, National Academy of Sciences, 2012, pp. 15283–88, doi:<a href=\"https://doi.org/10.1073/pnas.1206953109\">10.1073/pnas.1206953109</a>."},"quality_controlled":0,"extern":1,"intvolume":"       109","author":[{"last_name":"Schweizer","first_name":"Jakob","full_name":"Schweizer, Jakob"},{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","full_name":"Martin Loose","last_name":"Loose","first_name":"Martin"},{"full_name":"Bonny, Mike ","first_name":"Mike","last_name":"Bonny"},{"last_name":"Kruse","first_name":"Karsten","full_name":"Kruse, Karsten"},{"last_name":"Mönch","first_name":"Ingolf","full_name":"Mönch, Ingolf"},{"last_name":"Schwille","first_name":"Petra","full_name":"Schwille, Petra "}],"type":"journal_article","acknowledgement":"This work was supported by the Max-Planck-Society (P.S. and M.L.) and by the German Research Foundation as part of the Research Training Group “Nano- and Biotechnologies for Electronic Device Packaging” (GRK 1401) (J.S.) and by the Leibniz-Award (P.S.). ","volume":109,"publist_id":"5096","_id":"1987","page":"15283 - 15288","abstract":[{"text":"In the living cell, proteins are able to organize space much larger than their dimensions. In return, changes of intracellular space can influence biochemical reactions, allowing cells to sense their size and shape. Despite the possibility to reconstitute protein self-organization with only a few purified components, we still lack knowledge of how geometrical boundaries affect spatiotemporal protein patterns. Following a minimal systems approach, we used purified proteins and photolithographically patterned membranes to study the influence of spatial confinement on the self-organization of the Min system, a spatial regulator of bacterial cytokinesis, in vitro. We found that the emerging protein pattern responds even to the lateral, two-dimensional geometry of the membrane such that, as in the three-dimensional cell, Min protein waves travel along the longest axis of the membrane patch. This shows that for spatial sensing the Min system does not need to be enclosed in a three-dimensional compartment. Using a computational model we quantitatively analyzed our experimental findings and identified persistent binding of MinE to the membrane as requirement for the Min system to sense geometry. Our results give insight into the interplay between geometrical confinement and biochemical patterns emerging from a nonlinear reaction-diffusion system.\n","lang":"eng"}],"publication_status":"published","month":"09","title":"Geometry sensing by self-organized protein patterns","date_published":"2012-09-18T00:00:00Z","publisher":"National Academy of Sciences","date_updated":"2021-01-12T06:54:31Z"},{"abstract":[{"text":"Background: Drosophila albomicans is a unique model organism for studying both sex chromosome and B chromosome evolution. A pair of its autosomes comprising roughly 40% of the whole genome has fused to the ancient X and Y chromosomes only about 0.12 million years ago, thereby creating the youngest and most gene-rich neo-sex system reported to date. This species also possesses recently derived B chromosomes that show non-Mendelian inheritance and significantly influence fertility.Methods: We sequenced male flies with B chromosomes at 124.5-fold genome coverage using next-generation sequencing. To characterize neo-Y specific changes and B chromosome sequences, we also sequenced inbred female flies derived from the same strain but without B's at 28.5-fold.Results: We assembled a female genome and placed 53% of the sequence and 85% of the annotated proteins into specific chromosomes, by comparison with the 12 Drosophila genomes. Despite its very recent origin, the non-recombining neo-Y chromosome shows various signs of degeneration, including a significant enrichment of non-functional genes compared to the neo-X, and an excess of tandem duplications relative to other chromosomes. We also characterized a B-chromosome linked scaffold that contains an actively transcribed unit and shows sequence similarity to the subcentromeric regions of both the ancient X and the neo-X chromosome.Conclusions: Our results provide novel insights into the very early stages of sex chromosome evolution and B chromosome origination, and suggest an unprecedented connection between the births of these two systems in D. albomicans.","lang":"eng"}],"publication_status":"published","title":"Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans","month":"03","date_published":"2012-03-22T00:00:00Z","publisher":"BioMed Central","date_updated":"2021-01-12T06:55:08Z","extern":1,"intvolume":"        13","author":[{"first_name":"Qi","last_name":"Zhou","full_name":"Zhou, Qi"},{"full_name":"Zhu, Hongmei","first_name":"Hongmei","last_name":"Zhu"},{"full_name":"Huang, Quanfei","first_name":"Quanfei","last_name":"Huang"},{"first_name":"Li","last_name":"Zhao","full_name":"Zhao, Li"},{"full_name":"Zhang, Guo J","last_name":"Zhang","first_name":"Guo"},{"full_name":"Roy, Scott W","first_name":"Scott","last_name":"Roy"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","full_name":"Beatriz Vicoso","last_name":"Vicoso","first_name":"Beatriz"},{"last_name":"Xuan","first_name":"Zhaolin","full_name":"Xuan, Zhaolin"},{"full_name":"Ruan, Jue","first_name":"Jue","last_name":"Ruan"},{"first_name":"Yue","last_name":"Zhang","full_name":"Zhang, Yue"},{"full_name":"Zhao, Ruoping","first_name":"Ruoping","last_name":"Zhao"},{"full_name":"Ye, Chen","first_name":"Chen","last_name":"Ye"},{"full_name":"Zhang, Xiuqing","last_name":"Zhang","first_name":"Xiuqing"},{"first_name":"Jùn","last_name":"Wang","full_name":"Wang, Jùn"},{"last_name":"Wang","first_name":"Wen","full_name":"Wang, Wen"},{"full_name":"Bachtrog, Doris","first_name":"Doris","last_name":"Bachtrog"}],"volume":13,"type":"journal_article","publist_id":"4965","_id":"2073","citation":{"chicago":"Zhou, Qi, Hongmei Zhu, Quanfei Huang, Li Zhao, Guo Zhang, Scott Roy, Beatriz Vicoso, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” <i>BMC Genomics</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1471-2164-13-109\">https://doi.org/10.1186/1471-2164-13-109</a>.","apa":"Zhou, Q., Zhu, H., Huang, Q., Zhao, L., Zhang, G., Roy, S., … Bachtrog, D. (2012). Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2164-13-109\">https://doi.org/10.1186/1471-2164-13-109</a>","mla":"Zhou, Qi, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” <i>BMC Genomics</i>, vol. 13, no. 1, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1471-2164-13-109\">10.1186/1471-2164-13-109</a>.","short":"Q. Zhou, H. Zhu, Q. Huang, L. Zhao, G. Zhang, S. Roy, B. Vicoso, Z. Xuan, J. Ruan, Y. Zhang, R. Zhao, C. Ye, X. Zhang, J. Wang, W. Wang, D. Bachtrog, BMC Genomics 13 (2012).","ieee":"Q. Zhou <i>et al.</i>, “Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans,” <i>BMC Genomics</i>, vol. 13, no. 1. BioMed Central, 2012.","ama":"Zhou Q, Zhu H, Huang Q, et al. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. <i>BMC Genomics</i>. 2012;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2164-13-109\">10.1186/1471-2164-13-109</a>","ista":"Zhou Q, Zhu H, Huang Q, Zhao L, Zhang G, Roy S, Vicoso B, Xuan Z, Ruan J, Zhang Y, Zhao R, Ye C, Zhang X, Wang J, Wang W, Bachtrog D. 2012. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. BMC Genomics. 13(1)."},"quality_controlled":0,"year":"2012","date_created":"2018-12-11T11:55:33Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"issue":"1","doi":"10.1186/1471-2164-13-109","day":"22","publication":"BMC Genomics","status":"public"},{"extern":1,"intvolume":"        31","author":[{"last_name":"Hildebrand","first_name":"Kristian","full_name":"Hildebrand, Kristian"},{"full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"full_name":"Alexa, Marc","last_name":"Alexa","first_name":"Marc"}],"type":"journal_article","volume":31,"publist_id":"4959","_id":"2079","page":"583 - 592","abstract":[{"lang":"eng","text":"We introduce an algorithm and representation for fabricating 3D shape abstractions using mutually intersecting planar cut-outs. The planes have prefabricated slits at their intersections and are assembled by sliding them together. Often such abstractions are used as a sculptural art form or in architecture and are colloquially called ‘cardboard sculptures’. Based on an analysis of construction rules, we propose an extended binary space partitioning tree as an efficient representation of such cardboard models which allows us to quickly evaluate the feasibility of newly added planar elements. The complexity of insertion order quickly increases with the number of planar elements and manual analysis becomes intractable. We provide tools for generating cardboard sculptures with guaranteed constructibility. In combination with a simple optimization and sampling strategy for new elements, planar shape abstraction models can be designed by iteratively adding elements. As an output, we obtain a fabrication plan that can be printed or sent to a laser cutter. We demonstrate the complete process by designing and fabricating cardboard models of various well-known 3D shapes."}],"publication_status":"published","month":"05","title":"crdbrd: Shape fabrication by sliding planar slices","date_published":"2012-05-01T00:00:00Z","publisher":"Wiley-Blackwell","date_updated":"2021-01-12T06:55:10Z","year":"2012","date_created":"2018-12-11T11:55:35Z","issue":"2pt3","doi":"10.1111/j.1467-8659.2012.03037.x","status":"public","day":"01","publication":"Computer Graphics Forum","citation":{"ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “crdbrd: Shape fabrication by sliding planar slices,” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3. Wiley-Blackwell, pp. 583–592, 2012.","short":"K. Hildebrand, B. Bickel, M. Alexa, Computer Graphics Forum 31 (2012) 583–592.","ama":"Hildebrand K, Bickel B, Alexa M. crdbrd: Shape fabrication by sliding planar slices. <i>Computer Graphics Forum</i>. 2012;31(2pt3):583-592. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">10.1111/j.1467-8659.2012.03037.x</a>","ista":"Hildebrand K, Bickel B, Alexa M. 2012. crdbrd: Shape fabrication by sliding planar slices. Computer Graphics Forum. 31(2pt3), 583–592.","apa":"Hildebrand, K., Bickel, B., &#38; Alexa, M. (2012). crdbrd: Shape fabrication by sliding planar slices. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">https://doi.org/10.1111/j.1467-8659.2012.03037.x</a>","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">https://doi.org/10.1111/j.1467-8659.2012.03037.x</a>.","mla":"Hildebrand, Kristian, et al. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3, Wiley-Blackwell, 2012, pp. 583–92, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">10.1111/j.1467-8659.2012.03037.x</a>."},"quality_controlled":0},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1206.3528"}],"quality_controlled":"1","publication":"Physical Review Letters","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"doi":"10.1103/physrevlett.109.188101","issue":"18","article_number":"188101","date_created":"2021-11-29T14:08:00Z","year":"2012","keyword":["general physics and astronomy"],"title":"Mechanism of membrane tube formation induced by adhesive nanocomponents","publication_status":"published","external_id":{"arxiv":["1206.3528"],"pmid":["23215334"]},"abstract":[{"lang":"eng","text":"We report numerical simulations of membrane tubulation driven by large colloidal particles. Using Monte Carlo simulations we study how the process depends on particle size and binding strength, and present accurate free energy calculations to sort out how tube formation compares with the competing budding process. We find that tube formation is a result of the collective behavior of the particles adhering on the surface, and it occurs for binding strengths that are smaller than those required for budding. We also find that long linear aggregates of particles forming on the membrane surface act as nucleation seeds for tubulation by lowering the free energy barrier associated to the process."}],"article_processing_charge":"No","pmid":1,"volume":109,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","last_name":"Šarić"},{"full_name":"Cacciuto, Angelo","first_name":"Angelo","last_name":"Cacciuto"}],"extern":"1","citation":{"ieee":"A. Šarić and A. Cacciuto, “Mechanism of membrane tube formation induced by adhesive nanocomponents,” <i>Physical Review Letters</i>, vol. 109, no. 18. American Physical Society, 2012.","short":"A. Šarić, A. Cacciuto, Physical Review Letters 109 (2012).","ista":"Šarić A, Cacciuto A. 2012. Mechanism of membrane tube formation induced by adhesive nanocomponents. Physical Review Letters. 109(18), 188101.","ama":"Šarić A, Cacciuto A. Mechanism of membrane tube formation induced by adhesive nanocomponents. <i>Physical Review Letters</i>. 2012;109(18). doi:<a href=\"https://doi.org/10.1103/physrevlett.109.188101\">10.1103/physrevlett.109.188101</a>","chicago":"Šarić, Anđela, and Angelo Cacciuto. “Mechanism of Membrane Tube Formation Induced by Adhesive Nanocomponents.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/physrevlett.109.188101\">https://doi.org/10.1103/physrevlett.109.188101</a>.","apa":"Šarić, A., &#38; Cacciuto, A. (2012). Mechanism of membrane tube formation induced by adhesive nanocomponents. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.109.188101\">https://doi.org/10.1103/physrevlett.109.188101</a>","mla":"Šarić, Anđela, and Angelo Cacciuto. “Mechanism of Membrane Tube Formation Induced by Adhesive Nanocomponents.” <i>Physical Review Letters</i>, vol. 109, no. 18, 188101, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/physrevlett.109.188101\">10.1103/physrevlett.109.188101</a>."},"status":"public","day":"31","date_updated":"2021-11-29T14:29:25Z","arxiv":1,"publisher":"American Physical Society","date_published":"2012-10-31T00:00:00Z","month":"10","language":[{"iso":"eng"}],"oa":1,"scopus_import":"1","_id":"10387","type":"journal_article","intvolume":"       109","oa_version":"Preprint","article_type":"original"},{"oa_version":"Preprint","intvolume":"       108","article_type":"original","type":"journal_article","acknowledgement":"This work was supported by the National Science Foundation under Career Grant No. DMR-0846426.\r\n","scopus_import":"1","_id":"10388","oa":1,"date_published":"2012-03-14T00:00:00Z","language":[{"iso":"eng"}],"month":"03","date_updated":"2021-11-29T15:12:13Z","arxiv":1,"publisher":"American Physical Society","day":"14","status":"public","citation":{"ista":"Šarić A, Cacciuto A. 2012. Fluid membranes can drive linear aggregation of adsorbed spherical nanoparticles. Physical Review Letters. 108(11), 118101.","ama":"Šarić A, Cacciuto A. Fluid membranes can drive linear aggregation of adsorbed spherical nanoparticles. <i>Physical Review Letters</i>. 2012;108(11). doi:<a href=\"https://doi.org/10.1103/physrevlett.108.118101\">10.1103/physrevlett.108.118101</a>","short":"A. Šarić, A. Cacciuto, Physical Review Letters 108 (2012).","ieee":"A. Šarić and A. Cacciuto, “Fluid membranes can drive linear aggregation of adsorbed spherical nanoparticles,” <i>Physical Review Letters</i>, vol. 108, no. 11. American Physical Society, 2012.","mla":"Šarić, Anđela, and Angelo Cacciuto. “Fluid Membranes Can Drive Linear Aggregation of Adsorbed Spherical Nanoparticles.” <i>Physical Review Letters</i>, vol. 108, no. 11, 118101, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/physrevlett.108.118101\">10.1103/physrevlett.108.118101</a>.","chicago":"Šarić, Anđela, and Angelo Cacciuto. “Fluid Membranes Can Drive Linear Aggregation of Adsorbed Spherical Nanoparticles.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/physrevlett.108.118101\">https://doi.org/10.1103/physrevlett.108.118101</a>.","apa":"Šarić, A., &#38; Cacciuto, A. (2012). Fluid membranes can drive linear aggregation of adsorbed spherical nanoparticles. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.108.118101\">https://doi.org/10.1103/physrevlett.108.118101</a>"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","orcid":"0000-0002-7854-2139","full_name":"Šarić, Anđela","last_name":"Šarić","first_name":"Anđela"},{"full_name":"Cacciuto, Angelo","first_name":"Angelo","last_name":"Cacciuto"}],"extern":"1","volume":108,"pmid":1,"article_processing_charge":"No","publication_status":"published","external_id":{"arxiv":["1201.0036"],"pmid":["22540513"]},"abstract":[{"text":"Using computer simulations, we show that lipid membranes can mediate linear aggregation of spherical nanoparticles binding to it for a wide range of biologically relevant bending rigidities. This result is in net contrast with the isotropic aggregation of nanoparticles on fluid interfaces or the expected clustering of isotropic insertions in biological membranes. We present a phase diagram indicating where linear aggregation is expected and compute explicitly the free-energy barriers associated with linear and isotropic aggregation. Finally, we provide simple scaling arguments to explain this phenomenology.","lang":"eng"}],"keyword":["general physics and astronomy"],"title":"Fluid membranes can drive linear aggregation of adsorbed spherical nanoparticles","date_created":"2021-11-29T14:30:05Z","year":"2012","article_number":"118101","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"doi":"10.1103/physrevlett.108.118101","issue":"11","publication":"Physical Review Letters","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1201.0036","open_access":"1"}]},{"publication_status":"published","abstract":[{"lang":"eng","text":"In July, 2011, a 32-year-old man presented with thoracic pain radiating to the left arm and upper dorsum, shortness of breath, and palpitations. He had had upper back tension for 6 months. Medical history was unremarkable apart from moderate nicotine use (two pack-years). Echocardiography, electrocardiography, and laboratory tests were unremarkable, excluding a cardiac event. CT of the chest after chest radiography showed a large bulla of 16 cm diameter in the right hemithorax (figure A). We did not detect radiological evidence of underlying pulmonary disease. The bulla wall was unremarkable and no structures were seen within the bulla."}],"article_processing_charge":"No","date_updated":"2021-01-12T06:47:57Z","publisher":"Elsevier","date_published":"2012-10-01T00:00:00Z","title":"Bulla in the lung","language":[{"iso":"eng"}],"month":"10","acknowledgement":"We thank the interdisciplinary team at the ELK Berlin Chest Hospital.","type":"journal_article","volume":380,"author":[{"first_name":"Barbara","last_name":"Erne","full_name":"Erne, Barbara"},{"last_name":"Graff","first_name":"Mareike","full_name":"Graff, Mareike"},{"full_name":"Klemm, Wolfram","last_name":"Klemm","first_name":"Wolfram"},{"full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","last_name":"Danzl","first_name":"Johann G"},{"last_name":"Leschber","first_name":"Gunda","full_name":"Leschber, Gunda"}],"intvolume":"       380","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","extern":"1","_id":"1055","publist_id":"6333","citation":{"ama":"Erne B, Graff M, Klemm W, Danzl JG, Leschber G. Bulla in the lung. <i>The Lancet</i>. 2012;380(9849). doi:<a href=\"https://doi.org/10.1016/S0140-6736(12)60690-4\">10.1016/S0140-6736(12)60690-4</a>","ista":"Erne B, Graff M, Klemm W, Danzl JG, Leschber G. 2012. Bulla in the lung. The Lancet. 380(9849).","short":"B. Erne, M. Graff, W. Klemm, J.G. Danzl, G. Leschber, The Lancet 380 (2012).","ieee":"B. Erne, M. Graff, W. Klemm, J. G. Danzl, and G. Leschber, “Bulla in the lung,” <i>The Lancet</i>, vol. 380, no. 9849. Elsevier, 2012.","mla":"Erne, Barbara, et al. “Bulla in the Lung.” <i>The Lancet</i>, vol. 380, no. 9849, Elsevier, 2012, doi:<a href=\"https://doi.org/10.1016/S0140-6736(12)60690-4\">10.1016/S0140-6736(12)60690-4</a>.","apa":"Erne, B., Graff, M., Klemm, W., Danzl, J. G., &#38; Leschber, G. (2012). Bulla in the lung. <i>The Lancet</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0140-6736(12)60690-4\">https://doi.org/10.1016/S0140-6736(12)60690-4</a>","chicago":"Erne, Barbara, Mareike Graff, Wolfram Klemm, Johann G Danzl, and Gunda Leschber. “Bulla in the Lung.” <i>The Lancet</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/S0140-6736(12)60690-4\">https://doi.org/10.1016/S0140-6736(12)60690-4</a>."},"date_created":"2018-12-11T11:49:54Z","year":"2012","status":"public","day":"01","publication":"The Lancet","doi":"10.1016/S0140-6736(12)60690-4","issue":"9849"},{"citation":{"ieee":"M. Mark <i>et al.</i>, “Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions,” <i>Physical Review Letters</i>, vol. 108, no. 21. American Physical Society, 2012.","short":"M. Mark, E. Haller, K. Lauber, J.G. Danzl, A. Janisch, H. Büchler, A. Daley, H. Nägerl, Physical Review Letters 108 (2012).","ista":"Mark M, Haller E, Lauber K, Danzl JG, Janisch A, Büchler H, Daley A, Nägerl H. 2012. Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions. Physical Review Letters. 108(21).","ama":"Mark M, Haller E, Lauber K, et al. Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions. <i>Physical Review Letters</i>. 2012;108(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">10.1103/PhysRevLett.108.215302</a>","chicago":"Mark, Manfred, Elmar Haller, Katharina Lauber, Johann G Danzl, Alexander Janisch, Hans Büchler, Andrew Daley, and Hanns Nägerl. “Preparation and Spectroscopy of a Metastable Mott-Insulator State with Attractive Interactions.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">https://doi.org/10.1103/PhysRevLett.108.215302</a>.","apa":"Mark, M., Haller, E., Lauber, K., Danzl, J. G., Janisch, A., Büchler, H., … Nägerl, H. (2012). Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">https://doi.org/10.1103/PhysRevLett.108.215302</a>","mla":"Mark, Manfred, et al. “Preparation and Spectroscopy of a Metastable Mott-Insulator State with Attractive Interactions.” <i>Physical Review Letters</i>, vol. 108, no. 21, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.215302\">10.1103/PhysRevLett.108.215302</a>."},"day":"25","status":"public","oa":1,"arxiv":1,"publisher":"American Physical Society","date_updated":"2021-01-12T06:47:58Z","month":"05","language":[{"iso":"eng"}],"date_published":"2012-05-25T00:00:00Z","acknowledgement":"We are indebted to R. Grimm for generous support. We thank J. von Stecher, P. Johnson, and E. Tiesinga for fruitful discussions. We gratefully acknowledge funding by the Austrian Science Fund (FWF) within Project No. I153-N16 and within the framework of the European Science Foundation (ESF) EuroQUASAR collective research project QuDeGPM, and by the European Research Council (ERC) under Project No. 278417.","type":"journal_article","intvolume":"       108","oa_version":"Preprint","_id":"1056","publist_id":"6334","main_file_link":[{"url":"https://arxiv.org/abs/1201.1008","open_access":"1"}],"year":"2012","date_created":"2018-12-11T11:49:55Z","publication":"Physical Review Letters","issue":"21","doi":"10.1103/PhysRevLett.108.215302","abstract":[{"lang":"eng","text":"We prepare and study a metastable attractive Mott-insulator state formed with bosonic atoms in a three-dimensional optical lattice. Starting from a Mott insulator with Cs atoms at weak repulsive interactions, we use a magnetic Feshbach resonance to tune the interactions to large attractive values and produce a metastable state pinned by attractive interactions with a lifetime on the order of 10 s. We probe the (de)excitation spectrum via lattice modulation spectroscopy, measuring the interaction dependence of two- and three-body bound-state energies. As a result of increased on-site three-body loss we observe resonance broadening and suppression of tunneling processes that produce three-body occupation."}],"publication_status":"published","external_id":{"arxiv":["1201.1008"]},"article_processing_charge":"No","title":"Preparation and spectroscopy of a metastable mott-insulator state with attractive interactions","volume":108,"extern":"1","author":[{"last_name":"Mark","first_name":"Manfred","full_name":"Mark, Manfred"},{"last_name":"Haller","first_name":"Elmar","full_name":"Haller, Elmar"},{"first_name":"Katharina","last_name":"Lauber","full_name":"Lauber, Katharina"},{"last_name":"Danzl","first_name":"Johann G","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G"},{"last_name":"Janisch","first_name":"Alexander","full_name":"Janisch, Alexander"},{"full_name":"Büchler, Hans","last_name":"Büchler","first_name":"Hans"},{"full_name":"Daley, Andrew","last_name":"Daley","first_name":"Andrew"},{"first_name":"Hanns","last_name":"Nägerl","full_name":"Nägerl, Hanns"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"publisher":"American Physical Society","date_updated":"2022-02-08T10:48:01Z","language":[{"iso":"eng"}],"month":"02","date_published":"2012-02-01T00:00:00Z","type":"conference","acknowledgement":"This work was supported by the Center for Emergent Superconductivity, an Energy Frontier Research Center funded by the U.S. DOE, Office of Science, under Award No. DE-AC0298CH1088.","intvolume":"        57","oa_version":"Published Version","_id":"10750","citation":{"ama":"Polshyn H, Budakian R. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In: <i>APS March Meeting 2012</i>. Vol 57. American Physical Society; 2012.","ista":"Polshyn H, Budakian R. 2012. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. APS March Meeting 2012. APS: American Physical Society, Bulletin of the American Physical Society, vol. 57, X21.00008.","ieee":"H. Polshyn and R. Budakian, “Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc,” in <i>APS March Meeting 2012</i>, Boston, MA, United States, 2012, vol. 57, no. 1.","short":"H. Polshyn, R. Budakian, in:, APS March Meeting 2012, American Physical Society, 2012.","mla":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” <i>APS March Meeting 2012</i>, vol. 57, no. 1, X21.00008, American Physical Society, 2012.","chicago":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” In <i>APS March Meeting 2012</i>, Vol. 57. American Physical Society, 2012.","apa":"Polshyn, H., &#38; Budakian, R. (2012). Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In <i>APS March Meeting 2012</i> (Vol. 57). Boston, MA, United States: American Physical Society."},"day":"01","status":"public","alternative_title":["Bulletin of the American Physical Society"],"abstract":[{"text":"The goal of this work is to study the superconducting coherence length in the fluctuation regime in cuprate superconductors. In this work we present cantilever torque magnetometry measurements of micron-size BSCCO flakes patterned with arrays of nanometer scale rings or holes. Using ultrasensitive dynamic torque magnetometry, oscillations in magnetization are observed near Tc as a function of the applied magnetic flux threading the array. Special effort was made to detect the oscillations in magnetization at temperatures above Tc, where the Nernst effect and magnetization measurements suggest the possibility of pairing. To constrain the magnitude of the coherence length in the fluctuation regime, we will present the dependence of the amplitude of the h/2e period oscillations as a function of temperature and hole size.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","title":"Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc","volume":57,"extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896","last_name":"Polshyn","first_name":"Hryhoriy"},{"full_name":"Budakian, Raffi","last_name":"Budakian","first_name":"Raffi"}],"quality_controlled":"1","conference":{"location":"Boston, MA, United States","end_date":"2012-03-02","name":"APS: American Physical Society","start_date":"2012-02-27"},"main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR12/Event/167014","open_access":"1"}],"article_number":"X21.00008","year":"2012","date_created":"2022-02-08T10:39:08Z","publication":"APS March Meeting 2012","issue":"1","publication_identifier":{"issn":["0003-0503"]}},{"_id":"762","publist_id":"6892","type":"conference","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Petr","last_name":"Kuznetsov","full_name":"Kuznetsov, Petr"},{"first_name":"Giuliano","last_name":"Losa","full_name":"Losa, Giuliano"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-02-23T13:12:27Z","publisher":"ACM","date_published":"2012-01-01T00:00:00Z","month":"01","title":"On the cost of composing shared-memory algorithms","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"Decades of research in distributed computing have led to a variety of perspectives on what it means for a concurrent algorithm to be efficient, depending on model assumptions, progress guarantees, and complexity metrics. It is therefore natural to ask whether one could compose algorithms that perform efficiently under different conditions, so that the composition preserves the performance of the original components when their conditions are met. In this paper, we evaluate the cost of composing shared-memory algorithms. First, we formally define the notion of safely composable algorithms and we show that every sequential type has a safely composable implementation, as long as enough state is transferred between modules. Since such generic implementations are inherently expensive, we present a more general light-weight specification that allows the designer to transfer very little state between modules, by taking advantage of the semantics of the implemented object. Using this framework, we implement a composed longlived test-and-set object, with the property that each of its modules is asymptotically optimal with respect to the progress condition it ensures, while the entire implementation only uses objects with consensus number at most two. Thus, we show that the overhead of composition can be negligible in the case of some important shared-memory abstractions.","lang":"eng"}],"article_processing_charge":"No","page":"298 - 307","day":"01","status":"public","doi":"10.1145/2312005.2312057","date_created":"2018-12-11T11:48:22Z","year":"2012","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"citation":{"ieee":"D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, and G. Losa, “On the cost of composing shared-memory algorithms,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2012, pp. 298–307.","short":"D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, G. Losa, in:, ACM, 2012, pp. 298–307.","ama":"Alistarh D-A, Guerraoui R, Kuznetsov P, Losa G. On the cost of composing shared-memory algorithms. In: ACM; 2012:298-307. doi:<a href=\"https://doi.org/10.1145/2312005.2312057\">10.1145/2312005.2312057</a>","ista":"Alistarh D-A, Guerraoui R, Kuznetsov P, Losa G. 2012. On the cost of composing shared-memory algorithms. SPAA: Symposium on Parallelism in Algorithms and Architectures, 298–307.","apa":"Alistarh, D.-A., Guerraoui, R., Kuznetsov, P., &#38; Losa, G. (2012). On the cost of composing shared-memory algorithms (pp. 298–307). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. <a href=\"https://doi.org/10.1145/2312005.2312057\">https://doi.org/10.1145/2312005.2312057</a>","chicago":"Alistarh, Dan-Adrian, Rachid Guerraoui, Petr Kuznetsov, and Giuliano Losa. “On the Cost of Composing Shared-Memory Algorithms,” 298–307. ACM, 2012. <a href=\"https://doi.org/10.1145/2312005.2312057\">https://doi.org/10.1145/2312005.2312057</a>.","mla":"Alistarh, Dan-Adrian, et al. <i>On the Cost of Composing Shared-Memory Algorithms</i>. ACM, 2012, pp. 298–307, doi:<a href=\"https://doi.org/10.1145/2312005.2312057\">10.1145/2312005.2312057</a>."}},{"date_updated":"2023-02-23T13:12:41Z","publisher":"Springer","date_published":"2012-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"title":"Early deciding synchronous renaming in O(log f) rounds or less","publication_status":"published","abstract":[{"lang":"eng","text":"Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding upper bounds for synchronous renaming, in which the running time adapts to the actual number of failures f in the execution. We show that, surprisingly, renaming can be solved in constant time if the number of failures f is limited to O(√n), while for general f ≤ n - 1 renaming can always be solved in O(log f) communication rounds. In the wait-free case, i.e. for f = n - 1, our upper bounds match the Ω(log n) lower bound of Chaudhuri et al. [13]."}],"article_processing_charge":"No","page":"195 - 206","_id":"763","publist_id":"6893","type":"conference","acknowledgement":"Hagit Attiya - Supported in party by Israel Science Foundation (grant number 1227/10).\r\nCorentin Travers - Additional supports from the ANR projects ALADDIN and DISPLEXITY\r\n","volume":"7355 LNCS","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Attiya, Hagit","first_name":"Hagit","last_name":"Attiya"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","extern":"1","conference":{"name":"SIROCCO: Structural Information and Communication Complexity"},"citation":{"mla":"Alistarh, Dan-Adrian, et al. <i>Early Deciding Synchronous Renaming in O(Log f) Rounds or Less</i>. Vol. 7355 LNCS, Springer, 2012, pp. 195–206, doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">10.1007/978-3-642-31104-8_17</a>.","apa":"Alistarh, D.-A., Attiya, H., Guerraoui, R., &#38; Travers, C. (2012). Early deciding synchronous renaming in O(log f) rounds or less (Vol. 7355 LNCS, pp. 195–206). Presented at the SIROCCO: Structural Information and Communication Complexity, Springer. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">https://doi.org/10.1007/978-3-642-31104-8_17</a>","chicago":"Alistarh, Dan-Adrian, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. “Early Deciding Synchronous Renaming in O(Log f) Rounds or Less,” 7355 LNCS:195–206. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">https://doi.org/10.1007/978-3-642-31104-8_17</a>.","ama":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. Early deciding synchronous renaming in O(log f) rounds or less. In: Vol 7355 LNCS. Springer; 2012:195-206. doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">10.1007/978-3-642-31104-8_17</a>","ista":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. 2012. Early deciding synchronous renaming in O(log f) rounds or less. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 7355 LNCS, 195–206.","ieee":"D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206.","short":"D.-A. Alistarh, H. Attiya, R. Guerraoui, C. Travers, in:, Springer, 2012, pp. 195–206."},"day":"01","status":"public","doi":"10.1007/978-3-642-31104-8_17","alternative_title":["LNCS"],"date_created":"2018-12-11T11:48:22Z","year":"2012"},{"date_published":"2012-02-01T00:00:00Z","month":"02","title":"Of choices, failures and asynchrony: the many faces of set agreement","language":[{"iso":"eng"}],"date_updated":"2023-02-23T13:13:02Z","publisher":"Springer","article_processing_charge":"No","page":"595 - 629","publication_status":"published","abstract":[{"text":"Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. In synchronous networks, too, the complexity of set agreement has been a significant research challenge that has now been resolved. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony. Nothing specific is known about the complexity of set agreement in such a &quot;partially synchronous&quot; setting. In this paper, we address this challenge, presenting the first (asymptotically) tight bound on the complexity of set agreement in such systems. We introduce a novel technique for simulating, in a fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone message-passing system in which some fragments appear synchronous to some processes. We use this simulation technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. Specifically, we show that every set agreement protocol requires at least $\\lfloor\\frac t k \\rfloor + 2$ synchronous rounds to decide. We present an (asymptotically) matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony. From these two results, we derive the size of the minimal window of synchrony needed to solve set agreement. By relating synchronous, asynchronous and partially synchronous environments, our simulation technique is of independent interest. In particular, it allows us to obtain a new lower bound on the complexity of early deciding k-set agreement complementary to that of Gafni et al. (in SIAM J. Comput. 40(1):63-78, 2011), and to re-derive the combinatorial topology lower bound of Guerraoui et al. (in Theor. Comput. Sci. 410(6-7):570-580, 2009) in an algorithmic way.","lang":"eng"}],"publist_id":"6894","_id":"764","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}],"intvolume":"        62","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","extern":"1","acknowledgement":"We would like  to thank  Hagit  Attiya, Keren Censor-Hillel,  and the  anonymous\r\nreviewers for their feedback on drafts of this paper.\r\nPart of the work was performed  as C. Travers was a Post-Doctoral Fellow at the Technion, Haifa,\r\nsupported by the “Sam & Cecilia Neaman” Fellowship. Part of the work was performed as S. Gilbert was\r\na Post-Doctoral Fellow at the Swiss Federal Institute of Technology, Lausanne, Switzerland.","type":"journal_article","volume":62,"citation":{"mla":"Alistarh, Dan-Adrian, et al. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” <i>Algorithmica (New York)</i>, vol. 62, no. 1–2, Springer, 2012, pp. 595–629, doi:<a href=\"https://doi.org/10.1007/s00453-011-9581-7\">10.1007/s00453-011-9581-7</a>.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2012). Of choices, failures and asynchrony: the many faces of set agreement. <i>Algorithmica (New York)</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-011-9581-7\">https://doi.org/10.1007/s00453-011-9581-7</a>","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” <i>Algorithmica (New York)</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00453-011-9581-7\">https://doi.org/10.1007/s00453-011-9581-7</a>.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2012. Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). 62(1–2), 595–629.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Of choices, failures and asynchrony: the many faces of set agreement. <i>Algorithmica (New York)</i>. 2012;62(1-2):595-629. doi:<a href=\"https://doi.org/10.1007/s00453-011-9581-7\">10.1007/s00453-011-9581-7</a>","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Algorithmica (New York) 62 (2012) 595–629.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” <i>Algorithmica (New York)</i>, vol. 62, no. 1–2. Springer, pp. 595–629, 2012."},"doi":"10.1007/s00453-011-9581-7","issue":"1-2","day":"01","status":"public","publication":"Algorithmica (New York)","date_created":"2018-12-11T11:48:23Z","year":"2012"},{"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":"Bender","first_name":"Michael","full_name":"Bender, Michael"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","extern":"1","type":"conference","publist_id":"6890","_id":"766","article_processing_charge":"No","page":"331 - 340","publication_status":"published","abstract":[{"text":"Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key building block for various distributed algorithms. In this paper, we break new ground on this classic problem: we introduce the To-Do Tree concurrent data structure, which improves on the best known randomized and deterministic upper bounds. In the presence of an adaptive adversary, the randomized To-Do Tree algorithm has O(m + p log p log2 m) work complexity. We then show that there exists a deterministic variant of the To-Do Tree algorithm with work complexity O(m + p log5 m log2 max(m, p)). For all values of m and p, our algorithms are within log factors of the Ω(m + p log p) lower bound for this problem. The key technical ingredient in our results is a new approach for analyzing concurrent executions against a strong adaptive scheduler. This technique allows us to handle the complex dependencies between the processes' coin flips and their scheduling, and to tightly bound the work needed to perform subsets of the tasks.","lang":"eng"}],"date_published":"2012-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","title":"How to allocate tasks asynchronously","date_updated":"2023-02-23T13:13:27Z","publisher":"IEEE","date_created":"2018-12-11T11:48:23Z","year":"2012","doi":"10.1109/FOCS.2012.41","status":"public","day":"01","citation":{"apa":"Alistarh, D.-A., Bender, M., Gilbert, S., &#38; Guerraoui, R. (2012). How to allocate tasks asynchronously (pp. 331–340). Presented at the FOCS: Foundations of Computer Science, IEEE. <a href=\"https://doi.org/10.1109/FOCS.2012.41\">https://doi.org/10.1109/FOCS.2012.41</a>","chicago":"Alistarh, Dan-Adrian, Michael Bender, Seth Gilbert, and Rachid Guerraoui. “How to Allocate Tasks Asynchronously,” 331–40. IEEE, 2012. <a href=\"https://doi.org/10.1109/FOCS.2012.41\">https://doi.org/10.1109/FOCS.2012.41</a>.","mla":"Alistarh, Dan-Adrian, et al. <i>How to Allocate Tasks Asynchronously</i>. IEEE, 2012, pp. 331–40, doi:<a href=\"https://doi.org/10.1109/FOCS.2012.41\">10.1109/FOCS.2012.41</a>.","short":"D.-A. Alistarh, M. Bender, S. Gilbert, R. Guerraoui, in:, IEEE, 2012, pp. 331–340.","ieee":"D.-A. Alistarh, M. Bender, S. Gilbert, and R. Guerraoui, “How to allocate tasks asynchronously,” presented at the FOCS: Foundations of Computer Science, 2012, pp. 331–340.","ama":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. How to allocate tasks asynchronously. In: IEEE; 2012:331-340. doi:<a href=\"https://doi.org/10.1109/FOCS.2012.41\">10.1109/FOCS.2012.41</a>","ista":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. 2012. How to allocate tasks asynchronously. FOCS: Foundations of Computer Science, 331–340."},"conference":{"name":"FOCS: Foundations of Computer Science"}},{"citation":{"ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2012. Generating Fast Indulgent Algorithms. Theory of Computing Systems. 51(4), 404–424.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Generating Fast Indulgent Algorithms. <i>Theory of Computing Systems</i>. 2012;51(4):404-424. doi:<a href=\"https://doi.org/10.1007/s00224-012-9407-2\">10.1007/s00224-012-9407-2</a>","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating Fast Indulgent Algorithms,” <i>Theory of Computing Systems</i>, vol. 51, no. 4. Elsevier, pp. 404–424, 2012.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Theory of Computing Systems 51 (2012) 404–424.","mla":"Alistarh, Dan-Adrian, et al. “Generating Fast Indulgent Algorithms.” <i>Theory of Computing Systems</i>, vol. 51, no. 4, Elsevier, 2012, pp. 404–24, doi:<a href=\"https://doi.org/10.1007/s00224-012-9407-2\">10.1007/s00224-012-9407-2</a>.","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms.” <i>Theory of Computing Systems</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1007/s00224-012-9407-2\">https://doi.org/10.1007/s00224-012-9407-2</a>.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2012). Generating Fast Indulgent Algorithms. <i>Theory of Computing Systems</i>. Elsevier. <a href=\"https://doi.org/10.1007/s00224-012-9407-2\">https://doi.org/10.1007/s00224-012-9407-2</a>"},"year":"2012","date_created":"2018-12-11T11:48:23Z","issue":"4","doi":"10.1007/s00224-012-9407-2","status":"public","publication":"Theory of Computing Systems","day":"01","page":"404 - 424","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficiently transform an algorithm that relies on synchronous timing into an algorithm that tolerates asynchronous executions. We introduce a transformation technique from synchronous algorithms to indulgent algorithms (Guerraoui, in PODC, pp. 289-297, 2000), which induces only a constant overhead in terms of time complexity in well-behaved executions. Our technique is based on a new abstraction we call an asynchrony detector, which the participating processes implement collectively. The resulting transformation works for the class of colorless distributed tasks, including consensus and set agreement. Interestingly, we also show that our technique is relevant for colored tasks, by applying it to the renaming problem, to obtain the first indulgent renaming algorithm."}],"publication_status":"published","month":"01","language":[{"iso":"eng"}],"title":"Generating Fast Indulgent Algorithms","date_published":"2012-01-01T00:00:00Z","publisher":"Elsevier","date_updated":"2023-02-23T13:13:40Z","extern":"1","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"full_name":"Travers, Corentin","last_name":"Travers","first_name":"Corentin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        51","oa_version":"None","acknowledgement":"Dan Alistarh was supported by the NCCR MICS Project. Corentin Travers had additional support from INRIA team REGAL and ANR project SPREADS.\r\nThe authors would like to thank Hagit Attiya and Nikola Kneževi\r\n ́\r\nc for their feed-\r\nback on previous drafts of this paper, and the anonymous reviewers for their useful comments.","type":"journal_article","volume":51,"publist_id":"6891","_id":"767"},{"quality_controlled":"1","citation":{"ama":"Robinson MR, Sander van Doorn G, Gustafsson L, Qvarnström A. Environment-dependent selection on mate choice in a natural population of birds. <i>Ecology Letters</i>. 2012;15(6):611-618. doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2012.01780.x\">10.1111/j.1461-0248.2012.01780.x</a>","ista":"Robinson MR, Sander van Doorn G, Gustafsson L, Qvarnström A. 2012. Environment-dependent selection on mate choice in a natural population of birds. Ecology Letters. 15(6), 611–618.","short":"M.R. Robinson, G. Sander van Doorn, L. Gustafsson, A. Qvarnström, Ecology Letters 15 (2012) 611–618.","ieee":"M. R. Robinson, G. Sander van Doorn, L. Gustafsson, and A. Qvarnström, “Environment-dependent selection on mate choice in a natural population of birds,” <i>Ecology Letters</i>, vol. 15, no. 6. Wiley, pp. 611–618, 2012.","mla":"Robinson, Matthew Richard, et al. “Environment-Dependent Selection on Mate Choice in a Natural Population of Birds.” <i>Ecology Letters</i>, vol. 15, no. 6, Wiley, 2012, pp. 611–18, doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2012.01780.x\">10.1111/j.1461-0248.2012.01780.x</a>.","apa":"Robinson, M. R., Sander van Doorn, G., Gustafsson, L., &#38; Qvarnström, A. (2012). Environment-dependent selection on mate choice in a natural population of birds. <i>Ecology Letters</i>. Wiley. <a href=\"https://doi.org/10.1111/j.1461-0248.2012.01780.x\">https://doi.org/10.1111/j.1461-0248.2012.01780.x</a>","chicago":"Robinson, Matthew Richard, G. Sander van Doorn, Lars Gustafsson, and Anna Qvarnström. “Environment-Dependent Selection on Mate Choice in a Natural Population of Birds.” <i>Ecology Letters</i>. Wiley, 2012. <a href=\"https://doi.org/10.1111/j.1461-0248.2012.01780.x\">https://doi.org/10.1111/j.1461-0248.2012.01780.x</a>."},"year":"2012","date_created":"2020-04-30T11:01:07Z","publication":"Ecology Letters","status":"public","day":"01","issue":"6","doi":"10.1111/j.1461-0248.2012.01780.x","publication_identifier":{"issn":["1461-023X"]},"abstract":[{"lang":"eng","text":"Female mate choice acts as an important evolutionary force, yet the influence of the environment on both its expression and the selective pressures acting upon it remains unknown. We found consistent heritable differences between females in their choice of mate based on ornament size during a 25‐year study of a population of collared flycatchers. However, the fitness consequences of mate choice were dependent on environmental conditions experienced whilst breeding. Females breeding with highly ornamented males experienced high relative fitness during dry summer conditions, but low relative fitness during wetter years. Our results imply that sexual selection within a population can be highly variable and dependent upon the prevailing weather conditions experienced by individuals."}],"publication_status":"published","page":"611-618","article_processing_charge":"No","publisher":"Wiley","date_updated":"2021-01-12T08:15:15Z","month":"06","language":[{"iso":"eng"}],"title":"Environment-dependent selection on mate choice in a natural population of birds","date_published":"2012-06-01T00:00:00Z","type":"journal_article","volume":15,"article_type":"original","extern":"1","intvolume":"        15","author":[{"first_name":"Matthew Richard","last_name":"Robinson","orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","full_name":"Robinson, Matthew Richard"},{"full_name":"Sander van Doorn, G.","first_name":"G.","last_name":"Sander van Doorn"},{"first_name":"Lars","last_name":"Gustafsson","full_name":"Gustafsson, Lars"},{"full_name":"Qvarnström, Anna","last_name":"Qvarnström","first_name":"Anna"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","_id":"7748"},{"volume":15,"type":"journal_article","intvolume":"        15","author":[{"last_name":"Robinson","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813"},{"full_name":"Mar, Khyne U","last_name":"Mar","first_name":"Khyne U"},{"first_name":"Virpi","last_name":"Lummaa","full_name":"Lummaa, Virpi"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","extern":"1","_id":"7749","publication_status":"published","abstract":[{"text":"Although studies on laboratory species and natural populations of vertebrates have shown reproduction to impair later performance, little is known of the age‐specific associations between reproduction and survival, and how such findings apply to the ageing of large, long‐lived species. Herein we develop a framework to examine population‐level patterns of reproduction and survival across lifespan in long‐lived organisms, and decompose those changes into individual‐level effects, and the effects of age‐specific trade‐offs between fitness components. We apply this to an extensive longitudinal dataset on female semi‐captive Asian timber elephants (Elephas maximus) and report the first evidence of age‐specific fitness declines that are driven by age‐specific associations between fitness components in a long‐lived mammal. Associations between reproduction and survival are positive in early life, but negative in later life with up to 71% of later‐life survival declines associated with investing in the production of offspring within this population of this critically endangered species.","lang":"eng"}],"article_processing_charge":"No","page":"260-266","date_updated":"2021-01-12T08:15:16Z","publisher":"Wiley","date_published":"2012-03-01T00:00:00Z","title":"Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants","month":"03","language":[{"iso":"eng"}],"date_created":"2020-04-30T11:01:26Z","year":"2012","status":"public","publication":"Ecology Letters","day":"01","publication_identifier":{"issn":["1461-023X"]},"doi":"10.1111/j.1461-0248.2011.01735.x","issue":"3","quality_controlled":"1","citation":{"mla":"Robinson, Matthew Richard, et al. “Senescence and Age-Specific Trade-Offs between Reproduction and Survival in Female Asian Elephants.” <i>Ecology Letters</i>, vol. 15, no. 3, Wiley, 2012, pp. 260–66, doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2011.01735.x\">10.1111/j.1461-0248.2011.01735.x</a>.","chicago":"Robinson, Matthew Richard, Khyne U Mar, and Virpi Lummaa. “Senescence and Age-Specific Trade-Offs between Reproduction and Survival in Female Asian Elephants.” <i>Ecology Letters</i>. Wiley, 2012. <a href=\"https://doi.org/10.1111/j.1461-0248.2011.01735.x\">https://doi.org/10.1111/j.1461-0248.2011.01735.x</a>.","apa":"Robinson, M. R., Mar, K. U., &#38; Lummaa, V. (2012). Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants. <i>Ecology Letters</i>. Wiley. <a href=\"https://doi.org/10.1111/j.1461-0248.2011.01735.x\">https://doi.org/10.1111/j.1461-0248.2011.01735.x</a>","ista":"Robinson MR, Mar KU, Lummaa V. 2012. Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants. Ecology Letters. 15(3), 260–266.","ama":"Robinson MR, Mar KU, Lummaa V. Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants. <i>Ecology Letters</i>. 2012;15(3):260-266. doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2011.01735.x\">10.1111/j.1461-0248.2011.01735.x</a>","short":"M.R. Robinson, K.U. Mar, V. Lummaa, Ecology Letters 15 (2012) 260–266.","ieee":"M. R. Robinson, K. U. Mar, and V. Lummaa, “Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants,” <i>Ecology Letters</i>, vol. 15, no. 3. Wiley, pp. 260–266, 2012."}},{"_id":"7776","extern":"1","article_type":"original","author":[{"last_name":"Goodrich","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074"},{"full_name":"Liu, Andrea J.","last_name":"Liu","first_name":"Andrea J."},{"last_name":"Nagel","first_name":"Sidney R.","full_name":"Nagel, Sidney R."}],"intvolume":"       109","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","type":"journal_article","volume":109,"title":"Finite-size scaling at the jamming transition","month":"08","language":[{"iso":"eng"}],"date_published":"2012-08-27T00:00:00Z","publisher":"American Physical Society","date_updated":"2021-01-12T08:15:27Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present an analysis of finite-size effects in jammed packings of N soft, frictionless spheres at zero temperature. There is a 1/N correction to the discrete jump in the contact number at the transition so that jammed packings exist only above isostaticity. As a result, the canonical power-law scalings of the contact number and elastic moduli break down at low pressure. These quantities exhibit scaling collapse with a nontrivial scaling function, demonstrating that the jamming transition can be considered a phase transition. Scaling is achieved as a function of N in both two and three dimensions, indicating an upper critical dimension of 2."}],"publication_status":"published","issue":"9","doi":"10.1103/physrevlett.109.095704","publication_identifier":{"issn":["0031-9007","1079-7114"]},"status":"public","day":"27","publication":"Physical Review Letters","year":"2012","date_created":"2020-04-30T11:44:12Z","article_number":"095704","citation":{"apa":"Goodrich, C. P., Liu, A. J., &#38; Nagel, S. R. (2012). Finite-size scaling at the jamming transition. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.109.095704\">https://doi.org/10.1103/physrevlett.109.095704</a>","chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Finite-Size Scaling at the Jamming Transition.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/physrevlett.109.095704\">https://doi.org/10.1103/physrevlett.109.095704</a>.","mla":"Goodrich, Carl Peter, et al. “Finite-Size Scaling at the Jamming Transition.” <i>Physical Review Letters</i>, vol. 109, no. 9, 095704, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/physrevlett.109.095704\">10.1103/physrevlett.109.095704</a>.","ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Finite-size scaling at the jamming transition,” <i>Physical Review Letters</i>, vol. 109, no. 9. American Physical Society, 2012.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 109 (2012).","ama":"Goodrich CP, Liu AJ, Nagel SR. Finite-size scaling at the jamming transition. <i>Physical Review Letters</i>. 2012;109(9). doi:<a href=\"https://doi.org/10.1103/physrevlett.109.095704\">10.1103/physrevlett.109.095704</a>","ista":"Goodrich CP, Liu AJ, Nagel SR. 2012. Finite-size scaling at the jamming transition. Physical Review Letters. 109(9), 095704."},"quality_controlled":"1"},{"citation":{"mla":"Engel, Jakob, et al. “Biosynthesis of the Fungal Cell Wall Polysaccharide Galactomannan Requires Intraluminal GDP-Mannose.” <i>Journal of Biological Chemistry</i>, vol. 287, no. 53, American Society for Biochemistry and Molecular Biology, 2012, pp. 44418–24, doi:<a href=\"https://doi.org/10.1074/jbc.M112.398321\">10.1074/jbc.M112.398321</a>.","chicago":"Engel, Jakob, Philipp S Schmalhorst, and Françoise Routier. “Biosynthesis of the Fungal Cell Wall Polysaccharide Galactomannan Requires Intraluminal GDP-Mannose.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2012. <a href=\"https://doi.org/10.1074/jbc.M112.398321\">https://doi.org/10.1074/jbc.M112.398321</a>.","apa":"Engel, J., Schmalhorst, P. S., &#38; Routier, F. (2012). Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M112.398321\">https://doi.org/10.1074/jbc.M112.398321</a>","ama":"Engel J, Schmalhorst PS, Routier F. Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose. <i>Journal of Biological Chemistry</i>. 2012;287(53):44418-44424. doi:<a href=\"https://doi.org/10.1074/jbc.M112.398321\">10.1074/jbc.M112.398321</a>","ista":"Engel J, Schmalhorst PS, Routier F. 2012. Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose. Journal of Biological Chemistry. 287(53), 44418–44424.","ieee":"J. Engel, P. S. Schmalhorst, and F. Routier, “Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose,” <i>Journal of Biological Chemistry</i>, vol. 287, no. 53. American Society for Biochemistry and Molecular Biology, pp. 44418–44424, 2012.","short":"J. Engel, P.S. Schmalhorst, F. Routier, Journal of Biological Chemistry 287 (2012) 44418–44424."},"day":"28","status":"public","date_published":"2012-12-28T00:00:00Z","language":[{"iso":"eng"}],"month":"12","date_updated":"2022-03-21T07:57:14Z","publisher":"American Society for Biochemistry and Molecular Biology","intvolume":"       287","oa_version":"None","article_type":"original","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft.","type":"journal_article","publist_id":"6852","scopus_import":"1","_id":"801","quality_controlled":"1","date_created":"2018-12-11T11:48:34Z","year":"2012","doi":"10.1074/jbc.M112.398321","issue":"53","publication":"Journal of Biological Chemistry","article_processing_charge":"No","page":"44418 - 44424","external_id":{"pmid":["23139423"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Fungal cell walls frequently contain a polymer of mannose and galactose called galactomannan. In the pathogenic filamentous fungus Aspergillus fumigatus, this polysaccharide is made of a linear mannan backbone with side chains of galactofuran and is anchored to the plasma membrane via a glycosylphosphatidylinositol or is covalently linked to the cell wall. To date, the biosynthesis and significance of this polysaccharide are unknown. The present data demonstrate that deletion of the Golgi UDP-galactofuranose transporter GlfB or the GDP-mannose transporter GmtA leads to the absence of galactofuran or galactomannan, respectively. This indicates that the biosynthesis of galactomannan probably occurs in the lumen of the Golgi apparatus and thus contrasts with the biosynthesis of other fungal cell wall polysaccharides studied to date that takes place at the plasma membrane. Transglycosylation of galactomannan from the membrane to the cell wall is hypothesized because both the cell wall-bound and membrane-bound polysaccharide forms are affected in the generated mutants. Considering the severe growth defect of the A. fumigatus GmtA-deficient mutant, proving this paradigm might provide new targets for antifungal therapy."}],"title":"Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Engel, Jakob","last_name":"Engel","first_name":"Jakob"},{"orcid":"0000-0002-5795-0133","id":"309D50DA-F248-11E8-B48F-1D18A9856A87","full_name":"Schmalhorst, Philipp S","first_name":"Philipp S","last_name":"Schmalhorst"},{"full_name":"Routier, Françoise","last_name":"Routier","first_name":"Françoise"}],"extern":"1","volume":287,"pmid":1}]