[{"author":[{"first_name":"Luis","last_name":"Zapata","full_name":"Zapata, Luis"},{"full_name":"Pich, Oriol","last_name":"Pich","first_name":"Oriol"},{"last_name":"Serrano","first_name":"Luis","full_name":"Serrano, Luis"},{"full_name":"Kondrashov, Fyodor","first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694"},{"full_name":"Ossowski, Stephan","last_name":"Ossowski","first_name":"Stephan"},{"full_name":"Schaefer, Martin","first_name":"Martin","last_name":"Schaefer"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"279"}]},"date_created":"2021-08-06T12:53:49Z","date_updated":"2023-09-13T09:01:31Z","oa_version":"Preprint","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9811","year":"2018","title":"Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","status":"public","publisher":"Springer Nature","department":[{"_id":"FyKo"}],"abstract":[{"text":"This document contains additional supporting evidence presented as supplemental tables. (XLSX 50Â kb)","lang":"eng"}],"type":"research_data_reference","date_published":"2018-05-31T00:00:00Z","doi":"10.6084/m9.figshare.6401390.v1","citation":{"chicago":"Zapata, Luis, Oriol Pich, Luis Serrano, Fyodor Kondrashov, Stephan Ossowski, and Martin Schaefer. “Additional File 1: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome.” Springer Nature, 2018. https://doi.org/10.6084/m9.figshare.6401390.v1.","mla":"Zapata, Luis, et al. Additional File 1: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome. Springer Nature, 2018, doi:10.6084/m9.figshare.6401390.v1.","short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","ista":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. 2018. Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome, Springer Nature, 10.6084/m9.figshare.6401390.v1.","ieee":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, and M. Schaefer, “Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome.” Springer Nature, 2018.","apa":"Zapata, L., Pich, O., Serrano, L., Kondrashov, F., Ossowski, S., & Schaefer, M. (2018). Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Springer Nature. https://doi.org/10.6084/m9.figshare.6401390.v1","ama":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. 2018. doi:10.6084/m9.figshare.6401390.v1"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.6401390.v1"}],"oa":1,"month":"05","day":"31","article_processing_charge":"No"},{"issue":"1","abstract":[{"text":"Background: Norepinephrine (NE) signaling has a key role in white adipose tissue (WAT) functions, including lipolysis, free fatty acid liberation and, under certain conditions, conversion of white into brite (brown-in-white) adipocytes. However, acute effects of NE stimulation have not been described at the transcriptional network level. Results: We used RNA-seq to uncover a broad transcriptional response. The inference of protein-protein and protein-DNA interaction networks allowed us to identify a set of immediate-early genes (IEGs) with high betweenness, validating our approach and suggesting a hierarchical control of transcriptional regulation. In addition, we identified a transcriptional regulatory network with IEGs as master regulators, including HSF1 and NFIL3 as novel NE-induced IEG candidates. Moreover, a functional enrichment analysis and gene clustering into functional modules suggest a crosstalk between metabolic, signaling, and immune responses. Conclusions: Altogether, our network biology approach explores for the first time the immediate-early systems level response of human adipocytes to acute sympathetic activation, thereby providing a first network basis of early cell fate programs and crosstalks between metabolic and transcriptional networks required for proper WAT function.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"file_id":"5712","relation":"main_file","date_created":"2018-12-17T14:52:57Z","date_updated":"2020-07-14T12:45:23Z","checksum":"a56516e734dab589dc7f3e1915973b4d","file_name":"2018_BMCGenomics_Higareda.pdf","access_level":"open_access","creator":"dernst","file_size":4629784,"content_type":"application/pdf"}],"intvolume":" 19","title":"Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","ddc":["570"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"20","has_accepted_license":"1","article_processing_charge":"No","day":"03","scopus_import":"1","date_published":"2018-11-03T00:00:00Z","article_type":"original","citation":{"ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. BMC Genomics. 2018;19(1). doi:10.1186/s12864-018-5173-0","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. BMC Genomics. 19(1).","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., & Scheideler, M. (2018). Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. BMC Genomics. BioMed Central. https://doi.org/10.1186/s12864-018-5173-0","ieee":"J. Higareda Almaraz et al., “Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes,” BMC Genomics, vol. 19, no. 1. BioMed Central, 2018.","mla":"Higareda Almaraz, Juan, et al. “Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” BMC Genomics, vol. 19, no. 1, BioMed Central, 2018, doi:10.1186/s12864-018-5173-0.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, BMC Genomics 19 (2018).","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” BMC Genomics. BioMed Central, 2018. https://doi.org/10.1186/s12864-018-5173-0."},"publication":"BMC Genomics","publist_id":"8035","file_date_updated":"2020-07-14T12:45:23Z","volume":19,"date_created":"2018-12-11T11:44:12Z","date_updated":"2023-09-13T09:10:47Z","related_material":{"record":[{"id":"9807","relation":"research_data","status":"public"},{"id":"9808","status":"public","relation":"research_data"}]},"author":[{"last_name":"Higareda Almaraz","first_name":"Juan","full_name":"Higareda Almaraz, Juan"},{"last_name":"Karbiener","first_name":"Michael","full_name":"Karbiener, Michael"},{"last_name":"Giroud","first_name":"Maude","full_name":"Giroud, Maude"},{"full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"last_name":"Herzig","first_name":"Stephan","full_name":"Herzig, Stephan"},{"first_name":"Marcel","last_name":"Scheideler","full_name":"Scheideler, Marcel"}],"department":[{"_id":"SiHi"}],"publisher":"BioMed Central","publication_status":"published","year":"2018","acknowledgement":"This work was funded by the German Centre for Diabetes Research (DZD) and the Austrian Science Fund (FWF, P25729-B19).","publication_identifier":{"issn":["1471-2164"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1186/s12864-018-5173-0","quality_controlled":"1","isi":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"},"oa":1,"external_id":{"isi":["000450976700002"]}},{"abstract":[{"lang":"eng","text":"We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory."}],"issue":"4","type":"journal_article","oa_version":"Preprint","status":"public","title":"Non-malleable codes","intvolume":" 65","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"107","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-08-01T00:00:00Z","article_type":"original","publication":"Journal of the ACM","citation":{"apa":"Dziembowski, S., Pietrzak, K. Z., & Wichs, D. (2018). Non-malleable codes. Journal of the ACM. ACM. https://doi.org/10.1145/3178432","ieee":"S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal of the ACM, vol. 65, no. 4. ACM, 2018.","ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.","ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the ACM. 2018;65(4). doi:10.1145/3178432","chicago":"Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.” Journal of the ACM. ACM, 2018. https://doi.org/10.1145/3178432.","short":"S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).","mla":"Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM, vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432."},"ec_funded":1,"publist_id":"7947","article_number":"20","date_created":"2018-12-11T11:44:40Z","date_updated":"2023-09-13T09:05:17Z","volume":65,"author":[{"full_name":"Dziembowski, Stefan","first_name":"Stefan","last_name":"Dziembowski"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"publication_status":"published","publisher":"ACM","department":[{"_id":"KrPi"}],"year":"2018","month":"08","language":[{"iso":"eng"}],"doi":"10.1145/3178432","isi":1,"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"},{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2009/608","open_access":"1"}],"external_id":{"isi":["000442938200004"]}},{"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30228162","open_access":"1"}],"external_id":{"isi":["000451960800018"],"pmid":["30228162 "]},"language":[{"iso":"eng"}],"doi":"10.1083/jcb.201804048","publication_identifier":{"issn":["00219525"]},"month":"12","publisher":"Rockefeller University Press","department":[{"_id":"CaHe"}],"publication_status":"published","pmid":1,"year":"2018","volume":217,"date_updated":"2023-09-13T09:11:17Z","date_created":"2018-12-16T22:59:19Z","author":[{"last_name":"Carvalho","first_name":"Lara","full_name":"Carvalho, Lara"},{"first_name":"Pedro","last_name":"Patricio","full_name":"Patricio, Pedro"},{"full_name":"Ponte, Susana","last_name":"Ponte","first_name":"Susana"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"},{"last_name":"Almeida","first_name":"Luis","full_name":"Almeida, Luis"},{"full_name":"Nunes, André S.","first_name":"André S.","last_name":"Nunes"},{"full_name":"Araújo, Nuno A.M.","last_name":"Araújo","first_name":"Nuno A.M."},{"full_name":"Jacinto, Antonio","last_name":"Jacinto","first_name":"Antonio"}],"ec_funded":1,"page":"4267-4283","citation":{"ieee":"L. Carvalho et al., “Occluding junctions as novel regulators of tissue mechanics during wound repair,” Journal of Cell Biology, vol. 217, no. 12. Rockefeller University Press, pp. 4267–4283, 2018.","apa":"Carvalho, L., Patricio, P., Ponte, S., Heisenberg, C.-P. J., Almeida, L., Nunes, A. S., … Jacinto, A. (2018). Occluding junctions as novel regulators of tissue mechanics during wound repair. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201804048","ista":"Carvalho L, Patricio P, Ponte S, Heisenberg C-PJ, Almeida L, Nunes AS, Araújo NAM, Jacinto A. 2018. Occluding junctions as novel regulators of tissue mechanics during wound repair. Journal of Cell Biology. 217(12), 4267–4283.","ama":"Carvalho L, Patricio P, Ponte S, et al. Occluding junctions as novel regulators of tissue mechanics during wound repair. Journal of Cell Biology. 2018;217(12):4267-4283. doi:10.1083/jcb.201804048","chicago":"Carvalho, Lara, Pedro Patricio, Susana Ponte, Carl-Philipp J Heisenberg, Luis Almeida, André S. Nunes, Nuno A.M. Araújo, and Antonio Jacinto. “Occluding Junctions as Novel Regulators of Tissue Mechanics during Wound Repair.” Journal of Cell Biology. Rockefeller University Press, 2018. https://doi.org/10.1083/jcb.201804048.","short":"L. Carvalho, P. Patricio, S. Ponte, C.-P.J. Heisenberg, L. Almeida, A.S. Nunes, N.A.M. Araújo, A. Jacinto, Journal of Cell Biology 217 (2018) 4267–4283.","mla":"Carvalho, Lara, et al. “Occluding Junctions as Novel Regulators of Tissue Mechanics during Wound Repair.” Journal of Cell Biology, vol. 217, no. 12, Rockefeller University Press, 2018, pp. 4267–83, doi:10.1083/jcb.201804048."},"publication":"Journal of Cell Biology","date_published":"2018-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 217","title":"Occluding junctions as novel regulators of tissue mechanics during wound repair","status":"public","_id":"5676","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","type":"journal_article","issue":"12","abstract":[{"text":"In epithelial tissues, cells tightly connect to each other through cell–cell junctions, but they also present the remarkable capacity of reorganizing themselves without compromising tissue integrity. Upon injury, simple epithelia efficiently resolve small lesions through the action of actin cytoskeleton contractile structures at the wound edge and cellular rearrangements. However, the underlying mechanisms and how they cooperate are still poorly understood. In this study, we combine live imaging and theoretical modeling to reveal a novel and indispensable role for occluding junctions (OJs) in this process. We demonstrate that OJ loss of function leads to defects in wound-closure dynamics: instead of contracting, wounds dramatically increase their area. OJ mutants exhibit phenotypes in cell shape, cellular rearrangements, and mechanical properties as well as in actin cytoskeleton dynamics at the wound edge. We propose that OJs are essential for wound closure by impacting on epithelial mechanics at the tissue level, which in turn is crucial for correct regulation of the cellular events occurring at the wound edge.","lang":"eng"}]},{"type":"research_data_reference","abstract":[{"text":"Table S1. Genes with highest betweenness. Table S2. Local and Master regulators up-regulated. Table S3. Local and Master regulators down-regulated (XLSX 23 kb).","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9807","year":"2018","title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","status":"public","department":[{"_id":"SiHi"}],"publisher":"Springer Nature","author":[{"last_name":"Higareda Almaraz","first_name":"Juan","full_name":"Higareda Almaraz, Juan"},{"first_name":"Michael","last_name":"Karbiener","full_name":"Karbiener, Michael"},{"full_name":"Giroud, Maude","first_name":"Maude","last_name":"Giroud"},{"orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","last_name":"Pauler","first_name":"Florian","full_name":"Pauler, Florian"},{"last_name":"Gerhalter","first_name":"Teresa","full_name":"Gerhalter, Teresa"},{"last_name":"Herzig","first_name":"Stephan","full_name":"Herzig, Stephan"},{"first_name":"Marcel","last_name":"Scheideler","full_name":"Scheideler, Marcel"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"20"}]},"date_created":"2021-08-06T12:26:53Z","date_updated":"2023-09-13T09:10:47Z","oa_version":"Published Version","day":"03","month":"11","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295339.v1"}],"oa":1,"citation":{"ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, 10.6084/m9.figshare.7295339.v1.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., & Scheideler, M. (2018). Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. https://doi.org/10.6084/m9.figshare.7295339.v1","ieee":"J. Higareda Almaraz et al., “Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:10.6084/m9.figshare.7295339.v1","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. https://doi.org/10.6084/m9.figshare.7295339.v1.","mla":"Higareda Almaraz, Juan, et al. Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes. Springer Nature, 2018, doi:10.6084/m9.figshare.7295339.v1.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018)."},"date_published":"2018-11-03T00:00:00Z","doi":"10.6084/m9.figshare.7295339.v1"},{"status":"public","title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","department":[{"_id":"SiHi"}],"publisher":"Springer Nature","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9808","year":"2018","date_created":"2021-08-06T12:31:57Z","date_updated":"2023-09-13T09:10:47Z","oa_version":"Published Version","author":[{"full_name":"Higareda Almaraz, Juan","last_name":"Higareda Almaraz","first_name":"Juan"},{"full_name":"Karbiener, Michael","last_name":"Karbiener","first_name":"Michael"},{"first_name":"Maude","last_name":"Giroud","full_name":"Giroud, Maude"},{"full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gerhalter, Teresa","last_name":"Gerhalter","first_name":"Teresa"},{"first_name":"Stephan","last_name":"Herzig","full_name":"Herzig, Stephan"},{"last_name":"Scheideler","first_name":"Marcel","full_name":"Scheideler, Marcel"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"20"}]},"type":"research_data_reference","abstract":[{"lang":"eng","text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb)."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295369.v1"}],"citation":{"chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. https://doi.org/10.6084/m9.figshare.7295369.v1.","mla":"Higareda Almaraz, Juan, et al. Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes. Springer Nature, 2018, doi:10.6084/m9.figshare.7295369.v1.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, 10.6084/m9.figshare.7295369.v1.","ieee":"J. Higareda Almaraz et al., “Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., & Scheideler, M. (2018). Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. https://doi.org/10.6084/m9.figshare.7295369.v1","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:10.6084/m9.figshare.7295369.v1"},"oa":1,"doi":"10.6084/m9.figshare.7295369.v1","date_published":"2018-11-03T00:00:00Z","month":"11","day":"03","article_processing_charge":"No"},{"publist_id":"7723","ec_funded":1,"publication_status":"published","department":[{"_id":"KrPi"},{"_id":"HeEd"},{"_id":"VlKo"}],"publisher":"ACM","acknowledgement":"Leonid Reyzin was supported in part by IST Austria and by US NSF grants 1012910, 1012798, and 1422965; this research was performed while he was visiting IST Austria.","year":"2018","date_created":"2018-12-11T11:45:07Z","date_updated":"2023-09-13T09:13:12Z","author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen"},{"last_name":"Gazi","first_name":"Peter","full_name":"Gazi, Peter"},{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Osang","first_name":"Georg F","orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Reyzin, Lenoid","last_name":"Reyzin","first_name":"Lenoid"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"},{"full_name":"Rybar, Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rybar"}],"month":"06","isi":1,"quality_controlled":"1","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"oa":1,"external_id":{"isi":["000516620100005"]},"main_file_link":[{"url":"https://eprint.iacr.org/2016/783","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2018-06-08","location":"Incheon, Republic of Korea","start_date":"2018-06-04","name":"ASIACCS: Asia Conference on Computer and Communications Security "},"doi":"10.1145/3196494.3196534","type":"conference","abstract":[{"text":"We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly lower hardware and/or energy cost than evaluating a single instance on a standard single-core architecture. Data-independent means the memory access pattern of the function is independent of the input; this makes iMHFs harder to construct than data-dependent ones, but the latter can be attacked by various side-channel attacks. Following [Alwen-Blocki'16], we capture the evaluation of an iMHF as a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC. Ideally, one would like the complexity of a DAG underlying an iMHF to be as close to quadratic in the number of nodes of the graph as possible. Instead, we show that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2, TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial property of each underlying DAG (called its depth-robustness. By establishing upper bounds on this property we are then able to apply the general technique of [Alwen-Block'16] for analyzing the hardware costs of an iMHF.","lang":"eng"}],"title":"On the memory hardness of data independent password hashing functions","status":"public","_id":"193","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","scopus_import":"1","day":"01","article_processing_charge":"No","page":"51 - 65","publication":"Proceedings of the 2018 on Asia Conference on Computer and Communication Security","citation":{"chicago":"Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.","mla":"Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.","short":"J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.","ista":"Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.","apa":"Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534","ieee":"J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.","ama":"Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534"},"date_published":"2018-06-01T00:00:00Z"},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We introduce a formal quantitative notion of “bit security” for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic function requiring a brute force attack on a k-bit key space. Our new definition matches the notion of bit security commonly used by cryptographers and cryptanalysts when studying search (e.g., key recovery) problems, where the use of the traditional definition is well established. However, it produces a quantitatively different metric in the case of decision (indistinguishability) problems, where the use of (a straightforward generalization of) the traditional definition is more problematic and leads to a number of paradoxical situations or mismatches between theoretical/provable security and practical/common sense intuition. Key to our new definition is to consider adversaries that may explicitly declare failure of the attack. We support and justify the new definition by proving a number of technical results, including tight reductions between several standard cryptographic problems, a new hybrid theorem that preserves bit security, and an application to the security analysis of indistinguishability primitives making use of (approximate) floating point numbers. This is the first result showing that (standard precision) 53-bit floating point numbers can be used to achieve 100-bit security in the context of cryptographic primitives with general indistinguishability-based security definitions. Previous results of this type applied only to search problems, or special types of decision problems.","lang":"eng"}],"status":"public","title":"On the bit security of cryptographic primitives","intvolume":" 10820","_id":"300","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","scopus_import":"1","day":"31","article_processing_charge":"No","page":"3 - 28","citation":{"ama":"Micciancio D, Walter M. On the bit security of cryptographic primitives. In: Vol 10820. Springer; 2018:3-28. doi:10.1007/978-3-319-78381-9_1","ieee":"D. Micciancio and M. Walter, “On the bit security of cryptographic primitives,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10820, pp. 3–28.","apa":"Micciancio, D., & Walter, M. (2018). On the bit security of cryptographic primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78381-9_1","ista":"Micciancio D, Walter M. 2018. On the bit security of cryptographic primitives. Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.","short":"D. Micciancio, M. Walter, in:, Springer, 2018, pp. 3–28.","mla":"Micciancio, Daniele, and Michael Walter. On the Bit Security of Cryptographic Primitives. Vol. 10820, Springer, 2018, pp. 3–28, doi:10.1007/978-3-319-78381-9_1.","chicago":"Micciancio, Daniele, and Michael Walter. “On the Bit Security of Cryptographic Primitives,” 10820:3–28. Springer, 2018. https://doi.org/10.1007/978-3-319-78381-9_1."},"date_published":"2018-03-31T00:00:00Z","publist_id":"7581","ec_funded":1,"publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","acknowledgement":"Research supported in part by the Defense Advanced Research Projects Agency (DARPA) and the U.S. Army Research Office under the SafeWare program. Opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views, position or policy of the Government. The second author was also supported by the European Research Council, ERC consolidator grant (682815 - TOCNeT).","year":"2018","date_updated":"2023-09-13T09:12:04Z","date_created":"2018-12-11T11:45:42Z","volume":10820,"author":[{"full_name":"Micciancio, Daniele","first_name":"Daniele","last_name":"Micciancio"},{"full_name":"Walter, Michael","first_name":"Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482"}],"month":"03","quality_controlled":"1","isi":1,"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"external_id":{"isi":["000517097500001"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/077"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2018-05-03","location":"Tel Aviv, Israel","start_date":"2018-04-29","name":"Eurocrypt: Advances in Cryptology"},"doi":"10.1007/978-3-319-78381-9_1"},{"date_updated":"2023-09-13T09:34:38Z","date_created":"2018-12-11T11:45:46Z","volume":32,"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Iglesias Ham","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","full_name":"Iglesias Ham, Mabel"}],"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Society for Industrial and Applied Mathematics ","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","year":"2018","publist_id":"7553","language":[{"iso":"eng"}],"doi":"10.1137/16M1097201","quality_controlled":"1","isi":1,"project":[{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"main_file_link":[{"url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf","open_access":"1"}],"external_id":{"isi":["000428958900038"]},"oa":1,"month":"03","publication_identifier":{"issn":["08954801"]},"oa_version":"Submitted Version","title":"On the optimality of the FCC lattice for soft sphere packing","status":"public","intvolume":" 32","_id":"312","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"issue":"1","type":"journal_article","date_published":"2018-03-29T00:00:00Z","article_type":"original","page":"750 - 782","publication":"SIAM J Discrete Math","citation":{"ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 2018;32(1):750-782. doi:10.1137/16M1097201","apa":"Edelsbrunner, H., & Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/16M1097201","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” SIAM J Discrete Math, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:10.1137/16M1097201.","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/16M1097201."},"day":"29","article_processing_charge":"No","scopus_import":"1"},{"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Comptes Rendus Mathematique","citation":{"ista":"Akopyan A. 2018. On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. 356(4), 412–414.","apa":"Akopyan, A. (2018). On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. Elsevier. https://doi.org/10.1016/j.crma.2018.03.005","ieee":"A. Akopyan, “On the number of non-hexagons in a planar tiling,” Comptes Rendus Mathematique, vol. 356, no. 4. Elsevier, pp. 412–414, 2018.","ama":"Akopyan A. On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. 2018;356(4):412-414. doi:10.1016/j.crma.2018.03.005","chicago":"Akopyan, Arseniy. “On the Number of Non-Hexagons in a Planar Tiling.” Comptes Rendus Mathematique. Elsevier, 2018. https://doi.org/10.1016/j.crma.2018.03.005.","mla":"Akopyan, Arseniy. “On the Number of Non-Hexagons in a Planar Tiling.” Comptes Rendus Mathematique, vol. 356, no. 4, Elsevier, 2018, pp. 412–14, doi:10.1016/j.crma.2018.03.005.","short":"A. Akopyan, Comptes Rendus Mathematique 356 (2018) 412–414."},"article_type":"original","page":"412-414","date_published":"2018-04-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We give a simple proof of T. Stehling's result [4], whereby in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except a finite number are hexagons."}],"issue":"4","_id":"409","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"On the number of non-hexagons in a planar tiling","status":"public","intvolume":" 356","oa_version":"Preprint","month":"04","publication_identifier":{"issn":["1631073X"]},"oa":1,"external_id":{"isi":["000430402700009"],"arxiv":["1805.01652"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.01652"}],"quality_controlled":"1","isi":1,"doi":"10.1016/j.crma.2018.03.005","language":[{"iso":"eng"}],"publist_id":"7420","year":"2018","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Elsevier","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"}],"date_created":"2018-12-11T11:46:19Z","date_updated":"2023-09-13T09:34:12Z","volume":356},{"publist_id":"7404","ec_funded":1,"file_date_updated":"2020-07-14T12:46:25Z","related_material":{"link":[{"relation":"erratum","url":"http://doi.org/10.1038/s41562-018-0342-3"}]},"author":[{"first_name":"Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"volume":2,"date_created":"2018-12-11T11:46:22Z","date_updated":"2023-09-13T09:38:54Z","year":"2018","publisher":"Nature Publishing Group","department":[{"_id":"KrCh"}],"publication_status":"published","month":"03","doi":"10.1038/s41562-018-0320-9","language":[{"iso":"eng"}],"external_id":{"isi":["000446612000016"]},"oa":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"isi":1,"quality_controlled":"1","abstract":[{"text":"Reciprocity is a major factor in human social life and accounts for a large part of cooperation in our communities. Direct reciprocity arises when repeated interactions occur between the same individuals. The framework of iterated games formalizes this phenomenon. Despite being introduced more than five decades ago, the concept keeps offering beautiful surprises. Recent theoretical research driven by new mathematical tools has proposed a remarkable dichotomy among the crucial strategies: successful individuals either act as partners or as rivals. Rivals strive for unilateral advantages by applying selfish or extortionate strategies. Partners aim to share the payoff for mutual cooperation, but are ready to fight back when being exploited. Which of these behaviours evolves depends on the environment. Whereas small population sizes and a limited number of rounds favour rivalry, partner strategies are selected when populations are large and relationships stable. Only partners allow for evolution of cooperation, while the rivals’ attempt to put themselves first leads to defection. Hilbe et al. synthesize recent theoretical work on zero-determinant and ‘rival’ versus ‘partner’ strategies in social dilemmas. They describe the environments under which these contrasting selfish or cooperative strategies emerge in evolution.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","file":[{"checksum":"571b8cc0ba14e8d5d8b18e439a9835eb","date_updated":"2020-07-14T12:46:25Z","date_created":"2019-11-19T08:19:51Z","relation":"main_file","file_id":"7052","file_size":598033,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_NatureHumanBeh_Hilbe.pdf"}],"_id":"419","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2","ddc":["000"],"status":"public","title":"Partners and rivals in direct reciprocity","article_processing_charge":"No","has_accepted_license":"1","day":"19","scopus_import":"1","date_published":"2018-03-19T00:00:00Z","citation":{"ama":"Hilbe C, Chatterjee K, Nowak M. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2018;2:469–477. doi:10.1038/s41562-018-0320-9","ieee":"C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 469–477, 2018.","apa":"Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group. https://doi.org/10.1038/s41562-018-0320-9","ista":"Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477.","short":"C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477.","mla":"Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9.","chicago":"Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0320-9."},"publication":"Nature Human Behaviour","page":"469–477","article_type":"review"},{"volume":11022,"date_created":"2018-12-11T11:44:31Z","date_updated":"2023-09-13T09:35:46Z","author":[{"full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin","first_name":"Alexey"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"last_name":"Maler","first_name":"Oded","full_name":"Maler, Oded"},{"last_name":"Asarin","first_name":"Eugene","full_name":"Asarin, Eugene"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2018","publist_id":"7976","file_date_updated":"2020-07-14T12:48:03Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-00151-3_13","conference":{"start_date":"2018-09-04","location":"Bejing, China","end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000884993200013"]},"publication_identifier":{"isbn":["978-3-030-00150-6"]},"month":"08","file":[{"file_name":"2018_LNCS_Bakhirkin.pdf","access_level":"open_access","creator":"dernst","file_size":374851,"content_type":"application/pdf","file_id":"7831","relation":"main_file","date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-14T11:34:34Z","checksum":"436b7574934324cfa7d1d3986fddc65b"}],"oa_version":"Submitted Version","intvolume":" 11022","status":"public","title":"Online timed pattern matching using automata","ddc":["000"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"78","abstract":[{"text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2018-08-26T00:00:00Z","page":"215 - 232","citation":{"chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_13.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","mla":"Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata. Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13.","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., & Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_13","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:10.1007/978-3-030-00151-3_13"},"article_processing_charge":"No","has_accepted_license":"1","day":"26","scopus_import":"1"},{"article_number":"5690","file_date_updated":"2020-07-14T12:46:02Z","publist_id":"7548","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"GeKa"}],"year":"2018","date_created":"2018-12-11T11:45:47Z","date_updated":"2023-09-13T09:38:00Z","volume":8,"author":[{"last_name":"Brauns","first_name":"Matthias","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Brauns, Matthias"},{"full_name":"Amitonov, Sergey","last_name":"Amitonov","first_name":"Sergey"},{"last_name":"Spruijtenburg","first_name":"Paul","full_name":"Spruijtenburg, Paul"},{"last_name":"Zwanenburg","first_name":"Floris","full_name":"Zwanenburg, Floris"}],"month":"04","quality_controlled":"1","isi":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"},"external_id":{"isi":["000429404300013"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41598-018-24004-y","type":"journal_article","abstract":[{"lang":"eng","text":"We replace the established aluminium gates for the formation of quantum dots in silicon with gates made from palladium. We study the morphology of both aluminium and palladium gates with transmission electron microscopy. The native aluminium oxide is found to be formed all around the aluminium gates, which could lead to the formation of unintentional dots. Therefore, we report on a novel fabrication route that replaces aluminium and its native oxide by palladium with atomic-layer-deposition-grown aluminium oxide. Using this approach, we show the formation of low-disorder gate-defined quantum dots, which are reproducibly fabricated. Furthermore, palladium enables us to further shrink the gate design, allowing us to perform electron transport measurements in the few-electron regime in devices comprising only two gate layers, a major technological advancement. It remains to be seen, whether the introduction of palladium gates can improve the excellent results on electron and nuclear spin qubits defined with an aluminium gate stack."}],"issue":"1","title":"Palladium gates for reproducible quantum dots in silicon","ddc":["539"],"status":"public","intvolume":" 8","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"317","oa_version":"Published Version","file":[{"creator":"system","file_size":1850530,"content_type":"application/pdf","file_name":"IST-2018-1016-v1+1_2018_Brauns_Palladium_gates.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:02Z","date_created":"2018-12-12T10:17:04Z","checksum":"20af238ca4ba6491b77270be8d826bf5","file_id":"5256","relation":"main_file"}],"pubrep_id":"1016","scopus_import":"1","day":"09","article_processing_charge":"No","has_accepted_license":"1","publication":"Scientific Reports","citation":{"apa":"Brauns, M., Amitonov, S., Spruijtenburg, P., & Zwanenburg, F. (2018). Palladium gates for reproducible quantum dots in silicon. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-24004-y","ieee":"M. Brauns, S. Amitonov, P. Spruijtenburg, and F. Zwanenburg, “Palladium gates for reproducible quantum dots in silicon,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.","ista":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. 2018. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 8(1), 5690.","ama":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-24004-y","chicago":"Brauns, Matthias, Sergey Amitonov, Paul Spruijtenburg, and Floris Zwanenburg. “Palladium Gates for Reproducible Quantum Dots in Silicon.” Scientific Reports. Nature Publishing Group, 2018. https://doi.org/10.1038/s41598-018-24004-y.","short":"M. Brauns, S. Amitonov, P. Spruijtenburg, F. Zwanenburg, Scientific Reports 8 (2018).","mla":"Brauns, Matthias, et al. “Palladium Gates for Reproducible Quantum Dots in Silicon.” Scientific Reports, vol. 8, no. 1, 5690, Nature Publishing Group, 2018, doi:10.1038/s41598-018-24004-y."},"date_published":"2018-04-09T00:00:00Z"},{"article_type":"original","page":"6808-6821","publication":"The FASEB Journal","citation":{"ama":"Liutkeviciute Z, Gil Mansilla E, Eder T, et al. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. 2018;32(12):6808-6821. doi:10.1096/fj.201800443","ieee":"Z. Liutkeviciute et al., “Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity,” The FASEB Journal, vol. 32, no. 12. FASEB, pp. 6808–6821, 2018.","apa":"Liutkeviciute, Z., Gil Mansilla, E., Eder, T., Casillas Perez, B. E., Giulia Di Giglio, M., Muratspahić, E., … Gruber, C. (2018). Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. FASEB. https://doi.org/10.1096/fj.201800443","ista":"Liutkeviciute Z, Gil Mansilla E, Eder T, Casillas Perez BE, Giulia Di Giglio M, Muratspahić E, Grebien F, Rattei T, Muttenthaler M, Cremer S, Gruber C. 2018. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. The FASEB Journal. 32(12), 6808–6821.","short":"Z. Liutkeviciute, E. Gil Mansilla, T. Eder, B.E. Casillas Perez, M. Giulia Di Giglio, E. Muratspahić, F. Grebien, T. Rattei, M. Muttenthaler, S. Cremer, C. Gruber, The FASEB Journal 32 (2018) 6808–6821.","mla":"Liutkeviciute, Zita, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” The FASEB Journal, vol. 32, no. 12, FASEB, 2018, pp. 6808–21, doi:10.1096/fj.201800443.","chicago":"Liutkeviciute, Zita, Esther Gil Mansilla, Thomas Eder, Barbara E Casillas Perez, Maria Giulia Di Giglio, Edin Muratspahić, Florian Grebien, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” The FASEB Journal. FASEB, 2018. https://doi.org/10.1096/fj.201800443."},"date_published":"2018-11-29T00:00:00Z","scopus_import":"1","day":"29","article_processing_charge":"No","title":"Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity","status":"public","intvolume":" 32","_id":"194","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Ants are emerging model systems to study cellular signaling because distinct castes possess different physiologic phenotypes within the same colony. Here we studied the functionality of inotocin signaling, an insect ortholog of mammalian oxytocin (OT), which was recently discovered in ants. In Lasius ants, we determined that specialization within the colony, seasonal factors, and physiologic conditions down-regulated the expression of the OT-like signaling system. Given this natural variation, we interrogated its function using RNAi knockdowns. Next-generation RNA sequencing of OT-like precursor knock-down ants highlighted its role in the regulation of genes involved in metabolism. Knock-down ants exhibited higher walking activity and increased self-grooming in the brood chamber. We propose that OT-like signaling in ants is important for regulating metabolic processes and locomotion.","lang":"eng"}],"issue":"12","isi":1,"quality_controlled":"1","project":[{"_id":"25E3D34E-B435-11E9-9278-68D0E5697425","name":"Individual function and social role of oxytocin-like neuropeptides in ants"}],"external_id":{"pmid":["29939785"],"isi":["000449359700035"]},"oa":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.1096/fj.201800443"}],"language":[{"iso":"eng"}],"doi":"10.1096/fj.201800443","month":"11","publication_identifier":{"issn":["08926638"]},"publication_status":"published","department":[{"_id":"SyCr"}],"publisher":"FASEB","year":"2018","pmid":1,"date_updated":"2023-09-13T09:37:32Z","date_created":"2018-12-11T11:45:08Z","volume":32,"author":[{"full_name":"Liutkeviciute, Zita","first_name":"Zita","last_name":"Liutkeviciute"},{"first_name":"Esther","last_name":"Gil Mansilla","full_name":"Gil Mansilla, Esther"},{"last_name":"Eder","first_name":"Thomas","full_name":"Eder, Thomas"},{"full_name":"Casillas Perez, Barbara E","last_name":"Casillas Perez","first_name":"Barbara E","id":"351ED2AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Giulia Di Giglio, Maria","last_name":"Giulia Di Giglio","first_name":"Maria"},{"full_name":"Muratspahić, Edin","last_name":"Muratspahić","first_name":"Edin"},{"last_name":"Grebien","first_name":"Florian","full_name":"Grebien, Florian"},{"full_name":"Rattei, Thomas","first_name":"Thomas","last_name":"Rattei"},{"first_name":"Markus","last_name":"Muttenthaler","full_name":"Muttenthaler, Markus"},{"full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gruber","first_name":"Christian","full_name":"Gruber, Christian"}],"publist_id":"7721"},{"publication":"Nature Chemical Biology","citation":{"chicago":"Fehrentz, Timm, Florian Huber, Nina Hartrampf, Tobias Bruegmann, James Frank, Nicholas Fine, Daniela Malan, et al. “Optical Control of L-Type Ca2+ Channels Using a Diltiazem Photoswitch.” Nature Chemical Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41589-018-0090-8.","mla":"Fehrentz, Timm, et al. “Optical Control of L-Type Ca2+ Channels Using a Diltiazem Photoswitch.” Nature Chemical Biology, vol. 14, no. 8, Nature Publishing Group, 2018, pp. 764–67, doi:10.1038/s41589-018-0090-8.","short":"T. Fehrentz, F. Huber, N. Hartrampf, T. Bruegmann, J. Frank, N. Fine, D. Malan, J.G. Danzl, D. Tikhonov, M. Sumser, P. Sasse, D. Hodson, B. Zhorov, N. Klocker, D. Trauner, Nature Chemical Biology 14 (2018) 764–767.","ista":"Fehrentz T, Huber F, Hartrampf N, Bruegmann T, Frank J, Fine N, Malan D, Danzl JG, Tikhonov D, Sumser M, Sasse P, Hodson D, Zhorov B, Klocker N, Trauner D. 2018. Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. 14(8), 764–767.","apa":"Fehrentz, T., Huber, F., Hartrampf, N., Bruegmann, T., Frank, J., Fine, N., … Trauner, D. (2018). Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. Nature Publishing Group. https://doi.org/10.1038/s41589-018-0090-8","ieee":"T. Fehrentz et al., “Optical control of L-type Ca2+ channels using a diltiazem photoswitch,” Nature Chemical Biology, vol. 14, no. 8. Nature Publishing Group, pp. 764–767, 2018.","ama":"Fehrentz T, Huber F, Hartrampf N, et al. Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. 2018;14(8):764-767. doi:10.1038/s41589-018-0090-8"},"article_type":"original","page":"764 - 767","date_published":"2018-07-16T00:00:00Z","scopus_import":"1","day":"16","has_accepted_license":"1","article_processing_charge":"No","_id":"159","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Optical control of L-type Ca2+ channels using a diltiazem photoswitch","status":"public","ddc":["570"],"intvolume":" 14","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":6321000,"creator":"dernst","file_name":"2018_NatureChemicalBiology_Fehrentz.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:03Z","date_created":"2020-05-14T12:14:09Z","checksum":"d42935094ec845f54a0688bf12986d62","relation":"main_file","file_id":"7832"}],"type":"journal_article","abstract":[{"text":"L-type Ca2+ channels (LTCCs) play a crucial role in excitation-contraction coupling and release of hormones from secretory cells. They are targets of antihypertensive and antiarrhythmic drugs such as diltiazem. Here, we present a photoswitchable diltiazem, FHU-779, which can be used to reversibly block endogenous LTCCs by light. FHU-779 is as potent as diltiazem and can be used to place pancreatic β-cell function and cardiac activity under optical control.","lang":"eng"}],"issue":"8","oa":1,"external_id":{"isi":["000438970200010"]},"quality_controlled":"1","isi":1,"doi":"10.1038/s41589-018-0090-8","language":[{"iso":"eng"}],"month":"07","year":"2018","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"JoDa"}],"author":[{"full_name":"Fehrentz, Timm","last_name":"Fehrentz","first_name":"Timm"},{"first_name":"Florian","last_name":"Huber","full_name":"Huber, Florian"},{"full_name":"Hartrampf, Nina","last_name":"Hartrampf","first_name":"Nina"},{"first_name":"Tobias","last_name":"Bruegmann","full_name":"Bruegmann, Tobias"},{"last_name":"Frank","first_name":"James","full_name":"Frank, James"},{"last_name":"Fine","first_name":"Nicholas","full_name":"Fine, Nicholas"},{"last_name":"Malan","first_name":"Daniela","full_name":"Malan, Daniela"},{"first_name":"Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G"},{"full_name":"Tikhonov, Denis","last_name":"Tikhonov","first_name":"Denis"},{"full_name":"Sumser, Maritn","first_name":"Maritn","last_name":"Sumser"},{"full_name":"Sasse, Philipp","first_name":"Philipp","last_name":"Sasse"},{"last_name":"Hodson","first_name":"David","full_name":"Hodson, David"},{"first_name":"Boris","last_name":"Zhorov","full_name":"Zhorov, Boris"},{"full_name":"Klocker, Nikolaj","first_name":"Nikolaj","last_name":"Klocker"},{"full_name":"Trauner, Dirk","first_name":"Dirk","last_name":"Trauner"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/s41589-021-00744-3","relation":"erratum"}]},"date_updated":"2023-09-13T09:36:35Z","date_created":"2018-12-11T11:44:56Z","volume":14,"file_date_updated":"2020-07-14T12:45:03Z","publist_id":"7762"},{"_id":"79","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 11024","title":"Parameter-independent strategies for pMDPs via POMDPs","status":"public","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol."}],"citation":{"apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4","ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.","ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:10.1007/978-3-319-99154-2_4","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.","mla":"Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4."},"page":"53-70","date_published":"2018-08-15T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"15","year":"2018","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Arming, Sebastian","last_name":"Arming","first_name":"Sebastian"},{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Katoen","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P"},{"full_name":"Sokolova, Ana","first_name":"Ana","last_name":"Sokolova"}],"volume":11024,"date_created":"2018-12-11T11:44:31Z","date_updated":"2023-09-13T09:38:28Z","publist_id":"7975","external_id":{"isi":["000548912200004"],"arxiv":["1806.05126"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05126"}],"isi":1,"quality_controlled":"1","doi":"10.1007/978-3-319-99154-2_4","conference":{"name":"QEST: Quantitative Evaluation of Systems","location":"Beijing, China","start_date":"2018-09-04","end_date":"2018-09-07"},"language":[{"iso":"eng"}],"month":"08"},{"publist_id":"7429","ec_funded":1,"file_date_updated":"2020-07-14T12:46:22Z","author":[{"full_name":"Deuchert, Andreas","last_name":"Deuchert","first_name":"Andreas","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Geisinge","first_name":"Alissa","full_name":"Geisinge, Alissa"},{"last_name":"Hainzl","first_name":"Christian","full_name":"Hainzl, Christian"},{"full_name":"Loss, Michael","first_name":"Michael","last_name":"Loss"}],"volume":19,"date_updated":"2023-09-15T12:04:15Z","date_created":"2018-12-11T11:46:15Z","year":"2018","department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","month":"05","doi":"10.1007/s00023-018-0665-7","language":[{"iso":"eng"}],"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"},"external_id":{"isi":["000429799900008"]},"oa":1,"project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"isi":1,"quality_controlled":"1","issue":"5","abstract":[{"text":"We consider the two-dimensional BCS functional with a radial pair interaction. We show that the translational symmetry is not broken in a certain temperature interval below the critical temperature. In the case of vanishing angular momentum, our results carry over to the three-dimensional case.","lang":"eng"}],"type":"journal_article","pubrep_id":"1011","oa_version":"Published Version","file":[{"file_size":582680,"content_type":"application/pdf","creator":"system","file_name":"IST-2018-1011-v1+1_2018_Deuchert_Persistence.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:22Z","date_created":"2018-12-12T10:12:47Z","checksum":"04d2c9bd7cbf3ca1d7acaaf4e7dca3e5","relation":"main_file","file_id":"4966"}],"_id":"400","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 19","status":"public","ddc":["510"],"title":"Persistence of translational symmetry in the BCS model with radial pair interaction","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","scopus_import":"1","date_published":"2018-05-01T00:00:00Z","citation":{"chicago":"Deuchert, Andreas, Alissa Geisinge, Christian Hainzl, and Michael Loss. “Persistence of Translational Symmetry in the BCS Model with Radial Pair Interaction.” Annales Henri Poincare. Springer, 2018. https://doi.org/10.1007/s00023-018-0665-7.","short":"A. Deuchert, A. Geisinge, C. Hainzl, M. Loss, Annales Henri Poincare 19 (2018) 1507–1527.","mla":"Deuchert, Andreas, et al. “Persistence of Translational Symmetry in the BCS Model with Radial Pair Interaction.” Annales Henri Poincare, vol. 19, no. 5, Springer, 2018, pp. 1507–27, doi:10.1007/s00023-018-0665-7.","ieee":"A. Deuchert, A. Geisinge, C. Hainzl, and M. Loss, “Persistence of translational symmetry in the BCS model with radial pair interaction,” Annales Henri Poincare, vol. 19, no. 5. Springer, pp. 1507–1527, 2018.","apa":"Deuchert, A., Geisinge, A., Hainzl, C., & Loss, M. (2018). Persistence of translational symmetry in the BCS model with radial pair interaction. Annales Henri Poincare. Springer. https://doi.org/10.1007/s00023-018-0665-7","ista":"Deuchert A, Geisinge A, Hainzl C, Loss M. 2018. Persistence of translational symmetry in the BCS model with radial pair interaction. Annales Henri Poincare. 19(5), 1507–1527.","ama":"Deuchert A, Geisinge A, Hainzl C, Loss M. Persistence of translational symmetry in the BCS model with radial pair interaction. Annales Henri Poincare. 2018;19(5):1507-1527. doi:10.1007/s00023-018-0665-7"},"publication":"Annales Henri Poincare","page":"1507 - 1527"},{"file":[{"date_created":"2018-12-12T10:15:43Z","date_updated":"2020-07-14T12:46:22Z","checksum":"684229493db75b43e98a46cd922da497","relation":"main_file","file_id":"5165","content_type":"application/pdf","file_size":6887358,"creator":"system","file_name":"IST-2018-995-v1+1_2018_Bodova_Probabilistic.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"995","ddc":["530","571"],"status":"public","title":"Probabilistic models of individual and collective animal behavior","intvolume":" 13","_id":"406","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Recent developments in automated tracking allow uninterrupted, high-resolution recording of animal trajectories, sometimes coupled with the identification of stereotyped changes of body pose or other behaviors of interest. Analysis and interpretation of such data represents a challenge: the timing of animal behaviors may be stochastic and modulated by kinematic variables, by the interaction with the environment or with the conspecifics within the animal group, and dependent on internal cognitive or behavioral state of the individual. Existing models for collective motion typically fail to incorporate the discrete, stochastic, and internal-state-dependent aspects of behavior, while models focusing on individual animal behavior typically ignore the spatial aspects of the problem. Here we propose a probabilistic modeling framework to address this gap. Each animal can switch stochastically between different behavioral states, with each state resulting in a possibly different law of motion through space. Switching rates for behavioral transitions can depend in a very general way, which we seek to identify from data, on the effects of the environment as well as the interaction between the animals. We represent the switching dynamics as a Generalized Linear Model and show that: (i) forward simulation of multiple interacting animals is possible using a variant of the Gillespie’s Stochastic Simulation Algorithm; (ii) formulated properly, the maximum likelihood inference of switching rate functions is tractably solvable by gradient descent; (iii) model selection can be used to identify factors that modulate behavioral state switching and to appropriately adjust model complexity to data. To illustrate our framework, we apply it to two synthetic models of animal motion and to real zebrafish tracking data. "}],"issue":"3","type":"journal_article","date_published":"2018-03-07T00:00:00Z","publication":"PLoS One","citation":{"ista":"Bod’Ová K, Mitchell G, Harpaz R, Schneidman E, Tkačik G. 2018. Probabilistic models of individual and collective animal behavior. PLoS One. 13(3).","apa":"Bod’Ová, K., Mitchell, G., Harpaz, R., Schneidman, E., & Tkačik, G. (2018). Probabilistic models of individual and collective animal behavior. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0193049","ieee":"K. Bod’Ová, G. Mitchell, R. Harpaz, E. Schneidman, and G. Tkačik, “Probabilistic models of individual and collective animal behavior,” PLoS One, vol. 13, no. 3. Public Library of Science, 2018.","ama":"Bod’Ová K, Mitchell G, Harpaz R, Schneidman E, Tkačik G. Probabilistic models of individual and collective animal behavior. PLoS One. 2018;13(3). doi:10.1371/journal.pone.0193049","chicago":"Bod’Ová, Katarína, Gabriel Mitchell, Roy Harpaz, Elad Schneidman, and Gašper Tkačik. “Probabilistic Models of Individual and Collective Animal Behavior.” PLoS One. Public Library of Science, 2018. https://doi.org/10.1371/journal.pone.0193049.","mla":"Bod’Ová, Katarína, et al. “Probabilistic Models of Individual and Collective Animal Behavior.” PLoS One, vol. 13, no. 3, Public Library of Science, 2018, doi:10.1371/journal.pone.0193049.","short":"K. Bod’Ová, G. Mitchell, R. Harpaz, E. Schneidman, G. Tkačik, PLoS One 13 (2018)."},"day":"07","article_processing_charge":"Yes","has_accepted_license":"1","scopus_import":"1","date_created":"2018-12-11T11:46:18Z","date_updated":"2023-09-15T12:06:19Z","volume":13,"author":[{"first_name":"Katarína","last_name":"Bod’Ová","full_name":"Bod’Ová, Katarína"},{"full_name":"Mitchell, Gabriel","id":"315BCD80-F248-11E8-B48F-1D18A9856A87","last_name":"Mitchell","first_name":"Gabriel"},{"last_name":"Harpaz","first_name":"Roy","full_name":"Harpaz, Roy"},{"full_name":"Schneidman, Elad","first_name":"Elad","last_name":"Schneidman"},{"last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"related_material":{"record":[{"id":"9831","status":"public","relation":"research_data"}]},"publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"GaTk"}],"acknowledgement":"This work was supported by the Human Frontier Science Program RGP0065/2012 (GT, ES).","year":"2018","file_date_updated":"2020-07-14T12:46:22Z","publist_id":"7423","language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0193049","isi":1,"quality_controlled":"1","project":[{"name":"Information processing and computation in fish groups","grant_number":"RGP0065/2012","_id":"255008E4-B435-11E9-9278-68D0E5697425"}],"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"},"external_id":{"isi":["000426896800032"]},"oa":1,"month":"03"},{"publist_id":"7999","year":"2018","publisher":"Cell Press","department":[{"_id":"SyCr"}],"publication_status":"published","author":[{"full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","last_name":"Pull","first_name":"Christopher"},{"full_name":"Metzler, Sina","orcid":"0000-0002-9547-2494","id":"48204546-F248-11E8-B48F-1D18A9856A87","last_name":"Metzler","first_name":"Sina"},{"id":"31757262-F248-11E8-B48F-1D18A9856A87","first_name":"Elisabeth","last_name":"Naderlinger","full_name":"Naderlinger, Elisabeth"},{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"}],"volume":28,"date_created":"2018-12-11T11:44:23Z","date_updated":"2023-09-15T12:06:46Z","month":"10","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2018.08.063"}],"external_id":{"isi":["000446693400008"]},"isi":1,"quality_controlled":"1","doi":"10.1016/j.cub.2018.08.063","language":[{"iso":"eng"}],"type":"journal_article","issue":"19","abstract":[{"text":"Many animals use antimicrobials to prevent or cure disease [1,2]. For example, some animals will ingest plants with medicinal properties, both prophylactically to prevent infection and therapeutically to self-medicate when sick. Antimicrobial substances are also used as topical disinfectants, to prevent infection, protect offspring and to sanitise their surroundings [1,2]. Social insects (ants, bees, wasps and termites) build nests in environments with a high abundance and diversity of pathogenic microorganisms — such as soil and rotting wood — and colonies are often densely crowded, creating conditions that favour disease outbreaks. Consequently, social insects have evolved collective disease defences to protect their colonies from epidemics. These traits can be seen as functionally analogous to the immune system of individual organisms [3,4]. This ‘social immunity’ utilises antimicrobials to prevent and eradicate infections, and to keep the brood and nest clean. However, these antimicrobial compounds can be harmful to the insects themselves, and it is unknown how colonies prevent collateral damage when using them. Here, we demonstrate that antimicrobial acids, produced by workers to disinfect the colony, are harmful to the delicate pupal brood stage, but that the pupae are protected from the acids by the presence of a silk cocoon. Garden ants spray their nests with an antimicrobial poison to sanitize contaminated nestmates and brood. Here, Pull et al show that they also prophylactically sanitise their colonies, and that the silk cocoon serves as a barrier to protect developing pupae, thus preventing collateral damage during nest sanitation.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"55","intvolume":" 28","status":"public","title":"Protection against the lethal side effects of social immunity in ants","oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","day":"08","citation":{"chicago":"Pull, Christopher, Sina Metzler, Elisabeth Naderlinger, and Sylvia Cremer. “Protection against the Lethal Side Effects of Social Immunity in Ants.” Current Biology. Cell Press, 2018. https://doi.org/10.1016/j.cub.2018.08.063.","short":"C. Pull, S. Metzler, E. Naderlinger, S. Cremer, Current Biology 28 (2018) R1139–R1140.","mla":"Pull, Christopher, et al. “Protection against the Lethal Side Effects of Social Immunity in Ants.” Current Biology, vol. 28, no. 19, Cell Press, 2018, pp. R1139–40, doi:10.1016/j.cub.2018.08.063.","ieee":"C. Pull, S. Metzler, E. Naderlinger, and S. Cremer, “Protection against the lethal side effects of social immunity in ants,” Current Biology, vol. 28, no. 19. Cell Press, pp. R1139–R1140, 2018.","apa":"Pull, C., Metzler, S., Naderlinger, E., & Cremer, S. (2018). Protection against the lethal side effects of social immunity in ants. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2018.08.063","ista":"Pull C, Metzler S, Naderlinger E, Cremer S. 2018. Protection against the lethal side effects of social immunity in ants. Current Biology. 28(19), R1139–R1140.","ama":"Pull C, Metzler S, Naderlinger E, Cremer S. Protection against the lethal side effects of social immunity in ants. Current Biology. 2018;28(19):R1139-R1140. doi:10.1016/j.cub.2018.08.063"},"publication":"Current Biology","page":"R1139 - R1140","article_type":"original","date_published":"2018-10-08T00:00:00Z"},{"publist_id":"7740","ec_funded":1,"year":"2018","acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics ","department":[{"_id":"LaEr"}],"author":[{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger"},{"full_name":"Renfrew, David T","first_name":"David T","last_name":"Renfrew","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3493-121X"}],"date_created":"2018-12-11T11:45:03Z","date_updated":"2023-09-15T12:05:52Z","volume":50,"month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.01546"}],"oa":1,"external_id":{"isi":["000437018500032"],"arxiv":["1708.01546"]},"quality_controlled":"1","isi":1,"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"},{"name":"Structured Non-Hermitian Random Matrices","call_identifier":"FWF","grant_number":"M02080","_id":"258F40A4-B435-11E9-9278-68D0E5697425"}],"doi":"10.1137/17M1143125","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2.","lang":"eng"}],"issue":"3","_id":"181","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Power law decay for systems of randomly coupled differential equations","status":"public","intvolume":" 50","oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"SIAM Journal on Mathematical Analysis","citation":{"chicago":"Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/17M1143125.","mla":"Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” SIAM Journal on Mathematical Analysis, vol. 50, no. 3, Society for Industrial and Applied Mathematics , 2018, pp. 3271–90, doi:10.1137/17M1143125.","short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290.","ista":"Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3), 3271–3290.","ieee":"L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of randomly coupled differential equations,” SIAM Journal on Mathematical Analysis, vol. 50, no. 3. Society for Industrial and Applied Mathematics , pp. 3271–3290, 2018.","apa":"Erdös, L., Krüger, T. H., & Renfrew, D. T. (2018). Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/17M1143125","ama":"Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 2018;50(3):3271-3290. doi:10.1137/17M1143125"},"page":"3271 - 3290","date_published":"2018-01-01T00:00:00Z"},{"type":"journal_article","abstract":[{"lang":"eng","text":"We construct quantizations of multiplicative hypertoric varieties using an algebra of q-difference operators on affine space, where q is a root of unity in C. The quantization defines a matrix bundle (i.e. Azumaya algebra) over the multiplicative hypertoric variety and admits an explicit finite étale splitting. The global sections of this Azumaya algebra is a hypertoric quantum group, and we prove a localization theorem. We introduce a general framework of Frobenius quantum moment maps and their Hamiltonian reductions; our results shed light on an instance of this framework."}],"_id":"322","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Quantizations of multiplicative hypertoric varieties at a root of unity","intvolume":" 506","oa_version":"Preprint","scopus_import":"1","day":"15","article_processing_charge":"No","publication":"Journal of Algebra","citation":{"ieee":"I. V. Ganev, “Quantizations of multiplicative hypertoric varieties at a root of unity,” Journal of Algebra, vol. 506. World Scientific Publishing, pp. 92–128, 2018.","apa":"Ganev, I. V. (2018). Quantizations of multiplicative hypertoric varieties at a root of unity. Journal of Algebra. World Scientific Publishing. https://doi.org/10.1016/j.jalgebra.2018.03.015","ista":"Ganev IV. 2018. Quantizations of multiplicative hypertoric varieties at a root of unity. Journal of Algebra. 506, 92–128.","ama":"Ganev IV. Quantizations of multiplicative hypertoric varieties at a root of unity. Journal of Algebra. 2018;506:92-128. doi:10.1016/j.jalgebra.2018.03.015","chicago":"Ganev, Iordan V. “Quantizations of Multiplicative Hypertoric Varieties at a Root of Unity.” Journal of Algebra. World Scientific Publishing, 2018. https://doi.org/10.1016/j.jalgebra.2018.03.015.","short":"I.V. Ganev, Journal of Algebra 506 (2018) 92–128.","mla":"Ganev, Iordan V. “Quantizations of Multiplicative Hypertoric Varieties at a Root of Unity.” Journal of Algebra, vol. 506, World Scientific Publishing, 2018, pp. 92–128, doi:10.1016/j.jalgebra.2018.03.015."},"page":"92 - 128","date_published":"2018-07-15T00:00:00Z","publist_id":"7543","ec_funded":1,"acknowledgement":"National Science Foundation: Graduate Research Fellowship and grant No.0932078000; ERC Advanced Grant “Arithmetic and Physics of Higgs moduli spaces” No. 320593 \r\nThe author is grateful to David Jordan for suggesting this project and providing guidance throughout, particularly for the formulation of Frobenius quantum moment maps and key ideas in the proofs of Theorems 3.12 and 4.8. Special thanks to David Ben-Zvi (the author's PhD advisor) for numerous discussions and constant encouragement, and for suggesting the term ‘hypertoric quantum group.’ Many results appearing in the current paper were proven independently by Nicholas Cooney; the author is grateful to Nicholas for sharing his insight on various topics, including Proposition 3.8. The author also thanks Nicholas Proudfoot for relating the definition of multiplicative hypertoric varieties, as well as the content of Remark 2.14. The author also benefited immensely from the close reading and detailed comments of an anonymous referee, and from conversations with Justin Hilburn, Kobi Kremnitzer, Michael McBreen, Tom Nevins, Travis Schedler, and Ben Webster. \r\n\r\n\r\n\r\n","year":"2018","publication_status":"published","department":[{"_id":"TaHa"}],"publisher":"World Scientific Publishing","author":[{"last_name":"Ganev","first_name":"Iordan V","id":"447491B8-F248-11E8-B48F-1D18A9856A87","full_name":"Ganev, Iordan V"}],"date_updated":"2023-09-15T12:08:38Z","date_created":"2018-12-11T11:45:49Z","volume":506,"month":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.7211"}],"external_id":{"arxiv":["1412.7211"],"isi":["000433270600005"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Arithmetic and physics of Higgs moduli spaces"}],"doi":"10.1016/j.jalgebra.2018.03.015","language":[{"iso":"eng"}]},{"month":"07","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-96145-3_24","conference":{"name":"CAV: Computer Aided Verification","end_date":"2018-07-17","location":"Oxford, United Kingdom","start_date":"2018-07-14"},"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"isi":1,"quality_controlled":"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"},"external_id":{"isi":["000491481600024"]},"oa":1,"publist_id":"7781","file_date_updated":"2020-07-14T12:44:53Z","volume":10981,"date_created":"2018-12-11T11:44:51Z","date_updated":"2023-09-15T12:12:08Z","author":[{"orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong","first_name":"Hui","full_name":"Kong, Hui"},{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","acknowledgement":"Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32","year":"2018","has_accepted_license":"1","article_processing_charge":"No","day":"18","scopus_import":"1","date_published":"2018-07-18T00:00:00Z","page":"449 - 467","citation":{"ista":"Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification, LNCS, vol. 10981, 449–467.","ieee":"H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.","apa":"Kong, H., Bartocci, E., & Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_24","ama":"Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467. doi:10.1007/978-3-319-96145-3_24","chicago":"Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_24.","mla":"Kong, Hui, et al. Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.","short":"H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467."},"abstract":[{"lang":"eng","text":"We address the problem of analyzing the reachable set of a polynomial nonlinear continuous system by over-approximating the flowpipe of its dynamics. The common approach to tackle this problem is to perform a numerical integration over a given time horizon based on Taylor expansion and interval arithmetic. However, this method results to be very conservative when there is a large difference in speed between trajectories as time progresses. In this paper, we propose to use combinations of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse box which is big enough to contain the segment is constructed using sampled simulation and then in the box we compute by linear programming a set of barrier functions (called barrier tube or BT for short) which work together to form a tube surrounding the flowpipe. The benefit of using PBT is that (1) BT is independent of time and hence can avoid being stretched and deformed by time; and (2) a small number of BTs can form a tight over-approximation for the flowpipe, which means that the computation required to decide whether the BTs intersect the unsafe set can be reduced significantly. We implemented a prototype called PBTS in C++. Experiments on some benchmark systems show that our approach is effective."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":5591566,"access_level":"open_access","file_name":"2018_LNCS_Kong.pdf","checksum":"fd95e8026deacef3dc752a733bb9355f","date_created":"2018-12-17T15:57:06Z","date_updated":"2020-07-14T12:44:53Z","file_id":"5718","relation":"main_file"}],"intvolume":" 10981","ddc":["000"],"title":"Reachable set over-approximation for nonlinear systems using piecewise barrier tubes","status":"public","_id":"142","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"ec_funded":1,"publist_id":"7396","article_number":"022510","date_created":"2018-12-11T11:46:25Z","date_updated":"2023-09-15T12:09:35Z","volume":97,"author":[{"full_name":"Amaro, Pedro","first_name":"Pedro","last_name":"Amaro"},{"full_name":"Loureiro, Ulisses","last_name":"Loureiro","first_name":"Ulisses"},{"full_name":"Safari, Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","last_name":"Safari","first_name":"Laleh"},{"first_name":"Filippo","last_name":"Fratini","full_name":"Fratini, Filippo"},{"first_name":"Paul","last_name":"Indelicato","full_name":"Indelicato, Paul"},{"full_name":"Stöhlker, Thomas","first_name":"Thomas","last_name":"Stöhlker"},{"first_name":"José","last_name":"Santos","full_name":"Santos, José"}],"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","year":"2018","acknowledgement":"This work was funded by the Portuguese Fundação para a Ciência e a Tecnologia (FCT/MCTES/PIDDAC) under Grant No. UID/FIS/04559/2013 (LIBPhys). P.A. acknowledges the support of the FCT, under Contract No. SFRH/BPD/92329/2013. L.S. acknowledges financial support from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant Agreement No. (291734). Laboratoire Kastler Brossel (LKB) is “Unité Mixte de Recherche de Sorbonne Université, de ENS-PSL Research University, du Collège de France et du CNRS No. 8552.” APPENDIX:\r\n","month":"02","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevA.97.022510","isi":1,"quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.07920"}],"external_id":{"isi":["000425601000004"],"arxiv":["1802.07920"]},"oa":1,"abstract":[{"text":"We investigate the quantum interference induced shifts between energetically close states in highly charged ions, with the energy structure being observed by laser spectroscopy. In this work, we focus on hyperfine states of lithiumlike heavy-Z isotopes and quantify how much quantum interference changes the observed transition frequencies. The process of photon excitation and subsequent photon decay for the transition 2s→2p→2s is implemented with fully relativistic and full-multipole frameworks, which are relevant for such relativistic atomic systems. We consider the isotopes Pb79+207 and Bi80+209 due to experimental interest, as well as other examples of isotopes with lower Z, namely Pr56+141 and Ho64+165. We conclude that quantum interference can induce shifts up to 11% of the linewidth in the measurable resonances of the considered isotopes, if interference between resonances is neglected. The inclusion of relativity decreases the cross section by 35%, mainly due to the complete retardation form of the electric dipole multipole. However, the contribution of the next higher multipoles (e.g., magnetic quadrupole) to the cross section is negligible. This makes the contribution of relativity and higher-order multipoles to the quantum interference induced shifts a minor effect, even for heavy-Z elements.","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Preprint","status":"public","title":"Quantum interference in laser spectroscopy of highly charged lithiumlike ions","intvolume":" 97","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"427","day":"21","article_processing_charge":"No","scopus_import":"1","date_published":"2018-02-21T00:00:00Z","article_type":"original","publication":" Physical Review A - Atomic, Molecular, and Optical Physics","citation":{"mla":"Amaro, Pedro, et al. “Quantum Interference in Laser Spectroscopy of Highly Charged Lithiumlike Ions.” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no. 2, 022510, American Physical Society, 2018, doi:10.1103/PhysRevA.97.022510.","short":"P. Amaro, U. Loureiro, L. Safari, F. Fratini, P. Indelicato, T. Stöhlker, J. Santos, Physical Review A - Atomic, Molecular, and Optical Physics 97 (2018).","chicago":"Amaro, Pedro, Ulisses Loureiro, Laleh Safari, Filippo Fratini, Paul Indelicato, Thomas Stöhlker, and José Santos. “Quantum Interference in Laser Spectroscopy of Highly Charged Lithiumlike Ions.” Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevA.97.022510.","ama":"Amaro P, Loureiro U, Safari L, et al. Quantum interference in laser spectroscopy of highly charged lithiumlike ions. Physical Review A - Atomic, Molecular, and Optical Physics. 2018;97(2). doi:10.1103/PhysRevA.97.022510","ista":"Amaro P, Loureiro U, Safari L, Fratini F, Indelicato P, Stöhlker T, Santos J. 2018. Quantum interference in laser spectroscopy of highly charged lithiumlike ions. Physical Review A - Atomic, Molecular, and Optical Physics. 97(2), 022510.","ieee":"P. Amaro et al., “Quantum interference in laser spectroscopy of highly charged lithiumlike ions,” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no. 2. American Physical Society, 2018.","apa":"Amaro, P., Loureiro, U., Safari, L., Fratini, F., Indelicato, P., Stöhlker, T., & Santos, J. (2018). Quantum interference in laser spectroscopy of highly charged lithiumlike ions. Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.97.022510"}},{"author":[{"full_name":"Akitaya, Hugo","first_name":"Hugo","last_name":"Akitaya"},{"full_name":"Fulek, Radoslav","first_name":"Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774"},{"full_name":"Tóth, Csaba","last_name":"Tóth","first_name":"Csaba"}],"related_material":{"record":[{"id":"6982","status":"public","relation":"later_version"}]},"date_created":"2018-12-11T11:45:45Z","date_updated":"2023-09-15T12:19:32Z","year":"2018","acknowledgement":"∗Research supported in part by the NSF awards CCF-1422311 and CCF-1423615, and the Science Without Borders program. The second author gratefully acknowledges support from Austrian Science Fund (FWF): M2281-N35.","publication_status":"published","publisher":"ACM","department":[{"_id":"UlWa"}],"publist_id":"7556","conference":{"end_date":"2018-01-10","location":"New Orleans, LA, USA","start_date":"2018-01-07","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611975031.20","language":[{"iso":"eng"}],"external_id":{"arxiv":["1709.09209"],"isi":["000483921200021"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.09209"}],"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281","call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs"}],"month":"01","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"309","title":"Recognizing weak embeddings of graphs","status":"public","abstract":[{"text":"We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding ' : G ! M of a graph G into a 2manifold M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to a common node or arc, due to data compression or low resolution. This raises the computational problem of deciding whether a given map ' : G ! M comes from an embedding. A map ' : G ! M is a weak embedding if it can be perturbed into an embedding ψ: G ! M with k' \"k < \" for every " > 0. A polynomial-time algorithm for recognizing weak embeddings was recently found by Fulek and Kyncl [14], which reduces to solving a system of linear equations over Z2. It runs in O(n2!) O(n4:75) time, where 2:373 is the matrix multiplication exponent and n is the number of vertices and edges of G. We improve the running time to O(n log n). Our algorithm is also conceptually simpler than [14]: We perform a sequence of local operations that gradually "untangles" the image '(G) into an embedding (G), or reports that ' is not a weak embedding. It generalizes a recent technique developed for the case that G is a cycle and the embedding is a simple polygon [1], and combines local constraints on the orientation of subgraphs directly, thereby eliminating the need for solving large systems of linear equations.","lang":"eng"}],"type":"conference","date_published":"2018-01-01T00:00:00Z","citation":{"ista":"Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs. SODA: Symposium on Discrete Algorithms, 274–292.","apa":"Akitaya, H., Fulek, R., & Tóth, C. (2018). Recognizing weak embeddings of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA: ACM. https://doi.org/10.1137/1.9781611975031.20","ieee":"H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA, 2018, pp. 274–292.","ama":"Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. In: ACM; 2018:274-292. doi:10.1137/1.9781611975031.20","chicago":"Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs,” 274–92. ACM, 2018. https://doi.org/10.1137/1.9781611975031.20.","mla":"Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018, pp. 274–92, doi:10.1137/1.9781611975031.20.","short":"H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292."},"page":"274 - 292","day":"01","article_processing_charge":"No","scopus_import":"1"},{"article_type":"original","citation":{"short":"E. Yakaboylu, M. Shkolnikov, M. Lemeshko, Physical Review Letters 121 (2018).","mla":"Yakaboylu, Enderalp, et al. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters, vol. 121, no. 25, 255302, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.255302.","chicago":"Yakaboylu, Enderalp, Mikhail Shkolnikov, and Mikhail Lemeshko. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.255302.","ama":"Yakaboylu E, Shkolnikov M, Lemeshko M. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 2018;121(25). doi:10.1103/PhysRevLett.121.255302","ieee":"E. Yakaboylu, M. Shkolnikov, and M. Lemeshko, “Quantum groups as hidden symmetries of quantum impurities,” Physical Review Letters, vol. 121, no. 25. American Physical Society, 2018.","apa":"Yakaboylu, E., Shkolnikov, M., & Lemeshko, M. (2018). Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.255302","ista":"Yakaboylu E, Shkolnikov M, Lemeshko M. 2018. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 121(25), 255302."},"publication":"Physical Review Letters","date_published":"2018-12-17T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"17","intvolume":" 121","status":"public","title":"Quantum groups as hidden symmetries of quantum impurities","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5794","oa_version":"Preprint","type":"journal_article","issue":"25","abstract":[{"lang":"eng","text":"We present an approach to interacting quantum many-body systems based on the notion of quantum groups, also known as q-deformed Lie algebras. In particular, we show that, if the symmetry of a free quantum particle corresponds to a Lie group G, in the presence of a many-body environment this particle can be described by a deformed group, Gq. Crucially, the single deformation parameter, q, contains all the information about the many-particle interactions in the system. We exemplify our approach by considering a quantum rotor interacting with a bath of bosons, and demonstrate that extracting the value of q from closed-form solutions in the perturbative regime allows one to predict the behavior of the system for arbitrary values of the impurity-bath coupling strength, in good agreement with nonperturbative calculations. Furthermore, the value of the deformation parameter allows one to predict at which coupling strengths rotor-bath interactions result in a formation of a stable quasiparticle. The approach based on quantum groups does not only allow for a drastic simplification of impurity problems, but also provides valuable insights into hidden symmetries of interacting many-particle systems."}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000454178600009"],"arxiv":["1809.00222"]},"main_file_link":[{"url":"https://arxiv.org/abs/1809.00222","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevLett.121.255302","publication_identifier":{"issn":["00319007"]},"month":"12","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","year":"2018","volume":121,"date_updated":"2023-09-15T12:09:06Z","date_created":"2019-01-06T22:59:12Z","author":[{"last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87","last_name":"Shkolnikov","first_name":"Mikhail","full_name":"Shkolnikov, Mikhail"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"}],"article_number":"255302","ec_funded":1},{"date_published":"2018-10-01T00:00:00Z","citation":{"ama":"Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 2018;28(5):3215-3238. doi:10.1214/18-AAP1389","apa":"Edelsbrunner, H., & Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/18-AAP1389","ieee":"H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics,” Annals of Applied Probability, vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018.","ista":"Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.","short":"H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:10.1214/18-AAP1389.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability. Institute of Mathematical Statistics, 2018. https://doi.org/10.1214/18-AAP1389."},"publication":"Annals of Applied Probability","page":"3215 - 3238","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"87","intvolume":" 28","title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics","status":"public","issue":"5","abstract":[{"lang":"eng","text":"Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics."}],"type":"journal_article","doi":"10.1214/18-AAP1389","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02870"}],"oa":1,"external_id":{"isi":["000442893500018"],"arxiv":["1705.02870"]},"project":[{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"quality_controlled":"1","isi":1,"month":"10","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6287"}]},"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","first_name":"Anton","last_name":"Nikitenko","full_name":"Nikitenko, Anton"}],"volume":28,"date_created":"2018-12-11T11:44:33Z","date_updated":"2023-09-15T12:10:35Z","year":"2018","department":[{"_id":"HeEd"}],"publisher":"Institute of Mathematical Statistics","publication_status":"published","publist_id":"7967"},{"oa_version":"Submitted Version","_id":"192","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Rapid and reversible root growth inhibition by TIR1 auxin signalling","intvolume":" 4","abstract":[{"text":"The phytohormone auxin is the information carrier in a plethora of developmental and physiological processes in plants(1). It has been firmly established that canonical, nuclear auxin signalling acts through regulation of gene transcription(2). Here, we combined microfluidics, live imaging, genetic engineering and computational modelling to reanalyse the classical case of root growth inhibition(3) by auxin. We show that Arabidopsis roots react to addition and removal of auxin by extremely rapid adaptation of growth rate. This process requires intracellular auxin perception but not transcriptional reprogramming. The formation of the canonical TIR1/AFB-Aux/IAA co-receptor complex is required for the growth regulation, hinting to a novel, non-transcriptional branch of this signalling pathway. Our results challenge the current understanding of root growth regulation by auxin and suggest another, presumably non-transcriptional, signalling output of the canonical auxin pathway.","lang":"eng"}],"issue":"7","type":"journal_article","date_published":"2018-06-25T00:00:00Z","publication":"Nature Plants","citation":{"chicago":"Fendrych, Matyas, Maria Akhmanova, Jack Merrin, Matous Glanc, Shinya Hagihara, Koji Takahashi, Naoyuki Uchida, Keiko U Torii, and Jiří Friml. “Rapid and Reversible Root Growth Inhibition by TIR1 Auxin Signalling.” Nature Plants. Springer Nature, 2018. https://doi.org/10.1038/s41477-018-0190-1.","mla":"Fendrych, Matyas, et al. “Rapid and Reversible Root Growth Inhibition by TIR1 Auxin Signalling.” Nature Plants, vol. 4, no. 7, Springer Nature, 2018, pp. 453–59, doi:10.1038/s41477-018-0190-1.","short":"M. Fendrych, M. Akhmanova, J. Merrin, M. Glanc, S. Hagihara, K. Takahashi, N. Uchida, K.U. Torii, J. Friml, Nature Plants 4 (2018) 453–459.","ista":"Fendrych M, Akhmanova M, Merrin J, Glanc M, Hagihara S, Takahashi K, Uchida N, Torii KU, Friml J. 2018. Rapid and reversible root growth inhibition by TIR1 auxin signalling. Nature Plants. 4(7), 453–459.","apa":"Fendrych, M., Akhmanova, M., Merrin, J., Glanc, M., Hagihara, S., Takahashi, K., … Friml, J. (2018). Rapid and reversible root growth inhibition by TIR1 auxin signalling. Nature Plants. Springer Nature. https://doi.org/10.1038/s41477-018-0190-1","ieee":"M. Fendrych et al., “Rapid and reversible root growth inhibition by TIR1 auxin signalling,” Nature Plants, vol. 4, no. 7. Springer Nature, pp. 453–459, 2018.","ama":"Fendrych M, Akhmanova M, Merrin J, et al. Rapid and reversible root growth inhibition by TIR1 auxin signalling. Nature Plants. 2018;4(7):453-459. doi:10.1038/s41477-018-0190-1"},"article_type":"original","page":"453 - 459","day":"25","article_processing_charge":"No","scopus_import":"1","author":[{"full_name":"Fendrych, Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","first_name":"Matyas","last_name":"Fendrych"},{"id":"3425EC26-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1522-3162","first_name":"Maria","last_name":"Akhmanova","full_name":"Akhmanova, Maria"},{"first_name":"Jack","last_name":"Merrin","id":"4515C308-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack"},{"first_name":"Matous","last_name":"Glanc","full_name":"Glanc, Matous"},{"full_name":"Hagihara, Shinya","first_name":"Shinya","last_name":"Hagihara"},{"full_name":"Takahashi, Koji","last_name":"Takahashi","first_name":"Koji"},{"first_name":"Naoyuki","last_name":"Uchida","full_name":"Uchida, Naoyuki"},{"full_name":"Torii, Keiko U","last_name":"Torii","first_name":"Keiko U"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"}],"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/new-mechanism-for-the-plant-hormone-auxin-discovered/"}]},"date_created":"2018-12-11T11:45:07Z","date_updated":"2023-09-15T12:11:03Z","volume":4,"year":"2018","pmid":1,"publication_status":"published","department":[{"_id":"JiFr"},{"_id":"DaSi"},{"_id":"NanoFab"}],"publisher":"Springer Nature","publist_id":"7728","doi":"10.1038/s41477-018-0190-1","language":[{"iso":"eng"}],"external_id":{"pmid":["29942048"],"isi":["000443221200017"]},"oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29942048","open_access":"1"}],"quality_controlled":"1","isi":1,"month":"06"},{"article_type":"original","citation":{"apa":"Hille, S., Akhmanova, M., Glanc, M., Johnson, A. J., & Friml, J. (2018). Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms19113566","ieee":"S. Hille, M. Akhmanova, M. Glanc, A. J. Johnson, and J. Friml, “Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation,” International Journal of Molecular Sciences, vol. 19, no. 11. MDPI, 2018.","ista":"Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. 2018. Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation. International Journal of Molecular Sciences. 19(11).","ama":"Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation. International Journal of Molecular Sciences. 2018;19(11). doi:10.3390/ijms19113566","chicago":"Hille, Sander, Maria Akhmanova, Matous Glanc, Alexander J Johnson, and Jiří Friml. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International Journal of Molecular Sciences. MDPI, 2018. https://doi.org/10.3390/ijms19113566.","short":"S. Hille, M. Akhmanova, M. Glanc, A.J. Johnson, J. Friml, International Journal of Molecular Sciences 19 (2018).","mla":"Hille, Sander, et al. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International Journal of Molecular Sciences, vol. 19, no. 11, MDPI, 2018, doi:10.3390/ijms19113566."},"publication":"International Journal of Molecular Sciences","date_published":"2018-11-12T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"12","intvolume":" 19","status":"public","ddc":["580"],"title":"Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"14","file":[{"relation":"main_file","file_id":"5719","checksum":"e4b59c2599b0ca26ebf5b8434bcde94a","date_created":"2018-12-17T16:04:11Z","date_updated":"2020-07-14T12:44:50Z","access_level":"open_access","file_name":"2018_IJMS_Hille.pdf","file_size":2200593,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","issue":"11","abstract":[{"text":"The intercellular transport of auxin is driven by PIN-formed (PIN) auxin efflux carriers. PINs are localized at the plasma membrane (PM) and on constitutively recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either by direct translocation across the PM or by pumping auxin into secretory vesicles (SVs), leading to its secretory release upon fusion with the PM. Which of these two mechanisms dominates is a matter of debate. Here, we addressed the issue with a mathematical modeling approach. We demonstrate that the efficiency of secretory transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency and PIN density. 3D structured illumination microscopy (SIM) was used to determine PIN density on the PM. Combining this data with published values of the other parameters, we show that the transport activity of PINs in SVs would have to be at least 1000× greater than on the PM in order to produce a comparable macroscopic auxin transport. If both transport mechanisms operated simultaneously and PINs were equally active on SVs and PM, the contribution of secretion to the total auxin flux would be negligible. In conclusion, while secretory vesicle-mediated transport of auxin is an intriguing and theoretically possible model, it is unlikely to be a major mechanism of auxin transport inplanta.","lang":"eng"}],"project":[{"call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"},{"call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","_id":"26538374-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":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"},"external_id":{"isi":["000451528500282"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.3390/ijms19113566","publication_identifier":{"eissn":["1422-0067"]},"month":"11","department":[{"_id":"DaSi"},{"_id":"JiFr"}],"publisher":"MDPI","publication_status":"published","year":"2018","acknowledgement":"European Research Council (ERC): 742985 to Jiri Friml; M.A. was supported by the Austrian Science Fund (FWF) (M2379-B28); AJ was supported by the Austria Science Fund (FWF): I03630 to Jiri Friml.","volume":19,"date_updated":"2023-09-18T08:09:32Z","date_created":"2018-12-11T11:44:09Z","author":[{"first_name":"Sander","last_name":"Hille","full_name":"Hille, Sander"},{"full_name":"Akhmanova, Maria","id":"3425EC26-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1522-3162","first_name":"Maria","last_name":"Akhmanova"},{"full_name":"Glanc, Matous","orcid":"0000-0003-0619-7783","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","last_name":"Glanc","first_name":"Matous"},{"full_name":"Johnson, Alexander J","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2739-8843","first_name":"Alexander J","last_name":"Johnson"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"}],"ec_funded":1,"publist_id":"8042","file_date_updated":"2020-07-14T12:44:50Z"},{"author":[{"full_name":"Sachdeva, Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","last_name":"Sachdeva","first_name":"Himani"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"volume":210,"date_updated":"2023-09-18T08:10:29Z","date_created":"2018-12-11T11:44:18Z","year":"2018","publisher":"Genetics Society of America","department":[{"_id":"NiBa"}],"publication_status":"published","doi":"10.1534/genetics.118.301429","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000452315900021"]},"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/379578v1"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["00166731"]},"month":"12","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"39","intvolume":" 210","title":"Replicability of introgression under linked, polygenic selection","status":"public","issue":"4","abstract":[{"text":"We study how a block of genome with a large number of weakly selected loci introgresses under directional selection into a genetically homogeneous population. We derive exact expressions for the expected rate of growth of any fragment of the introduced block during the initial phase of introgression, and show that the growth rate of a single-locus variant is largely insensitive to its own additive effect, but depends instead on the combined effect of all loci within a characteristic linkage scale. The expected growth rate of a fragment is highly correlated with its long-term introgression probability in populations of moderate size, and can hence identify variants that are likely to introgress across replicate populations. We clarify how the introgression probability of an individual variant is determined by the interplay between hitchhiking with relatively large fragments during the early phase of introgression and selection on fine-scale variation within these, which at longer times results in differential introgression probabilities for beneficial and deleterious loci within successful fragments. By simulating individuals, we also investigate how introgression probabilities at individual loci depend on the variance of fitness effects, the net fitness of the introduced block, and the size of the recipient population, and how this shapes the net advance under selection. Our work suggests that even highly replicable substitutions may be associated with a range of selective effects, which makes it challenging to fine map the causal loci that underlie polygenic adaptation.","lang":"eng"}],"type":"journal_article","date_published":"2018-12-04T00:00:00Z","citation":{"ista":"Sachdeva H, Barton NH. 2018. Replicability of introgression under linked, polygenic selection. Genetics. 210(4), 1411–1427.","ieee":"H. Sachdeva and N. H. Barton, “Replicability of introgression under linked, polygenic selection,” Genetics, vol. 210, no. 4. Genetics Society of America, pp. 1411–1427, 2018.","apa":"Sachdeva, H., & Barton, N. H. (2018). Replicability of introgression under linked, polygenic selection. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.118.301429","ama":"Sachdeva H, Barton NH. Replicability of introgression under linked, polygenic selection. Genetics. 2018;210(4):1411-1427. doi:10.1534/genetics.118.301429","chicago":"Sachdeva, Himani, and Nicholas H Barton. “Replicability of Introgression under Linked, Polygenic Selection.” Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/genetics.118.301429.","mla":"Sachdeva, Himani, and Nicholas H. Barton. “Replicability of Introgression under Linked, Polygenic Selection.” Genetics, vol. 210, no. 4, Genetics Society of America, 2018, pp. 1411–27, doi:10.1534/genetics.118.301429.","short":"H. Sachdeva, N.H. Barton, Genetics 210 (2018) 1411–1427."},"publication":"Genetics","page":"1411-1427","article_type":"original","article_processing_charge":"No","day":"04","scopus_import":"1"},{"language":[{"iso":"eng"}],"doi":"10.1142/S0217979218400222","quality_controlled":"1","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1710.11171","open_access":"1"}],"external_id":{"isi":["000438217300007"]},"oa":1,"month":"07","date_created":"2018-12-11T11:46:22Z","date_updated":"2023-09-18T08:09:59Z","volume":32,"author":[{"id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777","first_name":"Giacomo","last_name":"Bighin","full_name":"Bighin, Giacomo"},{"full_name":"Salasnich, Luca","first_name":"Luca","last_name":"Salasnich"}],"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"World Scientific Publishing","year":"2018","publist_id":"7402","date_published":"2018-07-10T00:00:00Z","page":"1840022","publication":"International Journal of Modern Physics B","citation":{"ama":"Bighin G, Salasnich L. Renormalization of the superfluid density in the two-dimensional BCS-BEC crossover. International Journal of Modern Physics B. 2018;32(17):1840022. doi:10.1142/S0217979218400222","ista":"Bighin G, Salasnich L. 2018. Renormalization of the superfluid density in the two-dimensional BCS-BEC crossover. International Journal of Modern Physics B. 32(17), 1840022.","apa":"Bighin, G., & Salasnich, L. (2018). Renormalization of the superfluid density in the two-dimensional BCS-BEC crossover. International Journal of Modern Physics B. World Scientific Publishing. https://doi.org/10.1142/S0217979218400222","ieee":"G. Bighin and L. Salasnich, “Renormalization of the superfluid density in the two-dimensional BCS-BEC crossover,” International Journal of Modern Physics B, vol. 32, no. 17. World Scientific Publishing, p. 1840022, 2018.","mla":"Bighin, Giacomo, and Luca Salasnich. “Renormalization of the Superfluid Density in the Two-Dimensional BCS-BEC Crossover.” International Journal of Modern Physics B, vol. 32, no. 17, World Scientific Publishing, 2018, p. 1840022, doi:10.1142/S0217979218400222.","short":"G. Bighin, L. Salasnich, International Journal of Modern Physics B 32 (2018) 1840022.","chicago":"Bighin, Giacomo, and Luca Salasnich. “Renormalization of the Superfluid Density in the Two-Dimensional BCS-BEC Crossover.” International Journal of Modern Physics B. World Scientific Publishing, 2018. https://doi.org/10.1142/S0217979218400222."},"day":"10","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","status":"public","title":"Renormalization of the superfluid density in the two-dimensional BCS-BEC crossover","intvolume":" 32","_id":"420","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We analyze the theoretical derivation of the beyond-mean-field equation of state for two-dimensional gas of dilute, ultracold alkali-metal atoms in the Bardeen–Cooper–Schrieffer (BCS) to Bose–Einstein condensate (BEC) crossover. We show that at zero temperature our theory — considering Gaussian fluctuations on top of the mean-field equation of state — is in very good agreement with experimental data. Subsequently, we investigate the superfluid density at finite temperature and its renormalization due to the proliferation of vortex–antivortex pairs. By doing so, we determine the Berezinskii–Kosterlitz–Thouless (BKT) critical temperature — at which the renormalized superfluid density jumps to zero — as a function of the inter-atomic potential strength. We find that the Nelson–Kosterlitz criterion overestimates the BKT temperature with respect to the renormalization group equations, this effect being particularly relevant in the intermediate regime of the crossover."}],"issue":"17","type":"journal_article"},{"publication_identifier":{"issn":["00278424"]},"month":"10","doi":"10.1073/pnas.1801832115","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"isi":["000448040500065"],"pmid":["30297406"]},"oa":1,"isi":1,"quality_controlled":"1","publist_id":"8017","file_date_updated":"2020-07-14T12:46:16Z","author":[{"full_name":"Tavares, Hugo","first_name":"Hugo","last_name":"Tavares"},{"full_name":"Whitley, Annabel","last_name":"Whitley","first_name":"Annabel"},{"last_name":"Field","first_name":"David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David"},{"full_name":"Bradley, Desmond","last_name":"Bradley","first_name":"Desmond"},{"full_name":"Couchman, Matthew","first_name":"Matthew","last_name":"Couchman"},{"first_name":"Lucy","last_name":"Copsey","full_name":"Copsey, Lucy"},{"full_name":"Elleouet, Joane","first_name":"Joane","last_name":"Elleouet"},{"full_name":"Burrus, Monique","first_name":"Monique","last_name":"Burrus"},{"full_name":"Andalo, Christophe","last_name":"Andalo","first_name":"Christophe"},{"last_name":"Li","first_name":"Miaomiao","full_name":"Li, Miaomiao"},{"first_name":"Qun","last_name":"Li","full_name":"Li, Qun"},{"first_name":"Yongbiao","last_name":"Xue","full_name":"Xue, Yongbiao"},{"last_name":"Rebocho","first_name":"Alexandra B","full_name":"Rebocho, Alexandra B"},{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Coen, Enrico","first_name":"Enrico","last_name":"Coen"}],"volume":115,"date_updated":"2023-09-18T08:36:49Z","date_created":"2018-12-11T11:44:18Z","pmid":1,"acknowledgement":" ERC Grant 201252 (to N.H.B.)","year":"2018","department":[{"_id":"NiBa"}],"publisher":"National Academy of Sciences","publication_status":"published","has_accepted_license":"1","article_processing_charge":"No","day":"23","scopus_import":"1","date_published":"2018-10-23T00:00:00Z","citation":{"short":"H. Tavares, A. Whitley, D. Field, D. Bradley, M. Couchman, L. Copsey, J. Elleouet, M. Burrus, C. Andalo, M. Li, Q. Li, Y. Xue, A.B. Rebocho, N.H. Barton, E. Coen, PNAS 115 (2018) 11006–11011.","mla":"Tavares, Hugo, et al. “Selection and Gene Flow Shape Genomic Islands That Control Floral Guides.” PNAS, vol. 115, no. 43, National Academy of Sciences, 2018, pp. 11006–11, doi:10.1073/pnas.1801832115.","chicago":"Tavares, Hugo, Annabel Whitley, David Field, Desmond Bradley, Matthew Couchman, Lucy Copsey, Joane Elleouet, et al. “Selection and Gene Flow Shape Genomic Islands That Control Floral Guides.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1801832115.","ama":"Tavares H, Whitley A, Field D, et al. Selection and gene flow shape genomic islands that control floral guides. PNAS. 2018;115(43):11006-11011. doi:10.1073/pnas.1801832115","apa":"Tavares, H., Whitley, A., Field, D., Bradley, D., Couchman, M., Copsey, L., … Coen, E. (2018). Selection and gene flow shape genomic islands that control floral guides. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1801832115","ieee":"H. Tavares et al., “Selection and gene flow shape genomic islands that control floral guides,” PNAS, vol. 115, no. 43. National Academy of Sciences, pp. 11006–11011, 2018.","ista":"Tavares H, Whitley A, Field D, Bradley D, Couchman M, Copsey L, Elleouet J, Burrus M, Andalo C, Li M, Li Q, Xue Y, Rebocho AB, Barton NH, Coen E. 2018. Selection and gene flow shape genomic islands that control floral guides. PNAS. 115(43), 11006–11011."},"publication":"PNAS","page":"11006 - 11011","issue":"43","abstract":[{"lang":"eng","text":"Genomes of closely-related species or populations often display localized regions of enhanced relative sequence divergence, termed genomic islands. It has been proposed that these islands arise through selective sweeps and/or barriers to gene flow. Here, we genetically dissect a genomic island that controls flower color pattern differences between two subspecies of Antirrhinum majus, A.m.striatum and A.m.pseudomajus, and relate it to clinal variation across a natural hybrid zone. We show that selective sweeps likely raised relative divergence at two tightly-linked MYB-like transcription factors, leading to distinct flower patterns in the two subspecies. The two patterns provide alternate floral guides and create a strong barrier to gene flow where populations come into contact. This barrier affects the selected flower color genes and tightlylinked loci, but does not extend outside of this domain, allowing gene flow to lower relative divergence for the rest of the chromosome. Thus, both selective sweeps and barriers to gene flow play a role in shaping genomic islands: sweeps cause elevation in relative divergence, while heterogeneous gene flow flattens the surrounding \"sea,\" making the island of divergence stand out. By showing how selective sweeps establish alternative adaptive phenotypes that lead to barriers to gene flow, our study sheds light on possible mechanisms leading to reproductive isolation and speciation."}],"type":"journal_article","file":[{"creator":"dernst","content_type":"application/pdf","file_size":1911302,"access_level":"open_access","file_name":"11006.full.pdf","checksum":"d2305d0cc81dbbe4c1c677d64ad6f6d1","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-17T08:44:03Z","file_id":"5683","relation":"main_file"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"38","intvolume":" 115","status":"public","title":"Selection and gene flow shape genomic islands that control floral guides","ddc":["570"]},{"year":"2018","editor":[{"full_name":"Andrews, D L","first_name":"D L","last_name":"Andrews"},{"full_name":"Ostendorf, A","last_name":"Ostendorf","first_name":"A"},{"full_name":"Bain, A J","first_name":"A J","last_name":"Bain"},{"full_name":"Nunzi, J M","first_name":"J M","last_name":"Nunzi"}],"publisher":"SPIE","department":[{"_id":"JoFi"}],"publication_status":"published","author":[{"last_name":"Xuereb","first_name":"André","full_name":"Xuereb, André"},{"full_name":"Aquilina, Matteo","last_name":"Aquilina","first_name":"Matteo"},{"full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423","first_name":"Shabir","last_name":"Barzanjeh"}],"volume":10672,"date_updated":"2023-09-18T08:12:24Z","date_created":"2018-12-11T11:44:55Z","article_number":"106721N","publist_id":"7766","external_id":{"isi":["000453298500019"],"arxiv":["1806.01000"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.01000"}],"quality_controlled":"1","isi":1,"doi":"10.1117/12.2309928","conference":{"start_date":"2018-04-22","location":"Strasbourg, France","end_date":"2018-04-26","name":"SPIE: The international society for optical engineering"},"language":[{"iso":"eng"}],"month":"05","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"155","intvolume":" 10672","status":"public","title":"Routing thermal noise through quantum networks","oa_version":"Preprint","type":"conference","alternative_title":["Proceedings of SPIE"],"abstract":[{"text":"There is currently significant interest in operating devices in the quantum regime, where their behaviour cannot be explained through classical mechanics. Quantum states, including entangled states, are fragile and easily disturbed by excessive thermal noise. Here we address the question of whether it is possible to create non-reciprocal devices that encourage the flow of thermal noise towards or away from a particular quantum device in a network. Our work makes use of the cascaded systems formalism to answer this question in the affirmative, showing how a three-port device can be used as an effective thermal transistor, and illustrates how this formalism maps onto an experimentally-realisable optomechanical system. Our results pave the way to more resilient quantum devices and to the use of thermal noise as a resource.","lang":"eng"}],"citation":{"ama":"Xuereb A, Aquilina M, Barzanjeh S. Routing thermal noise through quantum networks. In: Andrews DL, Ostendorf A, Bain AJ, Nunzi JM, eds. Vol 10672. SPIE; 2018. doi:10.1117/12.2309928","ista":"Xuereb A, Aquilina M, Barzanjeh S. 2018. Routing thermal noise through quantum networks. SPIE: The international society for optical engineering, Proceedings of SPIE, vol. 10672, 106721N.","ieee":"A. Xuereb, M. Aquilina, and S. Barzanjeh, “Routing thermal noise through quantum networks,” presented at the SPIE: The international society for optical engineering, Strasbourg, France, 2018, vol. 10672.","apa":"Xuereb, A., Aquilina, M., & Barzanjeh, S. (2018). Routing thermal noise through quantum networks. In D. L. Andrews, A. Ostendorf, A. J. Bain, & J. M. Nunzi (Eds.) (Vol. 10672). Presented at the SPIE: The international society for optical engineering, Strasbourg, France: SPIE. https://doi.org/10.1117/12.2309928","mla":"Xuereb, André, et al. Routing Thermal Noise through Quantum Networks. Edited by D L Andrews et al., vol. 10672, 106721N, SPIE, 2018, doi:10.1117/12.2309928.","short":"A. Xuereb, M. Aquilina, S. Barzanjeh, in:, D.L. Andrews, A. Ostendorf, A.J. Bain, J.M. Nunzi (Eds.), SPIE, 2018.","chicago":"Xuereb, André, Matteo Aquilina, and Shabir Barzanjeh. “Routing Thermal Noise through Quantum Networks.” edited by D L Andrews, A Ostendorf, A J Bain, and J M Nunzi, Vol. 10672. SPIE, 2018. https://doi.org/10.1117/12.2309928."},"date_published":"2018-05-04T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"04"},{"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1126/science.aao0980","isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000452994400048"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1126/science.aao0980"}],"volume":362,"date_updated":"2023-09-18T08:11:56Z","date_created":"2018-12-19T14:53:50Z","author":[{"first_name":"Kenneth","last_name":"Gotlieb","full_name":"Gotlieb, Kenneth"},{"first_name":"Chiu-Yun","last_name":"Lin","full_name":"Lin, Chiu-Yun"},{"first_name":"Maksym","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym"},{"full_name":"Zhang, Wentao","last_name":"Zhang","first_name":"Wentao"},{"full_name":"Smallwood, Christopher L.","first_name":"Christopher L.","last_name":"Smallwood"},{"full_name":"Jozwiak, Christopher","last_name":"Jozwiak","first_name":"Christopher"},{"full_name":"Eisaki, Hiroshi","last_name":"Eisaki","first_name":"Hiroshi"},{"full_name":"Hussain, Zahid","first_name":"Zahid","last_name":"Hussain"},{"full_name":"Vishwanath, Ashvin","last_name":"Vishwanath","first_name":"Ashvin"},{"last_name":"Lanzara","first_name":"Alessandra","full_name":"Lanzara, Alessandra"}],"publisher":"American Association for the Advancement of Science","department":[{"_id":"MaSe"}],"publication_status":"published","year":"2018","acknowledgement":" M.S. was supported by the Gordon and Betty Moore Foundation s EPiQS Initiative through grant GBMF4307","article_processing_charge":"No","day":"14","scopus_import":"1","date_published":"2018-12-14T00:00:00Z","page":"1271-1275","article_type":"original","citation":{"chicago":"Gotlieb, Kenneth, Chiu-Yun Lin, Maksym Serbyn, Wentao Zhang, Christopher L. Smallwood, Christopher Jozwiak, Hiroshi Eisaki, Zahid Hussain, Ashvin Vishwanath, and Alessandra Lanzara. “Revealing Hidden Spin-Momentum Locking in a High-Temperature Cuprate Superconductor.” Science. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/science.aao0980.","short":"K. Gotlieb, C.-Y. Lin, M. Serbyn, W. Zhang, C.L. Smallwood, C. Jozwiak, H. Eisaki, Z. Hussain, A. Vishwanath, A. Lanzara, Science 362 (2018) 1271–1275.","mla":"Gotlieb, Kenneth, et al. “Revealing Hidden Spin-Momentum Locking in a High-Temperature Cuprate Superconductor.” Science, vol. 362, no. 6420, American Association for the Advancement of Science, 2018, pp. 1271–75, doi:10.1126/science.aao0980.","apa":"Gotlieb, K., Lin, C.-Y., Serbyn, M., Zhang, W., Smallwood, C. L., Jozwiak, C., … Lanzara, A. (2018). Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao0980","ieee":"K. Gotlieb et al., “Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor,” Science, vol. 362, no. 6420. American Association for the Advancement of Science, pp. 1271–1275, 2018.","ista":"Gotlieb K, Lin C-Y, Serbyn M, Zhang W, Smallwood CL, Jozwiak C, Eisaki H, Hussain Z, Vishwanath A, Lanzara A. 2018. Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor. Science. 362(6420), 1271–1275.","ama":"Gotlieb K, Lin C-Y, Serbyn M, et al. Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor. Science. 2018;362(6420):1271-1275. doi:10.1126/science.aao0980"},"publication":"Science","issue":"6420","abstract":[{"text":"Cuprate superconductors have long been thought of as having strong electronic correlations but negligible spin-orbit coupling. Using spin- and angle-resolved photoemission spectroscopy, we discovered that one of the most studied cuprate superconductors, Bi2212, has a nontrivial spin texture with a spin-momentum locking that circles the Brillouin zone center and a spin-layer locking that allows states of opposite spin to be localized in different parts of the unit cell. Our findings pose challenges for the vast majority of models of cuprates, such as the Hubbard model and its variants, where spin-orbit interaction has been mostly neglected, and open the intriguing question of how the high-temperature superconducting state emerges in the presence of this nontrivial spin texture. ","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","intvolume":" 362","title":"Revealing hidden spin-momentum locking in a high-temperature cuprate superconductor","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5767"},{"citation":{"short":"M. Kaucka, J. Petersen, M. Tesarova, B. Szarowska, M. Kastriti, M. Xie, A. Kicheva, K. Annusver, M. Kasper, O. Symmons, L. Pan, F. Spitz, J. Kaiser, M. Hovorakova, T. Zikmund, K. Sunadome, M.P. Matise, H. Wang, U. Marklund, H. Abdo, P. Ernfors, P. Maire, M. Wurmser, A.S. Chagin, K. Fried, I. Adameyko, ELife 7 (2018).","mla":"Kaucka, Marketa, et al. “Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” ELife, vol. 7, e34465, eLife Sciences Publications, 2018, doi:10.7554/eLife.34465.","chicago":"Kaucka, Marketa, Julian Petersen, Marketa Tesarova, Bara Szarowska, Maria Kastriti, Meng Xie, Anna Kicheva, et al. “Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.34465.","ama":"Kaucka M, Petersen J, Tesarova M, et al. Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. eLife. 2018;7. doi:10.7554/eLife.34465","apa":"Kaucka, M., Petersen, J., Tesarova, M., Szarowska, B., Kastriti, M., Xie, M., … Adameyko, I. (2018). Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.34465","ieee":"M. Kaucka et al., “Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage,” eLife, vol. 7. eLife Sciences Publications, 2018.","ista":"Kaucka M, Petersen J, Tesarova M, Szarowska B, Kastriti M, Xie M, Kicheva A, Annusver K, Kasper M, Symmons O, Pan L, Spitz F, Kaiser J, Hovorakova M, Zikmund T, Sunadome K, Matise MP, Wang H, Marklund U, Abdo H, Ernfors P, Maire P, Wurmser M, Chagin AS, Fried K, Adameyko I. 2018. Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. eLife. 7, e34465."},"publication":"eLife","date_published":"2018-06-13T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"13","intvolume":" 7","status":"public","title":"Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage","ddc":["571"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"162","oa_version":"Published Version","file":[{"file_name":"2018_eLife_Kaucka.pdf","access_level":"open_access","creator":"dernst","file_size":9816484,"content_type":"application/pdf","file_id":"5727","relation":"main_file","date_created":"2018-12-17T16:41:58Z","date_updated":"2020-07-14T12:45:07Z","checksum":"da2378cdcf6b5461dcde194e4d608343"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Facial shape is the basis for facial recognition and categorization. Facial features reflect the underlying geometry of the skeletal structures. Here, we reveal that cartilaginous nasal capsule (corresponding to upper jaw and face) is shaped by signals generated by neural structures: brain and olfactory epithelium. Brain-derived Sonic Hedgehog (SHH) enables the induction of nasal septum and posterior nasal capsule, whereas the formation of a capsule roof is controlled by signals from the olfactory epithelium. Unexpectedly, the cartilage of the nasal capsule turned out to be important for shaping membranous facial bones during development. This suggests that conserved neurosensory structures could benefit from protection and have evolved signals inducing cranial cartilages encasing them. Experiments with mutant mice revealed that the genomic regulatory regions controlling production of SHH in the nervous system contribute to facial cartilage morphogenesis, which might be a mechanism responsible for the adaptive evolution of animal faces and snouts."}],"project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037","call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord"}],"quality_controlled":"1","isi":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"},"oa":1,"external_id":{"isi":["000436227500001"]},"language":[{"iso":"eng"}],"doi":"10.7554/eLife.34465","month":"06","publisher":"eLife Sciences Publications","department":[{"_id":"AnKi"}],"publication_status":"published","year":"2018","volume":7,"date_created":"2018-12-11T11:44:57Z","date_updated":"2023-09-18T09:29:07Z","related_material":{"record":[{"id":"9838","relation":"research_data","status":"public"}]},"author":[{"last_name":"Kaucka","first_name":"Marketa","full_name":"Kaucka, Marketa"},{"last_name":"Petersen","first_name":"Julian","full_name":"Petersen, Julian"},{"first_name":"Marketa","last_name":"Tesarova","full_name":"Tesarova, Marketa"},{"first_name":"Bara","last_name":"Szarowska","full_name":"Szarowska, Bara"},{"first_name":"Maria","last_name":"Kastriti","full_name":"Kastriti, Maria"},{"first_name":"Meng","last_name":"Xie","full_name":"Xie, Meng"},{"orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna","full_name":"Kicheva, Anna"},{"full_name":"Annusver, Karl","first_name":"Karl","last_name":"Annusver"},{"first_name":"Maria","last_name":"Kasper","full_name":"Kasper, Maria"},{"full_name":"Symmons, Orsolya","last_name":"Symmons","first_name":"Orsolya"},{"first_name":"Leslie","last_name":"Pan","full_name":"Pan, Leslie"},{"full_name":"Spitz, Francois","first_name":"Francois","last_name":"Spitz"},{"full_name":"Kaiser, Jozef","last_name":"Kaiser","first_name":"Jozef"},{"last_name":"Hovorakova","first_name":"Maria","full_name":"Hovorakova, Maria"},{"last_name":"Zikmund","first_name":"Tomas","full_name":"Zikmund, Tomas"},{"first_name":"Kazunori","last_name":"Sunadome","full_name":"Sunadome, Kazunori"},{"full_name":"Matise, Michael P","last_name":"Matise","first_name":"Michael P"},{"last_name":"Wang","first_name":"Hui","full_name":"Wang, Hui"},{"last_name":"Marklund","first_name":"Ulrika","full_name":"Marklund, Ulrika"},{"first_name":"Hind","last_name":"Abdo","full_name":"Abdo, Hind"},{"full_name":"Ernfors, Patrik","last_name":"Ernfors","first_name":"Patrik"},{"last_name":"Maire","first_name":"Pascal","full_name":"Maire, Pascal"},{"first_name":"Maud","last_name":"Wurmser","full_name":"Wurmser, Maud"},{"last_name":"Chagin","first_name":"Andrei S","full_name":"Chagin, Andrei S"},{"full_name":"Fried, Kaj","last_name":"Fried","first_name":"Kaj"},{"last_name":"Adameyko","first_name":"Igor","full_name":"Adameyko, Igor"}],"article_number":"e34465","ec_funded":1,"publist_id":"7759","file_date_updated":"2020-07-14T12:45:07Z"},{"page":"451 - 467","citation":{"ista":"Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821, 451–467.","ieee":"B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.","apa":"Cohen, B., & Pietrzak, K. Z. (2018). Simple proofs of sequential work (Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_15","ama":"Cohen B, Pietrzak KZ. Simple proofs of sequential work. In: Vol 10821. Springer; 2018:451-467. doi:10.1007/978-3-319-78375-8_15","chicago":"Cohen, Bram, and Krzysztof Z Pietrzak. “Simple Proofs of Sequential Work,” 10821:451–67. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_15.","mla":"Cohen, Bram, and Krzysztof Z. Pietrzak. Simple Proofs of Sequential Work. Vol. 10821, Springer, 2018, pp. 451–67, doi:10.1007/978-3-319-78375-8_15.","short":"B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467."},"date_published":"2018-05-29T00:00:00Z","scopus_import":"1","day":"29","article_processing_charge":"No","status":"public","title":"Simple proofs of sequential work","intvolume":" 10821","_id":"302","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"At ITCS 2013, Mahmoody, Moran and Vadhan [MMV13] introduce and construct publicly verifiable proofs of sequential work, which is a protocol for proving that one spent sequential computational work related to some statement. The original motivation for such proofs included non-interactive time-stamping and universally verifiable CPU benchmarks. A more recent application, and our main motivation, are blockchain designs, where proofs of sequential work can be used – in combination with proofs of space – as a more ecological and economical substitute for proofs of work which are currently used to secure Bitcoin and other cryptocurrencies. The construction proposed by [MMV13] is based on a hash function and can be proven secure in the random oracle model, or assuming inherently sequential hash-functions, which is a new standard model assumption introduced in their work. In a proof of sequential work, a prover gets a “statement” χ, a time parameter N and access to a hash-function H, which for the security proof is modelled as a random oracle. Correctness requires that an honest prover can make a verifier accept making only N queries to H, while soundness requires that any prover who makes the verifier accept must have made (almost) N sequential queries to H. Thus a solution constitutes a proof that N time passed since χ was received. Solutions must be publicly verifiable in time at most polylogarithmic in N. The construction of [MMV13] is based on “depth-robust” graphs, and as a consequence has rather poor concrete parameters. But the major drawback is that the prover needs not just N time, but also N space to compute a proof. In this work we propose a proof of sequential work which is much simpler, more efficient and achieves much better concrete bounds. Most importantly, the space required can be as small as log (N) (but we get better soundness using slightly more memory than that). An open problem stated by [MMV13] that our construction does not solve either is achieving a “unique” proof, where even a cheating prover can only generate a single accepting proof. This property would be extremely useful for applications to blockchains."}],"quality_controlled":"1","isi":1,"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"external_id":{"isi":["000517098700015"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/183.pdf"}],"language":[{"iso":"eng"}],"conference":{"location":"Tel Aviv, Israel","start_date":"2018-04-29","end_date":"2018-05-03","name":"Eurocrypt: Advances in Cryptology"},"doi":"10.1007/978-3-319-78375-8_15","month":"05","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","year":"2018","date_created":"2018-12-11T11:45:42Z","date_updated":"2023-09-18T09:29:33Z","volume":10821,"author":[{"full_name":"Cohen, Bram","last_name":"Cohen","first_name":"Bram"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"ec_funded":1,"publist_id":"7579"},{"publist_id":"8024","ec_funded":1,"article_number":"042410","date_updated":"2023-09-18T09:18:44Z","date_created":"2018-12-11T11:44:15Z","volume":98,"author":[{"last_name":"Ferrari","first_name":"Ulisse","full_name":"Ferrari, Ulisse"},{"full_name":"Deny, Stephane","first_name":"Stephane","last_name":"Deny"},{"first_name":"Matthew J","last_name":"Chalk","full_name":"Chalk, Matthew J"},{"first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"first_name":"Olivier","last_name":"Marre","full_name":"Marre, Olivier"},{"full_name":"Mora, Thierry","last_name":"Mora","first_name":"Thierry"}],"publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"American Physical Society","acknowledgement":"This work was supported by ANR Trajectory, the French State program Investissements d’Avenir managed by the Agence Nationale de la Recherche (LIFESENSES; ANR-10-LABX-65), EC Grant No. H2020-785907 from the Human Brain Project, NIH Grant No. U01NS090501, and an AVIESAN-UNADEV grant to O.M. M.C. was supported by the Agence Nationale de la Recherche Jeune Chercheur/Jeune Chercheuse grant (ANR-17-CE37-0013).","year":"2018","month":"10","publication_identifier":{"issn":["24700045"]},"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.98.042410","isi":1,"quality_controlled":"1","project":[{"_id":"26436750-B435-11E9-9278-68D0E5697425","grant_number":"785907","name":"Human Brain Project Specific Grant Agreement 2 (HBP SGA 2)","call_identifier":"H2020"}],"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/243816v2.full"}],"oa":1,"external_id":{"isi":["000447486100004"]},"abstract":[{"lang":"eng","text":"Correlations in sensory neural networks have both extrinsic and intrinsic origins. Extrinsic or stimulus correlations arise from shared inputs to the network and, thus, depend strongly on the stimulus ensemble. Intrinsic or noise correlations reflect biophysical mechanisms of interactions between neurons, which are expected to be robust to changes in the stimulus ensemble. Despite the importance of this distinction for understanding how sensory networks encode information collectively, no method exists to reliably separate intrinsic interactions from extrinsic correlations in neural activity data, limiting our ability to build predictive models of the network response. In this paper we introduce a general strategy to infer population models of interacting neurons that collectively encode stimulus information. The key to disentangling intrinsic from extrinsic correlations is to infer the couplings between neurons separately from the encoding model and to combine the two using corrections calculated in a mean-field approximation. We demonstrate the effectiveness of this approach in retinal recordings. The same coupling network is inferred from responses to radically different stimulus ensembles, showing that these couplings indeed reflect stimulus-independent interactions between neurons. The inferred model predicts accurately the collective response of retinal ganglion cell populations as a function of the stimulus."}],"issue":"4","type":"journal_article","oa_version":"Preprint","status":"public","title":"Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons","intvolume":" 98","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"31","day":"17","article_processing_charge":"No","scopus_import":"1","date_published":"2018-10-17T00:00:00Z","article_type":"original","publication":"Physical Review E","citation":{"chicago":"Ferrari, Ulisse, Stephane Deny, Matthew J Chalk, Gašper Tkačik, Olivier Marre, and Thierry Mora. “Separating Intrinsic Interactions from Extrinsic Correlations in a Network of Sensory Neurons.” Physical Review E. American Physical Society, 2018. https://doi.org/10.1103/PhysRevE.98.042410.","mla":"Ferrari, Ulisse, et al. “Separating Intrinsic Interactions from Extrinsic Correlations in a Network of Sensory Neurons.” Physical Review E, vol. 98, no. 4, 042410, American Physical Society, 2018, doi:10.1103/PhysRevE.98.042410.","short":"U. Ferrari, S. Deny, M.J. Chalk, G. Tkačik, O. Marre, T. Mora, Physical Review E 98 (2018).","ista":"Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. 2018. Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons. Physical Review E. 98(4), 042410.","ieee":"U. Ferrari, S. Deny, M. J. Chalk, G. Tkačik, O. Marre, and T. Mora, “Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons,” Physical Review E, vol. 98, no. 4. American Physical Society, 2018.","apa":"Ferrari, U., Deny, S., Chalk, M. J., Tkačik, G., Marre, O., & Mora, T. (2018). Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.042410","ama":"Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons. Physical Review E. 2018;98(4). doi:10.1103/PhysRevE.98.042410"}},{"page":"E8135 - E8142","article_type":"original","citation":{"chicago":"Kalinin, Nikita, Aldo Guzmán Sáenz, Y Prieto, Mikhail Shkolnikov, V Kalinina, and Ernesto Lupercio. “Self-Organized Criticality and Pattern Emergence through the Lens of Tropical Geometry.” PNAS: Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1805847115.","mla":"Kalinin, Nikita, et al. “Self-Organized Criticality and Pattern Emergence through the Lens of Tropical Geometry.” PNAS: Proceedings of the National Academy of Sciences of the United States of America, vol. 115, no. 35, National Academy of Sciences, 2018, pp. E8135–42, doi:10.1073/pnas.1805847115.","short":"N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, E. Lupercio, PNAS: Proceedings of the National Academy of Sciences of the United States of America 115 (2018) E8135–E8142.","ista":"Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E. 2018. Self-organized criticality and pattern emergence through the lens of tropical geometry. PNAS: Proceedings of the National Academy of Sciences of the United States of America. 115(35), E8135–E8142.","apa":"Kalinin, N., Guzmán Sáenz, A., Prieto, Y., Shkolnikov, M., Kalinina, V., & Lupercio, E. (2018). Self-organized criticality and pattern emergence through the lens of tropical geometry. PNAS: Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1805847115","ieee":"N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, and E. Lupercio, “Self-organized criticality and pattern emergence through the lens of tropical geometry,” PNAS: Proceedings of the National Academy of Sciences of the United States of America, vol. 115, no. 35. National Academy of Sciences, pp. E8135–E8142, 2018.","ama":"Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E. Self-organized criticality and pattern emergence through the lens of tropical geometry. PNAS: Proceedings of the National Academy of Sciences of the United States of America. 2018;115(35):E8135-E8142. doi:10.1073/pnas.1805847115"},"publication":"PNAS: Proceedings of the National Academy of Sciences of the United States of America","date_published":"2018-08-28T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"28","intvolume":" 115","status":"public","title":"Self-organized criticality and pattern emergence through the lens of tropical geometry","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"64","oa_version":"Preprint","type":"journal_article","issue":"35","abstract":[{"lang":"eng","text":"Tropical geometry, an established field in pure mathematics, is a place where string theory, mirror symmetry, computational algebra, auction theory, and so forth meet and influence one another. In this paper, we report on our discovery of a tropical model with self-organized criticality (SOC) behavior. Our model is continuous, in contrast to all known models of SOC, and is a certain scaling limit of the sandpile model, the first and archetypical model of SOC. We describe how our model is related to pattern formation and proportional growth phenomena and discuss the dichotomy between continuous and discrete models in several contexts. Our aim in this context is to present an idealized tropical toy model (cf. Turing reaction-diffusion model), requiring further investigation."}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","isi":1,"external_id":{"arxiv":["1806.09153"],"isi":["000442861600009"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.09153"}],"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1805847115","publication_identifier":{"issn":["00278424"]},"month":"08","publisher":"National Academy of Sciences","department":[{"_id":"TaHa"}],"publication_status":"published","year":"2018","volume":115,"date_created":"2018-12-11T11:44:26Z","date_updated":"2023-09-18T08:41:16Z","author":[{"full_name":"Kalinin, Nikita","first_name":"Nikita","last_name":"Kalinin"},{"full_name":"Guzmán Sáenz, Aldo","first_name":"Aldo","last_name":"Guzmán Sáenz"},{"first_name":"Y","last_name":"Prieto","full_name":"Prieto, Y"},{"last_name":"Shkolnikov","first_name":"Mikhail","orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87","full_name":"Shkolnikov, Mikhail"},{"first_name":"V","last_name":"Kalinina","full_name":"Kalinina, V"},{"full_name":"Lupercio, Ernesto","last_name":"Lupercio","first_name":"Ernesto"}],"ec_funded":1,"publist_id":"7990"},{"month":"06","day":"14","article_processing_charge":"No","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.f1s76f2"}],"citation":{"chicago":"Kaucka, Marketa, Julian Petersen, Marketa Tesarova, Bara Szarowska, Maria Eleni Kastriti, Meng Xie, Anna Kicheva, et al. “Data from: Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” Dryad, 2018. https://doi.org/10.5061/dryad.f1s76f2.","short":"M. Kaucka, J. Petersen, M. Tesarova, B. Szarowska, M.E. Kastriti, M. Xie, A. Kicheva, K. Annusver, M. Kasper, O. Symmons, L. Pan, F. Spitz, J. Kaiser, M. Hovorakova, T. Zikmund, K. Sunadome, M.P. Matise, H. Wang, U. Marklund, H. Abdo, P. Ernfors, P. Maire, M. Wurmser, A.S. Chagin, K. Fried, I. Adameyko, (2018).","mla":"Kaucka, Marketa, et al. Data from: Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage. Dryad, 2018, doi:10.5061/dryad.f1s76f2.","apa":"Kaucka, M., Petersen, J., Tesarova, M., Szarowska, B., Kastriti, M. E., Xie, M., … Adameyko, I. (2018). Data from: Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. Dryad. https://doi.org/10.5061/dryad.f1s76f2","ieee":"M. Kaucka et al., “Data from: Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage.” Dryad, 2018.","ista":"Kaucka M, Petersen J, Tesarova M, Szarowska B, Kastriti ME, Xie M, Kicheva A, Annusver K, Kasper M, Symmons O, Pan L, Spitz F, Kaiser J, Hovorakova M, Zikmund T, Sunadome K, Matise MP, Wang H, Marklund U, Abdo H, Ernfors P, Maire P, Wurmser M, Chagin AS, Fried K, Adameyko I. 2018. Data from: Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage, Dryad, 10.5061/dryad.f1s76f2.","ama":"Kaucka M, Petersen J, Tesarova M, et al. Data from: Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. 2018. doi:10.5061/dryad.f1s76f2"},"doi":"10.5061/dryad.f1s76f2","date_published":"2018-06-14T00:00:00Z","type":"research_data_reference","abstract":[{"text":"Facial shape is the basis for facial recognition and categorization. Facial features reflect the underlying geometry of the skeletal structures. Here we reveal that cartilaginous nasal capsule (corresponding to upper jaw and face) is shaped by signals generated by neural structures: brain and olfactory epithelium. Brain-derived Sonic Hedgehog (SHH) enables the induction of nasal septum and posterior nasal capsule, whereas the formation of a capsule roof is controlled by signals from the olfactory epithelium. Unexpectedly, the cartilage of the nasal capsule turned out to be important for shaping membranous facial bones during development. This suggests that conserved neurosensory structures could benefit from protection and have evolved signals inducing cranial cartilages encasing them. Experiments with mutant mice revealed that the genomic regulatory regions controlling production of SHH in the nervous system contribute to facial cartilage morphogenesis, which might be a mechanism responsible for the adaptive evolution of animal faces and snouts.","lang":"eng"}],"title":"Data from: Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage","status":"public","department":[{"_id":"AnKi"}],"publisher":"Dryad","_id":"9838","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","date_created":"2021-08-09T12:54:35Z","date_updated":"2023-09-18T09:29:07Z","oa_version":"Published Version","author":[{"last_name":"Kaucka","first_name":"Marketa","full_name":"Kaucka, Marketa"},{"first_name":"Julian","last_name":"Petersen","full_name":"Petersen, Julian"},{"first_name":"Marketa","last_name":"Tesarova","full_name":"Tesarova, Marketa"},{"last_name":"Szarowska","first_name":"Bara","full_name":"Szarowska, Bara"},{"last_name":"Kastriti","first_name":"Maria Eleni","full_name":"Kastriti, Maria Eleni"},{"last_name":"Xie","first_name":"Meng","full_name":"Xie, Meng"},{"last_name":"Kicheva","first_name":"Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna"},{"first_name":"Karl","last_name":"Annusver","full_name":"Annusver, Karl"},{"full_name":"Kasper, Maria","last_name":"Kasper","first_name":"Maria"},{"full_name":"Symmons, Orsolya","last_name":"Symmons","first_name":"Orsolya"},{"full_name":"Pan, Leslie","first_name":"Leslie","last_name":"Pan"},{"last_name":"Spitz","first_name":"Francois","full_name":"Spitz, Francois"},{"last_name":"Kaiser","first_name":"Jozef","full_name":"Kaiser, Jozef"},{"full_name":"Hovorakova, Maria","first_name":"Maria","last_name":"Hovorakova"},{"first_name":"Tomas","last_name":"Zikmund","full_name":"Zikmund, Tomas"},{"full_name":"Sunadome, Kazunori","last_name":"Sunadome","first_name":"Kazunori"},{"full_name":"Matise, Michael P","first_name":"Michael P","last_name":"Matise"},{"last_name":"Wang","first_name":"Hui","full_name":"Wang, Hui"},{"full_name":"Marklund, Ulrika","first_name":"Ulrika","last_name":"Marklund"},{"full_name":"Abdo, Hind","last_name":"Abdo","first_name":"Hind"},{"full_name":"Ernfors, Patrik","last_name":"Ernfors","first_name":"Patrik"},{"full_name":"Maire, Pascal","first_name":"Pascal","last_name":"Maire"},{"full_name":"Wurmser, Maud","first_name":"Maud","last_name":"Wurmser"},{"full_name":"Chagin, Andrei S","first_name":"Andrei S","last_name":"Chagin"},{"full_name":"Fried, Kaj","last_name":"Fried","first_name":"Kaj"},{"full_name":"Adameyko, Igor","last_name":"Adameyko","first_name":"Igor"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"162"}]}},{"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"19","citation":{"ista":"Luján R, Aguado C, Ciruela F, Arus X, Martín Belmonte A, Alfaro Ruiz R, Martinez Gomez J, De La Ossa L, Watanabe M, Adelman J, Shigemoto R, Fukazawa Y. 2018. Sk2 channels associate with mGlu1α receptors and CaV2.1 channels in Purkinje cells. Frontiers in Cellular Neuroscience. 12, 311.","apa":"Luján, R., Aguado, C., Ciruela, F., Arus, X., Martín Belmonte, A., Alfaro Ruiz, R., … Fukazawa, Y. (2018). Sk2 channels associate with mGlu1α receptors and CaV2.1 channels in Purkinje cells. Frontiers in Cellular Neuroscience. Frontiers Media. https://doi.org/10.3389/fncel.2018.00311","ieee":"R. Luján et al., “Sk2 channels associate with mGlu1α receptors and CaV2.1 channels in Purkinje cells,” Frontiers in Cellular Neuroscience, vol. 12. Frontiers Media, 2018.","ama":"Luján R, Aguado C, Ciruela F, et al. Sk2 channels associate with mGlu1α receptors and CaV2.1 channels in Purkinje cells. Frontiers in Cellular Neuroscience. 2018;12. doi:10.3389/fncel.2018.00311","chicago":"Luján, Rafæl, Carolina Aguado, Francisco Ciruela, Xavier Arus, Alejandro Martín Belmonte, Rocío Alfaro Ruiz, Jesus Martinez Gomez, et al. “Sk2 Channels Associate with MGlu1α Receptors and CaV2.1 Channels in Purkinje Cells.” Frontiers in Cellular Neuroscience. Frontiers Media, 2018. https://doi.org/10.3389/fncel.2018.00311.","mla":"Luján, Rafæl, et al. “Sk2 Channels Associate with MGlu1α Receptors and CaV2.1 Channels in Purkinje Cells.” Frontiers in Cellular Neuroscience, vol. 12, 311, Frontiers Media, 2018, doi:10.3389/fncel.2018.00311.","short":"R. Luján, C. Aguado, F. Ciruela, X. Arus, A. Martín Belmonte, R. Alfaro Ruiz, J. Martinez Gomez, L. De La Ossa, M. Watanabe, J. Adelman, R. Shigemoto, Y. Fukazawa, Frontiers in Cellular Neuroscience 12 (2018)."},"publication":"Frontiers in Cellular Neuroscience","article_type":"original","date_published":"2018-09-19T00:00:00Z","type":"journal_article","abstract":[{"text":"The small-conductance, Ca2+-activated K+ (SK) channel subtype SK2 regulates the spike rate and firing frequency, as well as Ca2+ transients in Purkinje cells (PCs). To understand the molecular basis by which SK2 channels mediate these functions, we analyzed the exact location and densities of SK2 channels along the neuronal surface of the mouse cerebellar PCs using SDS-digested freeze-fracture replica labeling (SDS-FRL) of high sensitivity combined with quantitative analyses. Immunogold particles for SK2 were observed on post- and pre-synaptic compartments showing both scattered and clustered distribution patterns. We found an axo-somato-dendritic gradient of the SK2 particle density increasing 12-fold from soma to dendritic spines. Using two different immunogold approaches, we also found that SK2 immunoparticles were frequently adjacent to, but never overlap with, the postsynaptic density of excitatory synapses in PC spines. Co-immunoprecipitation analysis demonstrated that SK2 channels form macromolecular complexes with two types of proteins that mobilize Ca2+: CaV2.1 channels and mGlu1α receptors in the cerebellum. Freeze-fracture replica double-labeling showed significant co-clustering of particles for SK2 with those for CaV2.1 channels and mGlu1α receptors. SK2 channels were also detected at presynaptic sites, mostly at the presynaptic active zone (AZ), where they are close to CaV2.1 channels, though they are not significantly co-clustered. These data demonstrate that SK2 channels located in different neuronal compartments can associate with distinct proteins mobilizing Ca2+, and suggest that the ultrastructural association of SK2 with CaV2.1 and mGlu1α provides the mechanism that ensures voltage (excitability) regulation by distinct intracellular Ca2+ transients in PCs.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"41","intvolume":" 12","title":"Sk2 channels associate with mGlu1α receptors and CaV2.1 channels in Purkinje cells","status":"public","ddc":["570"],"file":[{"file_id":"5684","relation":"main_file","date_updated":"2020-07-14T12:46:23Z","date_created":"2018-12-17T08:49:03Z","checksum":"0bcaec8d596162af0b7fe3f31325d480","file_name":"fncel-12-00311.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":6834251}],"oa_version":"Published Version","publication_identifier":{"issn":["16625102"]},"month":"09","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"},"external_id":{"isi":["000445090100002"]},"oa":1,"project":[{"grant_number":"720270","_id":"25CBA828-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)"}],"quality_controlled":"1","isi":1,"doi":"10.3389/fncel.2018.00311","language":[{"iso":"eng"}],"article_number":"311","publist_id":"8013","ec_funded":1,"file_date_updated":"2020-07-14T12:46:23Z","year":"2018","publisher":"Frontiers Media","department":[{"_id":"RySh"}],"publication_status":"published","author":[{"full_name":"Luján, Rafæl","last_name":"Luján","first_name":"Rafæl"},{"full_name":"Aguado, Carolina","first_name":"Carolina","last_name":"Aguado"},{"first_name":"Francisco","last_name":"Ciruela","full_name":"Ciruela, Francisco"},{"last_name":"Arus","first_name":"Xavier","full_name":"Arus, Xavier"},{"full_name":"Martín Belmonte, Alejandro","last_name":"Martín Belmonte","first_name":"Alejandro"},{"last_name":"Alfaro Ruiz","first_name":"Rocío","full_name":"Alfaro Ruiz, Rocío"},{"full_name":"Martinez Gomez, Jesus","last_name":"Martinez Gomez","first_name":"Jesus"},{"first_name":"Luis","last_name":"De La Ossa","full_name":"De La Ossa, Luis"},{"full_name":"Watanabe, Masahiko","first_name":"Masahiko","last_name":"Watanabe"},{"full_name":"Adelman, John","last_name":"Adelman","first_name":"John"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"full_name":"Fukazawa, Yugo","first_name":"Yugo","last_name":"Fukazawa"}],"volume":12,"date_updated":"2023-09-18T09:31:18Z","date_created":"2018-12-11T11:44:19Z"},{"publication_identifier":{"issn":["15306984"]},"month":"10","project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497","_id":"25517E86-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000451102100064"],"pmid":["30359041"]},"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,"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"doi":"10.1021/acs.nanolett.8b03217","publist_id":"8032","ec_funded":1,"file_date_updated":"2020-07-14T12:45:37Z","department":[{"_id":"GeKa"}],"publisher":"American Chemical Society","publication_status":"published","pmid":1,"year":"2018","volume":18,"date_created":"2018-12-11T11:44:13Z","date_updated":"2023-09-18T09:30:37Z","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"id":"69","relation":"dissertation_contains","status":"public"},{"id":"7996","status":"public","relation":"dissertation_contains"}]},"author":[{"orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","last_name":"Vukušić","first_name":"Lada","full_name":"Vukušić, Lada"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","last_name":"Kukucka","first_name":"Josip"},{"first_name":"Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes"},{"full_name":"Milem, Joshua M","id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87","last_name":"Milem","first_name":"Joshua M"},{"full_name":"Schäffler, Friedrich","last_name":"Schäffler","first_name":"Friedrich"},{"full_name":"Katsaros, Georgios","last_name":"Katsaros","first_name":"Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"25","page":"7141 - 7145","citation":{"ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217","ieee":"L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros, “Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018.","apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., & Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217","ista":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018. Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.","chicago":"Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217."},"publication":"Nano Letters","date_published":"2018-10-25T00:00:00Z","type":"journal_article","issue":"11","abstract":[{"text":"The strong atomistic spin–orbit coupling of holes makes single-shot spin readout measurements difficult because it reduces the spin lifetimes. By integrating the charge sensor into a high bandwidth radio frequency reflectometry setup, we were able to demonstrate single-shot readout of a germanium quantum dot hole spin and measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT are reported, with a total readout visibility of about 70%. By analyzing separately the spin-to-charge conversion and charge readout fidelities, we have obtained insight into the processes limiting the visibilities of hole spins. The analyses suggest that high hole visibilities are feasible at realistic experimental conditions, underlying the potential of hole spins for the realization of viable qubit devices.","lang":"eng"}],"intvolume":" 18","title":"Single-shot readout of hole spins in Ge","ddc":["530"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"23","oa_version":"Published Version","file":[{"checksum":"3e6034a94c6b5335e939145d88bdb371","date_created":"2018-12-12T10:16:08Z","date_updated":"2020-07-14T12:45:37Z","file_id":"5194","relation":"main_file","creator":"system","file_size":1361441,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf"}],"pubrep_id":"1065"},{"citation":{"ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479.","apa":"Gilad, E., Brown, T. A., Oskin, M., & Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. https://doi.org/10.1007/978-3-319-96983-1_33","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:10.1007/978-3-319-96983-1_33","chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. https://doi.org/10.1007/978-3-319-96983-1_33.","mla":"Gilad, Eran, et al. Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. Vol. 11014, Springer, 2018, pp. 465–79, doi:10.1007/978-3-319-96983-1_33.","short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479."},"page":"465 - 479","date_published":"2018-08-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"85","intvolume":" 11014","title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","ddc":["000"],"status":"public","oa_version":"Preprint","file":[{"file_size":665372,"content_type":"application/pdf","creator":"dernst","file_name":"2018_Brown.pdf","access_level":"open_access","date_created":"2019-02-12T07:40:40Z","date_updated":"2020-07-14T12:48:14Z","checksum":"13a3f250be8878405e791b53c19722ad","relation":"main_file","file_id":"5954"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use.","lang":"eng"}],"external_id":{"isi":["000851042300031"]},"oa":1,"project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","doi":"10.1007/978-3-319-96983-1_33","conference":{"name":"Euro-Par: European Conference on Parallel Processing","location":"Turin, Italy","start_date":"2018-08-27","end_date":"2018-08-31"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["03029743"]},"month":"08","acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","year":"2018","publisher":"Springer","department":[{"_id":"DaAl"}],"publication_status":"published","author":[{"first_name":"Eran","last_name":"Gilad","full_name":"Gilad, Eran"},{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","last_name":"Brown","full_name":"Brown, Trevor A"},{"first_name":"Mark","last_name":"Oskin","full_name":"Oskin, Mark"},{"full_name":"Etsion, Yoav","last_name":"Etsion","first_name":"Yoav"}],"volume":11014,"date_updated":"2023-09-18T09:32:36Z","date_created":"2018-12-11T11:44:33Z","publist_id":"7969","file_date_updated":"2020-07-14T12:48:14Z"},{"issue":"10","abstract":[{"text":"Many-body quantum systems typically display fast dynamics and ballistic spreading of information. Here we address the open problem of how slow the dynamics can be after a generic breaking of integrability by local interactions. We develop a method based on degenerate perturbation theory that reveals slow dynamical regimes and delocalization processes in general translation invariant models, along with accurate estimates of their delocalization time scales. Our results shed light on the fundamental questions of the robustness of quantum integrable systems and the possibility of many-body localization without disorder. As an example, we construct a large class of one-dimensional lattice models where, despite the absence of asymptotic localization, the transient dynamics is exceptionally slow, i.e., the dynamics is indistinguishable from that of many-body localized systems for the system sizes and time scales accessible in experiments and numerical simulations.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 97","status":"public","title":"Slow dynamics in translation-invariant quantum lattice models","_id":"327","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"19","scopus_import":"1","date_published":"2018-03-19T00:00:00Z","citation":{"ama":"Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. Slow dynamics in translation-invariant quantum lattice models. Physical Review B. 2018;97(10). doi:10.1103/PhysRevB.97.104307","apa":"Michailidis, A., Žnidarič, M., Medvedyeva, M., Abanin, D., Prosen, T., & Papić, Z. (2018). Slow dynamics in translation-invariant quantum lattice models. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.97.104307","ieee":"A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, and Z. Papić, “Slow dynamics in translation-invariant quantum lattice models,” Physical Review B, vol. 97, no. 10. American Physical Society, 2018.","ista":"Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. 2018. Slow dynamics in translation-invariant quantum lattice models. Physical Review B. 97(10), 104307.","short":"A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, Z. Papić, Physical Review B 97 (2018).","mla":"Michailidis, Alexios, et al. “Slow Dynamics in Translation-Invariant Quantum Lattice Models.” Physical Review B, vol. 97, no. 10, 104307, American Physical Society, 2018, doi:10.1103/PhysRevB.97.104307.","chicago":"Michailidis, Alexios, Marko Žnidarič, Mariya Medvedyeva, Dmitry Abanin, Tomaž Prosen, and Zlatko Papić. “Slow Dynamics in Translation-Invariant Quantum Lattice Models.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.97.104307."},"publication":"Physical Review B","publist_id":"7538","article_number":"104307","volume":97,"date_created":"2018-12-11T11:45:50Z","date_updated":"2023-09-18T09:31:46Z","author":[{"full_name":"Michailidis, Alexios","orcid":"0000-0002-8443-1064","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","last_name":"Michailidis","first_name":"Alexios"},{"last_name":"Žnidarič","first_name":"Marko","full_name":"Žnidarič, Marko"},{"last_name":"Medvedyeva","first_name":"Mariya","full_name":"Medvedyeva, Mariya"},{"full_name":"Abanin, Dmitry","first_name":"Dmitry","last_name":"Abanin"},{"first_name":"Tomaž","last_name":"Prosen","full_name":"Prosen, Tomaž"},{"full_name":"Papić, Zlatko","first_name":"Zlatko","last_name":"Papić"}],"department":[{"_id":"MaSe"}],"publisher":"American Physical Society","publication_status":"published","year":"2018","acknowledgement":"We thank F. Huveneers for useful discussions. Z.P. and A.M. acknowledge support by EPSRC Grant No. EP/P009409/1 and and the Royal Society Research Grant No. RG160635. Statement of compliance with EPSRC policy framework on research data: This publication is theoretical work that does not require supporting research data. D.A. acknowledges support by the Swiss National Science Foundation. M.Z., M.M. and T.P. acknowledge Grants J1-7279 (M.Z.) and N1-0025 (M.M. and T.P.) of Slovenian Research Agency, and Advanced Grant of European Research Council, Grant No. 694544 - OMNES (T.P.).","month":"03","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevB.97.104307","isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1706.05026"}],"external_id":{"isi":["000427798800005"]},"oa":1},{"page":"11031-11070","publication":"Ecology and Evolution","citation":{"apa":"Viljakainen, L., Jurvansuu, J., Holmberg, I., Pamminger, T., Erler, S., & Cremer, S. (2018). Social environment affects the transcriptomic response to bacteria in ant queens. Ecology and Evolution. Wiley. https://doi.org/10.1002/ece3.4573","ieee":"L. Viljakainen, J. Jurvansuu, I. Holmberg, T. Pamminger, S. Erler, and S. Cremer, “Social environment affects the transcriptomic response to bacteria in ant queens,” Ecology and Evolution, vol. 8, no. 22. Wiley, pp. 11031–11070, 2018.","ista":"Viljakainen L, Jurvansuu J, Holmberg I, Pamminger T, Erler S, Cremer S. 2018. Social environment affects the transcriptomic response to bacteria in ant queens. Ecology and Evolution. 8(22), 11031–11070.","ama":"Viljakainen L, Jurvansuu J, Holmberg I, Pamminger T, Erler S, Cremer S. Social environment affects the transcriptomic response to bacteria in ant queens. Ecology and Evolution. 2018;8(22):11031-11070. doi:10.1002/ece3.4573","chicago":"Viljakainen, Lumi, Jaana Jurvansuu, Ida Holmberg, Tobias Pamminger, Silvio Erler, and Sylvia Cremer. “Social Environment Affects the Transcriptomic Response to Bacteria in Ant Queens.” Ecology and Evolution. Wiley, 2018. https://doi.org/10.1002/ece3.4573.","short":"L. Viljakainen, J. Jurvansuu, I. Holmberg, T. Pamminger, S. Erler, S. Cremer, Ecology and Evolution 8 (2018) 11031–11070.","mla":"Viljakainen, Lumi, et al. “Social Environment Affects the Transcriptomic Response to Bacteria in Ant Queens.” Ecology and Evolution, vol. 8, no. 22, Wiley, 2018, pp. 11031–70, doi:10.1002/ece3.4573."},"date_published":"2018-11-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","title":"Social environment affects the transcriptomic response to bacteria in ant queens","ddc":["576","591"],"status":"public","intvolume":" 8","_id":"29","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5682","checksum":"0d1355c78627ca7210aadd9a17a01915","date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-17T08:27:04Z","access_level":"open_access","file_name":"Viljakainen_et_al-2018-Ecology_and_Evolution.pdf","file_size":1272096,"content_type":"application/pdf","creator":"dernst"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Social insects have evolved enormous capacities to collectively build nests and defend their colonies against both predators and pathogens. The latter is achieved by a combination of individual immune responses and sophisticated collective behavioral and organizational disease defenses, that is, social immunity. We investigated how the presence or absence of these social defense lines affects individual-level immunity in ant queens after bacterial infection. To this end, we injected queens of the ant Linepithema humile with a mix of gram+ and gram− bacteria or a control solution, reared them either with workers or alone and analyzed their gene expression patterns at 2, 4, 8, and 12 hr post-injection, using RNA-seq. This allowed us to test for the effect of bacterial infection, social context, as well as the interaction between the two over the course of infection and raising of an immune response. We found that social isolation per se affected queen gene expression for metabolism genes, but not for immune genes. When infected, queens reared with and without workers up-regulated similar numbers of innate immune genes revealing activation of Toll and Imd signaling pathways and melanization. Interestingly, however, they mostly regulated different genes along the pathways and showed a different pattern of overall gene up-regulation or down-regulation. Hence, we can conclude that the absence of workers does not compromise the onset of an individual immune response by the queens, but that the social environment impacts the route of the individual innate immune responses."}],"issue":"22","isi":1,"quality_controlled":"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"},"oa":1,"external_id":{"isi":["000451611000032"]},"language":[{"iso":"eng"}],"doi":"10.1002/ece3.4573","month":"11","publication_identifier":{"issn":["20457758"]},"publication_status":"published","publisher":"Wiley","department":[{"_id":"SyCr"}],"year":"2018","date_created":"2018-12-11T11:44:15Z","date_updated":"2023-09-19T09:29:12Z","volume":8,"author":[{"full_name":"Viljakainen, Lumi","first_name":"Lumi","last_name":"Viljakainen"},{"full_name":"Jurvansuu, Jaana","last_name":"Jurvansuu","first_name":"Jaana"},{"last_name":"Holmberg","first_name":"Ida","full_name":"Holmberg, Ida"},{"full_name":"Pamminger, Tobias","last_name":"Pamminger","first_name":"Tobias"},{"full_name":"Erler, Silvio","last_name":"Erler","first_name":"Silvio"},{"full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:45:52Z","publist_id":"8026"},{"file_date_updated":"2020-07-14T12:44:50Z","publist_id":"7783","year":"2018","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"author":[{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"full_name":"Giacobbe, Mirco","first_name":"Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"related_material":{"record":[{"id":"6894","relation":"dissertation_contains","status":"public"}]},"date_updated":"2023-09-19T09:30:43Z","date_created":"2018-12-11T11:44:50Z","volume":10981,"month":"07","publication_identifier":{"issn":["03029743"]},"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"},"external_id":{"isi":["000491481600025"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2018-07-17","location":"Oxford, United Kingdom","start_date":"2018-07-14"},"doi":"10.1007/978-3-319-96145-3_25","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Reachability analysis is difficult for hybrid automata with affine differential equations, because the reach set needs to be approximated. Promising abstraction techniques usually employ interval methods or template polyhedra. Interval methods account for dense time and guarantee soundness, and there are interval-based tools that overapproximate affine flowpipes. But interval methods impose bounded and rigid shapes, which make refinement expensive and fixpoint detection difficult. Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded, but sound template refinement for unbounded reachability analysis has been implemented only for systems with piecewise constant dynamics. We capitalize on the advantages of both techniques, combining interval arithmetic and template polyhedra, using the former to abstract time and the latter to abstract space. During a CEGAR loop, whenever a spurious error trajectory is found, we compute additional space constraints and split time intervals, and use these space-time interpolants to eliminate the counterexample. Space-time interpolation offers a lazy, flexible framework for increasing precision while guaranteeing soundness, both for error avoidance and fixpoint detection. To the best of out knowledge, this is the first abstraction refinement scheme for the reachability analysis over unbounded and dense time of affine hybrid systems, which is both sound and automatic. We demonstrate the effectiveness of our algorithm with several benchmark examples, which cannot be handled by other tools.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"140","status":"public","title":"Space-time interpolants","ddc":["005"],"intvolume":" 10981","pubrep_id":"1010","oa_version":"Published Version","file":[{"creator":"system","file_size":563710,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf","checksum":"6dca832f575d6b3f0ea9dff56f579142","date_created":"2018-12-12T10:17:53Z","date_updated":"2020-07-14T12:44:50Z","file_id":"5310","relation":"main_file"}],"scopus_import":"1","day":"18","has_accepted_license":"1","article_processing_charge":"No","citation":{"chicago":"Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,” 10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.","short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.","mla":"Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer, 2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.","ieee":"G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.","apa":"Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25","ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:10.1007/978-3-319-96145-3_25"},"page":"468 - 486","date_published":"2018-07-18T00:00:00Z"},{"issue":"3","abstract":[{"text":"We give a lower bound on the ground state energy of a system of two fermions of one species interacting with two fermions of another species via point interactions. We show that there is a critical mass ratio m2 ≈ 0.58 such that the system is stable, i.e., the energy is bounded from below, for m∈[m2,m2−1]. So far it was not known whether this 2 + 2 system exhibits a stable region at all or whether the formation of four-body bound states causes an unbounded spectrum for all mass ratios, similar to the Thomas effect. Our result gives further evidence for the stability of the more general N + M system.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"file_id":"5729","relation":"main_file","checksum":"411c4db5700d7297c9cd8ebc5dd29091","date_updated":"2020-07-14T12:45:01Z","date_created":"2018-12-17T16:49:02Z","access_level":"open_access","file_name":"2018_MathPhysics_Moser.pdf","creator":"dernst","file_size":496973,"content_type":"application/pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"154","intvolume":" 21","ddc":["530"],"status":"public","title":"Stability of the 2+2 fermionic system with point interactions","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-09-01T00:00:00Z","citation":{"ama":"Moser T, Seiringer R. Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. 2018;21(3). doi:10.1007/s11040-018-9275-3","ista":"Moser T, Seiringer R. 2018. Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. 21(3), 19.","ieee":"T. Moser and R. Seiringer, “Stability of the 2+2 fermionic system with point interactions,” Mathematical Physics Analysis and Geometry, vol. 21, no. 3. Springer, 2018.","apa":"Moser, T., & Seiringer, R. (2018). Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. Springer. https://doi.org/10.1007/s11040-018-9275-3","mla":"Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System with Point Interactions.” Mathematical Physics Analysis and Geometry, vol. 21, no. 3, 19, Springer, 2018, doi:10.1007/s11040-018-9275-3.","short":"T. Moser, R. Seiringer, Mathematical Physics Analysis and Geometry 21 (2018).","chicago":"Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System with Point Interactions.” Mathematical Physics Analysis and Geometry. Springer, 2018. https://doi.org/10.1007/s11040-018-9275-3."},"publication":"Mathematical Physics Analysis and Geometry","article_type":"original","ec_funded":1,"publist_id":"7767","file_date_updated":"2020-07-14T12:45:01Z","article_number":"19","related_material":{"record":[{"id":"52","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Moser"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"volume":21,"date_created":"2018-12-11T11:44:55Z","date_updated":"2023-09-19T09:31:15Z","year":"2018","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF).","publisher":"Springer","department":[{"_id":"RoSe"}],"publication_status":"published","publication_identifier":{"issn":["13850172"],"eissn":["15729656"]},"month":"09","doi":"10.1007/s11040-018-9275-3","language":[{"iso":"eng"}],"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"},"external_id":{"isi":["000439639700001"]},"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"isi":1,"quality_controlled":"1"},{"author":[{"last_name":"Hannezo","first_name":"Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"},{"last_name":"Simons","first_name":"Benjamin D.","full_name":"Simons, Benjamin D."}],"volume":60,"date_updated":"2023-09-19T09:32:49Z","date_created":"2018-12-30T22:59:14Z","year":"2018","publisher":"Wiley","department":[{"_id":"EdHa"}],"file_date_updated":"2020-07-14T12:47:11Z","doi":"10.1111/dgd.12570","language":[{"iso":"eng"}],"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"},"external_id":{"isi":["000453555100002"]},"oa":1,"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["00121592"]},"month":"12","file":[{"file_id":"5933","relation":"main_file","date_created":"2019-02-06T10:40:46Z","date_updated":"2020-07-14T12:47:11Z","checksum":"a6d30b0785db902c734a84fecb2eadd9","file_name":"2018_DevGrowh_Hannezo.pdf","access_level":"open_access","creator":"dernst","file_size":1313606,"content_type":"application/pdf"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5787","intvolume":" 60","title":"Statistical theory of branching morphogenesis","ddc":["570"],"status":"public","issue":"9","abstract":[{"text":"Branching morphogenesis remains a subject of abiding interest. Although much is \r\nknown about the gene regulatory programs and signaling pathways that operate at \r\nthe cellular scale, it has remained unclear how the macroscopic features of branched \r\norgans, including their size, network topology and spatial patterning, are encoded. \r\nLately, it has been proposed that, these features can be explained quantitatively in \r\nseveral organs within a single unifying framework. Based on large-\r\nscale organ recon\r\n-\r\nstructions and cell lineage tracing, it has been argued that morphogenesis follows \r\nfrom the collective dynamics of sublineage- \r\nrestricted self- \r\nrenewing progenitor cells, \r\nlocalized at ductal tips, that act cooperatively to drive a serial process of ductal elon\r\n-\r\ngation and stochastic tip bifurcation. By correlating differentiation or cell cycle exit \r\nwith proximity to maturing ducts, this dynamic results in the specification of a com-\r\nplex network of defined density and statistical organization. These results suggest \r\nthat, for several mammalian tissues, branched epithelial structures develop as a self- \r\norganized process, reliant upon a strikingly simple, but generic, set of local rules, \r\nwithout recourse to a rigid and deterministic sequence of genetically programmed \r\nevents. Here, we review the basis of these findings and discuss their implications.","lang":"eng"}],"type":"journal_article","date_published":"2018-12-09T00:00:00Z","citation":{"mla":"Hannezo, Edouard B., and Benjamin D. Simons. “Statistical Theory of Branching Morphogenesis.” Development Growth and Differentiation, vol. 60, no. 9, Wiley, 2018, pp. 512–21, doi:10.1111/dgd.12570.","short":"E.B. Hannezo, B.D. Simons, Development Growth and Differentiation 60 (2018) 512–521.","chicago":"Hannezo, Edouard B, and Benjamin D. Simons. “Statistical Theory of Branching Morphogenesis.” Development Growth and Differentiation. Wiley, 2018. https://doi.org/10.1111/dgd.12570.","ama":"Hannezo EB, Simons BD. Statistical theory of branching morphogenesis. Development Growth and Differentiation. 2018;60(9):512-521. doi:10.1111/dgd.12570","ista":"Hannezo EB, Simons BD. 2018. Statistical theory of branching morphogenesis. Development Growth and Differentiation. 60(9), 512–521.","apa":"Hannezo, E. B., & Simons, B. D. (2018). Statistical theory of branching morphogenesis. Development Growth and Differentiation. Wiley. https://doi.org/10.1111/dgd.12570","ieee":"E. B. Hannezo and B. D. Simons, “Statistical theory of branching morphogenesis,” Development Growth and Differentiation, vol. 60, no. 9. Wiley, pp. 512–521, 2018."},"publication":"Development Growth and Differentiation","page":"512-521","has_accepted_license":"1","article_processing_charge":"No","day":"09","scopus_import":"1"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"12","citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.","mla":"Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.","short":"T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.","ista":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.","apa":"Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21","ieee":"T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.","ama":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21"},"page":"385 - 407","date_published":"2018-04-12T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with ω -regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy representation in graph games has been binary decision diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain the inherent flavor of the decisions of strategies, and are notoriously hard to minimize to obtain succinct representation. In this work we propose decision trees for strategy representation in graph games. Decision trees retain the flavor of decisions of strategies and allow entropy-based minimization to obtain succinct trees. However, decision trees work in settings (e.g., probabilistic models) where errors are allowed, and overfitting of data is typically avoided. In contrast, for strategies in graph games no error is allowed, and the decision tree must represent the entire strategy. We develop new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees. We have implemented our techniques to extend the existing decision tree solvers. We present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient data-structure for strategy representation as compared to BDDs.","lang":"eng"}],"_id":"297","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 10805","title":"Strategy representation by decision trees in reactive synthesis","ddc":["000"],"status":"public","file":[{"relation":"main_file","file_id":"5723","date_created":"2018-12-17T16:29:08Z","date_updated":"2020-07-14T12:45:57Z","checksum":"b13874ffb114932ad9cc2586b7469db4","file_name":"2018_LNCS_Brazdil.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1829940,"creator":"dernst"}],"oa_version":"Published Version","month":"04","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"},"external_id":{"isi":["000546326300021"]},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"isi":1,"quality_controlled":"1","doi":"10.1007/978-3-319-89960-2_21","conference":{"name":"TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2018-04-20","location":"Thessaloniki, Greece","start_date":"2018-04-14"},"language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"7584","file_date_updated":"2020-07-14T12:45:57Z","year":"2018","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kretinsky, Jan","first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","first_name":"Viktor","last_name":"Toman","full_name":"Toman, Viktor"}],"volume":10805,"date_created":"2018-12-11T11:45:41Z","date_updated":"2023-09-19T09:57:08Z"},{"publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.","year":"2018","volume":10982,"date_created":"2018-12-11T11:44:51Z","date_updated":"2023-09-19T09:59:55Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"},{"last_name":"Oraee","first_name":"Simin","full_name":"Oraee, Simin"},{"orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","first_name":"Viktor","full_name":"Toman, Viktor"}],"publist_id":"7782","ec_funded":1,"file_date_updated":"2020-07-14T12:44:53Z","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"isi":1,"quality_controlled":"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"},"oa":1,"external_id":{"isi":["000491469700013"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-96142-2_13","conference":{"name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom","start_date":"2018-07-14","end_date":"2018-07-17"},"month":"07","intvolume":" 10982","title":"Symbolic algorithms for graphs and Markov decision processes with fairness objectives","status":"public","ddc":["000"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"141","file":[{"creator":"dernst","file_size":675606,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_LNCS_Chatterjee.pdf","checksum":"1a6ffa4febe8bb8ac28be3adb3eafebc","date_updated":"2020-07-14T12:44:53Z","date_created":"2018-12-18T08:52:38Z","file_id":"5737","relation":"main_file"}],"oa_version":"Published Version","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples."}],"page":"178-197","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.","apa":"Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.","mla":"Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13."},"date_published":"2018-07-18T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"18"},{"scopus_import":"1","article_processing_charge":"No","day":"31","page":"99 - 130","citation":{"ista":"Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.","apa":"Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4","ama":"Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821. Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space Complexity,” 10821:99–130. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_4.","mla":"Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer, 2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130."},"date_published":"2018-03-31T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware (like x86 CPUs). MHFs have interesting cryptographic applications, most notably to password hashing and securing blockchains.\r\n\r\nAlwen and Serbinenko [STOC’15] define the cumulative memory complexity (cmc) of a function as the sum (over all time-steps) of the amount of memory required to compute the function. They advocate that a good MHF must have high cmc. Unlike previous notions, cmc takes into account that dedicated hardware might exploit amortization and parallelism. Still, cmc has been critizised as insufficient, as it fails to capture possible time-memory trade-offs; as memory cost doesn’t scale linearly, functions with the same cmc could still have very different actual hardware cost.\r\n\r\nIn this work we address this problem, and introduce the notion of sustained-memory complexity, which requires that any algorithm evaluating the function must use a large amount of memory for many steps. We construct functions (in the parallel random oracle model) whose sustained-memory complexity is almost optimal: our function can be evaluated using n steps and O(n/log(n)) memory, in each step making one query to the (fixed-input length) random oracle, while any algorithm that can make arbitrary many parallel queries to the random oracle, still needs Ω(n/log(n)) memory for Ω(n) steps.\r\n\r\nAs has been done for various notions (including cmc) before, we reduce the task of constructing an MHFs with high sustained-memory complexity to proving pebbling lower bounds on DAGs. Our main technical contribution is the construction is a family of DAGs on n nodes with constant indegree with high “sustained-space complexity”, meaning that any parallel black-pebbling strategy requires Ω(n/log(n)) pebbles for at least Ω(n) steps.\r\n\r\nAlong the way we construct a family of maximally “depth-robust” DAGs with maximum indegree O(logn) , improving upon the construction of Mahmoody et al. [ITCS’13] which had maximum indegree O(log2n⋅","lang":"eng"}],"intvolume":" 10821","title":"Sustained space complexity","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"298","oa_version":"Preprint","month":"03","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"isi":1,"quality_controlled":"1","external_id":{"arxiv":["1705.05313"],"isi":["000517098700004"]},"main_file_link":[{"url":"https://arxiv.org/abs/1705.05313","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-78375-8_4","conference":{"start_date":"2018-04-29","location":"Tel Aviv, Israel","end_date":"2018-05-03","name":"Eurocrypt 2018: Advances in Cryptology"},"ec_funded":1,"publist_id":"7583","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2018","volume":10821,"date_created":"2018-12-11T11:45:41Z","date_updated":"2023-09-19T09:59:30Z","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"full_name":"Blocki, Jeremiah","first_name":"Jeremiah","last_name":"Blocki"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"}]},{"publist_id":"8019","file_date_updated":"2020-07-14T12:46:13Z","volume":69,"date_updated":"2023-09-19T10:00:46Z","date_created":"2018-12-11T11:44:17Z","author":[{"first_name":"Lam","last_name":"Vu","full_name":"Vu, Lam"},{"full_name":"Zhu, Tingting","last_name":"Zhu","first_name":"Tingting"},{"orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge","full_name":"Verstraeten, Inge"},{"full_name":"Van De Cotte, Brigitte","last_name":"Van De Cotte","first_name":"Brigitte"},{"full_name":"Gevaert, Kris","last_name":"Gevaert","first_name":"Kris"},{"full_name":"De Smet, Ive","last_name":"De Smet","first_name":"Ive"}],"publisher":"Oxford University Press","department":[{"_id":"JiFr"}],"publication_status":"published","year":"2018","acknowledgement":"TZ is supported by a grant from the Chinese Scholarship Council.","month":"08","language":[{"iso":"eng"}],"doi":"10.1093/jxb/ery204","isi":1,"quality_controlled":"1","external_id":{"isi":["000443568700010"]},"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,"issue":"19","abstract":[{"lang":"eng","text":"Wheat (Triticum ssp.) is one of the most important human food sources. However, this crop is very sensitive to temperature changes. Specifically, processes during wheat leaf, flower, and seed development and photosynthesis, which all contribute to the yield of this crop, are affected by high temperature. While this has to some extent been investigated on physiological, developmental, and molecular levels, very little is known about early signalling events associated with an increase in temperature. Phosphorylation-mediated signalling mechanisms, which are quick and dynamic, are associated with plant growth and development, also under abiotic stress conditions. Therefore, we probed the impact of a short-term and mild increase in temperature on the wheat leaf and spikelet phosphoproteome. In total, 3822 (containing 5178 phosphosites) and 5581 phosphopeptides (containing 7023 phosphosites) were identified in leaf and spikelet samples, respectively. Following statistical analysis, the resulting data set provides the scientific community with a first large-scale plant phosphoproteome under the control of higher ambient temperature. This community resource on the high temperature-mediated wheat phosphoproteome will be valuable for future studies. Our analyses also revealed a core set of common proteins between leaf and spikelet, suggesting some level of conserved regulatory mechanisms. Furthermore, we observed temperature-regulated interconversion of phosphoforms, which probably impacts protein activity."}],"type":"journal_article","oa_version":"Published Version","file":[{"file_size":3359316,"content_type":"application/pdf","creator":"dernst","file_name":"2018_JournalExperimBotany_Vu.pdf","access_level":"open_access","date_created":"2018-12-18T09:47:51Z","date_updated":"2020-07-14T12:46:13Z","checksum":"34cb0a1611588b75bd6f4913fb4e30f1","relation":"main_file","file_id":"5741"}],"intvolume":" 69","status":"public","title":"Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms","ddc":["581"],"_id":"36","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","has_accepted_license":"1","day":"31","scopus_import":"1","date_published":"2018-08-31T00:00:00Z","page":"4609 - 4624","citation":{"short":"L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, I. De Smet, Journal of Experimental Botany 69 (2018) 4609–4624.","mla":"Vu, Lam, et al. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental Botany, vol. 69, no. 19, Oxford University Press, 2018, pp. 4609–24, doi:10.1093/jxb/ery204.","chicago":"Vu, Lam, Tingting Zhu, Inge Verstraeten, Brigitte Van De Cotte, Kris Gevaert, and Ive De Smet. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery204.","ama":"Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. 2018;69(19):4609-4624. doi:10.1093/jxb/ery204","apa":"Vu, L., Zhu, T., Verstraeten, I., Van De Cotte, B., Gevaert, K., & De Smet, I. (2018). Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery204","ieee":"L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, and I. De Smet, “Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms,” Journal of Experimental Botany, vol. 69, no. 19. Oxford University Press, pp. 4609–4624, 2018.","ista":"Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. 2018. Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. 69(19), 4609–4624."},"publication":"Journal of Experimental Botany"}]