[{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"411","year":"2018","publication_status":"published","title":"Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia","status":"public","publisher":"Springer","department":[{"_id":"JiFr"}],"editor":[{"full_name":"Ristova, Daniela","last_name":"Ristova","first_name":"Daniela"},{"first_name":"Elke","last_name":"Barbez","full_name":"Barbez, Elke"}],"intvolume":" 1761","author":[{"last_name":"Karampelias","first_name":"Michael","full_name":"Karampelias, Michael"},{"first_name":"Ricardo","last_name":"Tejos","full_name":"Tejos, Ricardo"},{"full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"}],"date_updated":"2021-01-12T07:54:34Z","date_created":"2018-12-11T11:46:20Z","oa_version":"None","volume":1761,"type":"book_chapter","alternative_title":["Methods in Molecular Biology"],"abstract":[{"text":"Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins.","lang":"eng"}],"publist_id":"7418","publication":"Root Development. Methods and Protocols","citation":{"ista":"Karampelias M, Tejos R, Friml J, Vanneste S. 2018.Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Root Development. Methods and Protocols. Methods in Molecular Biology, vol. 1761, 131–143.","apa":"Karampelias, M., Tejos, R., Friml, J., & Vanneste, S. (2018). Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In D. Ristova & E. Barbez (Eds.), Root Development. Methods and Protocols (Vol. 1761, pp. 131–143). Springer. https://doi.org/10.1007/978-1-4939-7747-5_10","ieee":"M. Karampelias, R. Tejos, J. Friml, and S. Vanneste, “Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia,” in Root Development. Methods and Protocols, vol. 1761, D. Ristova and E. Barbez, Eds. Springer, 2018, pp. 131–143.","ama":"Karampelias M, Tejos R, Friml J, Vanneste S. Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Ristova D, Barbez E, eds. Root Development. Methods and Protocols. Vol 1761. MIMB. Springer; 2018:131-143. doi:10.1007/978-1-4939-7747-5_10","chicago":"Karampelias, Michael, Ricardo Tejos, Jiří Friml, and Steffen Vanneste. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” In Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, 1761:131–43. MIMB. Springer, 2018. https://doi.org/10.1007/978-1-4939-7747-5_10.","mla":"Karampelias, Michael, et al. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, vol. 1761, Springer, 2018, pp. 131–43, doi:10.1007/978-1-4939-7747-5_10.","short":"M. Karampelias, R. Tejos, J. Friml, S. Vanneste, in:, D. Ristova, E. Barbez (Eds.), Root Development. Methods and Protocols, Springer, 2018, pp. 131–143."},"quality_controlled":"1","page":"131 - 143","date_published":"2018-03-11T00:00:00Z","doi":"10.1007/978-1-4939-7747-5_10","language":[{"iso":"eng"}],"scopus_import":1,"series_title":"MIMB","month":"03","day":"11"},{"year":"2018","_id":"456","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaNo"}],"publisher":"American Association for the Advancement of Science","intvolume":" 10","status":"public","publication_status":"published","title":"Zika-associated microcephaly: Reduce the stress and race for the treatment","author":[{"full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino"}],"oa_version":"None","volume":10,"date_updated":"2021-01-12T07:59:42Z","date_created":"2018-12-11T11:46:34Z","type":"journal_article","article_number":"eaar7514","publist_id":"7365","issue":"423","abstract":[{"lang":"eng","text":"Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. "}],"citation":{"mla":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514, American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.","short":"G. Novarino, Science Translational Medicine 10 (2018).","chicago":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514.","ama":"Novarino G. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514","ista":"Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 10(423), eaar7514.","apa":"Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514","ieee":"G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for the treatment,” Science Translational Medicine, vol. 10, no. 423. American Association for the Advancement of Science, 2018."},"publication":"Science Translational Medicine","quality_controlled":"1","doi":"10.1126/scitranslmed.aar7514","date_published":"2018-01-10T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":1,"day":"10","month":"01"},{"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_VOEB_Petritsch.pdf","content_type":"application/pdf","file_size":509434,"creator":"dernst","relation":"main_file","file_id":"5702","checksum":"7ac61bade5f37db011ca435ebcf86797","date_updated":"2020-07-14T12:46:38Z","date_created":"2018-12-17T12:40:27Z"}],"intvolume":" 71","title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","status":"public","ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"53","issue":"1","abstract":[{"lang":"eng","text":"In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation."}],"type":"journal_article","date_published":"2018-10-01T00:00:00Z","page":"199 - 206","citation":{"mla":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.","short":"B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.","chicago":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993.","ama":"Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993","ista":"Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.","apa":"Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993","ieee":"B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018."},"publication":"VÖB Mitteilungen","has_accepted_license":"1","day":"01","scopus_import":1,"volume":71,"date_created":"2018-12-11T11:44:22Z","date_updated":"2021-01-12T08:01:26Z","author":[{"orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87","last_name":"Petritsch","first_name":"Barbara","full_name":"Petritsch, Barbara"},{"full_name":"Porsche, Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","last_name":"Porsche","first_name":"Jana"}],"department":[{"_id":"E-Lib"}],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","publication_status":"published","year":"2018","publist_id":"8001","file_date_updated":"2020-07-14T12:46:38Z","language":[{"iso":"eng"}],"doi":"10.31263/voebm.v71i1.1993","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"10"},{"type":"journal_article","abstract":[{"lang":"eng","text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model."}],"issue":"6","_id":"536","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Communication-efficient randomized consensus","ddc":["000"],"intvolume":" 31","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2017_DistribComp_Alistarh.pdf","file_size":595707,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5867","checksum":"69b46e537acdcac745237ddb853fcbb5","date_updated":"2020-07-14T12:46:38Z","date_created":"2019-01-22T07:25:51Z"}],"scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication":"Distributed Computing","citation":{"ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1","apa":"Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1","ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501.","short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1."},"page":"489-501","date_published":"2018-11-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:38Z","publist_id":"7281","year":"2018","publication_status":"published","publisher":"Springer","department":[{"_id":"DaAl"}],"author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"full_name":"King, Valerie","first_name":"Valerie","last_name":"King"},{"first_name":"Jared","last_name":"Saia","full_name":"Saia, Jared"}],"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-23T12:23:25Z","volume":31,"month":"11","publication_identifier":{"issn":["01782770"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"doi":"10.1007/s00446-017-0315-1","language":[{"iso":"eng"}]},{"publication_status":"published","publisher":"Springer","department":[{"_id":"RoSe"}],"year":"2018","date_created":"2018-12-11T11:47:09Z","date_updated":"2021-01-12T08:02:35Z","volume":360,"author":[{"full_name":"Napiórkowski, Marcin M","last_name":"Napiórkowski","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Reuvers, Robin","last_name":"Reuvers","first_name":"Robin"},{"last_name":"Solovej","first_name":"Jan","full_name":"Solovej, Jan"}],"publist_id":"7260","quality_controlled":"1","project":[{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"external_id":{"arxiv":["1511.05953"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00220-017-3064-x","month":"05","publication_identifier":{"issn":["00103616"]},"status":"public","title":"The Bogoliubov free energy functional II: The dilute Limit","intvolume":" 360","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"554","oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).","lang":"eng"}],"issue":"1","page":"347-403","publication":"Communications in Mathematical Physics","citation":{"ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x","ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.","ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.","short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x."},"date_published":"2018-05-01T00:00:00Z","scopus_import":1,"day":"01"}]