[{"day":"28","citation":{"chicago":"De La Bretèche, Régis, and Timothy D Browning. “Binary Forms as Sums of Two Squares and Châtelet Surfaces.” <i>Israel Journal of Mathematics</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11856-012-0019-y\">https://doi.org/10.1007/s11856-012-0019-y</a>.","short":"R. De La Bretèche, T.D. Browning, Israel Journal of Mathematics 191 (2012) 973–1012.","ama":"De La Bretèche R, Browning TD. Binary forms as sums of two squares and Châtelet surfaces. <i>Israel Journal of Mathematics</i>. 2012;191(2):973-1012. doi:<a href=\"https://doi.org/10.1007/s11856-012-0019-y\">10.1007/s11856-012-0019-y</a>","ieee":"R. De La Bretèche and T. D. Browning, “Binary forms as sums of two squares and Châtelet surfaces,” <i>Israel Journal of Mathematics</i>, vol. 191, no. 2. Springer, pp. 973–1012, 2012.","apa":"De La Bretèche, R., &#38; Browning, T. D. (2012). Binary forms as sums of two squares and Châtelet surfaces. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-012-0019-y\">https://doi.org/10.1007/s11856-012-0019-y</a>","mla":"De La Bretèche, Régis, and Timothy D. Browning. “Binary Forms as Sums of Two Squares and Châtelet Surfaces.” <i>Israel Journal of Mathematics</i>, vol. 191, no. 2, Springer, 2012, pp. 973–1012, doi:<a href=\"https://doi.org/10.1007/s11856-012-0019-y\">10.1007/s11856-012-0019-y</a>.","ista":"De La Bretèche R, Browning TD. 2012. Binary forms as sums of two squares and Châtelet surfaces. Israel Journal of Mathematics. 191(2), 973–1012."},"extern":1,"author":[{"full_name":"de la Bretèche, Régis","first_name":"Régis","last_name":"De La Bretèche"},{"last_name":"Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","full_name":"Timothy Browning"}],"publication_status":"published","date_updated":"2021-01-12T06:57:19Z","type":"journal_article","month":"02","abstract":[{"text":"The representation of integral binary forms as sums of two squares is discussed and applied to establish the Manin conjecture for certain Châtelet surfaces over ℚ.","lang":"eng"}],"doi":"10.1007/s11856-012-0019-y","publist_id":"7663","issue":"2","status":"public","_id":"241","publication":"Israel Journal of Mathematics","volume":191,"year":"2012","page":"973 - 1012","date_created":"2018-12-11T11:45:23Z","intvolume":"       191","quality_controlled":0,"title":"Binary forms as sums of two squares and Châtelet surfaces","date_published":"2012-02-28T00:00:00Z","publisher":"Springer"},{"quality_controlled":"1","date_published":"2012-05-01T00:00:00Z","title":"A consistent phylogenetic backbone for the fungi","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"volume":29,"publication":"Molecular Biology and Evolution","year":"2012","date_created":"2018-12-11T11:57:30Z","ddc":["570","576"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:40Z","_id":"2411","author":[{"full_name":"Ebersberger, Ingo","first_name":"Ingo","last_name":"Ebersberger"},{"last_name":"De Matos Simoes","full_name":"De Matos Simoes, Ricardo","first_name":"Ricardo"},{"first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne","last_name":"Kupczok"},{"full_name":"Gube, Matthias","first_name":"Matthias","last_name":"Gube"},{"full_name":"Kothe, Erika","first_name":"Erika","last_name":"Kothe"},{"first_name":"Kerstin","full_name":"Voigt, Kerstin","last_name":"Voigt"},{"last_name":"Von Haeseler","first_name":"Arndt","full_name":"Von Haeseler, Arndt"}],"oa":1,"citation":{"ista":"Ebersberger I, De Matos Simoes R, Kupczok A, Gube M, Kothe E, Voigt K, Von Haeseler A. 2012. A consistent phylogenetic backbone for the fungi. Molecular Biology and Evolution. 29(5), 1319–1334.","mla":"Ebersberger, Ingo, et al. “A Consistent Phylogenetic Backbone for the Fungi.” <i>Molecular Biology and Evolution</i>, vol. 29, no. 5, Oxford University Press, 2012, pp. 1319–34, doi:<a href=\"https://doi.org/10.1093/molbev/msr285\">10.1093/molbev/msr285</a>.","apa":"Ebersberger, I., De Matos Simoes, R., Kupczok, A., Gube, M., Kothe, E., Voigt, K., &#38; Von Haeseler, A. (2012). A consistent phylogenetic backbone for the fungi. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msr285\">https://doi.org/10.1093/molbev/msr285</a>","ieee":"I. Ebersberger <i>et al.</i>, “A consistent phylogenetic backbone for the fungi,” <i>Molecular Biology and Evolution</i>, vol. 29, no. 5. Oxford University Press, pp. 1319–1334, 2012.","ama":"Ebersberger I, De Matos Simoes R, Kupczok A, et al. A consistent phylogenetic backbone for the fungi. <i>Molecular Biology and Evolution</i>. 2012;29(5):1319-1334. doi:<a href=\"https://doi.org/10.1093/molbev/msr285\">10.1093/molbev/msr285</a>","short":"I. Ebersberger, R. De Matos Simoes, A. Kupczok, M. Gube, E. Kothe, K. Voigt, A. Von Haeseler, Molecular Biology and Evolution 29 (2012) 1319–1334.","chicago":"Ebersberger, Ingo, Ricardo De Matos Simoes, Anne Kupczok, Matthias Gube, Erika Kothe, Kerstin Voigt, and Arndt Von Haeseler. “A Consistent Phylogenetic Backbone for the Fungi.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2012. <a href=\"https://doi.org/10.1093/molbev/msr285\">https://doi.org/10.1093/molbev/msr285</a>."},"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","date_created":"2018-12-12T10:13:30Z","file_id":"5013","file_name":"IST-2015-384-v1+1_Mol_Biol_Evol-2012-Ebersberger-1319-34.pdf","file_size":754922,"date_updated":"2020-07-14T12:45:40Z","content_type":"application/pdf","relation":"main_file","checksum":"d565dcac27d1736c0c378ea6fcf22d69","creator":"system"}],"department":[{"_id":"JoBo"}],"date_updated":"2021-01-12T06:57:19Z","oa_version":"Published Version","type":"journal_article","pubrep_id":"384","publisher":"Oxford University Press","language":[{"iso":"eng"}],"page":"1319 - 1334","intvolume":"        29","publist_id":"4515","abstract":[{"text":"The kingdom of fungi provides model organisms for biotechnology, cell biology, genetics, and life sciences in general. Only when their phylogenetic relationships are stably resolved, can individual results from fungal research be integrated into a holistic picture of biology. However, and despite recent progress, many deep relationships within the fungi remain unclear. Here, we present the first phylogenomic study of an entire eukaryotic kingdom that uses a consistency criterion to strengthen phylogenetic conclusions. We reason that branches (splits) recovered with independent data and different tree reconstruction methods are likely to reflect true evolutionary relationships. Two complementary phylogenomic data sets based on 99 fungal genomes and 109 fungal expressed sequence tag (EST) sets analyzed with four different tree reconstruction methods shed light from different angles on the fungal tree of life. Eleven additional data sets address specifically the phylogenetic position of Blastocladiomycota, Ustilaginomycotina, and Dothideomycetes, respectively. The combined evidence from the resulting trees supports the deep-level stability of the fungal groups toward a comprehensive natural system of the fungi. In addition, our analysis reveals methodologically interesting aspects. Enrichment for EST encoded data-a common practice in phylogenomic analyses-introduces a strong bias toward slowly evolving and functionally correlated genes. Consequently, the generalization of phylogenomic data sets as collections of randomly selected genes cannot be taken for granted. A thorough characterization of the data to assess possible influences on the tree reconstruction should therefore become a standard in phylogenomic analyses.","lang":"eng"}],"doi":"10.1093/molbev/msr285","issue":"5","status":"public","day":"01","publication_status":"published","month":"05"},{"title":"Averages of shifted convolutions of d3 (n)","date_published":"2012-10-01T00:00:00Z","quality_controlled":0,"publisher":"Cambridge University Press","year":"2012","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1101.5464"}],"publication":"Proceedings of the Edinburgh Mathematical Society","volume":55,"intvolume":"        55","date_created":"2018-12-11T11:45:23Z","page":"551 - 576","issue":"3","abstract":[{"text":"We investigate the first and second moments of shifted convolutions of the generalized divisor function d 3(n).","lang":"eng"}],"publist_id":"7662","doi":"10.1017/S001309151100037X","status":"public","_id":"242","acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","date_updated":"2021-01-12T06:57:23Z","publication_status":"published","citation":{"ista":"Baier S, Browning TD, Marasingha G, Zhao L. 2012. Averages of shifted convolutions of d3 (n). Proceedings of the Edinburgh Mathematical Society. 55(3), 551–576.","apa":"Baier, S., Browning, T. D., Marasingha, G., &#38; Zhao, L. (2012). Averages of shifted convolutions of d3 (n). <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S001309151100037X\">https://doi.org/10.1017/S001309151100037X</a>","mla":"Baier, Stephan, et al. “Averages of Shifted Convolutions of D3 (N).” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 55, no. 3, Cambridge University Press, 2012, pp. 551–76, doi:<a href=\"https://doi.org/10.1017/S001309151100037X\">10.1017/S001309151100037X</a>.","ieee":"S. Baier, T. D. Browning, G. Marasingha, and L. Zhao, “Averages of shifted convolutions of d3 (n),” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 55, no. 3. Cambridge University Press, pp. 551–576, 2012.","ama":"Baier S, Browning TD, Marasingha G, Zhao L. Averages of shifted convolutions of d3 (n). <i>Proceedings of the Edinburgh Mathematical Society</i>. 2012;55(3):551-576. doi:<a href=\"https://doi.org/10.1017/S001309151100037X\">10.1017/S001309151100037X</a>","short":"S. Baier, T.D. Browning, G. Marasingha, L. Zhao, Proceedings of the Edinburgh Mathematical Society 55 (2012) 551–576.","chicago":"Baier, Stephan, Timothy D Browning, Gihan Marasingha, and Liangyi Zhao. “Averages of Shifted Convolutions of D3 (N).” <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1017/S001309151100037X\">https://doi.org/10.1017/S001309151100037X</a>."},"day":"01","extern":1,"oa":1,"author":[{"full_name":"Baier, Stephan","first_name":"Stephan","last_name":"Baier"},{"last_name":"Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","full_name":"Timothy Browning"},{"first_name":"Gihan","full_name":"Marasingha, Gihan","last_name":"Marasingha"},{"first_name":"Liangyi","full_name":"Zhao, Liangyi","last_name":"Zhao"}],"type":"journal_article","month":"10"},{"issue":"5","abstract":[{"lang":"eng","text":"Let P(t) ∈ ℚ[t] be an irreducible quadratic polynomial and suppose that K is a quartic extension of ℚ containing the roots of P(t). Let N K/ℚ(X) be a full norm form for the extension K/ℚ. We show that the variety P(t) =N K/ℚ(X)≠ 0 satisfies the Hasse principle and weak approximation. The proof uses analytic methods."}],"doi":"10.1007/s00039-012-0168-5","publist_id":"7661","_id":"243","status":"public","publication_status":"published","date_updated":"2021-01-12T06:57:26Z","author":[{"orcid":"0000-0002-8314-0177","first_name":"Timothy D","full_name":"Timothy Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning"},{"first_name":"Roger","full_name":"Heath-Brown, Roger","last_name":"Heath Brown"}],"extern":1,"day":"25","citation":{"ama":"Browning TD, Heath Brown R. Quadratic polynomials represented by norm forms. <i>Geometric and Functional Analysis</i>. 2012;22(5):1124-1190. doi:<a href=\"https://doi.org/10.1007/s00039-012-0168-5\">10.1007/s00039-012-0168-5</a>","short":"T.D. Browning, R. Heath Brown, Geometric and Functional Analysis 22 (2012) 1124–1190.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Quadratic Polynomials Represented by Norm Forms.” <i>Geometric and Functional Analysis</i>. Springer Basel, 2012. <a href=\"https://doi.org/10.1007/s00039-012-0168-5\">https://doi.org/10.1007/s00039-012-0168-5</a>.","ieee":"T. D. Browning and R. Heath Brown, “Quadratic polynomials represented by norm forms,” <i>Geometric and Functional Analysis</i>, vol. 22, no. 5. Springer Basel, pp. 1124–1190, 2012.","ista":"Browning TD, Heath Brown R. 2012. Quadratic polynomials represented by norm forms. Geometric and Functional Analysis. 22(5), 1124–1190.","mla":"Browning, Timothy D., and Roger Heath Brown. “Quadratic Polynomials Represented by Norm Forms.” <i>Geometric and Functional Analysis</i>, vol. 22, no. 5, Springer Basel, 2012, pp. 1124–90, doi:<a href=\"https://doi.org/10.1007/s00039-012-0168-5\">10.1007/s00039-012-0168-5</a>.","apa":"Browning, T. D., &#38; Heath Brown, R. (2012). Quadratic polynomials represented by norm forms. <i>Geometric and Functional Analysis</i>. Springer Basel. <a href=\"https://doi.org/10.1007/s00039-012-0168-5\">https://doi.org/10.1007/s00039-012-0168-5</a>"},"month":"08","type":"journal_article","date_published":"2012-08-25T00:00:00Z","title":"Quadratic polynomials represented by norm forms","quality_controlled":0,"publisher":"Springer Basel","year":"2012","volume":22,"publication":"Geometric and Functional Analysis","date_created":"2018-12-11T11:45:24Z","intvolume":"        22","page":"1124 - 1190"},{"doi":"10.1109/icassp.2012.6288524","abstract":[{"lang":"eng","text":"This paper proposes a novel cooperative approach for two-hop amplify-and-forward (A&F) relaying that exploits both the signal forwarded by the relay and the one directly transmitted by the source in impulse-radio ultra-wideband (IR-UWB) systems. Specifically, we focus on a non-coherent setup employing a double-differential encoding scheme at the source node and a single differential demodulation at the relay and destination. The log-likelihood ratio based decision rule is derived at the destination node. A semi-analytical power allocation strategy is presented by evaluating a closed-form expression for the effective signal to noise ratio (SNR) at the destination, which is maximized by exhaustive search. Numerical simulations show that the proposed system outperforms both the direct transmission with single differential encoding and the non-cooperative multi-hop approach in different scenarios."}],"_id":"6746","status":"public","publication_identifier":{"issn":["1520-6149"]},"date_updated":"2021-01-12T08:08:49Z","oa_version":"None","publication_status":"published","extern":"1","author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli"},{"first_name":"Qi","full_name":"Zhou, Qi","last_name":"Zhou"},{"last_name":"Ma","full_name":"Ma, Xiaoli","first_name":"Xiaoli"},{"full_name":"Lottici, Vincenzo","first_name":"Vincenzo","last_name":"Lottici"}],"day":"31","citation":{"ista":"Mondelli M, Zhou Q, Ma X, Lottici V. 2012. A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems. 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). ICASSP: International Conference on Acoustics, Speech and Signal Processing, 2905–2908.","apa":"Mondelli, M., Zhou, Q., Ma, X., &#38; Lottici, V. (2012). A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems. In <i>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i> (pp. 2905–2908). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/icassp.2012.6288524\">https://doi.org/10.1109/icassp.2012.6288524</a>","mla":"Mondelli, Marco, et al. “A Cooperative Approach for Amplify-and-Forward Differential Transmitted Reference IR-UWB Relay Systems.” <i>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, IEEE, 2012, pp. 2905–08, doi:<a href=\"https://doi.org/10.1109/icassp.2012.6288524\">10.1109/icassp.2012.6288524</a>.","ieee":"M. Mondelli, Q. Zhou, X. Ma, and V. Lottici, “A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems,” in <i>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, Kyoto, Japan, 2012, pp. 2905–2908.","short":"M. Mondelli, Q. Zhou, X. Ma, V. Lottici, in:, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2012, pp. 2905–2908.","ama":"Mondelli M, Zhou Q, Ma X, Lottici V. A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems. In: <i>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE; 2012:2905-2908. doi:<a href=\"https://doi.org/10.1109/icassp.2012.6288524\">10.1109/icassp.2012.6288524</a>","chicago":"Mondelli, Marco, Qi Zhou, Xiaoli Ma, and Vincenzo Lottici. “A Cooperative Approach for Amplify-and-Forward Differential Transmitted Reference IR-UWB Relay Systems.” In <i>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2905–8. IEEE, 2012. <a href=\"https://doi.org/10.1109/icassp.2012.6288524\">https://doi.org/10.1109/icassp.2012.6288524</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","type":"conference","date_published":"2012-07-31T00:00:00Z","title":"A cooperative approach for amplify-and-forward differential transmitted reference IR-UWB relay systems","quality_controlled":"1","conference":{"name":"ICASSP: International Conference on Acoustics, Speech and Signal Processing","start_date":"2012-03-25","location":"Kyoto, Japan","end_date":"2012-03-30"},"publisher":"IEEE","year":"2012","language":[{"iso":"eng"}],"publication":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","date_created":"2019-07-31T09:14:48Z","page":"2905-2908"},{"publication_status":"published","oa_version":"None","date_updated":"2021-01-12T08:11:43Z","author":[{"last_name":"Lukas","first_name":"K. C.","full_name":"Lukas, K. C."},{"first_name":"G.","full_name":"Joshi, G.","last_name":"Joshi"},{"last_name":"Modic","full_name":"Modic, Kimberly A","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147"},{"last_name":"Ren","first_name":"Z. F.","full_name":"Ren, Z. F."},{"full_name":"Opeil, C. P.","first_name":"C. P.","last_name":"Opeil"}],"extern":"1","citation":{"ieee":"K. C. Lukas, G. Joshi, K. A. Modic, Z. F. Ren, and C. P. Opeil, “Thermoelectric properties of Ho-doped Bi0.88Sb0.12,” <i>Journal of Materials Science</i>, vol. 47, no. 15. Springer Nature, pp. 5729–5734, 2012.","ama":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. <i>Journal of Materials Science</i>. 2012;47(15):5729-5734. doi:<a href=\"https://doi.org/10.1007/s10853-012-6463-6\">10.1007/s10853-012-6463-6</a>","short":"K.C. Lukas, G. Joshi, K.A. Modic, Z.F. Ren, C.P. Opeil, Journal of Materials Science 47 (2012) 5729–5734.","chicago":"Lukas, K. C., G. Joshi, Kimberly A Modic, Z. F. Ren, and C. P. Opeil. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” <i>Journal of Materials Science</i>. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/s10853-012-6463-6\">https://doi.org/10.1007/s10853-012-6463-6</a>.","ista":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. 2012. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. Journal of Materials Science. 47(15), 5729–5734.","mla":"Lukas, K. C., et al. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” <i>Journal of Materials Science</i>, vol. 47, no. 15, Springer Nature, 2012, pp. 5729–34, doi:<a href=\"https://doi.org/10.1007/s10853-012-6463-6\">10.1007/s10853-012-6463-6</a>.","apa":"Lukas, K. C., Joshi, G., Modic, K. A., Ren, Z. F., &#38; Opeil, C. P. (2012). Thermoelectric properties of Ho-doped Bi0.88Sb0.12. <i>Journal of Materials Science</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10853-012-6463-6\">https://doi.org/10.1007/s10853-012-6463-6</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","month":"08","type":"journal_article","issue":"15","doi":"10.1007/s10853-012-6463-6","abstract":[{"lang":"eng","text":"The Seebeck coefficients, electrical resistivities, total thermal conductivities, and magnetization are reported for temperatures between 5 and 350 K for n-type Bi0.88Sb0.12 nano-composite alloys made by Ho-doping at the 0, 1, and 3 % atomic levels. The alloys were prepared using a dc hot-pressing method, and are shown to be single phase for both Ho contents with grain sizes on the average of 900 nm. We find the parent compound has a maximum of ZT = 0.28 at 231 K, while doping 1 % Ho increases the maximum ZT to 0.31 at 221 K and the 3 % doped sample suppresses the maximum ZT = 0.24 at a temperature of 260 K."}],"_id":"7074","status":"public","publication_identifier":{"issn":["0022-2461"],"eissn":["1573-4803"]},"year":"2012","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":47,"publication":"Journal of Materials Science","date_created":"2019-11-19T13:36:54Z","intvolume":"        47","page":"5729-5734","article_type":"original","date_published":"2012-08-01T00:00:00Z","title":"Thermoelectric properties of Ho-doped Bi0.88Sb0.12","quality_controlled":"1","publisher":"Springer Nature"},{"title":"The carbon electrode in nonaqueous Li–O2 cells","date_published":"2012-11-28T00:00:00Z","quality_controlled":"1","publisher":"ACS","year":"2012","volume":135,"language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Journal of the American Chemical Society","date_created":"2020-01-15T12:18:57Z","intvolume":"       135","page":"494-500","article_type":"original","issue":"1","abstract":[{"lang":"eng","text":"Carbon has been used widely as the basis of porous cathodes for nonaqueous Li–O2 cells. However, the stability of carbon and the effect of carbon on electrolyte decomposition in such cells are complex and depend on the hydrophobicity/hydrophilicity of the carbon surface. Analyzing carbon cathodes, cycled in Li–O2 cells between 2 and 4 V, using acid treatment and Fenton’s reagent, and combined with differential electrochemical mass spectrometry and FTIR, demonstrates the following: Carbon is relatively stable below 3.5 V (vs Li/Li+) on discharge or charge, especially so for hydrophobic carbon, but is unstable on charging above 3.5 V (in the presence of Li2O2), oxidatively decomposing to form Li2CO3. Direct chemical reaction with Li2O2 accounts for only a small proportion of the total carbon decomposition on cycling. Carbon promotes electrolyte decomposition during discharge and charge in a Li–O2 cell, giving rise to Li2CO3 and Li carboxylates (DMSO and tetraglyme electrolytes). The Li2CO3 and Li carboxylates present at the end of discharge and those that form on charge result in polarization on the subsequent charge. Li2CO3 (derived from carbon and from the electrolyte) as well as the Li carboxylates (derived from the electrolyte) decompose and form on charging. Oxidation of Li2CO3 on charging to ∼4 V is incomplete; Li2CO3 accumulates on cycling resulting in electrode passivation and capacity fading. Hydrophilic carbon is less stable and more catalytically active toward electrolyte decomposition than carbon with a hydrophobic surface. If the Li–O2 cell could be charged at or below 3.5 V, then carbon may be relatively stable, however, its ability to promote electrolyte decomposition, presenting problems for its use in a practical Li–O2 battery. The results emphasize that stable cycling of Li2O2 at the cathode in a Li–O2 cell depends on the synergy between electrolyte and electrode; the stability of the electrode and the electrolyte cannot be considered in isolation."}],"doi":"10.1021/ja310258x","_id":"7308","status":"public","publication_identifier":{"issn":["0002-7863","1520-5126"]},"oa_version":"None","publication_status":"published","date_updated":"2021-01-12T08:12:56Z","extern":"1","author":[{"first_name":"Muhammed M.","full_name":"Ottakam Thotiyl, Muhammed M.","last_name":"Ottakam Thotiyl"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger"},{"last_name":"Peng","first_name":"Zhangquan","full_name":"Peng, Zhangquan"},{"last_name":"Bruce","full_name":"Bruce, Peter G.","first_name":"Peter G."}],"day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. M. Ottakam Thotiyl, S. A. Freunberger, Z. Peng, and P. G. Bruce, “The carbon electrode in nonaqueous Li–O2 cells,” <i>Journal of the American Chemical Society</i>, vol. 135, no. 1. ACS, pp. 494–500, 2012.","chicago":"Ottakam Thotiyl, Muhammed M., Stefan Alexander Freunberger, Zhangquan Peng, and Peter G. Bruce. “The Carbon Electrode in Nonaqueous Li–O2 Cells.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja310258x\">https://doi.org/10.1021/ja310258x</a>.","ama":"Ottakam Thotiyl MM, Freunberger SA, Peng Z, Bruce PG. The carbon electrode in nonaqueous Li–O2 cells. <i>Journal of the American Chemical Society</i>. 2012;135(1):494-500. doi:<a href=\"https://doi.org/10.1021/ja310258x\">10.1021/ja310258x</a>","short":"M.M. Ottakam Thotiyl, S.A. Freunberger, Z. Peng, P.G. Bruce, Journal of the American Chemical Society 135 (2012) 494–500.","apa":"Ottakam Thotiyl, M. M., Freunberger, S. A., Peng, Z., &#38; Bruce, P. G. (2012). The carbon electrode in nonaqueous Li–O2 cells. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja310258x\">https://doi.org/10.1021/ja310258x</a>","mla":"Ottakam Thotiyl, Muhammed M., et al. “The Carbon Electrode in Nonaqueous Li–O2 Cells.” <i>Journal of the American Chemical Society</i>, vol. 135, no. 1, ACS, 2012, pp. 494–500, doi:<a href=\"https://doi.org/10.1021/ja310258x\">10.1021/ja310258x</a>.","ista":"Ottakam Thotiyl MM, Freunberger SA, Peng Z, Bruce PG. 2012. The carbon electrode in nonaqueous Li–O2 cells. Journal of the American Chemical Society. 135(1), 494–500."},"month":"11","type":"journal_article"},{"month":"10","type":"journal_article","oa_version":"None","publication_status":"published","date_updated":"2021-01-12T08:12:56Z","extern":"1","author":[{"full_name":"Choi, Nam-Soon","first_name":"Nam-Soon","last_name":"Choi"},{"last_name":"Chen","full_name":"Chen, Zonghai","first_name":"Zonghai"},{"last_name":"Freunberger","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"},{"full_name":"Ji, Xiulei","first_name":"Xiulei","last_name":"Ji"},{"last_name":"Sun","full_name":"Sun, Yang-Kook","first_name":"Yang-Kook"},{"full_name":"Amine, Khalil","first_name":"Khalil","last_name":"Amine"},{"last_name":"Yushin","first_name":"Gleb","full_name":"Yushin, Gleb"},{"last_name":"Nazar","first_name":"Linda F.","full_name":"Nazar, Linda F."},{"last_name":"Cho","full_name":"Cho, Jaephil","first_name":"Jaephil"},{"last_name":"Bruce","first_name":"Peter G.","full_name":"Bruce, Peter G."}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"N.-S. Choi, Z. Chen, S.A. Freunberger, X. Ji, Y.-K. Sun, K. Amine, G. Yushin, L.F. Nazar, J. Cho, P.G. Bruce, Angewandte Chemie International Edition 51 (2012) 9994–10024.","ama":"Choi N-S, Chen Z, Freunberger SA, et al. Challenges facing Lithium batteries and electrical double-layer capacitors. <i>Angewandte Chemie International Edition</i>. 2012;51(40):9994-10024. doi:<a href=\"https://doi.org/10.1002/anie.201201429\">10.1002/anie.201201429</a>","chicago":"Choi, Nam-Soon, Zonghai Chen, Stefan Alexander Freunberger, Xiulei Ji, Yang-Kook Sun, Khalil Amine, Gleb Yushin, Linda F. Nazar, Jaephil Cho, and Peter G. Bruce. “Challenges Facing Lithium Batteries and Electrical Double-Layer Capacitors.” <i>Angewandte Chemie International Edition</i>. Wiley, 2012. <a href=\"https://doi.org/10.1002/anie.201201429\">https://doi.org/10.1002/anie.201201429</a>.","ieee":"N.-S. Choi <i>et al.</i>, “Challenges facing Lithium batteries and electrical double-layer capacitors,” <i>Angewandte Chemie International Edition</i>, vol. 51, no. 40. Wiley, pp. 9994–10024, 2012.","ista":"Choi N-S, Chen Z, Freunberger SA, Ji X, Sun Y-K, Amine K, Yushin G, Nazar LF, Cho J, Bruce PG. 2012. Challenges facing Lithium batteries and electrical double-layer capacitors. Angewandte Chemie International Edition. 51(40), 9994–10024.","apa":"Choi, N.-S., Chen, Z., Freunberger, S. A., Ji, X., Sun, Y.-K., Amine, K., … Bruce, P. G. (2012). Challenges facing Lithium batteries and electrical double-layer capacitors. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201201429\">https://doi.org/10.1002/anie.201201429</a>","mla":"Choi, Nam-Soon, et al. “Challenges Facing Lithium Batteries and Electrical Double-Layer Capacitors.” <i>Angewandte Chemie International Edition</i>, vol. 51, no. 40, Wiley, 2012, pp. 9994–10024, doi:<a href=\"https://doi.org/10.1002/anie.201201429\">10.1002/anie.201201429</a>."},"_id":"7309","status":"public","publication_identifier":{"issn":["1433-7851"]},"issue":"40","abstract":[{"lang":"eng","text":"Energy‐storage technologies, including electrical double‐layer capacitors and rechargeable batteries, have attracted significant attention for applications in portable electronic devices, electric vehicles, bulk electricity storage at power stations, and “load leveling” of renewable sources, such as solar energy and wind power. Transforming lithium batteries and electric double‐layer capacitors requires a step change in the science underpinning these devices, including the discovery of new materials, new electrochemistry, and an increased understanding of the processes on which the devices depend. The Review will consider some of the current scientific issues underpinning lithium batteries and electric double‐layer capacitors."}],"doi":"10.1002/anie.201201429","intvolume":"        51","date_created":"2020-01-15T12:19:11Z","page":"9994-10024","article_type":"original","year":"2012","volume":51,"language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Angewandte Chemie International Edition","publisher":"Wiley","title":"Challenges facing Lithium batteries and electrical double-layer capacitors","date_published":"2012-10-01T00:00:00Z","quality_controlled":"1"},{"publisher":"AAAS","quality_controlled":"1","title":"A reversible and higher-rate Li-O2 battery","date_published":"2012-08-03T00:00:00Z","article_type":"original","page":"563-566","intvolume":"       337","date_created":"2020-01-15T12:19:23Z","publication":"Science","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":337,"year":"2012","publication_identifier":{"issn":["0036-8075","1095-9203"]},"status":"public","_id":"7310","abstract":[{"text":"The rechargeable nonaqueous lithium-air (Li-O2) battery is receiving a great deal of interest because, theoretically, its specific energy far exceeds the best that can be achieved with lithium-ion cells. Operation of the rechargeable Li-O2 battery depends critically on repeated and highly reversible formation/decomposition of lithium peroxide (Li2O2) at the cathode upon cycling. Here, we show that this process is possible with the use of a dimethyl sulfoxide electrolyte and a porous gold electrode (95% capacity retention from cycles 1 to 100), whereas previously only partial Li2O2 formation/decomposition and limited cycling could occur. Furthermore, we present data indicating that the kinetics of Li2O2 oxidation on charge is approximately 10 times faster than on carbon electrodes.","lang":"eng"}],"doi":"10.1126/science.1223985","issue":"6094","type":"journal_article","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Peng Z, Freunberger SA, Chen Y, Bruce PG. 2012. A reversible and higher-rate Li-O2 battery. Science. 337(6094), 563–566.","mla":"Peng, Z., et al. “A Reversible and Higher-Rate Li-O2 Battery.” <i>Science</i>, vol. 337, no. 6094, AAAS, 2012, pp. 563–66, doi:<a href=\"https://doi.org/10.1126/science.1223985\">10.1126/science.1223985</a>.","apa":"Peng, Z., Freunberger, S. A., Chen, Y., &#38; Bruce, P. G. (2012). A reversible and higher-rate Li-O2 battery. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.1223985\">https://doi.org/10.1126/science.1223985</a>","ama":"Peng Z, Freunberger SA, Chen Y, Bruce PG. A reversible and higher-rate Li-O2 battery. <i>Science</i>. 2012;337(6094):563-566. doi:<a href=\"https://doi.org/10.1126/science.1223985\">10.1126/science.1223985</a>","short":"Z. Peng, S.A. Freunberger, Y. Chen, P.G. Bruce, Science 337 (2012) 563–566.","chicago":"Peng, Z., Stefan Alexander Freunberger, Y. Chen, and P. G. Bruce. “A Reversible and Higher-Rate Li-O2 Battery.” <i>Science</i>. AAAS, 2012. <a href=\"https://doi.org/10.1126/science.1223985\">https://doi.org/10.1126/science.1223985</a>.","ieee":"Z. Peng, S. A. Freunberger, Y. Chen, and P. G. Bruce, “A reversible and higher-rate Li-O2 battery,” <i>Science</i>, vol. 337, no. 6094. AAAS, pp. 563–566, 2012."},"day":"03","extern":"1","author":[{"last_name":"Peng","full_name":"Peng, Z.","first_name":"Z."},{"last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319"},{"last_name":"Chen","first_name":"Y.","full_name":"Chen, Y."},{"full_name":"Bruce, P. G.","first_name":"P. G.","last_name":"Bruce"}],"oa_version":"None","publication_status":"published","date_updated":"2021-01-12T08:12:57Z"},{"publisher":"ACS","date_published":"2012-04-19T00:00:00Z","title":"Li–O2 battery with a dimethylformamide electrolyte","quality_controlled":"1","date_created":"2020-01-15T12:19:36Z","intvolume":"       134","article_type":"original","page":"7952-7957","year":"2012","publication":"Journal of the American Chemical Society","volume":134,"language":[{"iso":"eng"}],"article_processing_charge":"No","status":"public","_id":"7311","publication_identifier":{"issn":["0002-7863","1520-5126"]},"issue":"18","doi":"10.1021/ja302178w","abstract":[{"lang":"eng","text":"Stability of the electrolyte toward reduced oxygen species generated at the cathode is a crucial challenge for the rechargeable nonaqueous Li–O2 battery. Here, we investigate dimethylformamide as the basis of an electrolyte. Although reactions at the O2 cathode on the first discharge–charge cycle are dominated by reversible Li2O2 formation/decomposition, there is also electrolyte decomposition, which increases on cycling. The products of decomposition at the cathode on discharge are Li2O2, Li2CO3, HCO2Li, CH3CO2Li, NO, H2O, and CO2. Li2CO3 accumulates in the electrode with cycling. The stability of dimethylformamide toward reduced oxygen species is insufficient for its use in the rechargeable nonaqueous Li–O2 battery."}],"type":"journal_article","month":"04","date_updated":"2021-01-12T08:12:58Z","oa_version":"None","publication_status":"published","day":"19","citation":{"ieee":"Y. Chen, S. A. Freunberger, Z. Peng, F. Bardé, and P. G. Bruce, “Li–O2 battery with a dimethylformamide electrolyte,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 18. ACS, pp. 7952–7957, 2012.","short":"Y. Chen, S.A. Freunberger, Z. Peng, F. Bardé, P.G. Bruce, Journal of the American Chemical Society 134 (2012) 7952–7957.","ama":"Chen Y, Freunberger SA, Peng Z, Bardé F, Bruce PG. Li–O2 battery with a dimethylformamide electrolyte. <i>Journal of the American Chemical Society</i>. 2012;134(18):7952-7957. doi:<a href=\"https://doi.org/10.1021/ja302178w\">10.1021/ja302178w</a>","chicago":"Chen, Yuhui, Stefan Alexander Freunberger, Zhangquan Peng, Fanny Bardé, and Peter G. Bruce. “Li–O2 Battery with a Dimethylformamide Electrolyte.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja302178w\">https://doi.org/10.1021/ja302178w</a>.","ista":"Chen Y, Freunberger SA, Peng Z, Bardé F, Bruce PG. 2012. Li–O2 battery with a dimethylformamide electrolyte. Journal of the American Chemical Society. 134(18), 7952–7957.","apa":"Chen, Y., Freunberger, S. A., Peng, Z., Bardé, F., &#38; Bruce, P. G. (2012). Li–O2 battery with a dimethylformamide electrolyte. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja302178w\">https://doi.org/10.1021/ja302178w</a>","mla":"Chen, Yuhui, et al. “Li–O2 Battery with a Dimethylformamide Electrolyte.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 18, ACS, 2012, pp. 7952–57, doi:<a href=\"https://doi.org/10.1021/ja302178w\">10.1021/ja302178w</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chen, Yuhui","first_name":"Yuhui","last_name":"Chen"},{"first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","last_name":"Freunberger"},{"last_name":"Peng","full_name":"Peng, Zhangquan","first_name":"Zhangquan"},{"full_name":"Bardé, Fanny","first_name":"Fanny","last_name":"Bardé"},{"full_name":"Bruce, Peter G.","first_name":"Peter G.","last_name":"Bruce"}],"extern":"1"},{"_id":"762","status":"public","doi":"10.1145/2312005.2312057","abstract":[{"lang":"eng","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."}],"publist_id":"6892","month":"01","type":"conference","oa_version":"None","publication_status":"published","date_updated":"2023-02-23T13:12:27Z","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"},{"full_name":"Losa, Giuliano","first_name":"Giuliano","last_name":"Losa"}],"extern":"1","citation":{"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.","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>.","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>","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>","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>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"publisher":"ACM","title":"On the cost of composing shared-memory algorithms","date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T11:48:22Z","page":"298 - 307","year":"2012","article_processing_charge":"No","language":[{"iso":"eng"}]},{"year":"2012","volume":"7355 LNCS","article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:48:22Z","page":"195 - 206","title":"Early deciding synchronous renaming in O(log f) rounds or less","date_published":"2012-01-01T00:00:00Z","conference":{"name":"SIROCCO: Structural Information and Communication Complexity"},"publisher":"Springer","date_updated":"2023-02-23T13:12:41Z","oa_version":"None","publication_status":"published","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","day":"01","citation":{"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>","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>.","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.","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>","short":"D.-A. Alistarh, H. Attiya, R. Guerraoui, C. Travers, in:, Springer, 2012, pp. 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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Attiya","first_name":"Hagit","full_name":"Attiya, Hagit"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"},{"first_name":"Corentin","full_name":"Travers, Corentin","last_name":"Travers"}],"alternative_title":["LNCS"],"type":"conference","month":"01","abstract":[{"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].","lang":"eng"}],"doi":"10.1007/978-3-642-31104-8_17","publist_id":"6893","status":"public","_id":"763"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","volume":62,"publication":"Algorithmica (New York)","year":"2012","page":"595 - 629","date_created":"2018-12-11T11:48:23Z","intvolume":"        62","title":"Of choices, failures and asynchrony: the many faces of set agreement","date_published":"2012-02-01T00:00:00Z","publisher":"Springer","extern":"1","author":[{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gilbert","full_name":"Gilbert, Seth","first_name":"Seth"},{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"last_name":"Travers","first_name":"Corentin","full_name":"Travers, Corentin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","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>","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.","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>.","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."},"publication_status":"published","date_updated":"2023-02-23T13:13:02Z","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.","oa_version":"None","month":"02","type":"journal_article","abstract":[{"lang":"eng","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."}],"publist_id":"6894","doi":"10.1007/s00453-011-9581-7","issue":"1-2","_id":"764","status":"public"},{"doi":"10.1109/FOCS.2012.41","publist_id":"6890","abstract":[{"lang":"eng","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."}],"status":"public","_id":"766","date_updated":"2023-02-23T13:13:27Z","oa_version":"None","publication_status":"published","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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>","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>.","ista":"Alistarh D-A, Bender M, Gilbert S, Guerraoui R. 2012. How to allocate tasks asynchronously. FOCS: Foundations of Computer Science, 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.","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>.","short":"D.-A. Alistarh, M. Bender, S. Gilbert, R. Guerraoui, in:, IEEE, 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>"},"extern":"1","author":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Bender","full_name":"Bender, Michael","first_name":"Michael"},{"first_name":"Seth","full_name":"Gilbert, Seth","last_name":"Gilbert"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"}],"type":"conference","month":"01","date_published":"2012-01-01T00:00:00Z","title":"How to allocate tasks asynchronously","conference":{"name":"FOCS: Foundations of Computer Science"},"publisher":"IEEE","year":"2012","language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2018-12-11T11:48:23Z","page":"331 - 340"},{"page":"404 - 424","date_created":"2018-12-11T11:48:23Z","intvolume":"        51","publication":"Theory of Computing Systems","article_processing_charge":"No","volume":51,"language":[{"iso":"eng"}],"year":"2012","publisher":"Elsevier","date_published":"2012-01-01T00:00:00Z","title":"Generating Fast Indulgent Algorithms","type":"journal_article","month":"01","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2012. Generating Fast Indulgent Algorithms. Theory of Computing Systems. 51(4), 404–424.","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>","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>.","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.","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>","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>."},"author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"last_name":"Gilbert","full_name":"Gilbert, Seth","first_name":"Seth"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}],"extern":"1","publication_status":"published","date_updated":"2023-02-23T13:13:40Z","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.","oa_version":"None","status":"public","_id":"767","abstract":[{"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.","lang":"eng"}],"publist_id":"6891","doi":"10.1007/s00224-012-9407-2","issue":"4"},{"type":"journal_article","month":"06","oa_version":"None","publication_status":"published","date_updated":"2021-01-12T08:15:15Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","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.","short":"M.R. Robinson, G. Sander van Doorn, L. Gustafsson, A. Qvarnström, Ecology Letters 15 (2012) 611–618.","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>","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>."},"author":[{"full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","last_name":"Robinson"},{"last_name":"Sander van Doorn","full_name":"Sander van Doorn, G.","first_name":"G."},{"last_name":"Gustafsson","full_name":"Gustafsson, Lars","first_name":"Lars"},{"last_name":"Qvarnström","first_name":"Anna","full_name":"Qvarnström, Anna"}],"extern":"1","status":"public","_id":"7748","publication_identifier":{"issn":["1461-023X"]},"issue":"6","abstract":[{"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.","lang":"eng"}],"doi":"10.1111/j.1461-0248.2012.01780.x","date_created":"2020-04-30T11:01:07Z","intvolume":"        15","page":"611-618","article_type":"original","year":"2012","publication":"Ecology Letters","language":[{"iso":"eng"}],"volume":15,"article_processing_charge":"No","publisher":"Wiley","date_published":"2012-06-01T00:00:00Z","title":"Environment-dependent selection on mate choice in a natural population of birds","quality_controlled":"1"},{"date_created":"2020-04-30T11:01:26Z","intvolume":"        15","article_type":"original","page":"260-266","year":"2012","publication":"Ecology Letters","article_processing_charge":"No","volume":15,"language":[{"iso":"eng"}],"publisher":"Wiley","date_published":"2012-03-01T00:00:00Z","title":"Senescence and age-specific trade-offs between reproduction and survival in female Asian elephants","quality_controlled":"1","type":"journal_article","month":"03","publication_status":"published","date_updated":"2021-01-12T08:15:16Z","oa_version":"None","citation":{"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>.","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.","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>.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","author":[{"last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813"},{"last_name":"Mar","full_name":"Mar, Khyne U","first_name":"Khyne U"},{"last_name":"Lummaa","first_name":"Virpi","full_name":"Lummaa, Virpi"}],"extern":"1","status":"public","_id":"7749","publication_identifier":{"issn":["1461-023X"]},"issue":"3","abstract":[{"lang":"eng","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."}],"doi":"10.1111/j.1461-0248.2011.01735.x"},{"file_date_updated":"2020-07-14T12:46:35Z","scopus_import":"1","_id":"492","has_accepted_license":"1","citation":{"mla":"Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>, vol. 12, 116, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1471-2229-12-116\">10.1186/1471-2229-12-116</a>.","apa":"Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price, C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2229-12-116\">https://doi.org/10.1186/1471-2229-12-116</a>","ista":"Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C, Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 12, 116.","chicago":"Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1471-2229-12-116\">https://doi.org/10.1186/1471-2229-12-116</a>.","short":"T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C. Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC Plant Biology 12 (2012).","ama":"Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>. 2012;12. doi:<a href=\"https://doi.org/10.1186/1471-2229-12-116\">10.1186/1471-2229-12-116</a>","ieee":"T. Galkovskyi <i>et al.</i>, “GiA Roots: Software for the high throughput analysis of plant root system architecture,” <i>BMC Plant Biology</i>, vol. 12. BioMed Central, 2012."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"last_name":"Galkovskyi","full_name":"Galkovskyi, Taras","first_name":"Taras"},{"full_name":"Mileyko, Yuriy","first_name":"Yuriy","last_name":"Mileyko"},{"last_name":"Bucksch","first_name":"Alexander","full_name":"Bucksch, Alexander"},{"last_name":"Moore","full_name":"Moore, Brad","first_name":"Brad"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","first_name":"Olga","last_name":"Symonova"},{"last_name":"Price","first_name":"Charles","full_name":"Price, Charles"},{"last_name":"Topp","full_name":"Topp, Chrostopher","first_name":"Chrostopher"},{"full_name":"Iyer Pascuzzi, Anjali","first_name":"Anjali","last_name":"Iyer Pascuzzi"},{"full_name":"Zurek, Paul","first_name":"Paul","last_name":"Zurek"},{"first_name":"Suqin","full_name":"Fang, Suqin","last_name":"Fang"},{"last_name":"Harer","full_name":"Harer, John","first_name":"John"},{"first_name":"Philip","full_name":"Benfey, Philip","last_name":"Benfey"},{"first_name":"Joshua","full_name":"Weitz, Joshua","last_name":"Weitz"}],"oa_version":"Published Version","date_updated":"2022-08-25T14:59:17Z","file":[{"file_size":1691436,"date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_name":"IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf","date_created":"2018-12-12T10:12:35Z","file_id":"4953","access_level":"open_access","creator":"system","relation":"main_file","checksum":"0c629e36acd5f2878ff7dd088d67d494"}],"type":"journal_article","pubrep_id":"946","quality_controlled":"1","title":"GiA Roots: Software for the high throughput analysis of plant root system architecture","date_published":"2012-07-26T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication":"BMC Plant Biology","article_processing_charge":"No","volume":12,"year":"2012","ddc":["005","514","516"],"date_created":"2018-12-11T11:46:46Z","doi":"10.1186/1471-2229-12-116","publist_id":"7328","abstract":[{"lang":"eng","text":"Background: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Results: We have developed GiA Roots (General Image Analysis of Roots), a semi-automated software tool designed specifically for the high-throughput analysis of root system images. GiA Roots includes user-assisted algorithms to distinguish root from background and a fully automated pipeline that extracts dozens of root system phenotypes. Quantitative information on each phenotype, along with intermediate steps for full reproducibility, is returned to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line interface for interweaving the software into large-scale workflows. GiA Roots can also be extended to estimate novel phenotypes specified by the end-user.Conclusions: We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing 12 genotypes from the species Oryza sativa. We validate trait measurements against prior analyses of this image set that demonstrated that RSA traits are likely heritable and associated with genotypic differences. Moreover, we demonstrate that GiA Roots is extensible and an end-user can add functionality so that GiA Roots can estimate novel RSA traits. In summary, we show that the software can function as an efficient tool as part of a workflow to move from large numbers of root images to downstream analysis."}],"status":"public","day":"26","extern":"1","publication_status":"published","month":"07","publisher":"BioMed Central","language":[{"iso":"eng"}],"article_number":"116","intvolume":"        12"},{"abstract":[{"lang":"eng","text":"The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs."}],"doi":"10.3389/fnins.2012.00055","publist_id":"7327","status":"public","publication_status":"published","acknowledgement":"The studies were in part or completely supported by the Bundesministerium für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631 and 216886, the World Class University Program through the National Research Foundation of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008), the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415 (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk), the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830, German Research Foundation grants 550/B5 and C6, and by a scholarship from the German National Academic Foundation. This paper only reflects the authors’ views and funding agencies are not liable for any use that may be made of the information contained herein.\r\n","day":"13","month":"07","publisher":"Frontiers Research Foundation","language":[{"iso":"eng"}],"article_number":"55","intvolume":"         6","file_date_updated":"2020-07-14T12:46:35Z","scopus_import":1,"_id":"493","date_updated":"2021-01-12T08:01:03Z","oa_version":"Published Version","file":[{"creator":"system","checksum":"195238221c4b0b0f4035f6f6c16ea17c","relation":"main_file","file_id":"5356","date_created":"2018-12-12T10:18:34Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","file_size":2693701,"file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf"}],"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"citation":{"ieee":"M. Tangermann <i>et al.</i>, “Review of the BCI competition IV,” <i>Frontiers in Neuroscience</i>, vol. 6. Frontiers Research Foundation, 2012.","ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. 2012;6. doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>","short":"M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012).","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation, 2012. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>.","ista":"Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.","mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>, vol. 6, 55, Frontiers Research Foundation, 2012, doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>.","apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>"},"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"full_name":"Tangermann, Michael","first_name":"Michael","last_name":"Tangermann"},{"last_name":"Müller","full_name":"Müller, Klaus","first_name":"Klaus"},{"first_name":"Ad","full_name":"Aertsen, Ad","last_name":"Aertsen"},{"first_name":"Niels","full_name":"Birbaumer, Niels","last_name":"Birbaumer"},{"last_name":"Braun","first_name":"Christoph","full_name":"Braun, Christoph"},{"full_name":"Brunner, Clemens","first_name":"Clemens","last_name":"Brunner"},{"last_name":"Leeb","full_name":"Leeb, Robert","first_name":"Robert"},{"last_name":"Mehring","full_name":"Mehring, Carsten","first_name":"Carsten"},{"first_name":"Kai","full_name":"Miller, Kai","last_name":"Miller"},{"last_name":"Müller Putz","full_name":"Müller Putz, Gernot","first_name":"Gernot"},{"first_name":"Guido","full_name":"Nolte, Guido","last_name":"Nolte"},{"last_name":"Pfurtscheller","first_name":"Gert","full_name":"Pfurtscheller, Gert"},{"full_name":"Preissl, Hubert","first_name":"Hubert","last_name":"Preissl"},{"last_name":"Schalk","full_name":"Schalk, Gerwin","first_name":"Gerwin"},{"last_name":"Schlögl","full_name":"Schlögl, Alois","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100"},{"first_name":"Carmen","full_name":"Vidaurre, Carmen","last_name":"Vidaurre"},{"last_name":"Waldert","first_name":"Stephan","full_name":"Waldert, Stephan"},{"full_name":"Blankertz, Benjamin","first_name":"Benjamin","last_name":"Blankertz"}],"pubrep_id":"945","type":"journal_article","date_published":"2012-07-13T00:00:00Z","title":"Review of the BCI competition IV","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2012","publication":"Frontiers in Neuroscience","volume":6,"ddc":["004"],"date_created":"2018-12-11T11:46:46Z"},{"_id":"494","status":"public","issue":"4","scopus_import":1,"abstract":[{"lang":"eng","text":"We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2o(nlog n) and the lower bound is 1.5n. We improve the upper bound to n2n and describe a matching lower bound of 2ω(n). For the NBW to DCW translation, the currently known upper bound is 2o(nlog n). We improve it to 2 o(n), which is asymptotically tight. Both of our upper-bound constructions are based on a simple subset construction, do not involve intermediate automata with richer acceptance conditions, and can be implemented symbolically. We continue and solve the open problems of translating nondeterministic Streett, Rabin, Muller, and parity word automata to NCW and to DCW. Going via an intermediate NBW is not optimal and we describe direct, simple, and asymptotically tight constructions, involving a 2o(n) blow-up. The constructions are variants of the subset construction, providing a unified approach for translating all common classes of automata to NCW and DCW. Beyond the theoretical importance of the results, we point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata."}],"doi":"10.1145/2362355.2362357","publist_id":"7326","month":"10","type":"journal_article","department":[{"_id":"ToHe"}],"publication_status":"published","date_updated":"2021-01-12T08:01:03Z","oa_version":"None","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"citation":{"chicago":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>.","short":"U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).","ama":"Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2012;13(4). doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>","ieee":"U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 4. ACM, 2012.","apa":"Boker, U., &#38; Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>","mla":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 4, 29, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>.","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","publisher":"ACM","date_published":"2012-10-01T00:00:00Z","title":"Translating to Co-Büchi made tight, unified, and useful","quality_controlled":"1","date_created":"2018-12-11T11:46:47Z","intvolume":"        13","article_number":"29","year":"2012","language":[{"iso":"eng"}],"volume":13,"publication":"ACM Transactions on Computational Logic (TOCL)"}]