[{"oa":1,"quality_controlled":"1","publisher":"Springer","page":"181-201","date_created":"2018-12-16T22:59:20Z","date_published":"2018-12-01T00:00:00Z","doi":"10.1007/978-3-030-02768-1_11","year":"2018","isi":1,"day":"01","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"article_processing_charge":"No","external_id":{"isi":["000916310900011"],"arxiv":["1806.06683"]},"author":[{"full_name":"Huang, Mingzhang","last_name":"Huang","first_name":"Mingzhang"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"title":"New approaches for almost-sure termination of probabilistic programs","editor":[{"first_name":"Sukyoung","full_name":"Ryu, Sukyoung","last_name":"Ryu"}],"citation":{"mla":"Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:10.1007/978-3-030-02768-1_11.","apa":"Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11","ama":"Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:10.1007/978-3-030-02768-1_11","ieee":"M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.","short":"M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.","chicago":"Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.","ista":"Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"url":"http://arxiv.org/abs/1806.06683","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 11275","month":"12","abstract":[{"text":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can handle. Finally, we discuss algorithmic approaches for the two above methods that lead to automated analysis techniques for almost-sure termination of probabilistic programs.","lang":"eng"}],"oa_version":"Preprint","volume":11275,"publication_identifier":{"issn":["03029743"],"isbn":["9783030027674"]},"language":[{"iso":"eng"}],"conference":{"name":"16th Asian Symposium on Programming Languages and Systems, APLAS","location":"Wellington, New Zealand","end_date":"2018-12-06","start_date":"2018-12-02"},"type":"conference","status":"public","_id":"5679","department":[{"_id":"KrCh"}],"date_updated":"2023-09-13T09:02:22Z"},{"month":"05","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.6401414.v1"}],"oa":1,"publisher":"Springer Nature","oa_version":"Published Version","abstract":[{"lang":"eng","text":"This document contains the full list of genes with their respective significance and dN/dS values. (TXT 4499Â kb)"}],"date_created":"2021-08-06T12:58:25Z","related_material":{"record":[{"relation":"used_in_publication","id":"279","status":"public"}]},"doi":"10.6084/m9.figshare.6401414.v1","date_published":"2018-05-31T00:00:00Z","day":"31","year":"2018","status":"public","type":"research_data_reference","_id":"9812","title":"Additional file 2: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","department":[{"_id":"FyKo"}],"article_processing_charge":"No","author":[{"first_name":"Luis","full_name":"Zapata, Luis","last_name":"Zapata"},{"first_name":"Oriol","last_name":"Pich","full_name":"Pich, Oriol"},{"first_name":"Luis","last_name":"Serrano","full_name":"Serrano, Luis"},{"first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor","last_name":"Kondrashov"},{"first_name":"Stephan","last_name":"Ossowski","full_name":"Ossowski, Stephan"},{"full_name":"Schaefer, Martin","last_name":"Schaefer","first_name":"Martin"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2023-09-13T09:01:31Z","citation":{"ista":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. 2018. Additional file 2: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome, Springer Nature, 10.6084/m9.figshare.6401414.v1.","chicago":"Zapata, Luis, Oriol Pich, Luis Serrano, Fyodor Kondrashov, Stephan Ossowski, and Martin Schaefer. “Additional File 2: 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.6401414.v1.","short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","ieee":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, and M. Schaefer, “Additional file 2: 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 2: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Springer Nature. https://doi.org/10.6084/m9.figshare.6401414.v1","ama":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. Additional file 2: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. 2018. doi:10.6084/m9.figshare.6401414.v1","mla":"Zapata, Luis, et al. Additional File 2: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome. Springer Nature, 2018, doi:10.6084/m9.figshare.6401414.v1."}},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2023-09-13T09:01:31Z","citation":{"short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","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","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.","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.","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."},"department":[{"_id":"FyKo"}],"title":"Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","article_processing_charge":"No","author":[{"full_name":"Zapata, Luis","last_name":"Zapata","first_name":"Luis"},{"first_name":"Oriol","full_name":"Pich, Oriol","last_name":"Pich"},{"full_name":"Serrano, Luis","last_name":"Serrano","first_name":"Luis"},{"first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"},{"full_name":"Ossowski, Stephan","last_name":"Ossowski","first_name":"Stephan"},{"first_name":"Martin","last_name":"Schaefer","full_name":"Schaefer, Martin"}],"_id":"9811","status":"public","type":"research_data_reference","day":"31","year":"2018","date_created":"2021-08-06T12:53:49Z","date_published":"2018-05-31T00:00:00Z","doi":"10.6084/m9.figshare.6401390.v1","related_material":{"record":[{"status":"public","id":"279","relation":"used_in_publication"}]},"oa_version":"Preprint","abstract":[{"text":"This document contains additional supporting evidence presented as supplemental tables. (XLSX 50Â kb)","lang":"eng"}],"month":"05","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.6401390.v1","open_access":"1"}],"oa":1,"publisher":"Springer Nature"},{"citation":{"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.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, BMC Genomics 19 (2018).","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","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","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.","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).","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000450976700002"]},"author":[{"last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan","first_name":"Juan"},{"full_name":"Karbiener, Michael","last_name":"Karbiener","first_name":"Michael"},{"first_name":"Maude","full_name":"Giroud, Maude","last_name":"Giroud"},{"full_name":"Pauler, Florian","orcid":"0000-0002-7462-0048","last_name":"Pauler","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gerhalter","full_name":"Gerhalter, Teresa","first_name":"Teresa"},{"last_name":"Herzig","full_name":"Herzig, Stephan","first_name":"Stephan"},{"first_name":"Marcel","last_name":"Scheideler","full_name":"Scheideler, Marcel"}],"publist_id":"8035","title":"Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","year":"2018","isi":1,"has_accepted_license":"1","publication":"BMC Genomics","day":"03","date_created":"2018-12-11T11:44:12Z","doi":"10.1186/s12864-018-5173-0","date_published":"2018-11-03T00:00:00Z","acknowledgement":"This work was funded by the German Centre for Diabetes Research (DZD) and the Austrian Science Fund (FWF, P25729-B19).","oa":1,"quality_controlled":"1","publisher":"BioMed Central","date_updated":"2023-09-13T09:10:47Z","ddc":["570"],"department":[{"_id":"SiHi"}],"file_date_updated":"2020-07-14T12:45:23Z","_id":"20","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"issn":["1471-2164"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"a56516e734dab589dc7f3e1915973b4d","file_id":"5712","creator":"dernst","file_size":4629784,"date_updated":"2020-07-14T12:45:23Z","file_name":"2018_BMCGenomics_Higareda.pdf","date_created":"2018-12-17T14:52:57Z"}],"issue":"1","volume":19,"related_material":{"record":[{"relation":"research_data","id":"9807","status":"public"},{"status":"public","id":"9808","relation":"research_data"}]},"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"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 19","month":"11"},{"publication_status":"published","language":[{"iso":"eng"}],"issue":"4","volume":65,"ec_funded":1,"abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2009/608","open_access":"1"}],"month":"08","intvolume":" 65","date_updated":"2023-09-13T09:05:17Z","department":[{"_id":"KrPi"}],"_id":"107","article_type":"original","type":"journal_article","status":"public","isi":1,"year":"2018","day":"01","publication":"Journal of the ACM","date_published":"2018-08-01T00:00:00Z","doi":"10.1145/3178432","date_created":"2018-12-11T11:44:40Z","quality_controlled":"1","publisher":"ACM","oa":1,"citation":{"mla":"Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM, vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.","short":"S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).","ieee":"S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal of the ACM, vol. 65, no. 4. ACM, 2018.","ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the ACM. 2018;65(4). doi:10.1145/3178432","apa":"Dziembowski, S., Pietrzak, K. Z., & Wichs, D. (2018). Non-malleable codes. Journal of the ACM. ACM. https://doi.org/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.","ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7947","author":[{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"first_name":"Daniel","full_name":"Wichs, Daniel","last_name":"Wichs"}],"article_processing_charge":"No","external_id":{"isi":["000442938200004"]},"title":"Non-malleable codes","article_number":"20","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"},{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}]},{"oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","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."}],"month":"12","intvolume":" 217","scopus_import":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30228162","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00219525"]},"publication_status":"published","volume":217,"issue":"12","ec_funded":1,"_id":"5676","status":"public","type":"journal_article","date_updated":"2023-09-13T09:11:17Z","department":[{"_id":"CaHe"}],"quality_controlled":"1","publisher":"Rockefeller University Press","oa":1,"day":"01","publication":"Journal of Cell Biology","isi":1,"year":"2018","doi":"10.1083/jcb.201804048","date_published":"2018-12-01T00:00:00Z","date_created":"2018-12-16T22:59:19Z","page":"4267-4283","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","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.","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","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","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.","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.","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."},"title":"Occluding junctions as novel regulators of tissue mechanics during wound repair","author":[{"full_name":"Carvalho, Lara","last_name":"Carvalho","first_name":"Lara"},{"full_name":"Patricio, Pedro","last_name":"Patricio","first_name":"Pedro"},{"first_name":"Susana","full_name":"Ponte, Susana","last_name":"Ponte"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"},{"full_name":"Almeida, Luis","last_name":"Almeida","first_name":"Luis"},{"full_name":"Nunes, André S.","last_name":"Nunes","first_name":"André S."},{"last_name":"Araújo","full_name":"Araújo, Nuno A.M.","first_name":"Nuno A.M."},{"first_name":"Antonio","last_name":"Jacinto","full_name":"Jacinto, Antonio"}],"external_id":{"isi":["000451960800018"],"pmid":["30228162 "]},"article_processing_charge":"No"},{"title":"Clustering meets implicit generative models","department":[{"_id":"FrLo"}],"author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Damien","full_name":"Vincent, Damien","last_name":"Vincent"},{"full_name":"Tolstikhin, Ilya","last_name":"Tolstikhin","first_name":"Ilya"},{"first_name":"Gunnar","full_name":"Ratsch, Gunnar","last_name":"Ratsch"},{"first_name":"Sylvain","last_name":"Gelly","full_name":"Gelly, Sylvain"},{"first_name":"Bernhard","full_name":"Scholkopf, Bernhard","last_name":"Scholkopf"}],"external_id":{"arxiv":["1804.11130"]},"article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. 2018. Clustering meets implicit generative models. 6th International Conference on Learning Representations. International Conference on Machine Learning.","chicago":"Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Ratsch, Sylvain Gelly, and Bernhard Scholkopf. “Clustering Meets Implicit Generative Models.” In 6th International Conference on Learning Representations, 2018.","ama":"Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. Clustering meets implicit generative models. In: 6th International Conference on Learning Representations. ; 2018.","apa":"Locatello, F., Vincent, D., Tolstikhin, I., Ratsch, G., Gelly, S., & Scholkopf, B. (2018). Clustering meets implicit generative models. In 6th International Conference on Learning Representations. Vancouver, Canada.","ieee":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, and B. Scholkopf, “Clustering meets implicit generative models,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf, in:, 6th International Conference on Learning Representations, 2018.","mla":"Locatello, Francesco, et al. “Clustering Meets Implicit Generative Models.” 6th International Conference on Learning Representations, 2018."},"date_updated":"2023-09-13T09:08:24Z","status":"public","type":"conference","conference":{"end_date":"2018-05-03","location":"Vancouver, Canada","start_date":"2018-04-30","name":"International Conference on Machine Learning"},"_id":"14224","date_published":"2018-05-01T00:00:00Z","date_created":"2023-08-22T14:25:34Z","day":"01","publication":"6th International Conference on Learning Representations","language":[{"iso":"eng"}],"publication_status":"published","year":"2018","month":"05","quality_controlled":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.11130"}],"oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Clustering is a cornerstone of unsupervised learning which can be thought as disentangling multiple generative mechanisms underlying the data. In this paper we introduce an algorithmic framework to train mixtures of implicit generative models which we particularize for variational autoencoders. Relying on an additional set of discriminators, we propose a competitive procedure in which the models only need to approximate the portion of the data distribution from which they can produce realistic samples. As a byproduct, each model is simpler to train, and a clustering interpretation arises naturally from the partitioning of the training points among the models. We empirically show that our approach splits the training distribution in a reasonable way and increases the quality of the generated samples."}]},{"month":"11","publisher":"Springer Nature","oa":1,"main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7295339.v1","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","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)."}],"date_published":"2018-11-03T00:00:00Z","related_material":{"record":[{"id":"20","status":"public","relation":"used_in_publication"}]},"doi":"10.6084/m9.figshare.7295339.v1","date_created":"2021-08-06T12:26:53Z","day":"03","year":"2018","status":"public","type":"research_data_reference","_id":"9807","department":[{"_id":"SiHi"}],"title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","author":[{"first_name":"Juan","last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan"},{"first_name":"Michael","last_name":"Karbiener","full_name":"Karbiener, Michael"},{"last_name":"Giroud","full_name":"Giroud, Maude","first_name":"Maude"},{"last_name":"Pauler","full_name":"Pauler, Florian","orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"first_name":"Stephan","last_name":"Herzig","full_name":"Herzig, Stephan"},{"first_name":"Marcel","last_name":"Scheideler","full_name":"Scheideler, Marcel"}],"article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"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.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (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","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","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.","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.","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."},"date_updated":"2023-09-13T09:10:47Z"},{"month":"11","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295369.v1"}],"oa":1,"publisher":"Springer Nature","oa_version":"Published Version","abstract":[{"text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb).","lang":"eng"}],"date_created":"2021-08-06T12:31:57Z","related_material":{"record":[{"status":"public","id":"20","relation":"used_in_publication"}]},"date_published":"2018-11-03T00:00:00Z","doi":"10.6084/m9.figshare.7295369.v1","day":"03","year":"2018","status":"public","type":"research_data_reference","_id":"9808","department":[{"_id":"SiHi"}],"title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","article_processing_charge":"No","author":[{"first_name":"Juan","full_name":"Higareda Almaraz, Juan","last_name":"Higareda Almaraz"},{"first_name":"Michael","full_name":"Karbiener, Michael","last_name":"Karbiener"},{"full_name":"Giroud, Maude","last_name":"Giroud","first_name":"Maude"},{"last_name":"Pauler","orcid":"0000-0002-7462-0048","full_name":"Pauler, Florian","first_name":"Florian","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"},{"first_name":"Marcel","last_name":"Scheideler","full_name":"Scheideler, Marcel"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","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.","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.","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.","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","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.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018)."},"date_updated":"2023-09-13T09:10:47Z"},{"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publist_id":"7723","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen"},{"first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"last_name":"Reyzin","full_name":"Reyzin, Lenoid","first_name":"Lenoid"},{"last_name":"Rolinek","full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"},{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rybar, Michal","last_name":"Rybar"}],"article_processing_charge":"No","external_id":{"isi":["000516620100005"]},"title":"On the memory hardness of data independent password hashing functions","citation":{"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","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","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.","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.","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.","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.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","publisher":"ACM","oa":1,"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.","page":"51 - 65","date_published":"2018-06-01T00:00:00Z","doi":"10.1145/3196494.3196534","date_created":"2018-12-11T11:45:07Z","isi":1,"year":"2018","day":"01","publication":"Proceedings of the 2018 on Asia Conference on Computer and Communication Security","type":"conference","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 "},"status":"public","_id":"193","department":[{"_id":"KrPi"},{"_id":"HeEd"},{"_id":"VlKo"}],"date_updated":"2023-09-13T09:13:12Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/783"}],"month":"06","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"}],"oa_version":"Submitted Version","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}]},{"oa_version":"Submitted Version","abstract":[{"lang":"eng","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."}],"month":"03","intvolume":" 10820","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2018/077","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":10820,"ec_funded":1,"_id":"300","status":"public","type":"conference","conference":{"name":"Eurocrypt: Advances in Cryptology","start_date":"2018-04-29","end_date":"2018-05-03","location":"Tel Aviv, Israel"},"date_updated":"2023-09-13T09:12:04Z","department":[{"_id":"KrPi"}],"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).","quality_controlled":"1","publisher":"Springer","oa":1,"day":"31","isi":1,"year":"2018","date_published":"2018-03-31T00:00:00Z","doi":"10.1007/978-3-319-78381-9_1","date_created":"2018-12-11T11:45:42Z","page":"3 - 28","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"D. Micciancio, M. Walter, in:, Springer, 2018, pp. 3–28.","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","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","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.","ista":"Micciancio D, Walter M. 2018. On the bit security of cryptographic primitives. Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.","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."},"title":"On the bit security of cryptographic primitives","publist_id":"7581","author":[{"full_name":"Micciancio, Daniele","last_name":"Micciancio","first_name":"Daniele"},{"last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"}],"external_id":{"isi":["000517097500001"]},"article_processing_charge":"No"},{"project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"citation":{"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.","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","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","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","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.","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.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000428958900038"]},"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7553","title":"On the optimality of the FCC lattice for soft sphere packing","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).","oa":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics ","year":"2018","isi":1,"publication":"SIAM J Discrete Math","day":"29","page":"750 - 782","date_created":"2018-12-11T11:45:46Z","doi":"10.1137/16M1097201","date_published":"2018-03-29T00:00:00Z","_id":"312","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-09-13T09:34:38Z","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf"}],"scopus_import":"1","intvolume":" 32","month":"03","publication_status":"published","publication_identifier":{"issn":["08954801"]},"language":[{"iso":"eng"}],"issue":"1","volume":32},{"title":"On the number of non-hexagons in a planar tiling","external_id":{"isi":["000430402700009"],"arxiv":["1805.01652"]},"article_processing_charge":"No","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan"}],"publist_id":"7420","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Akopyan A. 2018. On the number of non-hexagons in a planar tiling. Comptes Rendus Mathematique. 356(4), 412–414.","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.","short":"A. Akopyan, Comptes Rendus Mathematique 356 (2018) 412–414.","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","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","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."},"date_created":"2018-12-11T11:46:19Z","doi":"10.1016/j.crma.2018.03.005","date_published":"2018-04-01T00:00:00Z","page":"412-414","publication":"Comptes Rendus Mathematique","day":"01","year":"2018","isi":1,"oa":1,"quality_controlled":"1","publisher":"Elsevier","department":[{"_id":"HeEd"}],"date_updated":"2023-09-13T09:34:12Z","status":"public","type":"journal_article","article_type":"original","_id":"409","issue":"4","volume":356,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1631073X"]},"intvolume":" 356","month":"04","main_file_link":[{"url":"https://arxiv.org/abs/1805.01652","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"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.","lang":"eng"}]},{"related_material":{"link":[{"url":"http://doi.org/10.1038/s41562-018-0342-3","relation":"erratum"}]},"volume":2,"ec_funded":1,"publication_status":"published","file":[{"file_name":"2018_NatureHumanBeh_Hilbe.pdf","date_created":"2019-11-19T08:19:51Z","file_size":598033,"date_updated":"2020-07-14T12:46:25Z","creator":"dernst","checksum":"571b8cc0ba14e8d5d8b18e439a9835eb","file_id":"7052","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"03","intvolume":" 2","abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:25Z","date_updated":"2023-09-13T09:38:54Z","ddc":["000"],"article_type":"review","type":"journal_article","status":"public","_id":"419","page":"469–477","date_published":"2018-03-19T00:00:00Z","doi":"10.1038/s41562-018-0320-9","date_created":"2018-12-11T11:46:22Z","isi":1,"has_accepted_license":"1","year":"2018","day":"19","publication":"Nature Human Behaviour","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"publist_id":"7404","author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"external_id":{"isi":["000446612000016"]},"article_processing_charge":"No","title":"Partners and rivals in direct reciprocity","citation":{"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.","ista":"Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 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.","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","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.","short":"C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"quality_controlled":"1","publisher":"Springer","oa":1,"day":"26","has_accepted_license":"1","isi":1,"year":"2018","doi":"10.1007/978-3-030-00151-3_13","date_published":"2018-08-26T00:00:00Z","date_created":"2018-12-11T11:44:31Z","page":"215 - 232","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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","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","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.","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.","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.","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."},"title":"Online timed pattern matching using automata","author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"last_name":"Ferrere","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"first_name":"Eugene","full_name":"Asarin, Eugene","last_name":"Asarin"}],"publist_id":"7976","article_processing_charge":"No","external_id":{"isi":["000884993200013"]},"oa_version":"Submitted Version","abstract":[{"lang":"eng","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."}],"month":"08","intvolume":" 11022","alternative_title":["LNCS"],"scopus_import":"1","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"7831","checksum":"436b7574934324cfa7d1d3986fddc65b","date_updated":"2020-07-14T12:48:03Z","file_size":374851,"creator":"dernst","date_created":"2020-05-14T11:34:34Z","file_name":"2018_LNCS_Bakhirkin.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-030-00150-6"]},"publication_status":"published","volume":11022,"_id":"78","status":"public","type":"conference","conference":{"location":"Bejing, China","end_date":"2018-09-06","start_date":"2018-09-04","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"ddc":["000"],"date_updated":"2023-09-13T09:35:46Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:48:03Z"},{"title":"Palladium gates for reproducible quantum dots in silicon","external_id":{"isi":["000429404300013"]},"article_processing_charge":"No","author":[{"full_name":"Brauns, Matthias","last_name":"Brauns","first_name":"Matthias","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sergey","last_name":"Amitonov","full_name":"Amitonov, Sergey"},{"first_name":"Paul","last_name":"Spruijtenburg","full_name":"Spruijtenburg, Paul"},{"full_name":"Zwanenburg, Floris","last_name":"Zwanenburg","first_name":"Floris"}],"publist_id":"7548","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","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","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","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.","short":"M. Brauns, S. Amitonov, P. Spruijtenburg, F. Zwanenburg, Scientific Reports 8 (2018).","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.","ista":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. 2018. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 8(1), 5690."},"article_number":"5690","date_created":"2018-12-11T11:45:47Z","doi":"10.1038/s41598-018-24004-y","date_published":"2018-04-09T00:00:00Z","publication":"Scientific Reports","day":"09","year":"2018","has_accepted_license":"1","isi":1,"oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","file_date_updated":"2020-07-14T12:46:02Z","department":[{"_id":"GeKa"}],"ddc":["539"],"date_updated":"2023-09-13T09:38:00Z","pubrep_id":"1016","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"317","volume":8,"issue":"1","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"20af238ca4ba6491b77270be8d826bf5","file_id":"5256","file_size":1850530,"date_updated":"2020-07-14T12:46:02Z","creator":"system","file_name":"IST-2018-1016-v1+1_2018_Brauns_Palladium_gates.pdf","date_created":"2018-12-12T10:17:04Z"}],"publication_status":"published","intvolume":" 8","month":"04","scopus_import":"1","oa_version":"Published Version","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."}]},{"publisher":"FASEB","quality_controlled":"1","oa":1,"day":"29","publication":"The FASEB Journal","isi":1,"year":"2018","doi":"10.1096/fj.201800443","date_published":"2018-11-29T00:00:00Z","date_created":"2018-12-11T11:45:08Z","page":"6808-6821","project":[{"name":"Individual function and social role of oxytocin-like neuropeptides in ants","_id":"25E3D34E-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","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.","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.","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.","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.","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","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"},"title":"Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity","author":[{"first_name":"Zita","last_name":"Liutkeviciute","full_name":"Liutkeviciute, Zita"},{"first_name":"Esther","last_name":"Gil Mansilla","full_name":"Gil Mansilla, Esther"},{"first_name":"Thomas","last_name":"Eder","full_name":"Eder, Thomas"},{"last_name":"Casillas Perez","full_name":"Casillas Perez, Barbara E","id":"351ED2AA-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara E"},{"first_name":"Maria","last_name":"Giulia Di Giglio","full_name":"Giulia Di Giglio, Maria"},{"first_name":"Edin","last_name":"Muratspahić","full_name":"Muratspahić, Edin"},{"first_name":"Florian","last_name":"Grebien","full_name":"Grebien, Florian"},{"first_name":"Thomas","last_name":"Rattei","full_name":"Rattei, Thomas"},{"first_name":"Markus","last_name":"Muttenthaler","full_name":"Muttenthaler, Markus"},{"last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christian","full_name":"Gruber, Christian","last_name":"Gruber"}],"publist_id":"7721","external_id":{"isi":["000449359700035"],"pmid":["29939785"]},"article_processing_charge":"No","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","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."}],"month":"11","intvolume":" 32","scopus_import":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.1096/fj.201800443"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["08926638"]},"publication_status":"published","issue":"12","volume":32,"_id":"194","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-13T09:37:32Z","department":[{"_id":"SyCr"}]},{"status":"public","type":"journal_article","article_type":"original","_id":"159","department":[{"_id":"JoDa"}],"file_date_updated":"2020-07-14T12:45:03Z","ddc":["570"],"date_updated":"2023-09-13T09:36:35Z","intvolume":" 14","month":"07","scopus_import":"1","oa_version":"Submitted Version","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"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/s41589-021-00744-3","relation":"erratum"}]},"issue":"8","volume":14,"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":6321000,"date_updated":"2020-07-14T12:45:03Z","file_name":"2018_NatureChemicalBiology_Fehrentz.pdf","date_created":"2020-05-14T12:14:09Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"7832","checksum":"d42935094ec845f54a0688bf12986d62"}],"publication_status":"published","title":"Optical control of L-type Ca2+ channels using a diltiazem photoswitch","external_id":{"isi":["000438970200010"]},"article_processing_charge":"No","author":[{"last_name":"Fehrentz","full_name":"Fehrentz, Timm","first_name":"Timm"},{"first_name":"Florian","full_name":"Huber, Florian","last_name":"Huber"},{"full_name":"Hartrampf, Nina","last_name":"Hartrampf","first_name":"Nina"},{"full_name":"Bruegmann, Tobias","last_name":"Bruegmann","first_name":"Tobias"},{"first_name":"James","full_name":"Frank, James","last_name":"Frank"},{"first_name":"Nicholas","last_name":"Fine","full_name":"Fine, Nicholas"},{"first_name":"Daniela","full_name":"Malan, Daniela","last_name":"Malan"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","last_name":"Danzl"},{"first_name":"Denis","last_name":"Tikhonov","full_name":"Tikhonov, Denis"},{"full_name":"Sumser, Maritn","last_name":"Sumser","first_name":"Maritn"},{"last_name":"Sasse","full_name":"Sasse, Philipp","first_name":"Philipp"},{"full_name":"Hodson, David","last_name":"Hodson","first_name":"David"},{"first_name":"Boris","last_name":"Zhorov","full_name":"Zhorov, Boris"},{"full_name":"Klocker, Nikolaj","last_name":"Klocker","first_name":"Nikolaj"},{"last_name":"Trauner","full_name":"Trauner, Dirk","first_name":"Dirk"}],"publist_id":"7762","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","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","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","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.","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.","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.","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."},"oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","date_created":"2018-12-11T11:44:56Z","date_published":"2018-07-16T00:00:00Z","doi":"10.1038/s41589-018-0090-8","page":"764 - 767","publication":"Nature Chemical Biology","day":"16","year":"2018","isi":1,"has_accepted_license":"1"},{"year":"2018","isi":1,"day":"15","page":"53-70","date_created":"2018-12-11T11:44:31Z","doi":"10.1007/978-3-319-99154-2_4","date_published":"2018-08-15T00:00:00Z","oa":1,"publisher":"Springer","quality_controlled":"1","citation":{"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.","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.","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.","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","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","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.","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1806.05126"],"isi":["000548912200004"]},"article_processing_charge":"No","author":[{"first_name":"Sebastian","last_name":"Arming","full_name":"Arming, Sebastian"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Katoen","full_name":"Katoen, Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","first_name":"Joost P"},{"first_name":"Ana","last_name":"Sokolova","full_name":"Sokolova, Ana"}],"publist_id":"7975","title":"Parameter-independent strategies for pMDPs via POMDPs","publication_status":"published","language":[{"iso":"eng"}],"volume":11024,"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."}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1806.05126","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 11024","month":"08","date_updated":"2023-09-13T09:38:28Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"79","conference":{"name":"QEST: Quantitative Evaluation of Systems","location":"Beijing, China","end_date":"2018-09-07","start_date":"2018-09-04"},"type":"conference","status":"public"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-09-13T12:23:03Z","citation":{"ieee":"F. Locatello, D. Vincent, I. Tolstikhin, G. Rätsch, S. Gelly, and B. Schölkopf, “Competitive training of mixtures of independent deep generative models,” arXiv. .","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Rätsch, S. Gelly, B. Schölkopf, ArXiv (n.d.).","ama":"Locatello F, Vincent D, Tolstikhin I, Rätsch G, Gelly S, Schölkopf B. Competitive training of mixtures of independent deep generative models. arXiv. doi:10.48550/arXiv.1804.11130","apa":"Locatello, F., Vincent, D., Tolstikhin, I., Rätsch, G., Gelly, S., & Schölkopf, B. (n.d.). Competitive training of mixtures of independent deep generative models. arXiv. https://doi.org/10.48550/arXiv.1804.11130","mla":"Locatello, Francesco, et al. “Competitive Training of Mixtures of Independent Deep Generative Models.” ArXiv, 1804.11130, doi:10.48550/arXiv.1804.11130.","ista":"Locatello F, Vincent D, Tolstikhin I, Rätsch G, Gelly S, Schölkopf B. Competitive training of mixtures of independent deep generative models. arXiv, 1804.11130.","chicago":"Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Rätsch, Sylvain Gelly, and Bernhard Schölkopf. “Competitive Training of Mixtures of Independent Deep Generative Models.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1804.11130."},"title":"Competitive training of mixtures of independent deep generative models","department":[{"_id":"FrLo"}],"external_id":{"arxiv":["1804.11130"]},"article_processing_charge":"No","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"first_name":"Damien","last_name":"Vincent","full_name":"Vincent, Damien"},{"last_name":"Tolstikhin","full_name":"Tolstikhin, Ilya","first_name":"Ilya"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"},{"full_name":"Gelly, Sylvain","last_name":"Gelly","first_name":"Sylvain"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"}],"article_number":"1804.11130","_id":"14327","status":"public","type":"preprint","publication":"arXiv","language":[{"iso":"eng"}],"day":"30","publication_status":"submitted","year":"2018","date_created":"2023-09-13T12:20:49Z","doi":"10.48550/arXiv.1804.11130","date_published":"2018-04-30T00:00:00Z","oa_version":"Preprint","abstract":[{"lang":"eng","text":"A common assumption in causal modeling posits that the data is generated by a\r\nset of independent mechanisms, and algorithms should aim to recover this\r\nstructure. Standard unsupervised learning, however, is often concerned with\r\ntraining a single model to capture the overall distribution or aspects thereof.\r\nInspired by clustering approaches, we consider mixtures of implicit generative\r\nmodels that ``disentangle'' the independent generative mechanisms underlying\r\nthe data. Relying on an additional set of discriminators, we propose a\r\ncompetitive training procedure in which the models only need to capture the\r\nportion of the data distribution from which they can produce realistic samples.\r\nAs a by-product, each model is simpler and faster to train. We empirically show\r\nthat our approach splits the training distribution in a sensible way and\r\nincreases the quality of the generated samples."}],"month":"04","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1804.11130","open_access":"1"}],"oa":1}]