[{"external_id":{"isi":["000428901200001"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1109/TPAMI.2018.2804998","language":[{"iso":"eng"}],"month":"05","year":"2018","publisher":"IEEE","department":[{"_id":"ChLa"}],"publication_status":"published","author":[{"last_name":"Darrell","first_name":"Trevor","full_name":"Darrell, Trevor"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"},{"full_name":"Sebe, Nico","last_name":"Sebe","first_name":"Nico"},{"full_name":"Wu, Ying","last_name":"Wu","first_name":"Ying"},{"full_name":"Yan, Yan","first_name":"Yan","last_name":"Yan"}],"volume":40,"date_updated":"2023-09-11T14:07:54Z","date_created":"2018-12-11T11:45:48Z","publist_id":"7544","file_date_updated":"2020-07-14T12:46:03Z","citation":{"apa":"Darrell, T., Lampert, C., Sebe, N., Wu, Y., & Yan, Y. (2018). Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2018.2804998","ieee":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, and Y. Yan, “Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 5. IEEE, pp. 1029–1031, 2018.","ista":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. 2018. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(5), 1029–1031.","ama":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(5):1029-1031. doi:10.1109/TPAMI.2018.2804998","chicago":"Darrell, Trevor, Christoph Lampert, Nico Sebe, Ying Wu, and Yan Yan. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2018.2804998.","short":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, Y. Yan, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1029–1031.","mla":"Darrell, Trevor, et al. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 5, IEEE, 2018, pp. 1029–31, doi:10.1109/TPAMI.2018.2804998."},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","page":"1029 - 1031","article_type":"original","date_published":"2018-05-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","_id":"321","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 40","ddc":["000"],"title":"Guest editors' introduction to the special section on learning with Shared information for computer vision and multimedia analysis","status":"public","file":[{"relation":"main_file","file_id":"7835","date_updated":"2020-07-14T12:46:03Z","date_created":"2020-05-14T12:50:48Z","checksum":"b19c75da06faf3291a3ca47dfa50ef63","file_name":"2018_IEEE_Darrell.pdf","access_level":"open_access","content_type":"application/pdf","file_size":141724,"creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","issue":"5","abstract":[{"text":"The twelve papers in this special section focus on learning systems with shared information for computer vision and multimedia communication analysis. In the real world, a realistic setting for computer vision or multimedia recognition problems is that we have some classes containing lots of training data and many classes containing a small amount of training data. Therefore, how to use frequent classes to help learning rare classes for which it is harder to collect the training data is an open question. Learning with shared information is an emerging topic in machine learning, computer vision and multimedia analysis. There are different levels of components that can be shared during concept modeling and machine learning stages, such as sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, etc. Regarding the specific methods, multi-task learning, transfer learning and deep learning can be seen as using different strategies to share information. These learning with shared information methods are very effective in solving real-world large-scale problems.","lang":"eng"}]},{"date_created":"2021-08-09T13:13:48Z","date_updated":"2023-09-11T14:10:56Z","oa_version":"Published Version","author":[{"full_name":"Harrison, Mark C.","last_name":"Harrison","first_name":"Mark C."},{"first_name":"Evelien","last_name":"Jongepier","full_name":"Jongepier, Evelien"},{"last_name":"Robertson","first_name":"Hugh M.","full_name":"Robertson, Hugh M."},{"first_name":"Nicolas","last_name":"Arning","full_name":"Arning, Nicolas"},{"full_name":"Bitard-Feildel, Tristan","first_name":"Tristan","last_name":"Bitard-Feildel"},{"full_name":"Chao, Hsu","last_name":"Chao","first_name":"Hsu"},{"first_name":"Christopher P.","last_name":"Childers","full_name":"Childers, Christopher P."},{"full_name":"Dinh, Huyen","first_name":"Huyen","last_name":"Dinh"},{"full_name":"Doddapaneni, Harshavardhan","last_name":"Doddapaneni","first_name":"Harshavardhan"},{"last_name":"Dugan","first_name":"Shannon","full_name":"Dugan, Shannon"},{"full_name":"Gowin, Johannes","last_name":"Gowin","first_name":"Johannes"},{"full_name":"Greiner, Carolin","first_name":"Carolin","last_name":"Greiner"},{"first_name":"Yi","last_name":"Han","full_name":"Han, Yi"},{"last_name":"Hu","first_name":"Haofu","full_name":"Hu, Haofu"},{"full_name":"Hughes, Daniel S. T.","last_name":"Hughes","first_name":"Daniel S. T."},{"full_name":"Huylmans, Ann K","first_name":"Ann K","last_name":"Huylmans","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8871-4961"},{"full_name":"Kemena, Carsten","first_name":"Carsten","last_name":"Kemena"},{"last_name":"Kremer","first_name":"Lukas P. M.","full_name":"Kremer, Lukas P. M."},{"full_name":"Lee, Sandra L.","first_name":"Sandra L.","last_name":"Lee"},{"full_name":"Lopez-Ezquerra, Alberto","first_name":"Alberto","last_name":"Lopez-Ezquerra"},{"full_name":"Mallet, Ludovic","first_name":"Ludovic","last_name":"Mallet"},{"full_name":"Monroy-Kuhn, Jose M.","first_name":"Jose M.","last_name":"Monroy-Kuhn"},{"last_name":"Moser","first_name":"Annabell","full_name":"Moser, Annabell"},{"last_name":"Murali","first_name":"Shwetha C.","full_name":"Murali, Shwetha C."},{"full_name":"Muzny, Donna M.","last_name":"Muzny","first_name":"Donna M."},{"first_name":"Saria","last_name":"Otani","full_name":"Otani, Saria"},{"full_name":"Piulachs, Maria-Dolors","last_name":"Piulachs","first_name":"Maria-Dolors"},{"full_name":"Poelchau, Monica","last_name":"Poelchau","first_name":"Monica"},{"full_name":"Qu, Jiaxin","first_name":"Jiaxin","last_name":"Qu"},{"last_name":"Schaub","first_name":"Florentine","full_name":"Schaub, Florentine"},{"last_name":"Wada-Katsumata","first_name":"Ayako","full_name":"Wada-Katsumata, Ayako"},{"last_name":"Worley","first_name":"Kim C.","full_name":"Worley, Kim C."},{"full_name":"Xie, Qiaolin","last_name":"Xie","first_name":"Qiaolin"},{"first_name":"Guillem","last_name":"Ylla","full_name":"Ylla, Guillem"},{"last_name":"Poulsen","first_name":"Michael","full_name":"Poulsen, Michael"},{"last_name":"Gibbs","first_name":"Richard A.","full_name":"Gibbs, Richard A."},{"last_name":"Schal","first_name":"Coby","full_name":"Schal, Coby"},{"first_name":"Stephen","last_name":"Richards","full_name":"Richards, Stephen"},{"first_name":"Xavier","last_name":"Belles","full_name":"Belles, Xavier"},{"full_name":"Korb, Judith","last_name":"Korb","first_name":"Judith"},{"full_name":"Bornberg-Bauer, Erich","last_name":"Bornberg-Bauer","first_name":"Erich"}],"related_material":{"record":[{"id":"448","status":"public","relation":"used_in_publication"}]},"title":"Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality","status":"public","department":[{"_id":"BeVi"}],"publisher":"Dryad","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9841","year":"2018","abstract":[{"text":"Around 150 million years ago, eusocial termites evolved from within the cockroaches, 50 million years before eusocial Hymenoptera, such as bees and ants, appeared. Here, we report the 2-Gb genome of the German cockroach, Blattella germanica, and the 1.3-Gb genome of the drywood termite Cryptotermes secundus. We show evolutionary signatures of termite eusociality by comparing the genomes and transcriptomes of three termites and the cockroach against the background of 16 other eusocial and non-eusocial insects. Dramatic adaptive changes in genes underlying the production and perception of pheromones confirm the importance of chemical communication in the termites. These are accompanied by major changes in gene regulation and the molecular evolution of caste determination. Many of these results parallel molecular mechanisms of eusocial evolution in Hymenoptera. However, the specific solutions are remarkably different, thus revealing a striking case of convergence in one of the major evolutionary transitions in biological complexity.","lang":"eng"}],"type":"research_data_reference","date_published":"2018-12-12T00:00:00Z","doi":"10.5061/dryad.51d4r","main_file_link":[{"url":"https://doi.org/10.5061/dryad.51d4r","open_access":"1"}],"citation":{"chicago":"Harrison, Mark C., Evelien Jongepier, Hugh M. Robertson, Nicolas Arning, Tristan Bitard-Feildel, Hsu Chao, Christopher P. Childers, et al. “Data from: Hemimetabolous Genomes Reveal Molecular Basis of Termite Eusociality.” Dryad, 2018. https://doi.org/10.5061/dryad.51d4r.","mla":"Harrison, Mark C., et al. Data from: Hemimetabolous Genomes Reveal Molecular Basis of Termite Eusociality. Dryad, 2018, doi:10.5061/dryad.51d4r.","short":"M.C. Harrison, E. Jongepier, H.M. Robertson, N. Arning, T. Bitard-Feildel, H. Chao, C.P. Childers, H. Dinh, H. Doddapaneni, S. Dugan, J. Gowin, C. Greiner, Y. Han, H. Hu, D.S.T. Hughes, A.K. Huylmans, C. Kemena, L.P.M. Kremer, S.L. Lee, A. Lopez-Ezquerra, L. Mallet, J.M. Monroy-Kuhn, A. Moser, S.C. Murali, D.M. Muzny, S. Otani, M.-D. Piulachs, M. Poelchau, J. Qu, F. Schaub, A. Wada-Katsumata, K.C. Worley, Q. Xie, G. Ylla, M. Poulsen, R.A. Gibbs, C. Schal, S. Richards, X. Belles, J. Korb, E. Bornberg-Bauer, (2018).","ista":"Harrison MC, Jongepier E, Robertson HM, Arning N, Bitard-Feildel T, Chao H, Childers CP, Dinh H, Doddapaneni H, Dugan S, Gowin J, Greiner C, Han Y, Hu H, Hughes DST, Huylmans AK, Kemena C, Kremer LPM, Lee SL, Lopez-Ezquerra A, Mallet L, Monroy-Kuhn JM, Moser A, Murali SC, Muzny DM, Otani S, Piulachs M-D, Poelchau M, Qu J, Schaub F, Wada-Katsumata A, Worley KC, Xie Q, Ylla G, Poulsen M, Gibbs RA, Schal C, Richards S, Belles X, Korb J, Bornberg-Bauer E. 2018. Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality, Dryad, 10.5061/dryad.51d4r.","apa":"Harrison, M. C., Jongepier, E., Robertson, H. M., Arning, N., Bitard-Feildel, T., Chao, H., … Bornberg-Bauer, E. (2018). Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality. Dryad. https://doi.org/10.5061/dryad.51d4r","ieee":"M. C. Harrison et al., “Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality.” Dryad, 2018.","ama":"Harrison MC, Jongepier E, Robertson HM, et al. Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality. 2018. doi:10.5061/dryad.51d4r"},"oa":1,"month":"12","day":"12","article_processing_charge":"No"},{"doi":"10.1016/j.celrep.2018.09.066","language":[{"iso":"eng"}],"external_id":{"isi":["000448219500005"]},"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"},"oa":1,"isi":1,"quality_controlled":"1","month":"10","author":[{"full_name":"Chen, Ting","first_name":"Ting","last_name":"Chen"},{"last_name":"Kula","first_name":"Bartosz","full_name":"Kula, Bartosz"},{"full_name":"Nagy, Balint","id":"30F830CE-02D1-11E9-9BAA-DAF4881429F2","orcid":"0000-0002-4002-4686","first_name":"Balint","last_name":"Nagy"},{"full_name":"Barzan, Ruxandra","last_name":"Barzan","first_name":"Ruxandra"},{"last_name":"Gall","first_name":"Andrea","full_name":"Gall, Andrea"},{"first_name":"Ingrid","last_name":"Ehrlich","full_name":"Ehrlich, Ingrid"},{"last_name":"Kukley","first_name":"Maria","full_name":"Kukley, Maria"}],"volume":25,"date_updated":"2023-09-11T14:13:32Z","date_created":"2018-12-11T11:44:16Z","year":"2018","acknowledgement":"This work was supported by Deutsche Forschungsgemeinschaft (DFG) grant KU2569/1-1 (to M.K.); DFG project EXC307Centre for Integrative Neuroscience (CIN), including grant Pool Project 2011-12 (jointly to M.K. and I.E.); and the Charitable Hertie Foundation (to I.E.). CIN is an Excellence Cluster funded by the DFG within the framework of the Excellence Initiative for 2008–2018. M.K. is supported by the Tistou & Charlotte Kerstan Foundation.","department":[{"_id":"SaSi"}],"publisher":"Elsevier","publication_status":"published","publist_id":"8023","file_date_updated":"2020-07-14T12:46:03Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_published":"2018-10-23T00:00:00Z","citation":{"ieee":"T. Chen et al., “In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2,” Cell Reports, vol. 25, no. 4. Elsevier, p. 852–861.e7, 2018.","apa":"Chen, T., Kula, B., Nagy, B., Barzan, R., Gall, A., Ehrlich, I., & Kukley, M. (2018). In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2018.09.066","ista":"Chen T, Kula B, Nagy B, Barzan R, Gall A, Ehrlich I, Kukley M. 2018. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. 25(4), 852–861.e7.","ama":"Chen T, Kula B, Nagy B, et al. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. 2018;25(4):852-861.e7. doi:10.1016/j.celrep.2018.09.066","chicago":"Chen, Ting, Bartosz Kula, Balint Nagy, Ruxandra Barzan, Andrea Gall, Ingrid Ehrlich, and Maria Kukley. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” Cell Reports. Elsevier, 2018. https://doi.org/10.1016/j.celrep.2018.09.066.","short":"T. Chen, B. Kula, B. Nagy, R. Barzan, A. Gall, I. Ehrlich, M. Kukley, Cell Reports 25 (2018) 852–861.e7.","mla":"Chen, Ting, et al. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” Cell Reports, vol. 25, no. 4, Elsevier, 2018, p. 852–861.e7, doi:10.1016/j.celrep.2018.09.066."},"publication":"Cell Reports","page":"852 - 861.e7","article_processing_charge":"No","has_accepted_license":"1","day":"23","scopus_import":"1","file":[{"creator":"dernst","content_type":"application/pdf","file_size":4461997,"access_level":"open_access","file_name":"2018_CellReports_Chen.pdf","checksum":"d9f74277fd57176e04732707d575cf08","date_updated":"2020-07-14T12:46:03Z","date_created":"2018-12-17T12:42:57Z","file_id":"5703","relation":"main_file"}],"oa_version":"Published Version","_id":"32","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 25","status":"public","title":"In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2","ddc":["570"],"issue":"4","abstract":[{"text":"The functional role of AMPA receptor (AMPAR)-mediated synaptic signaling between neurons and oligodendrocyte precursor cells (OPCs) remains enigmatic. We modified the properties of AMPARs at axon-OPC synapses in the mouse corpus callosum in vivo during the peak of myelination by targeting the GluA2 subunit. Expression of the unedited (Ca2+ permeable) or the pore-dead GluA2 subunit of AMPARs triggered proliferation of OPCs and reduced their differentiation into oligodendrocytes. Expression of the cytoplasmic C-terminal (GluA2(813-862)) of the GluA2 subunit (C-tail), a modification designed to affect the interaction between GluA2 and AMPAR-binding proteins and to perturb trafficking of GluA2-containing AMPARs, decreased the differentiation of OPCs without affecting their proliferation. These findings suggest that ionotropic and non-ionotropic properties of AMPARs in OPCs, as well as specific aspects of AMPAR-mediated signaling at axon-OPC synapses in the mouse corpus callosum, are important for balancing the response of OPCs to proliferation and differentiation cues. In the brain, oligodendrocyte precursor cells (OPCs) receive glutamatergic AMPA-receptor-mediated synaptic input from neurons. Chen et al. show that modifying AMPA-receptor properties at axon-OPC synapses alters proliferation and differentiation of OPCs. This expands the traditional view of synaptic transmission by suggesting neurons also use synapses to modulate behavior of glia.","lang":"eng"}],"type":"journal_article"},{"department":[{"_id":"MiSi"}],"publisher":"Rockefeller University Press","publication_status":"published","year":"2018","volume":215,"date_updated":"2023-09-11T14:12:06Z","date_created":"2018-12-16T22:59:18Z","author":[{"orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87","last_name":"Reversat","first_name":"Anne","full_name":"Reversat, Anne"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"}],"file_date_updated":"2020-07-14T12:47:09Z","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"external_id":{"isi":["000451920600002"]},"language":[{"iso":"eng"}],"doi":"10.1084/jem.20181934","publication_identifier":{"issn":["00221007"]},"month":"11","intvolume":" 215","status":"public","title":"IgM's exit route","ddc":["570"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5672","file":[{"access_level":"open_access","file_name":"2018_JournalExperMed_Reversat.pdf","file_size":1216437,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5931","checksum":"687beea1d64c213f4cb9e3c29ec11a14","date_updated":"2020-07-14T12:47:09Z","date_created":"2019-02-06T08:49:52Z"}],"oa_version":"Published Version","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"The release of IgM is the first line of an antibody response and precedes the generation of high affinity IgG in germinal centers. Once secreted by freshly activated plasmablasts, IgM is released into the efferent lymph of reactive lymph nodes as early as 3 d after immunization. As pentameric IgM has an enormous size of 1,000 kD, its diffusibility is low, and one might wonder how it can pass through the densely lymphocyte-packed environment of a lymph node parenchyma in order to reach its exit. In this issue of JEM, Thierry et al. show that, in order to reach the blood stream, IgM molecules take a specific micro-anatomical route via lymph node conduits."}],"page":"2959-2961","citation":{"mla":"Reversat, Anne, and Michael K. Sixt. “IgM’s Exit Route.” Journal of Experimental Medicine, vol. 215, no. 12, Rockefeller University Press, 2018, pp. 2959–61, doi:10.1084/jem.20181934.","short":"A. Reversat, M.K. Sixt, Journal of Experimental Medicine 215 (2018) 2959–2961.","chicago":"Reversat, Anne, and Michael K Sixt. “IgM’s Exit Route.” Journal of Experimental Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20181934.","ama":"Reversat A, Sixt MK. IgM’s exit route. Journal of Experimental Medicine. 2018;215(12):2959-2961. doi:10.1084/jem.20181934","ista":"Reversat A, Sixt MK. 2018. IgM’s exit route. Journal of Experimental Medicine. 215(12), 2959–2961.","apa":"Reversat, A., & Sixt, M. K. (2018). IgM’s exit route. Journal of Experimental Medicine. Rockefeller University Press. https://doi.org/10.1084/jem.20181934","ieee":"A. Reversat and M. K. Sixt, “IgM’s exit route,” Journal of Experimental Medicine, vol. 215, no. 12. Rockefeller University Press, pp. 2959–2961, 2018."},"publication":"Journal of Experimental Medicine","date_published":"2018-11-20T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"20"},{"language":[{"iso":"eng"}],"doi":"10.1090/tran/7292","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000423197800019"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.04637"}],"oa":1,"month":"04","volume":370,"date_created":"2018-12-11T11:46:35Z","date_updated":"2023-09-11T14:19:12Z","author":[{"full_name":"Akopyan, Arseniy","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X"},{"full_name":"Bobenko, Alexander","first_name":"Alexander","last_name":"Bobenko"}],"publisher":"American Mathematical Society","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2018","acknowledgement":"DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”; People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) REA grant agreement n◦[291734]","publist_id":"7363","ec_funded":1,"date_published":"2018-04-01T00:00:00Z","page":"2825 - 2854","citation":{"ista":"Akopyan A, Bobenko A. 2018. Incircular nets and confocal conics. Transactions of the American Mathematical Society. 370(4), 2825–2854.","apa":"Akopyan, A., & Bobenko, A. (2018). Incircular nets and confocal conics. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7292","ieee":"A. Akopyan and A. Bobenko, “Incircular nets and confocal conics,” Transactions of the American Mathematical Society, vol. 370, no. 4. American Mathematical Society, pp. 2825–2854, 2018.","ama":"Akopyan A, Bobenko A. Incircular nets and confocal conics. Transactions of the American Mathematical Society. 2018;370(4):2825-2854. doi:10.1090/tran/7292","chicago":"Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal Conics.” Transactions of the American Mathematical Society. American Mathematical Society, 2018. https://doi.org/10.1090/tran/7292.","mla":"Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal Conics.” Transactions of the American Mathematical Society, vol. 370, no. 4, American Mathematical Society, 2018, pp. 2825–54, doi:10.1090/tran/7292.","short":"A. Akopyan, A. Bobenko, Transactions of the American Mathematical Society 370 (2018) 2825–2854."},"publication":"Transactions of the American Mathematical Society","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","intvolume":" 370","title":"Incircular nets and confocal conics","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"458","issue":"4","abstract":[{"lang":"eng","text":"We consider congruences of straight lines in a plane with the combinatorics of the square grid, with all elementary quadrilaterals possessing an incircle. It is shown that all the vertices of such nets (we call them incircular or IC-nets) lie on confocal conics. Our main new results are on checkerboard IC-nets in the plane. These are congruences of straight lines in the plane with the combinatorics of the square grid, combinatorially colored as a checkerboard, such that all black coordinate quadrilaterals possess inscribed circles. We show how this larger class of IC-nets appears quite naturally in Laguerre geometry of oriented planes and spheres and leads to new remarkable incidence theorems. Most of our results are valid in hyperbolic and spherical geometries as well. We present also generalizations in spaces of higher dimension, called checkerboard IS-nets. The construction of these nets is based on a new 9 inspheres incidence theorem."}],"type":"journal_article"},{"date_published":"2018-11-21T00:00:00Z","page":"21-36","citation":{"apa":"Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2","ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","mla":"Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2."},"day":"21","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","status":"public","title":"Infinite-duration poorman-bidding games","intvolume":" 11316","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5788","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"14th International Conference on Web and Internet Economics, WINE","end_date":"2018-12-17","start_date":"2018-12-15","location":"Oxford, UK"},"doi":"10.1007/978-3-030-04612-5_2","quality_controlled":"1","isi":1,"project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.04372"}],"oa":1,"external_id":{"arxiv":["1804.04372"],"isi":["000865933000002"]},"month":"11","publication_identifier":{"issn":["03029743"],"isbn":["9783030046118"]},"date_created":"2018-12-30T22:59:14Z","date_updated":"2023-09-12T07:44:01Z","volume":11316,"author":[{"full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"year":"2018"},{"publisher":"Nature Publishing Group","department":[{"_id":"FlSc"}],"publication_status":"published","pmid":1,"year":"2018","volume":560,"date_created":"2018-12-11T11:44:53Z","date_updated":"2023-09-12T07:44:37Z","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s41586-018-0505-4"}]},"author":[{"full_name":"Dick, Robert","first_name":"Robert","last_name":"Dick"},{"full_name":"Zadrozny, Kaneil K","last_name":"Zadrozny","first_name":"Kaneil K"},{"full_name":"Xu, Chaoyi","first_name":"Chaoyi","last_name":"Xu"},{"full_name":"Schur, Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","first_name":"Florian","last_name":"Schur"},{"full_name":"Lyddon, Terri D","first_name":"Terri D","last_name":"Lyddon"},{"last_name":"Ricana","first_name":"Clifton L","full_name":"Ricana, Clifton L"},{"last_name":"Wagner","first_name":"Jonathan M","full_name":"Wagner, Jonathan M"},{"full_name":"Perilla, Juan R","last_name":"Perilla","first_name":"Juan R"},{"last_name":"Ganser","first_name":"Pornillos Barbie K","full_name":"Ganser, Pornillos Barbie K"},{"full_name":"Johnson, Marc C","first_name":"Marc C","last_name":"Johnson"},{"full_name":"Pornillos, Owen","first_name":"Owen","last_name":"Pornillos"},{"full_name":"Vogt, Volker","first_name":"Volker","last_name":"Vogt"}],"publication_identifier":{"eissn":["1476-4687"]},"month":"08","quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000442483400046"],"pmid":["30158708"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6242333/"}],"language":[{"iso":"eng"}],"doi":"10.1038/s41586-018-0396-4","type":"journal_article","issue":"7719","abstract":[{"text":"A short, 14-amino-acid segment called SP1, located in the Gag structural protein1, has a critical role during the formation of the HIV-1 virus particle. During virus assembly, the SP1 peptide and seven preceding residues fold into a six-helix bundle, which holds together the Gag hexamer and facilitates the formation of a curved immature hexagonal lattice underneath the viral membrane2,3. Upon completion of assembly and budding, proteolytic cleavage of Gag leads to virus maturation, in which the immature lattice is broken down; the liberated CA domain of Gag then re-assembles into the mature conical capsid that encloses the viral genome and associated enzymes. Folding and proteolysis of the six-helix bundle are crucial rate-limiting steps of both Gag assembly and disassembly, and the six-helix bundle is an established target of HIV-1 inhibitors4,5. Here, using a combination of structural and functional analyses, we show that inositol hexakisphosphate (InsP6, also known as IP6) facilitates the formation of the six-helix bundle and assembly of the immature HIV-1 Gag lattice. IP6 makes ionic contacts with two rings of lysine residues at the centre of the Gag hexamer. Proteolytic cleavage then unmasks an alternative binding site, where IP6 interaction promotes the assembly of the mature capsid lattice. These studies identify IP6 as a naturally occurring small molecule that promotes both assembly and maturation of HIV-1.","lang":"eng"}],"intvolume":" 560","status":"public","title":"Inositol phosphates are assembly co-factors for HIV-1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"150","oa_version":"Submitted Version","scopus_import":"1","article_processing_charge":"No","day":"29","page":"509–512","article_type":"original","citation":{"short":"R. Dick, K.K. Zadrozny, C. Xu, F.K. Schur, T.D. Lyddon, C.L. Ricana, J.M. Wagner, J.R. Perilla, P.B.K. Ganser, M.C. Johnson, O. Pornillos, V. Vogt, Nature 560 (2018) 509–512.","mla":"Dick, Robert, et al. “Inositol Phosphates Are Assembly Co-Factors for HIV-1.” Nature, vol. 560, no. 7719, Nature Publishing Group, 2018, pp. 509–512, doi:10.1038/s41586-018-0396-4.","chicago":"Dick, Robert, Kaneil K Zadrozny, Chaoyi Xu, Florian KM Schur, Terri D Lyddon, Clifton L Ricana, Jonathan M Wagner, et al. “Inositol Phosphates Are Assembly Co-Factors for HIV-1.” Nature. Nature Publishing Group, 2018. https://doi.org/10.1038/s41586-018-0396-4.","ama":"Dick R, Zadrozny KK, Xu C, et al. Inositol phosphates are assembly co-factors for HIV-1. Nature. 2018;560(7719):509–512. doi:10.1038/s41586-018-0396-4","ieee":"R. Dick et al., “Inositol phosphates are assembly co-factors for HIV-1,” Nature, vol. 560, no. 7719. Nature Publishing Group, pp. 509–512, 2018.","apa":"Dick, R., Zadrozny, K. K., Xu, C., Schur, F. K., Lyddon, T. D., Ricana, C. L., … Vogt, V. (2018). Inositol phosphates are assembly co-factors for HIV-1. Nature. Nature Publishing Group. https://doi.org/10.1038/s41586-018-0396-4","ista":"Dick R, Zadrozny KK, Xu C, Schur FK, Lyddon TD, Ricana CL, Wagner JM, Perilla JR, Ganser PBK, Johnson MC, Pornillos O, Vogt V. 2018. Inositol phosphates are assembly co-factors for HIV-1. Nature. 560(7719), 509–512."},"publication":"Nature","date_published":"2018-08-29T00:00:00Z"},{"type":"journal_article","abstract":[{"text":"The theory of tropical series, that we develop here, firstly appeared in the study of the growth of pluriharmonic functions. Motivated by waves in sandpile models we introduce a dynamic on the set of tropical series, and it is experimentally observed that this dynamic obeys a power law. So, this paper serves as a compilation of results we need for other articles and also introduces several objects interesting by themselves.","lang":"eng"}],"issue":"6","status":"public","title":"Introduction to tropical series and wave dynamic on them","intvolume":" 38","_id":"303","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","scopus_import":"1","day":"01","article_processing_charge":"No","page":"2827 - 2849","publication":"Discrete and Continuous Dynamical Systems- Series A","citation":{"mla":"Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and Wave Dynamic on Them.” Discrete and Continuous Dynamical Systems- Series A, vol. 38, no. 6, AIMS, 2018, pp. 2827–49, doi:10.3934/dcds.2018120.","short":"N. Kalinin, M. Shkolnikov, Discrete and Continuous Dynamical Systems- Series A 38 (2018) 2827–2849.","chicago":"Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and Wave Dynamic on Them.” Discrete and Continuous Dynamical Systems- Series A. AIMS, 2018. https://doi.org/10.3934/dcds.2018120.","ama":"Kalinin N, Shkolnikov M. Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. 2018;38(6):2827-2849. doi:10.3934/dcds.2018120","ista":"Kalinin N, Shkolnikov M. 2018. Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. 38(6), 2827–2849.","apa":"Kalinin, N., & Shkolnikov, M. (2018). Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. AIMS. https://doi.org/10.3934/dcds.2018120","ieee":"N. Kalinin and M. Shkolnikov, “Introduction to tropical series and wave dynamic on them,” Discrete and Continuous Dynamical Systems- Series A, vol. 38, no. 6. AIMS, pp. 2827–2849, 2018."},"date_published":"2018-06-01T00:00:00Z","publist_id":"7576","publication_status":"published","department":[{"_id":"TaHa"}],"publisher":"AIMS","acknowledgement":"The first author, Nikita Kalinin, is funded by SNCF PostDoc.Mobility grant 168647. Support from the Basic Research Program of the National Research University Higher School of Economics is gratefully acknowledged. The second author, Mikhail Shkolnikov, is supported in part by the grant 159240 of the Swiss National Science Foundation as well as by the National Center of Competence in Research SwissMAP of the Swiss National Science Foundation.","year":"2018","date_created":"2018-12-11T11:45:43Z","date_updated":"2023-09-12T07:45:37Z","volume":38,"author":[{"full_name":"Kalinin, Nikita","first_name":"Nikita","last_name":"Kalinin"},{"orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87","last_name":"Shkolnikov","first_name":"Mikhail","full_name":"Shkolnikov, Mikhail"}],"month":"06","isi":1,"quality_controlled":"1","external_id":{"arxiv":["1706.03062"],"isi":["000438818400007"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1706.03062","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.3934/dcds.2018120"},{"abstract":[{"lang":"eng","text":"Approximating a probability density in a tractable manner is a central task\r\nin Bayesian statistics. Variational Inference (VI) is a popular technique that\r\nachieves tractability by choosing a relatively simple variational family.\r\nBorrowing ideas from the classic boosting framework, recent approaches attempt\r\nto \\emph{boost} VI by replacing the selection of a single density with a\r\ngreedily constructed mixture of densities. In order to guarantee convergence,\r\nprevious works impose stringent assumptions that require significant effort for\r\npractitioners. Specifically, they require a custom implementation of the greedy\r\nstep (called the LMO) for every probabilistic model with respect to an\r\nunnatural variational family of truncated distributions. Our work fixes these\r\nissues with novel theoretical and algorithmic insights. On the theoretical\r\nside, we show that boosting VI satisfies a relaxed smoothness assumption which\r\nis sufficient for the convergence of the functional Frank-Wolfe (FW) algorithm.\r\nFurthermore, we rephrase the LMO problem and propose to maximize the Residual\r\nELBO (RELBO) which replaces the standard ELBO optimization in VI. These\r\ntheoretical enhancements allow for black box implementation of the boosting\r\nsubroutine. Finally, we present a stopping criterion drawn from the duality gap\r\nin the classic FW analyses and exhaustive experiments to illustrate the\r\nusefulness of our theoretical and algorithmic contributions."}],"type":"conference","oa_version":"Preprint","status":"public","title":"Boosting black box variational inference","intvolume":" 31","_id":"14202","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"06","article_processing_charge":"No","scopus_import":"1","date_published":"2018-06-06T00:00:00Z","publication":"Advances in Neural Information Processing Systems","citation":{"ama":"Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. Boosting black box variational inference. In: Advances in Neural Information Processing Systems. Vol 31. Neural Information Processing Systems Foundation; 2018.","ista":"Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. 2018. Boosting black box variational inference. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 31.","ieee":"F. Locatello, G. Dresdner, R. Khanna, I. Valera, and G. Rätsch, “Boosting black box variational inference,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. 31.","apa":"Locatello, F., Dresdner, G., Khanna, R., Valera, I., & Rätsch, G. (2018). Boosting black box variational inference. In Advances in Neural Information Processing Systems (Vol. 31). Montreal, Canada: Neural Information Processing Systems Foundation.","mla":"Locatello, Francesco, et al. “Boosting Black Box Variational Inference.” Advances in Neural Information Processing Systems, vol. 31, Neural Information Processing Systems Foundation, 2018.","short":"F. Locatello, G. Dresdner, R. Khanna, I. Valera, G. Rätsch, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018.","chicago":"Locatello, Francesco, Gideon Dresdner, Rajiv Khanna, Isabel Valera, and Gunnar Rätsch. “Boosting Black Box Variational Inference.” In Advances in Neural Information Processing Systems, Vol. 31. Neural Information Processing Systems Foundation, 2018."},"extern":"1","date_updated":"2023-09-13T07:38:24Z","date_created":"2023-08-22T14:15:40Z","volume":31,"author":[{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"},{"last_name":"Dresdner","first_name":"Gideon","full_name":"Dresdner, Gideon"},{"last_name":"Khanna","first_name":"Rajiv","full_name":"Khanna, Rajiv"},{"full_name":"Valera, Isabel","last_name":"Valera","first_name":"Isabel"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"}],"publication_status":"published","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"FrLo"}],"year":"2018","month":"06","publication_identifier":{"isbn":["9781510884472"],"eissn":["1049-5258"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2018-12-08","location":"Montreal, Canada","start_date":"2018-12-03","name":"NeurIPS: Neural Information Processing Systems"},"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1806.02185","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1806.02185"]}},{"extern":"1","date_updated":"2023-09-13T07:52:40Z","date_created":"2023-08-22T14:15:20Z","volume":84,"author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Khanna, Rajiv","first_name":"Rajiv","last_name":"Khanna"},{"full_name":"Ghosh, Joydeep","last_name":"Ghosh","first_name":"Joydeep"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"}],"publication_status":"published","department":[{"_id":"FrLo"}],"publisher":"ML Research Press","year":"2018","month":"04","language":[{"iso":"eng"}],"conference":{"end_date":"2018-04-11","location":"Playa Blanca, Lanzarote","start_date":"2018-04-09","name":"AISTATS: Conference on Artificial Intelligence and Statistics"},"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.01733"}],"external_id":{"arxiv":["1708.01733"]},"abstract":[{"lang":"eng","text":"Variational inference is a popular technique to approximate a possibly\r\nintractable Bayesian posterior with a more tractable one. Recently, boosting\r\nvariational inference has been proposed as a new paradigm to approximate the\r\nposterior by a mixture of densities by greedily adding components to the\r\nmixture. However, as is the case with many other variational inference\r\nalgorithms, its theoretical properties have not been studied. In the present\r\nwork, we study the convergence properties of this approach from a modern\r\noptimization viewpoint by establishing connections to the classic Frank-Wolfe\r\nalgorithm. Our analyses yields novel theoretical insights regarding the\r\nsufficient conditions for convergence, explicit rates, and algorithmic\r\nsimplifications. Since a lot of focus in previous works for variational\r\ninference has been on tractability, our work is especially important as a much\r\nneeded attempt to bridge the gap between probabilistic models and their\r\ncorresponding theoretical properties."}],"alternative_title":["PMLR"],"type":"conference","oa_version":"Preprint","title":"Boosting variational inference: An optimization perspective","status":"public","intvolume":" 84","_id":"14201","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","article_processing_charge":"No","scopus_import":"1","date_published":"2018-04-15T00:00:00Z","page":"464-472","publication":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics","citation":{"ista":"Locatello F, Khanna R, Ghosh J, Rätsch G. 2018. Boosting variational inference: An optimization perspective. Proceedings of the 21st International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 84, 464–472.","ieee":"F. Locatello, R. Khanna, J. Ghosh, and G. Rätsch, “Boosting variational inference: An optimization perspective,” in Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, Playa Blanca, Lanzarote, 2018, vol. 84, pp. 464–472.","apa":"Locatello, F., Khanna, R., Ghosh, J., & Rätsch, G. (2018). Boosting variational inference: An optimization perspective. In Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (Vol. 84, pp. 464–472). Playa Blanca, Lanzarote: ML Research Press.","ama":"Locatello F, Khanna R, Ghosh J, Rätsch G. Boosting variational inference: An optimization perspective. In: Proceedings of the 21st International Conference on Artificial Intelligence and Statistics. Vol 84. ML Research Press; 2018:464-472.","chicago":"Locatello, Francesco, Rajiv Khanna, Joydeep Ghosh, and Gunnar Rätsch. “Boosting Variational Inference: An Optimization Perspective.” In Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, 84:464–72. ML Research Press, 2018.","mla":"Locatello, Francesco, et al. “Boosting Variational Inference: An Optimization Perspective.” Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, vol. 84, ML Research Press, 2018, pp. 464–72.","short":"F. Locatello, R. Khanna, J. Ghosh, G. Rätsch, in:, Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, ML Research Press, 2018, pp. 464–472."}},{"abstract":[{"text":"High-dimensional time series are common in many domains. Since human\r\ncognition is not optimized to work well in high-dimensional spaces, these areas\r\ncould benefit from interpretable low-dimensional representations. However, most\r\nrepresentation learning algorithms for time series data are difficult to\r\ninterpret. This is due to non-intuitive mappings from data features to salient\r\nproperties of the representation and non-smoothness over time. To address this\r\nproblem, we propose a new representation learning framework building on ideas\r\nfrom interpretable discrete dimensionality reduction and deep generative\r\nmodeling. This framework allows us to learn discrete representations of time\r\nseries, which give rise to smooth and interpretable embeddings with superior\r\nclustering performance. We introduce a new way to overcome the\r\nnon-differentiability in discrete representation learning and present a\r\ngradient-based version of the traditional self-organizing map algorithm that is\r\nmore performant than the original. Furthermore, to allow for a probabilistic\r\ninterpretation of our method, we integrate a Markov model in the representation\r\nspace. This model uncovers the temporal transition structure, improves\r\nclustering performance even further and provides additional explanatory\r\ninsights as well as a natural representation of uncertainty. We evaluate our\r\nmodel in terms of clustering performance and interpretability on static\r\n(Fashion-)MNIST data, a time series of linearly interpolated (Fashion-)MNIST\r\nimages, a chaotic Lorenz attractor system with two macro states, as well as on\r\na challenging real world medical time series application on the eICU data set.\r\nOur learned representations compare favorably with competitor methods and\r\nfacilitate downstream tasks on the real world data.","lang":"eng"}],"extern":"1","type":"conference","author":[{"first_name":"Vincent","last_name":"Fortuin","full_name":"Fortuin, Vincent"},{"first_name":"Matthias","last_name":"Hüser","full_name":"Hüser, Matthias"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco"},{"last_name":"Strathmann","first_name":"Heiko","full_name":"Strathmann, Heiko"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"}],"oa_version":"Preprint","date_created":"2023-08-22T14:12:48Z","date_updated":"2023-09-13T06:35:12Z","_id":"14198","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"FrLo"}],"title":"SOM-VAE: Interpretable discrete representation learning on time series","publication_status":"published","status":"public","article_processing_charge":"No","day":"06","month":"06","date_published":"2018-06-06T00:00:00Z","conference":{"location":"New Orleans, LA, United States","start_date":"2019-05-06","end_date":"2019-05-09","name":"ICLR: International Conference on Learning Representations"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.02199"}],"citation":{"chicago":"Fortuin, Vincent, Matthias Hüser, Francesco Locatello, Heiko Strathmann, and Gunnar Rätsch. “SOM-VAE: Interpretable Discrete Representation Learning on Time Series.” In International Conference on Learning Representations, 2018.","short":"V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, G. Rätsch, in:, International Conference on Learning Representations, 2018.","mla":"Fortuin, Vincent, et al. “SOM-VAE: Interpretable Discrete Representation Learning on Time Series.” International Conference on Learning Representations, 2018.","ieee":"V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, and G. Rätsch, “SOM-VAE: Interpretable discrete representation learning on time series,” in International Conference on Learning Representations, New Orleans, LA, United States, 2018.","apa":"Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., & Rätsch, G. (2018). SOM-VAE: Interpretable discrete representation learning on time series. In International Conference on Learning Representations. New Orleans, LA, United States.","ista":"Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. 2018. SOM-VAE: Interpretable discrete representation learning on time series. International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. SOM-VAE: Interpretable discrete representation learning on time series. In: International Conference on Learning Representations. ; 2018."},"external_id":{"arxiv":["1806.02199"]},"publication":"International Conference on Learning Representations","quality_controlled":"1"},{"conference":{"end_date":"2018-07-15","start_date":"2018-07-10","location":"Stockholm, Sweden","name":"ICML: International Conference on Machine Learning"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.08544","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1804.08544"]},"quality_controlled":"1","month":"07","author":[{"full_name":"Yurtsever, Alp","last_name":"Yurtsever","first_name":"Alp"},{"last_name":"Fercoq","first_name":"Olivier","full_name":"Fercoq, Olivier"},{"full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"first_name":"Volkan","last_name":"Cevher","full_name":"Cevher, Volkan"}],"volume":80,"date_created":"2023-08-22T14:16:01Z","date_updated":"2023-09-13T08:13:39Z","year":"2018","department":[{"_id":"FrLo"}],"publisher":"ML Research Press","publication_status":"published","extern":"1","date_published":"2018-07-15T00:00:00Z","citation":{"mla":"Yurtsever, Alp, et al. “A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming.” Proceedings of the 35th International Conference on Machine Learning, vol. 80, ML Research Press, 2018, pp. 5727–36.","short":"A. Yurtsever, O. Fercoq, F. Locatello, V. Cevher, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 5727–5736.","chicago":"Yurtsever, Alp, Olivier Fercoq, Francesco Locatello, and Volkan Cevher. “A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming.” In Proceedings of the 35th International Conference on Machine Learning, 80:5727–36. ML Research Press, 2018.","ama":"Yurtsever A, Fercoq O, Locatello F, Cevher V. A conditional gradient framework for composite convex minimization with applications to semidefinite programming. In: Proceedings of the 35th International Conference on Machine Learning. Vol 80. ML Research Press; 2018:5727-5736.","ista":"Yurtsever A, Fercoq O, Locatello F, Cevher V. 2018. A conditional gradient framework for composite convex minimization with applications to semidefinite programming. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 80, 5727–5736.","ieee":"A. Yurtsever, O. Fercoq, F. Locatello, and V. Cevher, “A conditional gradient framework for composite convex minimization with applications to semidefinite programming,” in Proceedings of the 35th International Conference on Machine Learning, Stockholm, Sweden, 2018, vol. 80, pp. 5727–5736.","apa":"Yurtsever, A., Fercoq, O., Locatello, F., & Cevher, V. (2018). A conditional gradient framework for composite convex minimization with applications to semidefinite programming. In Proceedings of the 35th International Conference on Machine Learning (Vol. 80, pp. 5727–5736). Stockholm, Sweden: ML Research Press."},"publication":"Proceedings of the 35th International Conference on Machine Learning","page":"5727-5736","article_processing_charge":"No","day":"15","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14203","intvolume":" 80","title":"A conditional gradient framework for composite convex minimization with applications to semidefinite programming","status":"public","abstract":[{"text":"We propose a conditional gradient framework for a composite convex minimization template with broad applications. Our approach combines smoothing and homotopy techniques under the CGM framework, and provably achieves the optimal O(1/k−−√) convergence rate. We demonstrate that the same rate holds if the linear subproblems are solved approximately with additive or multiplicative error. In contrast with the relevant work, we are able to characterize the convergence when the non-smooth term is an indicator function. Specific applications of our framework include the non-smooth minimization, semidefinite programming, and minimization with linear inclusion constraints over a compact domain. Numerical evidence demonstrates the benefits of our framework.","lang":"eng"}],"type":"conference","alternative_title":["PMLR"]},{"page":"1279 - 1303","publication":"Genetics","citation":{"mla":"Sachdeva, Himani, and Nicholas H. Barton. “Introgression of a Block of Genome under Infinitesimal Selection.” Genetics, vol. 209, no. 4, Genetics Society of America, 2018, pp. 1279–303, doi:10.1534/genetics.118.301018.","short":"H. Sachdeva, N.H. Barton, Genetics 209 (2018) 1279–1303.","chicago":"Sachdeva, Himani, and Nicholas H Barton. “Introgression of a Block of Genome under Infinitesimal Selection.” Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/genetics.118.301018.","ama":"Sachdeva H, Barton NH. Introgression of a block of genome under infinitesimal selection. Genetics. 2018;209(4):1279-1303. doi:10.1534/genetics.118.301018","ista":"Sachdeva H, Barton NH. 2018. Introgression of a block of genome under infinitesimal selection. Genetics. 209(4), 1279–1303.","apa":"Sachdeva, H., & Barton, N. H. (2018). Introgression of a block of genome under infinitesimal selection. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.118.301018","ieee":"H. Sachdeva and N. H. Barton, “Introgression of a block of genome under infinitesimal selection,” Genetics, vol. 209, no. 4. Genetics Society of America, pp. 1279–1303, 2018."},"date_published":"2018-08-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","status":"public","title":"Introgression of a block of genome under infinitesimal selection","intvolume":" 209","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"282","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"Adaptive introgression is common in nature and can be driven by selection acting on multiple, linked genes. We explore the effects of polygenic selection on introgression under the infinitesimal model with linkage. This model assumes that the introgressing block has an effectively infinite number of genes, each with an infinitesimal effect on the trait under selection. The block is assumed to introgress under directional selection within a native population that is genetically homogeneous. We use individual-based simulations and a branching process approximation to compute various statistics of the introgressing block, and explore how these depend on parameters such as the map length and initial trait value associated with the introgressing block, the genetic variability along the block, and the strength of selection. Our results show that the introgression dynamics of a block under infinitesimal selection is qualitatively different from the dynamics of neutral introgression. We also find that in the long run, surviving descendant blocks are likely to have intermediate lengths, and clarify how the length is shaped by the interplay between linkage and infinitesimal selection. Our results suggest that it may be difficult to distinguish introgression of single loci from that of genomic blocks with multiple, tightly linked and weakly selected loci."}],"issue":"4","quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000440014100020"]},"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/early/2017/11/30/227082"}],"language":[{"iso":"eng"}],"doi":"10.1534/genetics.118.301018","month":"08","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Genetics Society of America","year":"2018","date_updated":"2023-09-13T08:22:32Z","date_created":"2018-12-11T11:45:36Z","volume":209,"author":[{"full_name":"Sachdeva, Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","first_name":"Himani","last_name":"Sachdeva"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"publist_id":"7617"},{"oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"108","status":"public","title":"Inverted leftover hash lemma","intvolume":" 2018","abstract":[{"lang":"eng","text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes."}],"type":"conference","alternative_title":["ISIT Proceedings"],"date_published":"2018-08-16T00:00:00Z","citation":{"ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:10.1109/ISIT.2018.8437654","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","apa":"Obremski, M., & Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. https://doi.org/10.1109/ISIT.2018.8437654","ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","mla":"Obremski, Marciej, and Maciej Skórski. Inverted Leftover Hash Lemma. Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. https://doi.org/10.1109/ISIT.2018.8437654."},"day":"16","article_processing_charge":"No","scopus_import":"1","author":[{"full_name":"Obremski, Marciej","last_name":"Obremski","first_name":"Marciej"},{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skorski","full_name":"Skorski, Maciej"}],"date_updated":"2023-09-13T08:23:18Z","date_created":"2018-12-11T11:44:40Z","volume":2018,"year":"2018","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrPi"}],"publist_id":"7946","conference":{"name":"ISIT: International Symposium on Information Theory","end_date":"2018-06-22","location":"Vail, CO, USA","start_date":"2018-06-17 "},"doi":"10.1109/ISIT.2018.8437654","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000448139300368"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/507"}],"quality_controlled":"1","isi":1,"month":"08"},{"date_updated":"2023-09-13T08:19:05Z","date_created":"2023-08-22T14:16:25Z","volume":80,"author":[{"full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"first_name":"Anant","last_name":"Raj","full_name":"Raj, Anant"},{"full_name":"Karimireddy, Sai Praneeth","last_name":"Karimireddy","first_name":"Sai Praneeth"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"last_name":"Schölkopf","first_name":"Bernhard","full_name":"Schölkopf, Bernhard"},{"full_name":"Stich, Sebastian U.","last_name":"Stich","first_name":"Sebastian U."},{"full_name":"Jaggi, Martin","last_name":"Jaggi","first_name":"Martin"}],"publication_status":"published","publisher":"ML Research Press","department":[{"_id":"FrLo"}],"year":"2018","extern":"1","language":[{"iso":"eng"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1803.09539","open_access":"1"}],"external_id":{"arxiv":["1803.09539"]},"oa":1,"month":"07","oa_version":"Preprint","title":"On matching pursuit and coordinate descent","status":"public","intvolume":" 80","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14204","abstract":[{"text":"Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers a generalized notion of directions. Exploiting the connection between the two algorithms, we present a unified analysis of both, providing affine invariant sublinear O(1/t) rates on smooth objectives and linear convergence on strongly convex objectives. As a byproduct of our affine invariant analysis of matching pursuit, our rates for steepest coordinate descent are the tightest known. Furthermore, we show the first accelerated convergence rate O(1/t2) for matching pursuit and steepest coordinate descent on convex objectives.","lang":"eng"}],"alternative_title":["PMLR"],"type":"conference","date_published":"2018-07-01T00:00:00Z","page":"3198-3207","publication":"Proceedings of the 35th International Conference on Machine Learning","citation":{"chicago":"Locatello, Francesco, Anant Raj, Sai Praneeth Karimireddy, Gunnar Rätsch, Bernhard Schölkopf, Sebastian U. Stich, and Martin Jaggi. “On Matching Pursuit and Coordinate Descent.” In Proceedings of the 35th International Conference on Machine Learning, 80:3198–3207. ML Research Press, 2018.","mla":"Locatello, Francesco, et al. “On Matching Pursuit and Coordinate Descent.” Proceedings of the 35th International Conference on Machine Learning, vol. 80, ML Research Press, 2018, pp. 3198–207.","short":"F. Locatello, A. Raj, S.P. Karimireddy, G. Rätsch, B. Schölkopf, S.U. Stich, M. Jaggi, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 3198–3207.","ista":"Locatello F, Raj A, Karimireddy SP, Rätsch G, Schölkopf B, Stich SU, Jaggi M. 2018. On matching pursuit and coordinate descent. Proceedings of the 35th International Conference on Machine Learning. , PMLR, vol. 80, 3198–3207.","ieee":"F. Locatello et al., “On matching pursuit and coordinate descent,” in Proceedings of the 35th International Conference on Machine Learning, 2018, vol. 80, pp. 3198–3207.","apa":"Locatello, F., Raj, A., Karimireddy, S. P., Rätsch, G., Schölkopf, B., Stich, S. U., & Jaggi, M. (2018). On matching pursuit and coordinate descent. In Proceedings of the 35th International Conference on Machine Learning (Vol. 80, pp. 3198–3207). ML Research Press.","ama":"Locatello F, Raj A, Karimireddy SP, et al. On matching pursuit and coordinate descent. In: Proceedings of the 35th International Conference on Machine Learning. Vol 80. ML Research Press; 2018:3198-3207."},"day":"01","article_processing_charge":"No","scopus_import":"1"},{"date_published":"2018-07-18T00:00:00Z","citation":{"ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.","apa":"Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-96145-3_5","ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:10.1007/978-3-319-96145-3_5","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_5.","short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","mla":"Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol. 10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5."},"page":"79 - 102","day":"18","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","file":[{"file_size":1603844,"content_type":"application/pdf","creator":"dernst","file_name":"2018_LNCS_Kragl.pdf","access_level":"open_access","date_created":"2018-12-17T12:52:12Z","date_updated":"2020-07-14T12:45:04Z","checksum":"c64fff560fe5a7532ec10626ad1c215e","relation":"main_file","file_id":"5705"}],"oa_version":"Published Version","_id":"160","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["000"],"title":"Layered Concurrent Programs","status":"public","intvolume":" 10981","abstract":[{"text":"We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"conference":{"location":"Oxford, UK","start_date":"2018-07-14","end_date":"2018-07-17","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-319-96145-3_5","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"},"oa":1,"external_id":{"isi":["000491481600005"]},"quality_controlled":"1","isi":1,"project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"month":"07","author":[{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8332"}]},"date_created":"2018-12-11T11:44:57Z","date_updated":"2023-09-13T08:45:09Z","volume":10981,"year":"2018","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:45:04Z","publist_id":"7761"},{"file":[{"content_type":"application/pdf","file_size":4007095,"creator":"dernst","access_level":"open_access","file_name":"2018_Plos_Chaudhry.pdf","checksum":"527076f78265cd4ea192cd1569851587","date_updated":"2020-07-14T12:48:10Z","date_created":"2018-12-17T12:55:31Z","relation":"main_file","file_id":"5706"}],"oa_version":"Published Version","intvolume":" 16","status":"public","title":"Leaky resistance and the conditions for the existence of lytic bacteriophage","ddc":["570"],"_id":"82","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"8","abstract":[{"lang":"eng","text":"In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term "leaky resistance." We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”."}],"type":"journal_article","date_published":"2018-08-16T00:00:00Z","citation":{"ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 16(8), 2005971.","ieee":"W. Chaudhry et al., “Leaky resistance and the conditions for the existence of lytic bacteriophage,” PLoS Biology, vol. 16, no. 8. Public Library of Science, 2018.","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005971","ama":"Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 2018;16(8). doi:10.1371/journal.pbio.2005971","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005971.","mla":"Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” PLoS Biology, vol. 16, no. 8, 2005971, Public Library of Science, 2018, doi:10.1371/journal.pbio.2005971.","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018)."},"publication":"PLoS Biology","article_processing_charge":"Yes","has_accepted_license":"1","day":"16","scopus_import":"1","volume":16,"date_updated":"2023-09-13T08:45:41Z","date_created":"2018-12-11T11:44:32Z","related_material":{"record":[{"id":"9810","relation":"research_data","status":"public"}]},"author":[{"full_name":"Chaudhry, Waqas","first_name":"Waqas","last_name":"Chaudhry"},{"full_name":"Pleska, Maros","first_name":"Maros","last_name":"Pleska","id":"4569785E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7460-7479"},{"full_name":"Shah, Nilang","first_name":"Nilang","last_name":"Shah"},{"first_name":"Howard","last_name":"Weiss","full_name":"Weiss, Howard"},{"full_name":"Mccall, Ingrid","last_name":"Mccall","first_name":"Ingrid"},{"first_name":"Justin","last_name":"Meyer","full_name":"Meyer, Justin"},{"full_name":"Gupta, Animesh","last_name":"Gupta","first_name":"Animesh"},{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet"},{"full_name":"Levin, Bruce","last_name":"Levin","first_name":"Bruce"}],"publisher":"Public Library of Science","department":[{"_id":"CaGu"}],"publication_status":"published","year":"2018","publist_id":"7972","file_date_updated":"2020-07-14T12:48:10Z","article_number":"2005971","language":[{"iso":"eng"}],"doi":"10.1371/journal.pbio.2005971","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":["000443383300024"]},"oa":1,"month":"08"},{"month":"08","project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000448185000050"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3197517.3201325","article_number":"89","ec_funded":1,"publist_id":"8053","file_date_updated":"2020-07-14T12:46:22Z","publisher":"ACM","department":[{"_id":"BeBi"}],"publication_status":"published","year":"2018","volume":37,"date_created":"2018-12-11T11:44:06Z","date_updated":"2023-09-13T08:46:15Z","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/new-interactive-machine-learning-tool-makes-car-designs-more-aerodynamic/"}]},"author":[{"first_name":"Nobuyuki","last_name":"Umetani","full_name":"Umetani, Nobuyuki"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"04","citation":{"chicago":"Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive Aerodynamic Design.” ACM Trans. Graph. ACM, 2018. https://doi.org/10.1145/3197517.3201325.","short":"N. Umetani, B. Bickel, ACM Trans. Graph. 37 (2018).","mla":"Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive Aerodynamic Design.” ACM Trans. Graph., vol. 37, no. 4, 89, ACM, 2018, doi:10.1145/3197517.3201325.","apa":"Umetani, N., & Bickel, B. (2018). Learning three-dimensional flow for interactive aerodynamic design. ACM Trans. Graph. ACM. https://doi.org/10.1145/3197517.3201325","ieee":"N. Umetani and B. Bickel, “Learning three-dimensional flow for interactive aerodynamic design,” ACM Trans. Graph., vol. 37, no. 4. ACM, 2018.","ista":"Umetani N, Bickel B. 2018. Learning three-dimensional flow for interactive aerodynamic design. ACM Trans. Graph. 37(4), 89.","ama":"Umetani N, Bickel B. Learning three-dimensional flow for interactive aerodynamic design. ACM Trans Graph. 2018;37(4). doi:10.1145/3197517.3201325"},"publication":"ACM Trans. Graph.","date_published":"2018-08-04T00:00:00Z","type":"journal_article","issue":"4","abstract":[{"text":"We present a data-driven technique to instantly predict how fluid flows around various three-dimensional objects. Such simulation is useful for computational fabrication and engineering, but is usually computationally expensive since it requires solving the Navier-Stokes equation for many time steps. To accelerate the process, we propose a machine learning framework which predicts aerodynamic forces and velocity and pressure fields given a threedimensional shape input. Handling detailed free-form three-dimensional shapes in a data-driven framework is challenging because machine learning approaches usually require a consistent parametrization of input and output. We present a novel PolyCube maps-based parametrization that can be computed for three-dimensional shapes at interactive rates. This allows us to efficiently learn the nonlinear response of the flow using a Gaussian process regression. We demonstrate the effectiveness of our approach for the interactive design and optimization of a car body.","lang":"eng"}],"intvolume":" 37","status":"public","ddc":["003","004"],"title":"Learning three-dimensional flow for interactive aerodynamic design","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"4","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":22803163,"creator":"system","access_level":"open_access","file_name":"IST-2018-1049-v1+1_2018_sigg_Learning3DAerodynamics.pdf","checksum":"7a2243668f215821bc6aecad0320079a","date_updated":"2020-07-14T12:46:22Z","date_created":"2018-12-12T10:16:28Z","relation":"main_file","file_id":"5216"}],"pubrep_id":"1049"},{"language":[{"iso":"eng"}],"doi":"10.1214/17-AAP1302","isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.07776 "}],"external_id":{"arxiv":["1612.07776 "],"isi":["000431721800005"]},"oa":1,"month":"03","date_created":"2018-12-11T11:47:13Z","date_updated":"2023-09-13T08:47:52Z","volume":28,"author":[{"first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"},{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Krüger","first_name":"Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H"}],"related_material":{"record":[{"id":"149","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"year":"2018","ec_funded":1,"date_published":"2018-03-03T00:00:00Z","article_type":"original","page":"148-203","publication":"Annals Applied Probability ","citation":{"short":"J. Alt, L. Erdös, T.H. Krüger, Annals Applied Probability 28 (2018) 148–203.","mla":"Alt, Johannes, et al. “Local Inhomogeneous Circular Law.” Annals Applied Probability , vol. 28, no. 1, Institute of Mathematical Statistics, 2018, pp. 148–203, doi:10.1214/17-AAP1302.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “Local Inhomogeneous Circular Law.” Annals Applied Probability . Institute of Mathematical Statistics, 2018. https://doi.org/10.1214/17-AAP1302.","ama":"Alt J, Erdös L, Krüger TH. Local inhomogeneous circular law. Annals Applied Probability . 2018;28(1):148-203. doi:10.1214/17-AAP1302","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “Local inhomogeneous circular law,” Annals Applied Probability , vol. 28, no. 1. Institute of Mathematical Statistics, pp. 148–203, 2018.","apa":"Alt, J., Erdös, L., & Krüger, T. H. (2018). Local inhomogeneous circular law. Annals Applied Probability . Institute of Mathematical Statistics. https://doi.org/10.1214/17-AAP1302","ista":"Alt J, Erdös L, Krüger TH. 2018. Local inhomogeneous circular law. Annals Applied Probability . 28(1), 148–203."},"day":"03","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","status":"public","title":"Local inhomogeneous circular law","intvolume":" 28","_id":"566","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We consider large random matrices X with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical variances, the limiting density is uniform. In this special case, the local circular law by Bourgade et. al. [11,12] shows that the empirical density converges even locally on scales slightly above the typical eigenvalue spacing. In the general case, the limiting density is typically inhomogeneous and it is obtained via solving a system of deterministic equations. Our main result is the local inhomogeneous circular law in the bulk spectrum on the optimal scale for a general variance profile of the entries of X. \r\n\r\n"}],"issue":"1","type":"journal_article"},{"month":"09","isi":1,"quality_controlled":"1","external_id":{"isi":["000444141200005"],"arxiv":["1702.05172"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1702.05172","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00283-018-9795-5","publist_id":"7948","publisher":"Springer","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2018","volume":40,"date_updated":"2023-09-13T08:49:16Z","date_created":"2018-12-11T11:44:40Z","author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"last_name":"Petrunin","first_name":"Anton","full_name":"Petrunin, Anton"}],"scopus_import":"1","article_processing_charge":"No","day":"01","page":"26 - 31","citation":{"ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","apa":"Akopyan, A., & Petrunin, A. (2018). Long geodesics on convex surfaces. Mathematical Intelligencer. Springer. https://doi.org/10.1007/s00283-018-9795-5","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” Mathematical Intelligencer, vol. 40, no. 3. Springer, pp. 26–31, 2018.","ama":"Akopyan A, Petrunin A. Long geodesics on convex surfaces. Mathematical Intelligencer. 2018;40(3):26-31. doi:10.1007/s00283-018-9795-5","chicago":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” Mathematical Intelligencer. Springer, 2018. https://doi.org/10.1007/s00283-018-9795-5.","mla":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” Mathematical Intelligencer, vol. 40, no. 3, Springer, 2018, pp. 26–31, doi:10.1007/s00283-018-9795-5.","short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31."},"publication":"Mathematical Intelligencer","date_published":"2018-09-01T00:00:00Z","type":"journal_article","issue":"3","abstract":[{"text":"The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below.","lang":"eng"}],"intvolume":" 40","status":"public","title":"Long geodesics on convex surfaces","_id":"106","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint"},{"page":"2205 - 2221","citation":{"mla":"Brown, Markus, et al. “Lymphatic Exosomes Promote Dendritic Cell Migration along Guidance Cues.” Journal of Cell Biology, vol. 217, no. 6, Rockefeller University Press, 2018, pp. 2205–21, doi:10.1083/jcb.201612051.","short":"M. Brown, L. Johnson, D. Leone, P. Májek, K. Vaahtomeri, D. Senfter, N. Bukosza, H. Schachner, G. Asfour, B. Langer, R. Hauschild, K. Parapatics, Y. Hong, K. Bennett, R. Kain, M. Detmar, M.K. Sixt, D. Jackson, D. Kerjaschki, Journal of Cell Biology 217 (2018) 2205–2221.","chicago":"Brown, Markus, Louise Johnson, Dario Leone, Peter Májek, Kari Vaahtomeri, Daniel Senfter, Nora Bukosza, et al. “Lymphatic Exosomes Promote Dendritic Cell Migration along Guidance Cues.” Journal of Cell Biology. Rockefeller University Press, 2018. https://doi.org/10.1083/jcb.201612051.","ama":"Brown M, Johnson L, Leone D, et al. Lymphatic exosomes promote dendritic cell migration along guidance cues. Journal of Cell Biology. 2018;217(6):2205-2221. doi:10.1083/jcb.201612051","ista":"Brown M, Johnson L, Leone D, Májek P, Vaahtomeri K, Senfter D, Bukosza N, Schachner H, Asfour G, Langer B, Hauschild R, Parapatics K, Hong Y, Bennett K, Kain R, Detmar M, Sixt MK, Jackson D, Kerjaschki D. 2018. Lymphatic exosomes promote dendritic cell migration along guidance cues. Journal of Cell Biology. 217(6), 2205–2221.","apa":"Brown, M., Johnson, L., Leone, D., Májek, P., Vaahtomeri, K., Senfter, D., … Kerjaschki, D. (2018). Lymphatic exosomes promote dendritic cell migration along guidance cues. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201612051","ieee":"M. Brown et al., “Lymphatic exosomes promote dendritic cell migration along guidance cues,” Journal of Cell Biology, vol. 217, no. 6. Rockefeller University Press, pp. 2205–2221, 2018."},"publication":"Journal of Cell Biology","date_published":"2018-04-12T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"12","intvolume":" 217","title":"Lymphatic exosomes promote dendritic cell migration along guidance cues","status":"public","ddc":["570"],"_id":"275","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"access_level":"open_access","file_name":"2018_JournalCellBiology_Brown.pdf","content_type":"application/pdf","file_size":2252043,"creator":"dernst","relation":"main_file","file_id":"5704","checksum":"9c7eba51a35c62da8c13f98120b64df4","date_created":"2018-12-17T12:50:07Z","date_updated":"2020-07-14T12:45:45Z"}],"oa_version":"Published Version","type":"journal_article","issue":"6","abstract":[{"text":"Lymphatic endothelial cells (LECs) release extracellular chemokines to guide the migration of dendritic cells. In this study, we report that LECs also release basolateral exosome-rich endothelial vesicles (EEVs) that are secreted in greater numbers in the presence of inflammatory cytokines and accumulate in the perivascular stroma of small lymphatic vessels in human chronic inflammatory diseases. Proteomic analyses of EEV fractions identified > 1,700 cargo proteins and revealed a dominant motility-promoting protein signature. In vitro and ex vivo EEV fractions augmented cellular protrusion formation in a CX3CL1/fractalkine-dependent fashion and enhanced the directional migratory response of human dendritic cells along guidance cues. We conclude that perilymphatic LEC exosomes enhance exploratory behavior and thus promote directional migration of CX3CR1-expressing cells in complex tissue environments.","lang":"eng"}],"project":[{"_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","grant_number":"Y 564-B12","call_identifier":"FWF","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)"},{"grant_number":"281556","_id":"25A603A2-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000438077800026"],"pmid":["29650776"]},"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"}],"doi":"10.1083/jcb.201612051","month":"04","publisher":"Rockefeller University Press","department":[{"_id":"MiSi"},{"_id":"Bio"}],"publication_status":"published","pmid":1,"acknowledgement":"M. Brown was supported by the Cell Communication in Health and Disease Graduate Study Program of the Austrian Science Fund and Medizinische Universität Wien, M. Sixt by the European Research Council (ERC GA 281556) and an Austrian Science Fund START award, K.L. Bennett by the Austrian Academy of Sciences, D.G. Jackson and L.A. Johnson by Unit Funding (MC_UU_12010/2) and project grants from the Medical Research Council (G1100134 and MR/L008610/1), and M. Detmar by the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung and Advanced European Research Council grant LYVICAM. K. Vaahtomeri was supported by an Academy of Finland postdoctoral research grant (287853). This project has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No. 668036 (RELENT).","year":"2018","volume":217,"date_updated":"2023-09-13T08:51:29Z","date_created":"2018-12-11T11:45:33Z","author":[{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","first_name":"Markus","full_name":"Brown, Markus"},{"full_name":"Johnson, Louise","last_name":"Johnson","first_name":"Louise"},{"first_name":"Dario","last_name":"Leone","full_name":"Leone, Dario"},{"last_name":"Májek","first_name":"Peter","full_name":"Májek, Peter"},{"id":"368EE576-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7829-3518","first_name":"Kari","last_name":"Vaahtomeri","full_name":"Vaahtomeri, Kari"},{"last_name":"Senfter","first_name":"Daniel","full_name":"Senfter, Daniel"},{"full_name":"Bukosza, Nora","last_name":"Bukosza","first_name":"Nora"},{"full_name":"Schachner, Helga","last_name":"Schachner","first_name":"Helga"},{"first_name":"Gabriele","last_name":"Asfour","full_name":"Asfour, Gabriele"},{"full_name":"Langer, Brigitte","last_name":"Langer","first_name":"Brigitte"},{"last_name":"Hauschild","first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert"},{"last_name":"Parapatics","first_name":"Katja","full_name":"Parapatics, Katja"},{"first_name":"Young","last_name":"Hong","full_name":"Hong, Young"},{"full_name":"Bennett, Keiryn","first_name":"Keiryn","last_name":"Bennett"},{"full_name":"Kain, Renate","last_name":"Kain","first_name":"Renate"},{"full_name":"Detmar, Michael","first_name":"Michael","last_name":"Detmar"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"full_name":"Jackson, David","last_name":"Jackson","first_name":"David"},{"full_name":"Kerjaschki, Dontscho","last_name":"Kerjaschki","first_name":"Dontscho"}],"publist_id":"7627","ec_funded":1,"file_date_updated":"2020-07-14T12:45:45Z"},{"scopus_import":"1","article_processing_charge":"No","day":"16","page":"548 - 553","citation":{"ista":"Robert H, Park C, Gutièrrez C, Wójcikowska B, Pěnčík A, Novák O, Chen J, Grunewald W, Dresselhaus T, Friml J, Laux T. 2018. Maternal auxin supply contributes to early embryo patterning in Arabidopsis. Nature Plants. 4(8), 548–553.","ieee":"H. Robert et al., “Maternal auxin supply contributes to early embryo patterning in Arabidopsis,” Nature Plants, vol. 4, no. 8. Nature Publishing Group, pp. 548–553, 2018.","apa":"Robert, H., Park, C., Gutièrrez, C., Wójcikowska, B., Pěnčík, A., Novák, O., … Laux, T. (2018). Maternal auxin supply contributes to early embryo patterning in Arabidopsis. Nature Plants. Nature Publishing Group. https://doi.org/10.1038/s41477-018-0204-z","ama":"Robert H, Park C, Gutièrrez C, et al. Maternal auxin supply contributes to early embryo patterning in Arabidopsis. Nature Plants. 2018;4(8):548-553. doi:10.1038/s41477-018-0204-z","chicago":"Robert, Hélène, Chulmin Park, Carla Gutièrrez, Barbara Wójcikowska, Aleš Pěnčík, Ondřej Novák, Junyi Chen, et al. “Maternal Auxin Supply Contributes to Early Embryo Patterning in Arabidopsis.” Nature Plants. Nature Publishing Group, 2018. https://doi.org/10.1038/s41477-018-0204-z.","mla":"Robert, Hélène, et al. “Maternal Auxin Supply Contributes to Early Embryo Patterning in Arabidopsis.” Nature Plants, vol. 4, no. 8, Nature Publishing Group, 2018, pp. 548–53, doi:10.1038/s41477-018-0204-z.","short":"H. Robert, C. Park, C. Gutièrrez, B. Wójcikowska, A. Pěnčík, O. Novák, J. Chen, W. Grunewald, T. Dresselhaus, J. Friml, T. Laux, Nature Plants 4 (2018) 548–553."},"publication":"Nature Plants","date_published":"2018-07-16T00:00:00Z","type":"journal_article","issue":"8","abstract":[{"lang":"eng","text":"The angiosperm seed is composed of three genetically distinct tissues: the diploid embryo that originates from the fertilized egg cell, the triploid endosperm that is produced from the fertilized central cell, and the maternal sporophytic integuments that develop into the seed coat1. At the onset of embryo development in Arabidopsis thaliana, the zygote divides asymmetrically, producing a small apical embryonic cell and a larger basal cell that connects the embryo to the maternal tissue2. The coordinated and synchronous development of the embryo and the surrounding integuments, and the alignment of their growth axes, suggest communication between maternal tissues and the embryo. In contrast to animals, however, where a network of maternal factors that direct embryo patterning have been identified3,4, only a few maternal mutations have been described to affect embryo development in plants5–7. Early embryo patterning in Arabidopsis requires accumulation of the phytohormone auxin in the apical cell by directed transport from the suspensor8–10. However, the origin of this auxin has remained obscure. Here we investigate the source of auxin for early embryogenesis and provide evidence that the mother plant coordinates seed development by supplying auxin to the early embryo from the integuments of the ovule. We show that auxin response increases in ovules after fertilization, due to upregulated auxin biosynthesis in the integuments, and this maternally produced auxin is required for correct embryo development."}],"intvolume":" 4","title":"Maternal auxin supply contributes to early embryo patterning in Arabidopsis","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"158","oa_version":"Submitted Version","month":"07","project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30013211"}],"oa":1,"external_id":{"isi":["000443861300011"],"pmid":["30013211"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41477-018-0204-z","publist_id":"7763","ec_funded":1,"publisher":"Nature Publishing Group","department":[{"_id":"JiFr"}],"publication_status":"published","pmid":1,"year":"2018","acknowledgement":"This work was further supported by the Czech Science Foundation GACR (GA13-40637S) to J.F.;","volume":4,"date_created":"2018-12-11T11:44:56Z","date_updated":"2023-09-13T08:53:28Z","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/plant-mothers-talk-to-their-embryos-via-the-hormone-auxin/"}]},"author":[{"full_name":"Robert, Hélène","last_name":"Robert","first_name":"Hélène"},{"full_name":"Park, Chulmin","first_name":"Chulmin","last_name":"Park"},{"full_name":"Gutièrrez, Carla","last_name":"Gutièrrez","first_name":"Carla"},{"first_name":"Barbara","last_name":"Wójcikowska","full_name":"Wójcikowska, Barbara"},{"full_name":"Pěnčík, Aleš","last_name":"Pěnčík","first_name":"Aleš"},{"last_name":"Novák","first_name":"Ondřej","full_name":"Novák, Ondřej"},{"last_name":"Chen","first_name":"Junyi","full_name":"Chen, Junyi"},{"last_name":"Grunewald","first_name":"Wim","full_name":"Grunewald, Wim"},{"first_name":"Thomas","last_name":"Dresselhaus","full_name":"Dresselhaus, Thomas"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml","full_name":"Friml, Jirí"},{"last_name":"Laux","first_name":"Thomas","full_name":"Laux, Thomas"}]},{"type":"journal_article","issue":"10","abstract":[{"text":"Complex I has an essential role in ATP production by coupling electron transfer from NADH to quinone with translocation of protons across the inner mitochondrial membrane. Isolated complex I deficiency is a frequent cause of mitochondrial inherited diseases. Complex I has also been implicated in cancer, ageing, and neurodegenerative conditions. Until recently, the understanding of complex I deficiency on the molecular level was limited due to the lack of high-resolution structures of the enzyme. However, due to developments in single particle cryo-electron microscopy (cryo-EM), recent studies have reported nearly atomic resolution maps and models of mitochondrial complex I. These structures significantly add to our understanding of complex I mechanism and assembly. The disease-causing mutations are discussed here in their structural context.","lang":"eng"}],"intvolume":" 28","title":"Mammalian mitochondrial complex I structure and disease causing mutations","ddc":["572"],"status":"public","_id":"152","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","file":[{"file_id":"6994","relation":"main_file","date_created":"2019-11-07T12:55:20Z","date_updated":"2020-07-14T12:45:00Z","checksum":"ef6d2b4e1fd63948539639242610bfa6","file_name":"SasanovFinalMS+EdComments_LS_allacc_withFigs.pdf","access_level":"open_access","creator":"lsazanov","file_size":2185385,"content_type":"application/pdf"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"26","page":"835 - 867","article_type":"original","citation":{"mla":"Fiedorczuk, Karol, and Leonid A. Sazanov. “Mammalian Mitochondrial Complex I Structure and Disease Causing Mutations.” Trends in Cell Biology, vol. 28, no. 10, Elsevier, 2018, pp. 835–67, doi:10.1016/j.tcb.2018.06.006.","short":"K. Fiedorczuk, L.A. Sazanov, Trends in Cell Biology 28 (2018) 835–867.","chicago":"Fiedorczuk, Karol, and Leonid A Sazanov. “Mammalian Mitochondrial Complex I Structure and Disease Causing Mutations.” Trends in Cell Biology. Elsevier, 2018. https://doi.org/10.1016/j.tcb.2018.06.006.","ama":"Fiedorczuk K, Sazanov LA. Mammalian mitochondrial complex I structure and disease causing mutations. Trends in Cell Biology. 2018;28(10):835-867. doi:10.1016/j.tcb.2018.06.006","ista":"Fiedorczuk K, Sazanov LA. 2018. Mammalian mitochondrial complex I structure and disease causing mutations. Trends in Cell Biology. 28(10), 835–867.","apa":"Fiedorczuk, K., & Sazanov, L. A. (2018). Mammalian mitochondrial complex I structure and disease causing mutations. Trends in Cell Biology. Elsevier. https://doi.org/10.1016/j.tcb.2018.06.006","ieee":"K. Fiedorczuk and L. A. Sazanov, “Mammalian mitochondrial complex I structure and disease causing mutations,” Trends in Cell Biology, vol. 28, no. 10. Elsevier, pp. 835–867, 2018."},"publication":"Trends in Cell Biology","date_published":"2018-07-26T00:00:00Z","publist_id":"7769","file_date_updated":"2020-07-14T12:45:00Z","department":[{"_id":"LeSa"}],"publisher":"Elsevier","publication_status":"published","year":"2018","volume":28,"date_created":"2018-12-11T11:44:54Z","date_updated":"2023-09-13T08:51:56Z","author":[{"id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","last_name":"Fiedorczuk","first_name":"Karol","full_name":"Fiedorczuk, Karol"},{"full_name":"Sazanov, Leonid A","last_name":"Sazanov","first_name":"Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"month":"07","isi":1,"quality_controlled":"1","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":["000445118200007"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.tcb.2018.06.006"},{"year":"2018","publication_status":"published","publisher":"ACM","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"date_created":"2018-12-11T11:45:45Z","date_updated":"2023-09-13T08:50:16Z","ec_funded":1,"publist_id":"7555","external_id":{"arxiv":["1711.09148"],"isi":["000483921200152"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.09148"}],"oa":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"conference":{"location":"New Orleans, Louisiana, United States","start_date":"2018-01-07","end_date":"2018-01-10","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611975031.151","language":[{"iso":"eng"}],"month":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"310","title":"Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter","status":"public","oa_version":"Preprint","type":"conference","abstract":[{"text":"A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and coliveness. Our lower bounds are linear in the number of vertices of the graph, even for constant-diameter graphs. For none of these problems lower bounds on the number of symbolic operations were known before. The lower bounds show an interesting separation of these problems from the reachability problem, which can be solved with O(D) symbolic operations, where D is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires Õ(n/D) symbolic steps to achieve a (1 +ϵ)-approximation for any constant > 0. This compares to O(n/D) symbolic steps for the (naive) exact algorithm and O(D) symbolic steps for a 2-approximation. Finally we also give a refined analysis of the strongly connected components algorithms of [15], showing that it uses an optimal number of symbolic steps that is proportional to the sum of the diameters of the strongly connected components.","lang":"eng"}],"citation":{"ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. In: ACM; 2018:2341-2356. doi:10.1137/1.9781611975031.151","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. https://doi.org/10.1137/1.9781611975031.151","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.","mla":"Chatterjee, Krishnendu, et al. Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. ACM, 2018, pp. 2341–56, doi:10.1137/1.9781611975031.151.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151."},"page":"2341 - 2356","date_published":"2018-01-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"scopus_import":"1","day":"07","article_processing_charge":"No","publication":"Physical Review Letters","citation":{"short":"S. Barzanjeh, M. Aquilina, A. Xuereb, Physical Review Letters 120 (2018).","mla":"Barzanjeh, Shabir, et al. “Manipulating the Flow of Thermal Noise in Quantum Devices.” Physical Review Letters, vol. 120, no. 6, 060601, American Physical Society, 2018, doi:10.1103/PhysRevLett.120.060601.","chicago":"Barzanjeh, Shabir, Matteo Aquilina, and André Xuereb. “Manipulating the Flow of Thermal Noise in Quantum Devices.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.060601.","ama":"Barzanjeh S, Aquilina M, Xuereb A. Manipulating the flow of thermal noise in quantum devices. Physical Review Letters. 2018;120(6). doi:10.1103/PhysRevLett.120.060601","ieee":"S. Barzanjeh, M. Aquilina, and A. Xuereb, “Manipulating the flow of thermal noise in quantum devices,” Physical Review Letters, vol. 120, no. 6. American Physical Society, 2018.","apa":"Barzanjeh, S., Aquilina, M., & Xuereb, A. (2018). Manipulating the flow of thermal noise in quantum devices. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.120.060601","ista":"Barzanjeh S, Aquilina M, Xuereb A. 2018. Manipulating the flow of thermal noise in quantum devices. Physical Review Letters. 120(6), 060601."},"date_published":"2018-02-07T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"There has been significant interest recently in using complex quantum systems to create effective nonreciprocal dynamics. Proposals have been put forward for the realization of artificial magnetic fields for photons and phonons; experimental progress is fast making these proposals a reality. Much work has concentrated on the use of such systems for controlling the flow of signals, e.g., to create isolators or directional amplifiers for optical signals. In this Letter, we build on this work but move in a different direction. We develop the theory of and discuss a potential realization for the controllable flow of thermal noise in quantum systems. We demonstrate theoretically that the unidirectional flow of thermal noise is possible within quantum cascaded systems. Viewing an optomechanical platform as a cascaded system we show here that one can ultimately control the direction of the flow of thermal noise. By appropriately engineering the mechanical resonator, which acts as an artificial reservoir, the flow of thermal noise can be constrained to a desired direction, yielding a thermal rectifier. The proposed quantum thermal noise rectifier could potentially be used to develop devices such as a thermal modulator, a thermal router, and a thermal amplifier for nanoelectronic devices and superconducting circuits."}],"issue":"6","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"436","title":"Manipulating the flow of thermal noise in quantum devices","status":"public","intvolume":" 120","oa_version":"Preprint","month":"02","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1706.09051"}],"oa":1,"external_id":{"arxiv":["1706.09051"],"isi":["000424382100004"]},"quality_controlled":"1","isi":1,"project":[{"_id":"257EB838-B435-11E9-9278-68D0E5697425","grant_number":"732894","name":"Hybrid Optomechanical Technologies","call_identifier":"H2020"},{"grant_number":"707438","_id":"258047B6-B435-11E9-9278-68D0E5697425","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM","call_identifier":"H2020"}],"doi":"10.1103/PhysRevLett.120.060601","language":[{"iso":"eng"}],"article_number":"060601 ","ec_funded":1,"publist_id":"7387","year":"2018","publication_status":"published","department":[{"_id":"JoFi"}],"publisher":"American Physical Society","author":[{"full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423","first_name":"Shabir","last_name":"Barzanjeh"},{"last_name":"Aquilina","first_name":"Matteo","full_name":"Aquilina, Matteo"},{"full_name":"Xuereb, André","last_name":"Xuereb","first_name":"André"}],"related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/interference-as-a-new-method-for-cooling-quantum-devices/"}]},"date_updated":"2023-09-13T08:52:27Z","date_created":"2018-12-11T11:46:28Z","volume":120},{"issue":"149","abstract":[{"lang":"eng","text":"Spatial patterns are ubiquitous on the subcellular, cellular and tissue level, and can be studied using imaging techniques such as light and fluorescence microscopy. Imaging data provide quantitative information about biological systems; however, mechanisms causing spatial patterning often remain elusive. In recent years, spatio-temporal mathematical modelling has helped to overcome this problem. Yet, outliers and structured noise limit modelling of whole imaging data, and models often consider spatial summary statistics. Here, we introduce an integrated data-driven modelling approach that can cope with measurement artefacts and whole imaging data. Our approach combines mechanistic models of the biological processes with robust statistical models of the measurement process. The parameters of the integrated model are calibrated using a maximum-likelihood approach. We used this integrated modelling approach to study in vivo gradients of the chemokine (C-C motif) ligand 21 (CCL21). CCL21 gradients guide dendritic cells and are important in the adaptive immune response. Using artificial data, we verified that the integrated modelling approach provides reliable parameter estimates in the presence of measurement noise and that bias and variance of these estimates are reduced compared to conventional approaches. The application to experimental data allowed the parametrization and subsequent refinement of the model using additional mechanisms. Among other results, model-based hypothesis testing predicted lymphatic vessel-dependent concentration of heparan sulfate, the binding partner of CCL21. The selected model provided an accurate description of the experimental data and was partially validated using published data. Our findings demonstrate that integrated statistical modelling of whole imaging data is computationally feasible and can provide novel biological insights."}],"type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5925","date_updated":"2020-07-14T12:47:13Z","date_created":"2019-02-05T14:46:44Z","checksum":"56eb4308a15b7190bff938fab1f780e8","file_name":"2018_Interface_Hross.pdf","access_level":"open_access","file_size":1464288,"content_type":"application/pdf","creator":"dernst"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5858","intvolume":" 15","ddc":["570"],"title":"Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data","status":"public","has_accepted_license":"1","article_processing_charge":"No","day":"05","scopus_import":"1","date_published":"2018-12-05T00:00:00Z","citation":{"apa":"Hross, S., Theis, F. J., Sixt, M. K., & Hasenauer, J. (2018). Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0600","ieee":"S. Hross, F. J. Theis, M. K. Sixt, and J. Hasenauer, “Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018.","ista":"Hross S, Theis FJ, Sixt MK, Hasenauer J. 2018. Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. 15(149), 20180600.","ama":"Hross S, Theis FJ, Sixt MK, Hasenauer J. Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0600","chicago":"Hross, Sabrina, Fabian J. Theis, Michael K Sixt, and Jan Hasenauer. “Mechanistic Description of Spatial Processes Using Integrative Modelling of Noise-Corrupted Imaging Data.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0600.","short":"S. Hross, F.J. Theis, M.K. Sixt, J. Hasenauer, Journal of the Royal Society Interface 15 (2018).","mla":"Hross, Sabrina, et al. “Mechanistic Description of Spatial Processes Using Integrative Modelling of Noise-Corrupted Imaging Data.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180600, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0600."},"publication":"Journal of the Royal Society Interface","file_date_updated":"2020-07-14T12:47:13Z","article_number":"20180600","author":[{"full_name":"Hross, Sabrina","first_name":"Sabrina","last_name":"Hross"},{"full_name":"Theis, Fabian J.","first_name":"Fabian J.","last_name":"Theis"},{"full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Hasenauer","full_name":"Hasenauer, Jan"}],"volume":15,"date_updated":"2023-09-13T08:55:05Z","date_created":"2019-01-20T22:59:18Z","year":"2018","department":[{"_id":"MiSi"}],"publisher":"Royal Society Publishing","publication_status":"published","publication_identifier":{"issn":["17425689"]},"month":"12","doi":"10.1098/rsif.2018.0600","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":["000456783800011"]},"oa":1,"isi":1,"quality_controlled":"1"},{"title":"Mixing layer instability and vorticity amplification in a creeping viscoelastic flow","status":"public","ddc":["532"],"intvolume":" 3","_id":"16","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"relation":"main_file","file_id":"5043","checksum":"7fc0a2322214d1c04debef36d5bf2e8a","date_created":"2018-12-12T10:13:56Z","date_updated":"2020-07-14T12:45:04Z","access_level":"open_access","file_name":"IST-2018-1062-v1+1_PhysRevFluids.3.103303.pdf","content_type":"application/pdf","file_size":1838431,"creator":"system"}],"oa_version":"Submitted Version","pubrep_id":"1062","type":"journal_article","abstract":[{"lang":"eng","text":"We report quantitative evidence of mixing-layer elastic instability in a viscoelastic fluid flow between two widely spaced obstacles hindering a channel flow at Re 1 and Wi 1. Two mixing layers with nonuniform shear velocity profiles are formed in the region between the obstacles. The mixing-layer instability arises in the vicinity of an inflection point on the shear velocity profile with a steep variation in the elastic stress. The instability results in an intermittent appearance of small vortices in the mixing layers and an amplification of spatiotemporal averaged vorticity in the elastic turbulence regime. The latter is characterized through scaling of friction factor with Wi and both pressure and velocity spectra. Furthermore, the observations reported provide improved understanding of the stability of the mixing layer in a viscoelastic fluid at large elasticity, i.e., Wi 1 and Re 1 and oppose the current view of suppression of vorticity solely by polymer additives."}],"issue":"10","article_type":"original","publication":"Physical Review Fluids","citation":{"chicago":"Varshney, Atul, and Victor Steinberg. “Mixing Layer Instability and Vorticity Amplification in a Creeping Viscoelastic Flow.” Physical Review Fluids. American Physical Society, 2018. https://doi.org/10.1103/PhysRevFluids.3.103303.","mla":"Varshney, Atul, and Victor Steinberg. “Mixing Layer Instability and Vorticity Amplification in a Creeping Viscoelastic Flow.” Physical Review Fluids, vol. 3, no. 10, 103303, American Physical Society, 2018, doi:10.1103/PhysRevFluids.3.103303.","short":"A. Varshney, V. Steinberg, Physical Review Fluids 3 (2018).","ista":"Varshney A, Steinberg V. 2018. Mixing layer instability and vorticity amplification in a creeping viscoelastic flow. Physical Review Fluids. 3(10), 103303.","ieee":"A. Varshney and V. Steinberg, “Mixing layer instability and vorticity amplification in a creeping viscoelastic flow,” Physical Review Fluids, vol. 3, no. 10. American Physical Society, 2018.","apa":"Varshney, A., & Steinberg, V. (2018). Mixing layer instability and vorticity amplification in a creeping viscoelastic flow. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.3.103303","ama":"Varshney A, Steinberg V. Mixing layer instability and vorticity amplification in a creeping viscoelastic flow. Physical Review Fluids. 2018;3(10). doi:10.1103/PhysRevFluids.3.103303"},"date_published":"2018-10-16T00:00:00Z","scopus_import":"1","day":"16","has_accepted_license":"1","article_processing_charge":"No","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"BjHo"}],"acknowledgement":"This work was partially supported by the Israel Science Foundation (ISF; Grant No. 882/15) and the Binational USA-Israel Foundation (BSF; Grant No. 2016145).","year":"2018","date_created":"2018-12-11T11:44:10Z","date_updated":"2023-09-13T08:57:05Z","volume":3,"author":[{"first_name":"Atul","last_name":"Varshney","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3072-5999","full_name":"Varshney, Atul"},{"first_name":"Victor","last_name":"Steinberg","full_name":"Steinberg, Victor"}],"article_number":"103303","file_date_updated":"2020-07-14T12:45:04Z","publist_id":"8039","ec_funded":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"external_id":{"isi":["000447469200001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevFluids.3.103303","month":"10"},{"author":[{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","first_name":"Joel","last_name":"Rybicki","full_name":"Rybicki, Joel"},{"last_name":"Kisdi","first_name":"Eva","full_name":"Kisdi, Eva"},{"full_name":"Anttila, Jani","first_name":"Jani","last_name":"Anttila"}],"volume":115,"date_created":"2018-12-11T11:44:19Z","date_updated":"2023-09-13T08:57:38Z","year":"2018","acknowledgement":"J.R. and J.V.A. were also supported by the Academy of Finland Grants 1273253 and 267541.","department":[{"_id":"DaAl"}],"publisher":"National Academy of Sciences","publication_status":"published","publist_id":"8011","ec_funded":1,"file_date_updated":"2020-07-14T12:46:26Z","doi":"10.1073/pnas.1721061115","language":[{"iso":"eng"}],"external_id":{"isi":["000447491300057"]},"oa":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"month":"10","pubrep_id":"1063","oa_version":"Submitted Version","file":[{"file_size":4070777,"content_type":"application/pdf","creator":"dernst","file_name":"2018_PNAS_Rybicki.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:26Z","date_created":"2019-04-09T08:02:50Z","checksum":"df7ac544a587c06b75692653b9fabd18","relation":"main_file","file_id":"6258"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"43","intvolume":" 115","ddc":["570","577"],"status":"public","title":"Model of bacterial toxin-dependent pathogenesis explains infective dose","issue":"42","abstract":[{"lang":"eng","text":"The initial amount of pathogens required to start an infection within a susceptible host is called the infective dose and is known to vary to a large extent between different pathogen species. We investigate the hypothesis that the differences in infective doses are explained by the mode of action in the underlying mechanism of pathogenesis: Pathogens with locally acting mechanisms tend to have smaller infective doses than pathogens with distantly acting mechanisms. While empirical evidence tends to support the hypothesis, a formal theoretical explanation has been lacking. We give simple analytical models to gain insight into this phenomenon and also investigate a stochastic, spatially explicit, mechanistic within-host model for toxin-dependent bacterial infections. The model shows that pathogens secreting locally acting toxins have smaller infective doses than pathogens secreting diffusive toxins, as hypothesized. While local pathogenetic mechanisms require smaller infective doses, pathogens with distantly acting toxins tend to spread faster and may cause more damage to the host. The proposed model can serve as a basis for the spatially explicit analysis of various virulence factors also in the context of other problems in infection dynamics."}],"type":"journal_article","date_published":"2018-10-02T00:00:00Z","citation":{"chicago":"Rybicki, Joel, Eva Kisdi, and Jani Anttila. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1721061115.","mla":"Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” PNAS, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:10.1073/pnas.1721061115.","short":"J. Rybicki, E. Kisdi, J. Anttila, PNAS 115 (2018) 10690–10695.","ista":"Rybicki J, Kisdi E, Anttila J. 2018. Model of bacterial toxin-dependent pathogenesis explains infective dose. PNAS. 115(42), 10690–10695.","apa":"Rybicki, J., Kisdi, E., & Anttila, J. (2018). Model of bacterial toxin-dependent pathogenesis explains infective dose. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1721061115","ieee":"J. Rybicki, E. Kisdi, and J. Anttila, “Model of bacterial toxin-dependent pathogenesis explains infective dose,” PNAS, vol. 115, no. 42. National Academy of Sciences, pp. 10690–10695, 2018.","ama":"Rybicki J, Kisdi E, Anttila J. Model of bacterial toxin-dependent pathogenesis explains infective dose. PNAS. 2018;115(42):10690-10695. doi:10.1073/pnas.1721061115"},"publication":"PNAS","page":"10690 - 10695","has_accepted_license":"1","article_processing_charge":"No","day":"02","scopus_import":"1"},{"pubrep_id":"1038","file":[{"relation":"main_file","file_id":"5374","date_created":"2018-12-12T10:18:52Z","date_updated":"2020-07-14T12:44:43Z","checksum":"61d46273dca4de626accef1d17a0aaad","file_name":"IST-2018-1038-v1+1_metamolds_authorversion.pdf","access_level":"open_access","content_type":"application/pdf","file_size":91939066,"creator":"system"}],"oa_version":"Submitted Version","_id":"13","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["004"],"status":"public","title":"Metamolds: Computational design of silicone molds","intvolume":" 37","abstract":[{"lang":"eng","text":"We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery."}],"issue":"4","type":"journal_article","date_published":"2018-08-04T00:00:00Z","publication":"ACM Trans. Graph.","citation":{"short":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM Trans. Graph. 37 (2018).","mla":"Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.” ACM Trans. Graph., vol. 37, no. 4, 136, ACM, 2018, doi:10.1145/3197517.3201381.","chicago":"Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.” ACM Trans. Graph. ACM, 2018. https://doi.org/10.1145/3197517.3201381.","ama":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds: Computational design of silicone molds. ACM Trans Graph. 2018;37(4). doi:10.1145/3197517.3201381","ieee":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni, “Metamolds: Computational design of silicone molds,” ACM Trans. Graph., vol. 37, no. 4. ACM, 2018.","apa":"Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., & Cignoni, P. (2018). Metamolds: Computational design of silicone molds. ACM Trans. Graph. ACM. https://doi.org/10.1145/3197517.3201381","ista":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds: Computational design of silicone molds. ACM Trans. Graph. 37(4), 136."},"day":"04","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","author":[{"first_name":"Thomas","last_name":"Alderighi","full_name":"Alderighi, Thomas"},{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"first_name":"Daniela","last_name":"Giorgi","full_name":"Giorgi, Daniela"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd"},{"full_name":"Cignoni, Paolo","first_name":"Paolo","last_name":"Cignoni"}],"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/metamolds-molding-a-mold/"}]},"date_created":"2018-12-11T11:44:09Z","date_updated":"2023-09-13T08:56:07Z","volume":37,"year":"2018","publication_status":"published","publisher":"ACM","department":[{"_id":"BeBi"}],"file_date_updated":"2020-07-14T12:44:43Z","ec_funded":1,"publist_id":"8043","article_number":"136","doi":"10.1145/3197517.3201381","language":[{"iso":"eng"}],"external_id":{"isi":["000448185000097"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"month":"08"},{"month":"07","language":[{"iso":"eng"}],"doi":"10.1038/s41589-018-0108-2","project":[{"grant_number":"RGY0084/2012","_id":"255BFFFA-B435-11E9-9278-68D0E5697425","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)"}],"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30061718"}],"external_id":{"pmid":["30061718 "],"isi":["000442174500013"]},"publist_id":"7786","volume":14,"date_created":"2018-12-11T11:44:49Z","date_updated":"2023-09-13T08:58:05Z","author":[{"last_name":"Zhang","first_name":"William","full_name":"Zhang, William"},{"full_name":"Herde, Michel","last_name":"Herde","first_name":"Michel"},{"full_name":"Mitchell, Joshua","last_name":"Mitchell","first_name":"Joshua"},{"full_name":"Whitfield, Jason","first_name":"Jason","last_name":"Whitfield"},{"last_name":"Wulff","first_name":"Andreas","full_name":"Wulff, Andreas"},{"last_name":"Vongsouthi","first_name":"Vanessa","full_name":"Vongsouthi, Vanessa"},{"id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","last_name":"Sanchez Romero","first_name":"Inmaculada","full_name":"Sanchez Romero, Inmaculada"},{"full_name":"Gulakova, Polina","last_name":"Gulakova","first_name":"Polina"},{"full_name":"Minge, Daniel","last_name":"Minge","first_name":"Daniel"},{"first_name":"Björn","last_name":"Breithausen","full_name":"Breithausen, Björn"},{"last_name":"Schoch","first_name":"Susanne","full_name":"Schoch, Susanne"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L"},{"last_name":"Jackson","first_name":"Colin","full_name":"Jackson, Colin"},{"full_name":"Henneberger, Christian","first_name":"Christian","last_name":"Henneberger"}],"department":[{"_id":"HaJa"}],"publisher":"Nature Publishing Group","publication_status":"published","pmid":1,"year":"2018","article_processing_charge":"No","day":"30","scopus_import":"1","date_published":"2018-07-30T00:00:00Z","page":"861 - 869","article_type":"original","citation":{"ista":"Zhang W, Herde M, Mitchell J, Whitfield J, Wulff A, Vongsouthi V, Sanchez-Romero I, Gulakova P, Minge D, Breithausen B, Schoch S, Janovjak HL, Jackson C, Henneberger C. 2018. Monitoring hippocampal glycine with the computationally designed optical sensor GlyFS. Nature Chemical Biology. 14(9), 861–869.","apa":"Zhang, W., Herde, M., Mitchell, J., Whitfield, J., Wulff, A., Vongsouthi, V., … Henneberger, C. (2018). Monitoring hippocampal glycine with the computationally designed optical sensor GlyFS. Nature Chemical Biology. Nature Publishing Group. https://doi.org/10.1038/s41589-018-0108-2","ieee":"W. Zhang et al., “Monitoring hippocampal glycine with the computationally designed optical sensor GlyFS,” Nature Chemical Biology, vol. 14, no. 9. Nature Publishing Group, pp. 861–869, 2018.","ama":"Zhang W, Herde M, Mitchell J, et al. Monitoring hippocampal glycine with the computationally designed optical sensor GlyFS. Nature Chemical Biology. 2018;14(9):861-869. doi:10.1038/s41589-018-0108-2","chicago":"Zhang, William, Michel Herde, Joshua Mitchell, Jason Whitfield, Andreas Wulff, Vanessa Vongsouthi, Inmaculada Sanchez-Romero, et al. “Monitoring Hippocampal Glycine with the Computationally Designed Optical Sensor GlyFS.” Nature Chemical Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41589-018-0108-2.","mla":"Zhang, William, et al. “Monitoring Hippocampal Glycine with the Computationally Designed Optical Sensor GlyFS.” Nature Chemical Biology, vol. 14, no. 9, Nature Publishing Group, 2018, pp. 861–69, doi:10.1038/s41589-018-0108-2.","short":"W. Zhang, M. Herde, J. Mitchell, J. Whitfield, A. Wulff, V. Vongsouthi, I. Sanchez-Romero, P. Gulakova, D. Minge, B. Breithausen, S. Schoch, H.L. Janovjak, C. Jackson, C. Henneberger, Nature Chemical Biology 14 (2018) 861–869."},"publication":"Nature Chemical Biology","issue":"9","abstract":[{"text":"Fluorescent sensors are an essential part of the experimental toolbox of the life sciences, where they are used ubiquitously to visualize intra- and extracellular signaling. In the brain, optical neurotransmitter sensors can shed light on temporal and spatial aspects of signal transmission by directly observing, for instance, neurotransmitter release and spread. Here we report the development and application of the first optical sensor for the amino acid glycine, which is both an inhibitory neurotransmitter and a co-agonist of the N-methyl-d-aspartate receptors (NMDARs) involved in synaptic plasticity. Computational design of a glycine-specific binding protein allowed us to produce the optical glycine FRET sensor (GlyFS), which can be used with single and two-photon excitation fluorescence microscopy. We took advantage of this newly developed sensor to test predictions about the uneven spatial distribution of glycine in extracellular space and to demonstrate that extracellular glycine levels are controlled by plasticity-inducing stimuli.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 14","status":"public","title":"Monitoring hippocampal glycine with the computationally designed optical sensor GlyFS","_id":"137","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:45:45Z","date_created":"2018-12-17T14:10:32Z","checksum":"95fc5dc3938b3ad3b7697d10c83cc143","relation":"main_file","file_id":"5709","file_size":7682167,"content_type":"application/pdf","creator":"dernst","file_name":"2018_Plos_Frick.pdf","access_level":"open_access"}],"_id":"276","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Nano-scale microfluidics to study 3D chemotaxis at the single cell level","ddc":["570"],"intvolume":" 13","abstract":[{"lang":"eng","text":"Directed migration of cells relies on their ability to sense directional guidance cues and to interact with pericellular structures in order to transduce contractile cytoskeletal- into mechanical forces. These biomechanical processes depend highly on microenvironmental factors such as exposure to 2D surfaces or 3D matrices. In vivo, the majority of cells are exposed to 3D environments. Data on 3D cell migration are mostly derived from intravital microscopy or collagen-based in vitro assays. Both approaches offer only limited controlla-bility of experimental conditions. Here, we developed an automated microfluidic system that allows positioning of cells in 3D microenvironments containing highly controlled diffusion-based chemokine gradients. Tracking migration in such gradients was feasible in real time at the single cell level. Moreover, the setup allowed on-chip immunocytochemistry and thus linking of functional with phenotypical properties in individual cells. Spatially defined retrieval of cells from the device allows down-stream off-chip analysis. Using dendritic cells as a model, our setup specifically allowed us for the first time to quantitate key migration characteristics of cells exposed to identical gradients of the chemokine CCL19 yet placed on 2D vs in 3D environments. Migration properties between 2D and 3D migration were distinct. Morphological features of cells migrating in an in vitro 3D environment were similar to those of cells migrating in animal tissues, but different from cells migrating on a surface. Our system thus offers a highly controllable in vitro-mimic of a 3D environment that cells traffic in vivo."}],"issue":"6","type":"journal_article","date_published":"2018-06-07T00:00:00Z","publication":"PLoS One","citation":{"ama":"Frick C, Dettinger P, Renkawitz J, et al. Nano-scale microfluidics to study 3D chemotaxis at the single cell level. PLoS One. 2018;13(6). doi:10.1371/journal.pone.0198330","apa":"Frick, C., Dettinger, P., Renkawitz, J., Jauch, A., Berger, C., Recher, M., … Mehling, M. (2018). Nano-scale microfluidics to study 3D chemotaxis at the single cell level. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0198330","ieee":"C. Frick et al., “Nano-scale microfluidics to study 3D chemotaxis at the single cell level,” PLoS One, vol. 13, no. 6. Public Library of Science, 2018.","ista":"Frick C, Dettinger P, Renkawitz J, Jauch A, Berger C, Recher M, Schroeder T, Mehling M. 2018. Nano-scale microfluidics to study 3D chemotaxis at the single cell level. PLoS One. 13(6), e0198330.","short":"C. Frick, P. Dettinger, J. Renkawitz, A. Jauch, C. Berger, M. Recher, T. Schroeder, M. Mehling, PLoS One 13 (2018).","mla":"Frick, Corina, et al. “Nano-Scale Microfluidics to Study 3D Chemotaxis at the Single Cell Level.” PLoS One, vol. 13, no. 6, e0198330, Public Library of Science, 2018, doi:10.1371/journal.pone.0198330.","chicago":"Frick, Corina, Philip Dettinger, Jörg Renkawitz, Annaïse Jauch, Christoph Berger, Mike Recher, Timm Schroeder, and Matthias Mehling. “Nano-Scale Microfluidics to Study 3D Chemotaxis at the Single Cell Level.” PLoS One. Public Library of Science, 2018. https://doi.org/10.1371/journal.pone.0198330."},"article_type":"original","day":"07","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","author":[{"last_name":"Frick","first_name":"Corina","full_name":"Frick, Corina"},{"last_name":"Dettinger","first_name":"Philip","full_name":"Dettinger, Philip"},{"orcid":"0000-0003-2856-3369","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","last_name":"Renkawitz","first_name":"Jörg","full_name":"Renkawitz, Jörg"},{"full_name":"Jauch, Annaïse","last_name":"Jauch","first_name":"Annaïse"},{"full_name":"Berger, Christoph","last_name":"Berger","first_name":"Christoph"},{"full_name":"Recher, Mike","last_name":"Recher","first_name":"Mike"},{"first_name":"Timm","last_name":"Schroeder","full_name":"Schroeder, Timm"},{"first_name":"Matthias","last_name":"Mehling","full_name":"Mehling, Matthias"}],"date_updated":"2023-09-13T09:00:15Z","date_created":"2018-12-11T11:45:34Z","volume":13,"year":"2018","acknowledgement":"This work was supported by the Swiss National Science Foundation (MD-PhD fellowships, 323530_164221 to C.F.; and 323630_151483 to A.J.; grant PZ00P3_144863 to M.R, grant 31003A_156431 to T.S.; PZ00P3_148000 to C.T.B.; PZ00P3_154733 to M.M.), a Novartis “FreeNovation” grant to M.M. and T.S. and an EMBO long-term fellowship (ALTF 1396-2014) co-funded by the European Commission (LTFCOFUND2013, GA-2013-609409) to J.R.. M.R. was supported by the Gebert Rüf Foundation (GRS 058/14). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Public Library of Science","file_date_updated":"2020-07-14T12:45:45Z","publist_id":"7626","article_number":"e0198330","doi":"10.1371/journal.pone.0198330","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":["000434384900031"]},"oa":1,"quality_controlled":"1","isi":1,"month":"06"},{"date_published":"2018-06-08T00:00:00Z","publication":"Scientific Reports","citation":{"chicago":"Ceinos, Rosa Maria, Elena Frigato, Cristina Pagano, Nadine Frohlich, Pietro Negrini, Nicola Cavallari, Daniela Vallone, Silvia Fuselli, Cristiano Bertolucci, and Nicholas S Foulkes. “Mutations in Blind Cavefish Target the Light Regulated Circadian Clock Gene Period 2.” Scientific Reports. Nature Publishing Group, 2018. https://doi.org/10.1038/s41598-018-27080-2.","mla":"Ceinos, Rosa Maria, et al. “Mutations in Blind Cavefish Target the Light Regulated Circadian Clock Gene Period 2.” Scientific Reports, vol. 8, no. 1, 8754, Nature Publishing Group, 2018, doi:10.1038/s41598-018-27080-2.","short":"R.M. Ceinos, E. Frigato, C. Pagano, N. Frohlich, P. Negrini, N. Cavallari, D. Vallone, S. Fuselli, C. Bertolucci, N.S. Foulkes, Scientific Reports 8 (2018).","ista":"Ceinos RM, Frigato E, Pagano C, Frohlich N, Negrini P, Cavallari N, Vallone D, Fuselli S, Bertolucci C, Foulkes NS. 2018. Mutations in blind cavefish target the light regulated circadian clock gene period 2. Scientific Reports. 8(1), 8754.","apa":"Ceinos, R. M., Frigato, E., Pagano, C., Frohlich, N., Negrini, P., Cavallari, N., … Foulkes, N. S. (2018). Mutations in blind cavefish target the light regulated circadian clock gene period 2. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-27080-2","ieee":"R. M. Ceinos et al., “Mutations in blind cavefish target the light regulated circadian clock gene period 2,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.","ama":"Ceinos RM, Frigato E, Pagano C, et al. Mutations in blind cavefish target the light regulated circadian clock gene period 2. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-27080-2"},"day":"08","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","file":[{"checksum":"9c3942d772f84f3df032ffde0ed9a8ea","date_created":"2018-12-17T13:04:46Z","date_updated":"2020-07-14T12:45:49Z","file_id":"5707","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":1855324,"access_level":"open_access","file_name":"2018_ScientificReports_Ceinos.pdf"}],"oa_version":"Published Version","_id":"283","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["570"],"title":"Mutations in blind cavefish target the light regulated circadian clock gene period 2","intvolume":" 8","abstract":[{"lang":"eng","text":"Light represents the principal signal driving circadian clock entrainment. However, how light influences the evolution of the clock remains poorly understood. The cavefish Phreatichthys andruzzii represents a fascinating model to explore how evolution under extreme aphotic conditions shapes the circadian clock, since in this species the clock is unresponsive to light. We have previously demonstrated that loss-of-function mutations targeting non-visual opsins contribute in part to this blind clock phenotype. Here, we have compared orthologs of two core clock genes that play a key role in photic entrainment, cry1a and per2, in both zebrafish and P. andruzzii. We encountered aberrantly spliced variants for the P. andruzzii per2 transcript. The most abundant transcript encodes a truncated protein lacking the C-terminal Cry binding domain and incorporating an intronic, transposon-derived coding sequence. We demonstrate that the transposon insertion leads to a predominantly cytoplasmic localization of the cavefish Per2 protein in contrast to the zebrafish ortholog which is distributed in both the nucleus and cytoplasm. Thus, it seems that during evolution in complete darkness, the photic entrainment pathway of the circadian clock has been subject to mutation at multiple levels, extending from opsin photoreceptors to nuclear effectors."}],"issue":"1","type":"journal_article","doi":"10.1038/s41598-018-27080-2","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":["000434640800008"]},"isi":1,"quality_controlled":"1","month":"06","author":[{"first_name":"Rosa Maria","last_name":"Ceinos","full_name":"Ceinos, Rosa Maria"},{"first_name":"Elena","last_name":"Frigato","full_name":"Frigato, Elena"},{"full_name":"Pagano, Cristina","first_name":"Cristina","last_name":"Pagano"},{"first_name":"Nadine","last_name":"Frohlich","full_name":"Frohlich, Nadine"},{"full_name":"Negrini, Pietro","last_name":"Negrini","first_name":"Pietro"},{"last_name":"Cavallari","first_name":"Nicola","id":"457160E6-F248-11E8-B48F-1D18A9856A87","full_name":"Cavallari, Nicola"},{"full_name":"Vallone, Daniela","first_name":"Daniela","last_name":"Vallone"},{"last_name":"Fuselli","first_name":"Silvia","full_name":"Fuselli, Silvia"},{"full_name":"Bertolucci, Cristiano","last_name":"Bertolucci","first_name":"Cristiano"},{"last_name":"Foulkes","first_name":"Nicholas S","full_name":"Foulkes, Nicholas S"}],"date_updated":"2023-09-13T08:59:27Z","date_created":"2018-12-11T11:45:36Z","volume":8,"year":"2018","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"EvBe"}],"file_date_updated":"2020-07-14T12:45:49Z","publist_id":"7616","article_number":"8754"},{"publist_id":"7973","file_date_updated":"2020-10-09T06:24:21Z","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","year":"2018","volume":11022,"date_created":"2018-12-11T11:44:31Z","date_updated":"2023-09-13T08:58:34Z","author":[{"full_name":"Elgyütt, Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","last_name":"Elgyütt"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"month":"08","project":[{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000884993200004"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-00151-3_4","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2018-09-06","location":"Beijing, China","start_date":"2018-09-04"},"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}],"intvolume":" 11022","title":"Monitoring temporal logic with clock variables","status":"public","ddc":["000"],"_id":"81","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","success":1,"date_updated":"2020-10-09T06:24:21Z","date_created":"2020-10-09T06:24:21Z","relation":"main_file","file_id":"8638","content_type":"application/pdf","file_size":537219,"creator":"dernst","access_level":"open_access","file_name":"2018_LNCS_Elgyuett.pdf"}],"oa_version":"Submitted Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"26","page":"53 - 70","citation":{"short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.","mla":"Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables. Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_4.","ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:10.1007/978-3-030-00151-3_4","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","apa":"Elgyütt, A., Ferrere, T., & Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_4","ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70."},"date_published":"2018-08-26T00:00:00Z"},{"publication":"Distributed Computing","citation":{"chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6.","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.","apa":"Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6","ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6"},"date_published":"2018-09-12T00:00:00Z","scopus_import":"1","day":"12","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"76","title":"Near-optimal self-stabilising counting and firing squads","ddc":["000"],"status":"public","file":[{"relation":"main_file","file_id":"5711","checksum":"872db70bba9b401500abe3c6ae2f1a61","date_created":"2018-12-17T14:21:22Z","date_updated":"2020-07-14T12:48:01Z","access_level":"open_access","file_name":"2018_DistributedComputing_Lenzen.pdf","content_type":"application/pdf","file_size":799337,"creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.","lang":"eng"}],"external_id":{"isi":["000475627800005"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1,"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"doi":"10.1007/s00446-018-0342-6","language":[{"iso":"eng"}],"month":"09","year":"2018","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Springer","author":[{"full_name":"Lenzen, Christoph","last_name":"Lenzen","first_name":"Christoph"},{"full_name":"Rybicki, Joel","first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646"}],"date_updated":"2023-09-13T09:01:06Z","date_created":"2018-12-11T11:44:30Z","file_date_updated":"2020-07-14T12:48:01Z","publist_id":"7978"},{"month":"03","language":[{"iso":"eng"}],"doi":"10.1016/j.comgeo.2017.06.014","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000415778300010"]},"ec_funded":1,"publist_id":"7289","file_date_updated":"2020-07-14T12:46:38Z","volume":68,"date_updated":"2023-09-13T08:59:00Z","date_created":"2018-12-11T11:46:59Z","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"HeEd"}],"publisher":"Elsevier","publication_status":"published","year":"2018","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-03-01T00:00:00Z","page":"119 - 133","citation":{"chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls I: Inclusion–Exclusion.” Computational Geometry: Theory and Applications. Elsevier, 2018. https://doi.org/10.1016/j.comgeo.2017.06.014.","short":"H. Edelsbrunner, M. Iglesias Ham, Computational Geometry: Theory and Applications 68 (2018) 119–133.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls I: Inclusion–Exclusion.” Computational Geometry: Theory and Applications, vol. 68, Elsevier, 2018, pp. 119–33, doi:10.1016/j.comgeo.2017.06.014.","ieee":"H. Edelsbrunner and M. Iglesias Ham, “Multiple covers with balls I: Inclusion–exclusion,” Computational Geometry: Theory and Applications, vol. 68. Elsevier, pp. 119–133, 2018.","apa":"Edelsbrunner, H., & Iglesias Ham, M. (2018). Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.06.014","ista":"Edelsbrunner H, Iglesias Ham M. 2018. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 68, 119–133.","ama":"Edelsbrunner H, Iglesias Ham M. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 2018;68:119-133. doi:10.1016/j.comgeo.2017.06.014"},"publication":"Computational Geometry: Theory and Applications","abstract":[{"lang":"eng","text":"Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. We extend it to multiple coverings, proving short inclusion–exclusion formulas for the subset of Rn covered by at least k balls in a finite set. We implement two of the formulas in dimension n=3 and report on results obtained with our software."}],"type":"journal_article","oa_version":"Preprint","file":[{"content_type":"application/pdf","file_size":708357,"creator":"dernst","file_name":"2018_Edelsbrunner.pdf","access_level":"open_access","date_created":"2019-02-12T06:47:52Z","date_updated":"2020-07-14T12:46:38Z","checksum":"1c8d58cd489a66cd3e2064c1141c8c5e","relation":"main_file","file_id":"5953"}],"intvolume":" 68","title":"Multiple covers with balls I: Inclusion–exclusion","ddc":["000"],"status":"public","_id":"530","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"isi":1,"quality_controlled":"1","external_id":{"isi":["000429454000015"],"arxiv":["1712.10127"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.10127"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevA.97.043812","month":"04","publisher":"American Physical Society","department":[{"_id":"JoFi"}],"publication_status":"published","acknowledgement":"The work was partially supported by Russian Foundation for Basic Research (Grant No. 15-02-05657a) and by the Basic research program of Higher School of Economics (HSE).","year":"2018","volume":97,"date_created":"2018-12-11T11:45:44Z","date_updated":"2023-09-13T09:00:41Z","author":[{"last_name":"Redchenko","first_name":"Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","full_name":"Redchenko, Elena"},{"last_name":"Makarov","first_name":"Alexander","full_name":"Makarov, Alexander"},{"first_name":"Vladimir","last_name":"Yudson","full_name":"Yudson, Vladimir"}],"article_number":" 043812 ","publist_id":"7572","article_type":"original","citation":{"mla":"Redchenko, Elena, et al. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no. 4, 043812, American Physical Society, 2018, doi:10.1103/PhysRevA.97.043812.","short":"E. Redchenko, A. Makarov, V. Yudson, Physical Review A - Atomic, Molecular, and Optical Physics 97 (2018).","chicago":"Redchenko, Elena, Alexander Makarov, and Vladimir Yudson. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevA.97.043812.","ama":"Redchenko E, Makarov A, Yudson V. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A - Atomic, Molecular, and Optical Physics. 2018;97(4). doi:10.1103/PhysRevA.97.043812","ista":"Redchenko E, Makarov A, Yudson V. 2018. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A - Atomic, Molecular, and Optical Physics. 97(4), 043812.","apa":"Redchenko, E., Makarov, A., & Yudson, V. (2018). Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.97.043812","ieee":"E. Redchenko, A. Makarov, and V. Yudson, “Nanoscopy of pairs of atoms by fluorescence in a magnetic field,” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no. 4. American Physical Society, 2018."},"publication":" Physical Review A - Atomic, Molecular, and Optical Physics","date_published":"2018-04-09T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"09","intvolume":" 97","status":"public","title":"Nanoscopy of pairs of atoms by fluorescence in a magnetic field","_id":"307","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","type":"journal_article","issue":"4","abstract":[{"text":"Spontaneous emission spectra of two initially excited closely spaced identical atoms are very sensitive to the strength and the direction of the applied magnetic field. We consider the relevant schemes that ensure the determination of the mutual spatial orientation of the atoms and the distance between them by entirely optical means. A corresponding theoretical description is given accounting for the dipole-dipole interaction between the two atoms in the presence of a magnetic field and for polarizations of the quantum field interacting with magnetic sublevels of the two-atom system. ","lang":"eng"}]},{"related_material":{"record":[{"id":"9811","relation":"research_data","status":"public"},{"id":"9812","status":"public","relation":"research_data"}]},"author":[{"last_name":"Zapata","first_name":"Luis","full_name":"Zapata, Luis"},{"full_name":"Pich, Oriol","last_name":"Pich","first_name":"Oriol"},{"full_name":"Serrano, Luis","first_name":"Luis","last_name":"Serrano"},{"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","first_name":"Stephan","last_name":"Ossowski"},{"full_name":"Schaefer, Martin","last_name":"Schaefer","first_name":"Martin"}],"volume":19,"date_updated":"2023-09-13T09:01:32Z","date_created":"2018-12-11T11:45:35Z","year":"2018","department":[{"_id":"FyKo"}],"publisher":"BioMed Central","publication_status":"published","publist_id":"7620","ec_funded":1,"file_date_updated":"2020-07-14T12:45:47Z","article_number":"67","doi":"10.1186/s13059-018-1434-0","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"},"oa":1,"external_id":{"isi":["000433986200001"]},"project":[{"name":"Systematic investigation of epistasis in molecular evolution","call_identifier":"FP7","grant_number":"335980","_id":"26120F5C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"month":"05","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_GenomeBiology_Zapata.pdf","content_type":"application/pdf","file_size":1414722,"creator":"dernst","relation":"main_file","file_id":"5708","checksum":"f3e4922486bd9bf1483271bdbed394a7","date_created":"2018-12-17T14:05:01Z","date_updated":"2020-07-14T12:45:47Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"279","intvolume":" 19","ddc":["570"],"status":"public","title":"Negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","abstract":[{"lang":"eng","text":"Background: Natural selection shapes cancer genomes. Previous studies used signatures of positive selection to identify genes driving malignant transformation. However, the contribution of negative selection against somatic mutations that affect essential tumor functions or specific domains remains a controversial topic. Results: Here, we analyze 7546 individual exomes from 26 tumor types from TCGA data to explore the portion of the cancer exome under negative selection. Although we find most of the genes neutrally evolving in a pan-cancer framework, we identify essential cancer genes and immune-exposed protein regions under significant negative selection. Moreover, our simulations suggest that the amount of negative selection is underestimated. We therefore choose an empirical approach to identify genes, functions, and protein regions under negative selection. We find that expression and mutation status of negatively selected genes is indicative of patient survival. Processes that are most strongly conserved are those that play fundamental cellular roles such as protein synthesis, glucose metabolism, and molecular transport. Intriguingly, we observe strong signals of selection in the immunopeptidome and proteins controlling peptide exposition, highlighting the importance of immune surveillance evasion. Additionally, tumor type-specific immune activity correlates with the strength of negative selection on human epitopes. Conclusions: In summary, our results show that negative selection is a hallmark of cell essentiality and immune response in cancer. The functional domains identified could be exploited therapeutically, ultimately allowing for the development of novel cancer treatments."}],"type":"journal_article","date_published":"2018-05-31T00:00:00Z","citation":{"ama":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. Negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Genome Biology. 2018;19. doi:10.1186/s13059-018-1434-0","ista":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. 2018. Negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Genome Biology. 19, 67.","apa":"Zapata, L., Pich, O., Serrano, L., Kondrashov, F., Ossowski, S., & Schaefer, M. (2018). Negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Genome Biology. BioMed Central. https://doi.org/10.1186/s13059-018-1434-0","ieee":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, and M. Schaefer, “Negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome,” Genome Biology, vol. 19. BioMed Central, 2018.","mla":"Zapata, Luis, et al. “Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome.” Genome Biology, vol. 19, 67, BioMed Central, 2018, doi:10.1186/s13059-018-1434-0.","short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, Genome Biology 19 (2018).","chicago":"Zapata, Luis, Oriol Pich, Luis Serrano, Fyodor Kondrashov, Stephan Ossowski, and Martin Schaefer. “Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome.” Genome Biology. BioMed Central, 2018. https://doi.org/10.1186/s13059-018-1434-0."},"publication":"Genome Biology","has_accepted_license":"1","article_processing_charge":"No","day":"31","scopus_import":"1"},{"title":"Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission","ddc":["570"],"status":"public","intvolume":" 37","_id":"145","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_size":2846470,"content_type":"application/pdf","creator":"dernst","file_name":"2018_EMBO_Truckenbrodt.pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:56Z","date_created":"2018-12-17T14:17:29Z","checksum":"a540feb6c9af6aefc78de531461a8835","relation":"main_file","file_id":"5710"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Aged proteins can become hazardous to cellular function, by accumulating molecular damage. This implies that cells should preferentially rely on newly produced ones. We tested this hypothesis in cultured hippocampal neurons, focusing on synaptic transmission. We found that newly synthesized vesicle proteins were incorporated in the actively recycling pool of vesicles responsible for all neurotransmitter release during physiological activity. We observed this for the calcium sensor Synaptotagmin 1, for the neurotransmitter transporter VGAT, and for the fusion protein VAMP2 (Synaptobrevin 2). Metabolic labeling of proteins and visualization by secondary ion mass spectrometry enabled us to query the entire protein makeup of the actively recycling vesicles, which we found to be younger than that of non-recycling vesicles. The young vesicle proteins remained in use for up to ~ 24 h, during which they participated in recycling a few hundred times. They were afterward reluctant to release and were degraded after an additional ~ 24–48 h. We suggest that the recycling pool of synaptic vesicles relies on newly synthesized proteins, while the inactive reserve pool contains older proteins."}],"issue":"15","article_type":"original","publication":"The EMBO Journal","citation":{"ama":"Truckenbrodt SM, Viplav A, Jähne S, et al. Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission. The EMBO Journal. 2018;37(15). doi:10.15252/embj.201798044","apa":"Truckenbrodt, S. M., Viplav, A., Jähne, S., Vogts, A., Denker, A., Wildhagen, H., … Rizzoli, S. (2018). Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission. The EMBO Journal. Wiley. https://doi.org/10.15252/embj.201798044","ieee":"S. M. Truckenbrodt et al., “Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission,” The EMBO Journal, vol. 37, no. 15. Wiley, 2018.","ista":"Truckenbrodt SM, Viplav A, Jähne S, Vogts A, Denker A, Wildhagen H, Fornasiero E, Rizzoli S. 2018. Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission. The EMBO Journal. 37(15), e98044.","short":"S.M. Truckenbrodt, A. Viplav, S. Jähne, A. Vogts, A. Denker, H. Wildhagen, E. Fornasiero, S. Rizzoli, The EMBO Journal 37 (2018).","mla":"Truckenbrodt, Sven M., et al. “Newly Produced Synaptic Vesicle Proteins Are Preferentially Used in Synaptic Transmission.” The EMBO Journal, vol. 37, no. 15, e98044, Wiley, 2018, doi:10.15252/embj.201798044.","chicago":"Truckenbrodt, Sven M, Abhiyan Viplav, Sebsatian Jähne, Angela Vogts, Annette Denker, Hanna Wildhagen, Eugenio Fornasiero, and Silvio Rizzoli. “Newly Produced Synaptic Vesicle Proteins Are Preferentially Used in Synaptic Transmission.” The EMBO Journal. Wiley, 2018. https://doi.org/10.15252/embj.201798044."},"date_published":"2018-08-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication_status":"published","publisher":"Wiley","department":[{"_id":"JoDa"}],"year":"2018","acknowledgement":"We thank Reinhard Jahn for providing a plasmid for YFP-SNAP25. We thank Erwin Neher for help with the development of the mathematical model of the synaptic vesicle life cycle. We thank Martin Meschkat, Andreas Höbartner, Annedore Punge, and Peer Hoopmann for help with the experiments. We thank Burkhard Rammner for providing the illustrations of synaptic vesicle and protein dynamics. We thank Manuel Maidorn, Martin Helm, and Katharina N. Richter for critically reading the manuscript. S.T. was supported by an Excellence Stipend of the Göttingen Graduate School for Neurosciences, Biophysics, and Molecular Biosciences (GGNB). E.F.F. is a recipient of long-term fellowships from the European Molecular Biology Organization (ALTF_797-2012) and from the Human Frontier Science Program (HFSP_LT000830/2013). The work was supported by grants to S.O.R. from the European Research Council (ERC-2013-CoG NeuroMolAnatomy) and from the Deutsche Forschungsgemeinschaft (Cluster of Excellence Nanoscale Microscopy and Molecular Physiology of the Brain, SFB1190/P09, SFB889/A05, and SFB1286/A03, and DFG RI 1967 7/1). The nanoSIMS instrument was funded by the German Federal Ministry of Education and Research (03F0626A).","pmid":1,"date_updated":"2023-09-13T09:02:48Z","date_created":"2018-12-11T11:44:52Z","volume":37,"author":[{"id":"45812BD4-F248-11E8-B48F-1D18A9856A87","last_name":"Truckenbrodt","first_name":"Sven M","full_name":"Truckenbrodt, Sven M"},{"full_name":"Viplav, Abhiyan","last_name":"Viplav","first_name":"Abhiyan"},{"full_name":"Jähne, Sebsatian","last_name":"Jähne","first_name":"Sebsatian"},{"first_name":"Angela","last_name":"Vogts","full_name":"Vogts, Angela"},{"full_name":"Denker, Annette","last_name":"Denker","first_name":"Annette"},{"last_name":"Wildhagen","first_name":"Hanna","full_name":"Wildhagen, Hanna"},{"full_name":"Fornasiero, Eugenio","first_name":"Eugenio","last_name":"Fornasiero"},{"last_name":"Rizzoli","first_name":"Silvio","full_name":"Rizzoli, Silvio"}],"article_number":"e98044","file_date_updated":"2020-07-14T12:44:56Z","publist_id":"7778","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":["000440416900005"],"pmid":["29950309"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.15252/embj.201798044","month":"08","publication_identifier":{"issn":["0261-4189"]}},{"author":[{"full_name":"Fan, Ligang","first_name":"Ligang","last_name":"Fan"},{"full_name":"Zhao, Lei","first_name":"Lei","last_name":"Zhao"},{"full_name":"Hu, Wei","first_name":"Wei","last_name":"Hu"},{"full_name":"Li, Weina","last_name":"Li","first_name":"Weina"},{"full_name":"Novák, Ondřej","last_name":"Novák","first_name":"Ondřej"},{"full_name":"Strnad, Miroslav","first_name":"Miroslav","last_name":"Strnad"},{"full_name":"Simon, Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1998-6741","first_name":"Sibu","last_name":"Simon"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"full_name":"Shen, Jinbo","first_name":"Jinbo","last_name":"Shen"},{"first_name":"Liwen","last_name":"Jiang","full_name":"Jiang, Liwen"},{"last_name":"Qiu","first_name":"Quan","full_name":"Qiu, Quan"}],"date_created":"2018-12-11T11:46:36Z","date_updated":"2023-09-13T09:03:18Z","volume":41,"year":"2018","acknowledgement":"This work was supported by the National Natural Science Foundation of China (31571464, 31371438 and 31070222 to Q.S.Q.), the National Basic Research Program of China (973 project, 2013CB429904 to Q.S.Q.), the Research Fund for the Doctoral Program of Higher Education of China (20130211110001 to Q.S.Q.), the Ministry of Education, Youth and Sports of the Czech Republic (the National Program for Sustainability I, LO1204), and The Czech Science Foundation GAČR (GA13–40637S) to JF. We thank Dr. Tom J. Guilfoyle for DR5::GUS line and Dr. Jia Li for pBIB‐RFP vector and DR5::GFP line. We thank Liping Guan and Yang Zhao for their help with the confocal microscope assay. ","pmid":1,"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Wiley-Blackwell","file_date_updated":"2020-07-14T12:46:32Z","publist_id":"7359","license":"https://creativecommons.org/licenses/by-nc/4.0/","doi":"10.1111/pce.13153","language":[{"iso":"eng"}],"external_id":{"isi":["000426870500012"],"pmid":["29360148"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"isi":1,"quality_controlled":"1","month":"05","file":[{"file_id":"7042","relation":"main_file","checksum":"6a20f843565f962cb20281cdf5e40914","date_created":"2019-11-18T16:22:22Z","date_updated":"2020-07-14T12:46:32Z","access_level":"open_access","file_name":"2018_PlantCellEnv_Fan.pdf","creator":"dernst","file_size":1937976,"content_type":"application/pdf"}],"oa_version":"Submitted Version","_id":"462","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development","ddc":["580"],"intvolume":" 41","abstract":[{"lang":"eng","text":"AtNHX5 and AtNHX6 are endosomal Na+,K+/H+ antiporters that are critical for growth and development in Arabidopsis, but the mechanism behind their action remains unknown. Here, we report that AtNHX5 and AtNHX6, functioning as H+ leak, control auxin homeostasis and auxin-mediated development. We found that nhx5 nhx6 exhibited growth variations of auxin-related defects. We further showed that nhx5 nhx6 was affected in auxin homeostasis. Genetic analysis showed that AtNHX5 and AtNHX6 were required for the function of the ER-localized auxin transporter PIN5. Although AtNHX5 and AtNHX6 were co-localized with PIN5 at ER, they did not interact directly. Instead, the conserved acidic residues in AtNHX5 and AtNHX6, which are essential for exchange activity, were required for PIN5 function. AtNHX5 and AtNHX6 regulated the pH in ER. Overall, AtNHX5 and AtNHX6 may regulate auxin transport across the ER via the pH gradient created by their transport activity. H+-leak pathway provides a fine-tuning mechanism that controls cellular auxin fluxes. "}],"type":"journal_article","date_published":"2018-05-01T00:00:00Z","publication":"Plant, Cell and Environment","citation":{"short":"L. Fan, L. Zhao, W. Hu, W. Li, O. Novák, M. Strnad, S. Simon, J. Friml, J. Shen, L. Jiang, Q. Qiu, Plant, Cell and Environment 41 (2018) 850–864.","mla":"Fan, Ligang, et al. “NHX Antiporters Regulate the PH of Endoplasmic Reticulum and Auxin-Mediated Development.” Plant, Cell and Environment, vol. 41, Wiley-Blackwell, 2018, pp. 850–64, doi:10.1111/pce.13153.","chicago":"Fan, Ligang, Lei Zhao, Wei Hu, Weina Li, Ondřej Novák, Miroslav Strnad, Sibu Simon, et al. “NHX Antiporters Regulate the PH of Endoplasmic Reticulum and Auxin-Mediated Development.” Plant, Cell and Environment. Wiley-Blackwell, 2018. https://doi.org/10.1111/pce.13153.","ama":"Fan L, Zhao L, Hu W, et al. NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development. Plant, Cell and Environment. 2018;41:850-864. doi:10.1111/pce.13153","ieee":"L. Fan et al., “NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development,” Plant, Cell and Environment, vol. 41. Wiley-Blackwell, pp. 850–864, 2018.","apa":"Fan, L., Zhao, L., Hu, W., Li, W., Novák, O., Strnad, M., … Qiu, Q. (2018). NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development. Plant, Cell and Environment. Wiley-Blackwell. https://doi.org/10.1111/pce.13153","ista":"Fan L, Zhao L, Hu W, Li W, Novák O, Strnad M, Simon S, Friml J, Shen J, Jiang L, Qiu Q. 2018. NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development. Plant, Cell and Environment. 41, 850–864."},"article_type":"original","page":"850 - 864","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"15","citation":{"ista":"Altmeyer S. 2018. Non-linear dynamics and alternating ‘flip’ solutions in ferrofluidic Taylor-Couette flow. Journal of Magnetism and Magnetic Materials. 452, 427–441.","ieee":"S. Altmeyer, “Non-linear dynamics and alternating ‘flip’ solutions in ferrofluidic Taylor-Couette flow,” Journal of Magnetism and Magnetic Materials, vol. 452. Elsevier, pp. 427–441, 2018.","apa":"Altmeyer, S. (2018). Non-linear dynamics and alternating ‘flip’ solutions in ferrofluidic Taylor-Couette flow. Journal of Magnetism and Magnetic Materials. Elsevier. https://doi.org/10.1016/j.jmmm.2017.12.073","ama":"Altmeyer S. Non-linear dynamics and alternating ‘flip’ solutions in ferrofluidic Taylor-Couette flow. Journal of Magnetism and Magnetic Materials. 2018;452:427-441. doi:10.1016/j.jmmm.2017.12.073","chicago":"Altmeyer, Sebastian. “Non-Linear Dynamics and Alternating ‘Flip’ Solutions in Ferrofluidic Taylor-Couette Flow.” Journal of Magnetism and Magnetic Materials. Elsevier, 2018. https://doi.org/10.1016/j.jmmm.2017.12.073.","mla":"Altmeyer, Sebastian. “Non-Linear Dynamics and Alternating ‘Flip’ Solutions in Ferrofluidic Taylor-Couette Flow.” Journal of Magnetism and Magnetic Materials, vol. 452, Elsevier, 2018, pp. 427–41, doi:10.1016/j.jmmm.2017.12.073.","short":"S. Altmeyer, Journal of Magnetism and Magnetic Materials 452 (2018) 427–441."},"publication":"Journal of Magnetism and Magnetic Materials","page":"427 - 441","article_type":"original","date_published":"2018-04-15T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"This study treats with the influence of a symmetry-breaking transversal magnetic field on the nonlinear dynamics of ferrofluidic Taylor-Couette flow – flow confined between two concentric independently rotating cylinders. We detected alternating ‘flip’ solutions which are flow states featuring typical characteristics of slow-fast-dynamics in dynamical systems. The flip corresponds to a temporal change in the axial wavenumber and we find them to appear either as pure 2-fold axisymmetric (due to the symmetry-breaking nature of the applied transversal magnetic field) or involving non-axisymmetric, helical modes in its interim solution. The latter ones show features of typical ribbon solutions. In any case the flip solutions have a preferential first axial wavenumber which corresponds to the more stable state (slow dynamics) and second axial wavenumber, corresponding to the short appearing more unstable state (fast dynamics). However, in both cases the flip time grows exponential with increasing the magnetic field strength before the flip solutions, living on 2-tori invariant manifolds, cease to exist, with lifetime going to infinity. Further we show that ferrofluidic flow turbulence differ from the classical, ordinary (usually at high Reynolds number) turbulence. The applied magnetic field hinders the free motion of ferrofluid partials and therefore smoothen typical turbulent quantities and features so that speaking of mildly chaotic dynamics seems to be a more appropriate expression for the observed motion. "}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"519","intvolume":" 452","status":"public","ddc":["530"],"title":"Non-linear dynamics and alternating ‘flip’ solutions in ferrofluidic Taylor-Couette flow","file":[{"access_level":"open_access","file_name":"2018_Magnetism_Altmeyer.pdf","file_size":17309535,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7838","checksum":"431f5cd4a628d7ca21161f82b14ccb4f","date_created":"2020-05-14T14:41:17Z","date_updated":"2020-07-14T12:46:37Z"}],"oa_version":"Submitted Version","month":"04","external_id":{"isi":["000425547700061"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1016/j.jmmm.2017.12.073","language":[{"iso":"eng"}],"publist_id":"7297","file_date_updated":"2020-07-14T12:46:37Z","year":"2018","acknowledgement":"S.Altmeyer is a Serra Húnter Fellow","department":[{"_id":"BjHo"}],"publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","last_name":"Altmeyer","first_name":"Sebastian"}],"volume":452,"date_created":"2018-12-11T11:46:56Z","date_updated":"2023-09-13T09:03:44Z"},{"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"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","status":"public","title":"New approaches for almost-sure termination of probabilistic programs","intvolume":" 11275","_id":"5679","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-12-01T00:00:00Z","page":"181-201","citation":{"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.","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.","short":"M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.","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.","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","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.","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"},"date_created":"2018-12-16T22:59:20Z","date_updated":"2023-09-13T09:02:22Z","volume":11275,"author":[{"first_name":"Mingzhang","last_name":"Huang","full_name":"Huang, Mingzhang"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"editor":[{"full_name":"Ryu, Sukyoung","first_name":"Sukyoung","last_name":"Ryu"}],"year":"2018","month":"12","publication_identifier":{"isbn":["9783030027674"],"issn":["03029743"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2018-12-02","location":"Wellington, New Zealand","end_date":"2018-12-06","name":"16th Asian Symposium on Programming Languages and Systems, APLAS"},"doi":"10.1007/978-3-030-02768-1_11","isi":1,"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1806.06683","open_access":"1"}],"external_id":{"arxiv":["1806.06683"],"isi":["000916310900011"]}},{"month":"05","day":"31","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.6401414.v1"}],"citation":{"short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","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.","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.","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","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","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.","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."},"oa":1,"doi":"10.6084/m9.figshare.6401414.v1","date_published":"2018-05-31T00:00:00Z","type":"research_data_reference","abstract":[{"text":"This document contains the full list of genes with their respective significance and dN/dS values. (TXT 4499Â kb)","lang":"eng"}],"_id":"9812","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","status":"public","title":"Additional file 2: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","publisher":"Springer Nature","department":[{"_id":"FyKo"}],"author":[{"last_name":"Zapata","first_name":"Luis","full_name":"Zapata, Luis"},{"first_name":"Oriol","last_name":"Pich","full_name":"Pich, Oriol"},{"first_name":"Luis","last_name":"Serrano","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"},{"first_name":"Stephan","last_name":"Ossowski","full_name":"Ossowski, Stephan"},{"full_name":"Schaefer, Martin","last_name":"Schaefer","first_name":"Martin"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"279"}]},"date_created":"2021-08-06T12:58:25Z","date_updated":"2023-09-13T09:01:31Z","oa_version":"Published Version"},{"type":"research_data_reference","abstract":[{"lang":"eng","text":"This document contains additional supporting evidence presented as supplemental tables. (XLSX 50Â kb)"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9811","year":"2018","status":"public","title":"Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","department":[{"_id":"FyKo"}],"publisher":"Springer Nature","author":[{"full_name":"Zapata, Luis","first_name":"Luis","last_name":"Zapata"},{"last_name":"Pich","first_name":"Oriol","full_name":"Pich, Oriol"},{"full_name":"Serrano, Luis","last_name":"Serrano","first_name":"Luis"},{"full_name":"Kondrashov, Fyodor","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","first_name":"Fyodor"},{"full_name":"Ossowski, Stephan","last_name":"Ossowski","first_name":"Stephan"},{"last_name":"Schaefer","first_name":"Martin","full_name":"Schaefer, Martin"}],"related_material":{"record":[{"id":"279","status":"public","relation":"used_in_publication"}]},"date_created":"2021-08-06T12:53:49Z","date_updated":"2023-09-13T09:01:31Z","oa_version":"Preprint","month":"05","day":"31","article_processing_charge":"No","citation":{"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","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.","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.","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","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.","short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","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."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.6401390.v1"}],"doi":"10.6084/m9.figshare.6401390.v1","date_published":"2018-05-31T00:00:00Z"},{"publication_identifier":{"issn":["1471-2164"]},"month":"11","doi":"10.1186/s12864-018-5173-0","language":[{"iso":"eng"}],"external_id":{"isi":["000450976700002"]},"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,"isi":1,"quality_controlled":"1","publist_id":"8035","file_date_updated":"2020-07-14T12:45:23Z","related_material":{"record":[{"status":"public","relation":"research_data","id":"9807"},{"id":"9808","status":"public","relation":"research_data"}]},"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","last_name":"Giroud","first_name":"Maude"},{"full_name":"Pauler, Florian","orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","last_name":"Pauler","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"}],"volume":19,"date_updated":"2023-09-13T09:10:47Z","date_created":"2018-12-11T11:44:12Z","acknowledgement":"This work was funded by the German Centre for Diabetes Research (DZD) and the Austrian Science Fund (FWF, P25729-B19).","year":"2018","department":[{"_id":"SiHi"}],"publisher":"BioMed Central","publication_status":"published","has_accepted_license":"1","article_processing_charge":"No","day":"03","scopus_import":"1","date_published":"2018-11-03T00:00:00Z","citation":{"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.","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).","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).","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.","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","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"},"publication":"BMC Genomics","article_type":"original","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":[{"content_type":"application/pdf","file_size":4629784,"creator":"dernst","access_level":"open_access","file_name":"2018_BMCGenomics_Higareda.pdf","checksum":"a56516e734dab589dc7f3e1915973b4d","date_created":"2018-12-17T14:52:57Z","date_updated":"2020-07-14T12:45:23Z","relation":"main_file","file_id":"5712"}],"_id":"20","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 19","ddc":["570"],"status":"public","title":"Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes"},{"issue":"4","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"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 65","status":"public","title":"Non-malleable codes","_id":"107","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-08-01T00:00:00Z","article_type":"original","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).","chicago":"Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.” Journal of the ACM. ACM, 2018. https://doi.org/10.1145/3178432.","ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the ACM. 2018;65(4). doi:10.1145/3178432","ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.","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."},"publication":"Journal of the ACM","ec_funded":1,"publist_id":"7947","article_number":"20","volume":65,"date_updated":"2023-09-13T09:05:17Z","date_created":"2018-12-11T11:44:40Z","author":[{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"department":[{"_id":"KrPi"}],"publisher":"ACM","publication_status":"published","year":"2018","month":"08","language":[{"iso":"eng"}],"doi":"10.1145/3178432","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"},{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000442938200004"]},"main_file_link":[{"url":"https://eprint.iacr.org/2009/608","open_access":"1"}],"oa":1},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-12-01T00:00:00Z","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","page":"4267-4283","issue":"12","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."}],"type":"journal_article","oa_version":"Submitted Version","_id":"5676","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 217","status":"public","title":"Occluding junctions as novel regulators of tissue mechanics during wound repair","publication_identifier":{"issn":["00219525"]},"month":"12","doi":"10.1083/jcb.201804048","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30228162"}],"external_id":{"isi":["000451960800018"],"pmid":["30228162 "]},"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"ec_funded":1,"author":[{"full_name":"Carvalho, Lara","last_name":"Carvalho","first_name":"Lara"},{"full_name":"Patricio, Pedro","first_name":"Pedro","last_name":"Patricio"},{"full_name":"Ponte, Susana","first_name":"Susana","last_name":"Ponte"},{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"},{"full_name":"Almeida, Luis","last_name":"Almeida","first_name":"Luis"},{"full_name":"Nunes, André S.","last_name":"Nunes","first_name":"André S."},{"full_name":"Araújo, Nuno A.M.","first_name":"Nuno A.M.","last_name":"Araújo"},{"last_name":"Jacinto","first_name":"Antonio","full_name":"Jacinto, Antonio"}],"volume":217,"date_updated":"2023-09-13T09:11:17Z","date_created":"2018-12-16T22:59:19Z","pmid":1,"year":"2018","publisher":"Rockefeller University Press","department":[{"_id":"CaHe"}],"publication_status":"published"},{"type":"conference","extern":"1","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."}],"department":[{"_id":"FrLo"}],"status":"public","publication_status":"published","title":"Clustering meets implicit generative models","_id":"14224","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_updated":"2023-09-13T09:08:24Z","date_created":"2023-08-22T14:25:34Z","author":[{"full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"last_name":"Vincent","first_name":"Damien","full_name":"Vincent, Damien"},{"last_name":"Tolstikhin","first_name":"Ilya","full_name":"Tolstikhin, Ilya"},{"full_name":"Ratsch, Gunnar","last_name":"Ratsch","first_name":"Gunnar"},{"full_name":"Gelly, Sylvain","last_name":"Gelly","first_name":"Sylvain"},{"full_name":"Scholkopf, Bernhard","first_name":"Bernhard","last_name":"Scholkopf"}],"scopus_import":"1","article_processing_charge":"No","day":"01","month":"05","quality_controlled":"1","external_id":{"arxiv":["1804.11130"]},"oa":1,"citation":{"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.","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.","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.","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.","mla":"Locatello, Francesco, et al. “Clustering Meets Implicit Generative Models.” 6th International Conference on Learning Representations, 2018.","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf, in:, 6th International Conference on Learning Representations, 2018.","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."},"main_file_link":[{"url":"https://arxiv.org/abs/1804.11130","open_access":"1"}],"publication":"6th International Conference on Learning Representations","language":[{"iso":"eng"}],"date_published":"2018-05-01T00:00:00Z","conference":{"start_date":"2018-04-30","location":"Vancouver, Canada","end_date":"2018-05-03","name":"International Conference on Machine Learning"}},{"type":"research_data_reference","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)."}],"_id":"9807","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","publisher":"Springer Nature","department":[{"_id":"SiHi"}],"status":"public","title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"20"}]},"author":[{"last_name":"Higareda Almaraz","first_name":"Juan","full_name":"Higareda Almaraz, Juan"},{"first_name":"Michael","last_name":"Karbiener","full_name":"Karbiener, Michael"},{"last_name":"Giroud","first_name":"Maude","full_name":"Giroud, Maude"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048","first_name":"Florian","last_name":"Pauler","full_name":"Pauler, Florian"},{"full_name":"Gerhalter, Teresa","last_name":"Gerhalter","first_name":"Teresa"},{"full_name":"Herzig, Stephan","last_name":"Herzig","first_name":"Stephan"},{"full_name":"Scheideler, Marcel","last_name":"Scheideler","first_name":"Marcel"}],"oa_version":"Published Version","date_created":"2021-08-06T12:26:53Z","date_updated":"2023-09-13T09:10:47Z","article_processing_charge":"No","day":"03","month":"11","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295339.v1"}],"oa":1,"citation":{"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","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.","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.","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.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","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_published":"2018-11-03T00:00:00Z","doi":"10.6084/m9.figshare.7295339.v1"},{"date_created":"2021-08-06T12:31:57Z","date_updated":"2023-09-13T09:10:47Z","oa_version":"Published Version","author":[{"full_name":"Higareda Almaraz, Juan","first_name":"Juan","last_name":"Higareda Almaraz"},{"first_name":"Michael","last_name":"Karbiener","full_name":"Karbiener, Michael"},{"last_name":"Giroud","first_name":"Maude","full_name":"Giroud, Maude"},{"full_name":"Pauler, Florian","first_name":"Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"last_name":"Herzig","first_name":"Stephan","full_name":"Herzig, Stephan"},{"full_name":"Scheideler, Marcel","last_name":"Scheideler","first_name":"Marcel"}],"related_material":{"record":[{"id":"20","status":"public","relation":"used_in_publication"}]},"title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","status":"public","publisher":"Springer Nature","department":[{"_id":"SiHi"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9808","year":"2018","abstract":[{"lang":"eng","text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb)."}],"type":"research_data_reference","doi":"10.6084/m9.figshare.7295369.v1","date_published":"2018-11-03T00:00:00Z","oa":1,"citation":{"short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","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.","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.","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","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","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.","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."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295369.v1"}],"month":"11","day":"03","article_processing_charge":"No"},{"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"}],"_id":"193","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"On the memory hardness of data independent password hashing functions","oa_version":"Submitted Version","scopus_import":"1","article_processing_charge":"No","day":"01","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","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.","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.","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","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.","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."},"publication":"Proceedings of the 2018 on Asia Conference on Computer and Communication Security","page":"51 - 65","date_published":"2018-06-01T00:00:00Z","publist_id":"7723","ec_funded":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.","year":"2018","department":[{"_id":"KrPi"},{"_id":"HeEd"},{"_id":"VlKo"}],"publisher":"ACM","publication_status":"published","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8882-5116","first_name":"Georg F","last_name":"Osang","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"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"},{"first_name":"Michal","last_name":"Rybar","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","full_name":"Rybar, Michal"}],"date_updated":"2023-09-13T09:13:12Z","date_created":"2018-12-11T11:45:07Z","month":"06","external_id":{"isi":["000516620100005"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/783"}],"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"isi":1,"quality_controlled":"1","doi":"10.1145/3196494.3196534","conference":{"name":"ASIACCS: Asia Conference on Computer and Communications Security ","location":"Incheon, Republic of Korea","start_date":"2018-06-04","end_date":"2018-06-08"},"language":[{"iso":"eng"}]}]