[{"oa":1,"external_id":{"pmid":["30910826"],"isi":["000464583200006"]},"date_updated":"2023-09-07T14:47:00Z","intvolume":"       146","status":"public","issue":"7","publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"title":"Transient localization of the Arp2/3 complex initiates neuronal dendrite branching in vivo","day":"04","article_number":"dev171397","doi":"10.1242/dev.171397","isi":1,"year":"2019","department":[{"_id":"MiSi"}],"oa_version":"Published Version","article_type":"original","date_published":"2019-04-04T00:00:00Z","publication_status":"published","citation":{"apa":"Stürner, T., Tatarnikova, A., Müller, J., Schaffran, B., Cuntz, H., Zhang, Y., … Tavosanis, G. (2019). Transient localization of the Arp2/3 complex initiates neuronal dendrite branching in vivo. <i>Development</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/dev.171397\">https://doi.org/10.1242/dev.171397</a>","ama":"Stürner T, Tatarnikova A, Müller J, et al. Transient localization of the Arp2/3 complex initiates neuronal dendrite branching in vivo. <i>Development</i>. 2019;146(7). doi:<a href=\"https://doi.org/10.1242/dev.171397\">10.1242/dev.171397</a>","chicago":"Stürner, Tomke, Anastasia Tatarnikova, Jan Müller, Barbara Schaffran, Hermann Cuntz, Yun Zhang, Maria Nemethova, Sven Bogdan, Vic Small, and Gaia Tavosanis. “Transient Localization of the Arp2/3 Complex Initiates Neuronal Dendrite Branching in Vivo.” <i>Development</i>. The Company of Biologists, 2019. <a href=\"https://doi.org/10.1242/dev.171397\">https://doi.org/10.1242/dev.171397</a>.","ieee":"T. Stürner <i>et al.</i>, “Transient localization of the Arp2/3 complex initiates neuronal dendrite branching in vivo,” <i>Development</i>, vol. 146, no. 7. The Company of Biologists, 2019.","short":"T. Stürner, A. Tatarnikova, J. Müller, B. Schaffran, H. Cuntz, Y. Zhang, M. Nemethova, S. Bogdan, V. Small, G. Tavosanis, Development 146 (2019).","mla":"Stürner, Tomke, et al. “Transient Localization of the Arp2/3 Complex Initiates Neuronal Dendrite Branching in Vivo.” <i>Development</i>, vol. 146, no. 7, dev171397, The Company of Biologists, 2019, doi:<a href=\"https://doi.org/10.1242/dev.171397\">10.1242/dev.171397</a>.","ista":"Stürner T, Tatarnikova A, Müller J, Schaffran B, Cuntz H, Zhang Y, Nemethova M, Bogdan S, Small V, Tavosanis G. 2019. Transient localization of the Arp2/3 complex initiates neuronal dendrite branching in vivo. Development. 146(7), dev171397."},"quality_controlled":"1","type":"journal_article","author":[{"last_name":"Stürner","first_name":"Tomke","full_name":"Stürner, Tomke"},{"first_name":"Anastasia","full_name":"Tatarnikova, Anastasia","last_name":"Tatarnikova"},{"id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","last_name":"Müller","first_name":"Jan","full_name":"Müller, Jan"},{"first_name":"Barbara","full_name":"Schaffran, Barbara","last_name":"Schaffran"},{"first_name":"Hermann","full_name":"Cuntz, Hermann","last_name":"Cuntz"},{"full_name":"Zhang, Yun","first_name":"Yun","last_name":"Zhang"},{"last_name":"Nemethova","first_name":"Maria","full_name":"Nemethova, Maria","id":"34E27F1C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bogdan, Sven","first_name":"Sven","last_name":"Bogdan"},{"last_name":"Small","full_name":"Small, Vic","first_name":"Vic"},{"last_name":"Tavosanis","full_name":"Tavosanis, Gaia","first_name":"Gaia"}],"month":"04","language":[{"iso":"eng"}],"publication":"Development","article_processing_charge":"No","scopus_import":"1","volume":146,"date_created":"2020-01-29T16:27:10Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"url":"https://doi.org/10.1242/dev.171397","open_access":"1"}],"publisher":"The Company of Biologists","abstract":[{"lang":"eng","text":"The formation of neuronal dendrite branches is fundamental for the wiring and function of the nervous system. Indeed, dendrite branching enhances the coverage of the neuron's receptive field and modulates the initial processing of incoming stimuli. Complex dendrite patterns are achieved in vivo through a dynamic process of de novo branch formation, branch extension and retraction. The first step towards branch formation is the generation of a dynamic filopodium-like branchlet. The mechanisms underlying the initiation of dendrite branchlets are therefore crucial to the shaping of dendrites. Through in vivo time-lapse imaging of the subcellular localization of actin during the process of branching of Drosophila larva sensory neurons, combined with genetic analysis and electron tomography, we have identified the Actin-related protein (Arp) 2/3 complex as the major actin nucleator involved in the initiation of dendrite branchlet formation, under the control of the activator WAVE and of the small GTPase Rac1. Transient recruitment of an Arp2/3 component marks the site of branchlet initiation in vivo. These data position the activation of Arp2/3 as an early hub for the initiation of branchlet formation."}],"pmid":1,"_id":"7404"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"eLife Sciences Publications","pmid":1,"_id":"7405","abstract":[{"lang":"eng","text":"Biophysical modeling of neuronal networks helps to integrate and interpret rapidly growing and disparate experimental datasets at multiple scales. The NetPyNE tool (www.netpyne.org) provides both programmatic and graphical interfaces to develop data-driven multiscale network models in NEURON. NetPyNE clearly separates model parameters from implementation code. Users provide specifications at a high level via a standardized declarative language, for example connectivity rules, to create millions of cell-to-cell connections. NetPyNE then enables users to generate the NEURON network, run efficiently parallelized simulations, optimize and explore network parameters through automated batch runs, and use built-in functions for visualization and analysis – connectivity matrices, voltage traces, spike raster plots, local field potentials, and information theoretic measures. NetPyNE also facilitates model sharing by exporting and importing standardized formats (NeuroML and SONATA). NetPyNE is already being used to teach computational neuroscience students and by modelers to investigate brain regions and phenomena."}],"publication":"eLife","article_processing_charge":"No","scopus_import":"1","type":"journal_article","month":"05","author":[{"first_name":"Salvador","full_name":"Dura-Bernal, Salvador","last_name":"Dura-Bernal"},{"orcid":"0000-0002-9885-6936","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","last_name":"Suter","full_name":"Suter, Benjamin","first_name":"Benjamin"},{"last_name":"Gleeson","full_name":"Gleeson, Padraig","first_name":"Padraig"},{"full_name":"Cantarelli, Matteo","first_name":"Matteo","last_name":"Cantarelli"},{"last_name":"Quintana","first_name":"Adrian","full_name":"Quintana, Adrian"},{"last_name":"Rodriguez","first_name":"Facundo","full_name":"Rodriguez, Facundo"},{"last_name":"Kedziora","first_name":"David J","full_name":"Kedziora, David J"},{"full_name":"Chadderdon, George L","first_name":"George L","last_name":"Chadderdon"},{"full_name":"Kerr, Cliff C","first_name":"Cliff C","last_name":"Kerr"},{"first_name":"Samuel A","full_name":"Neymotin, Samuel A","last_name":"Neymotin"},{"first_name":"Robert A","full_name":"McDougal, Robert A","last_name":"McDougal"},{"last_name":"Hines","full_name":"Hines, Michael","first_name":"Michael"},{"first_name":"Gordon MG","full_name":"Shepherd, Gordon MG","last_name":"Shepherd"},{"last_name":"Lytton","first_name":"William W","full_name":"Lytton, William W"}],"language":[{"iso":"eng"}],"date_created":"2020-01-30T09:08:01Z","file_date_updated":"2020-07-14T12:47:57Z","ddc":["570"],"volume":8,"article_type":"original","date_published":"2019-05-31T00:00:00Z","department":[{"_id":"PeJo"}],"file":[{"relation":"main_file","access_level":"open_access","checksum":"7014189c11c10a12feeeae37f054871d","file_size":6182359,"file_name":"2019_eLife_DuraBernal.pdf","date_updated":"2020-07-14T12:47:57Z","creator":"dernst","date_created":"2020-02-04T08:41:47Z","file_id":"7444","content_type":"application/pdf"}],"oa_version":"Published Version","quality_controlled":"1","publication_status":"published","citation":{"chicago":"Dura-Bernal, Salvador, Benjamin Suter, Padraig Gleeson, Matteo Cantarelli, Adrian Quintana, Facundo Rodriguez, David J Kedziora, et al. “NetPyNE, a Tool for Data-Driven Multiscale Modeling of Brain Circuits.” <i>ELife</i>. eLife Sciences Publications, 2019. <a href=\"https://doi.org/10.7554/elife.44494\">https://doi.org/10.7554/elife.44494</a>.","ama":"Dura-Bernal S, Suter B, Gleeson P, et al. NetPyNE, a tool for data-driven multiscale modeling of brain circuits. <i>eLife</i>. 2019;8. doi:<a href=\"https://doi.org/10.7554/elife.44494\">10.7554/elife.44494</a>","apa":"Dura-Bernal, S., Suter, B., Gleeson, P., Cantarelli, M., Quintana, A., Rodriguez, F., … Lytton, W. W. (2019). NetPyNE, a tool for data-driven multiscale modeling of brain circuits. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.44494\">https://doi.org/10.7554/elife.44494</a>","ista":"Dura-Bernal S, Suter B, Gleeson P, Cantarelli M, Quintana A, Rodriguez F, Kedziora DJ, Chadderdon GL, Kerr CC, Neymotin SA, McDougal RA, Hines M, Shepherd GM, Lytton WW. 2019. NetPyNE, a tool for data-driven multiscale modeling of brain circuits. eLife. 8, e44494.","mla":"Dura-Bernal, Salvador, et al. “NetPyNE, a Tool for Data-Driven Multiscale Modeling of Brain Circuits.” <i>ELife</i>, vol. 8, e44494, eLife Sciences Publications, 2019, doi:<a href=\"https://doi.org/10.7554/elife.44494\">10.7554/elife.44494</a>.","short":"S. Dura-Bernal, B. Suter, P. Gleeson, M. Cantarelli, A. Quintana, F. Rodriguez, D.J. Kedziora, G.L. Chadderdon, C.C. Kerr, S.A. Neymotin, R.A. McDougal, M. Hines, G.M. Shepherd, W.W. Lytton, ELife 8 (2019).","ieee":"S. Dura-Bernal <i>et al.</i>, “NetPyNE, a tool for data-driven multiscale modeling of brain circuits,” <i>eLife</i>, vol. 8. eLife Sciences Publications, 2019."},"date_updated":"2023-09-07T14:27:52Z","intvolume":"         8","status":"public","oa":1,"external_id":{"pmid":["31025934"],"isi":["000468968400001"]},"year":"2019","title":"NetPyNE, a tool for data-driven multiscale modeling of brain circuits","publication_identifier":{"issn":["2050-084X"]},"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_number":"e44494","day":"31","doi":"10.7554/elife.44494","isi":1},{"quality_controlled":"1","citation":{"ista":"Mckenzie C, Spanova M, Johnson AJ, Kainrath S, Zheden V, Sitte HH, Janovjak HL. 2019. Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. 312, 114–121.","ieee":"C. Mckenzie <i>et al.</i>, “Isolation of synaptic vesicles from genetically engineered cultured neurons,” <i>Journal of Neuroscience Methods</i>, vol. 312. Elsevier, pp. 114–121, 2019.","mla":"Mckenzie, Catherine, et al. “Isolation of Synaptic Vesicles from Genetically Engineered Cultured Neurons.” <i>Journal of Neuroscience Methods</i>, vol. 312, Elsevier, 2019, pp. 114–21, doi:<a href=\"https://doi.org/10.1016/j.jneumeth.2018.11.018\">10.1016/j.jneumeth.2018.11.018</a>.","short":"C. Mckenzie, M. Spanova, A.J. Johnson, S. Kainrath, V. Zheden, H.H. Sitte, H.L. Janovjak, Journal of Neuroscience Methods 312 (2019) 114–121.","chicago":"Mckenzie, Catherine, Miroslava Spanova, Alexander J Johnson, Stephanie Kainrath, Vanessa Zheden, Harald H. Sitte, and Harald L Janovjak. “Isolation of Synaptic Vesicles from Genetically Engineered Cultured Neurons.” <i>Journal of Neuroscience Methods</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.jneumeth.2018.11.018\">https://doi.org/10.1016/j.jneumeth.2018.11.018</a>.","ama":"Mckenzie C, Spanova M, Johnson AJ, et al. Isolation of synaptic vesicles from genetically engineered cultured neurons. <i>Journal of Neuroscience Methods</i>. 2019;312:114-121. doi:<a href=\"https://doi.org/10.1016/j.jneumeth.2018.11.018\">10.1016/j.jneumeth.2018.11.018</a>","apa":"Mckenzie, C., Spanova, M., Johnson, A. J., Kainrath, S., Zheden, V., Sitte, H. H., &#38; Janovjak, H. L. (2019). Isolation of synaptic vesicles from genetically engineered cultured neurons. <i>Journal of Neuroscience Methods</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jneumeth.2018.11.018\">https://doi.org/10.1016/j.jneumeth.2018.11.018</a>"},"publication_status":"published","date_published":"2019-01-15T00:00:00Z","article_type":"original","department":[{"_id":"HaJa"},{"_id":"Bio"}],"oa_version":"None","year":"2019","publication_identifier":{"issn":["0165-0270"]},"title":"Isolation of synaptic vesicles from genetically engineered cultured neurons","isi":1,"doi":"10.1016/j.jneumeth.2018.11.018","day":"15","date_updated":"2023-09-06T15:27:29Z","status":"public","intvolume":"       312","external_id":{"pmid":["30496761"],"isi":["000456220900013"]},"pmid":1,"_id":"7406","abstract":[{"lang":"eng","text":"Background\r\nSynaptic vesicles (SVs) are an integral part of the neurotransmission machinery, and isolation of SVs from their host neuron is necessary to reveal their most fundamental biochemical and functional properties in in vitro assays. Isolated SVs from neurons that have been genetically engineered, e.g. to introduce genetically encoded indicators, are not readily available but would permit new insights into SV structure and function. Furthermore, it is unclear if cultured neurons can provide sufficient starting material for SV isolation procedures.\r\n\r\nNew method\r\nHere, we demonstrate an efficient ex vivo procedure to obtain functional SVs from cultured rat cortical neurons after genetic engineering with a lentivirus.\r\n\r\nResults\r\nWe show that ∼108 plated cortical neurons allow isolation of suitable SV amounts for functional analysis and imaging. We found that SVs isolated from cultured neurons have neurotransmitter uptake comparable to that of SVs isolated from intact cortex. Using total internal reflection fluorescence (TIRF) microscopy, we visualized an exogenous SV-targeted marker protein and demonstrated the high efficiency of SV modification.\r\n\r\nComparison with existing methods\r\nObtaining SVs from genetically engineered neurons currently generally requires the availability of transgenic animals, which is constrained by technical (e.g. cost and time) and biological (e.g. developmental defects and lethality) limitations.\r\n\r\nConclusions\r\nThese results demonstrate the modification and isolation of functional SVs using cultured neurons and viral transduction. The ability to readily obtain SVs from genetically engineered neurons will permit linking in situ studies to in vitro experiments in a variety of genetic contexts."}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"}],"ec_funded":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Elsevier","project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","call_identifier":"FP7"},{"_id":"26538374-B435-11E9-9278-68D0E5697425","name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","call_identifier":"FWF"},{"_id":"2548AE96-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","grant_number":"W1232-B24","call_identifier":"FWF"}],"page":"114-121","date_created":"2020-01-30T09:12:19Z","volume":312,"article_processing_charge":"No","publication":"Journal of Neuroscience Methods","scopus_import":"1","author":[{"id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","full_name":"Mckenzie, Catherine","first_name":"Catherine","last_name":"Mckenzie"},{"id":"44A924DC-F248-11E8-B48F-1D18A9856A87","first_name":"Miroslava","full_name":"Spanova, Miroslava","last_name":"Spanova"},{"id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2739-8843","last_name":"Johnson","full_name":"Johnson, Alexander J","first_name":"Alexander J"},{"first_name":"Stephanie","full_name":"Kainrath, Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9438-4783","id":"39C5A68A-F248-11E8-B48F-1D18A9856A87","first_name":"Vanessa","full_name":"Zheden, Vanessa","last_name":"Zheden"},{"first_name":"Harald H.","full_name":"Sitte, Harald H.","last_name":"Sitte"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","last_name":"Janovjak","first_name":"Harald L","full_name":"Janovjak, Harald L"}],"month":"01","language":[{"iso":"eng"}],"type":"journal_article"},{"type":"conference","author":[{"id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","first_name":"Hamza M","last_name":"Abusalah"},{"full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen","last_name":"Klein"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"last_name":"Walter","full_name":"Walter, Michael","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482"}],"conference":{"end_date":"2019-05-23","start_date":"2019-05-19","name":"International Conference on the Theory and Applications of Cryptographic Techniques","location":"Darmstadt, Germany"},"language":[{"iso":"eng"}],"month":"04","scopus_import":"1","publication":"Advances in Cryptology – EUROCRYPT 2019","article_processing_charge":"No","volume":11477,"date_created":"2020-01-30T09:26:14Z","page":"277-291","main_file_link":[{"url":"https://eprint.iacr.org/2019/252","open_access":"1"}],"project":[{"grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks"}],"publisher":"Springer International Publishing","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"abstract":[{"text":"Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving a statement χ and a time parameter T computes a proof ϕ(χ,T) which is efficiently and publicly verifiable. The proof can be computed in T sequential steps, but not much less, even by a malicious party having large parallelism. A PoSW thus serves as a proof that T units of time have passed since χ\r\n\r\nwas received.\r\n\r\nPoSW were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical construction was only recently proposed by Cohen and Pietrzak [CP18].\r\n\r\nIn this work we construct a new simple PoSW in the random permutation model which is almost as simple and efficient as [CP18] but conceptually very different. Whereas the structure underlying [CP18] is a hash tree, our construction is based on skip lists and has the interesting property that computing the PoSW is a reversible computation.\r\nThe fact that the construction is reversible can potentially be used for new applications like constructing proofs of replication. We also show how to “embed” the sloth function of Lenstra and Weselowski [LW17] into our PoSW to get a PoSW where one additionally can verify correctness of the output much more efficiently than recomputing it (though recent constructions of “verifiable delay functions” subsume most of the applications this construction was aiming at).","lang":"eng"}],"alternative_title":["LNCS"],"_id":"7411","external_id":{"isi":["000483516200010"]},"oa":1,"intvolume":"     11477","status":"public","date_updated":"2023-09-06T15:26:06Z","day":"24","doi":"10.1007/978-3-030-17656-3_10","isi":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030176556","9783030176563"],"eissn":["1611-3349"]},"title":"Reversible proofs of sequential work","year":"2019","oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"date_published":"2019-04-24T00:00:00Z","citation":{"chicago":"Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.” In <i>Advances in Cryptology – EUROCRYPT 2019</i>, 11477:277–91. Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">https://doi.org/10.1007/978-3-030-17656-3_10</a>.","apa":"Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Walter, M. (2019). Reversible proofs of sequential work. In <i>Advances in Cryptology – EUROCRYPT 2019</i> (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">https://doi.org/10.1007/978-3-030-17656-3_10</a>","ama":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: <i>Advances in Cryptology – EUROCRYPT 2019</i>. Vol 11477. Springer International Publishing; 2019:277-291. doi:<a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">10.1007/978-3-030-17656-3_10</a>","ista":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477, 277–291.","ieee":"H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in <i>Advances in Cryptology – EUROCRYPT 2019</i>, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.","mla":"Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” <i>Advances in Cryptology – EUROCRYPT 2019</i>, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:<a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">10.1007/978-3-030-17656-3_10</a>.","short":"H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291."},"publication_status":"published","quality_controlled":"1"},{"oa_version":"Preprint","department":[{"_id":"VlKo"}],"article_type":"original","date_published":"2019-10-31T00:00:00Z","publication_status":"published","citation":{"ama":"Achlioptas D, Iliopoulos F, Kolmogorov V. A local lemma for focused stochastical algorithms. <i>SIAM Journal on Computing</i>. 2019;48(5):1583-1602. doi:<a href=\"https://doi.org/10.1137/16m109332x\">10.1137/16m109332x</a>","apa":"Achlioptas, D., Iliopoulos, F., &#38; Kolmogorov, V. (2019). A local lemma for focused stochastical algorithms. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/16m109332x\">https://doi.org/10.1137/16m109332x</a>","chicago":"Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local Lemma for Focused Stochastical Algorithms.” <i>SIAM Journal on Computing</i>. SIAM, 2019. <a href=\"https://doi.org/10.1137/16m109332x\">https://doi.org/10.1137/16m109332x</a>.","short":"D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.","mla":"Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.” <i>SIAM Journal on Computing</i>, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:<a href=\"https://doi.org/10.1137/16m109332x\">10.1137/16m109332x</a>.","ieee":"D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused stochastical algorithms,” <i>SIAM Journal on Computing</i>, vol. 48, no. 5. SIAM, pp. 1583–1602, 2019.","ista":"Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602."},"quality_controlled":"1","arxiv":1,"external_id":{"arxiv":["1809.01537"],"isi":["000493900200005"]},"oa":1,"intvolume":"        48","status":"public","date_updated":"2023-09-06T15:25:29Z","day":"31","doi":"10.1137/16m109332x","isi":1,"title":"A local lemma for focused stochastical algorithms","issue":"5","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"year":"2019","main_file_link":[{"url":"https://arxiv.org/abs/1809.01537","open_access":"1"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7"}],"publisher":"SIAM","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"abstract":[{"lang":"eng","text":"We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These algorithms search a state space by repeatedly selecting some constraint that is violated in the current state and moving to a random nearby state that addresses the violation, while (we hope) not introducing many new violations. An important class of focused local search algorithms with provable performance guarantees has recently arisen from algorithmizations of the Lovász local lemma (LLL), a nonconstructive tool for proving the existence of satisfying states by introducing a background measure on the state space. While powerful, the state transitions of algorithms in this class must be, in a precise sense, perfectly compatible with the background measure. In many applications this is a very restrictive requirement, and one needs to step outside the class. Here we introduce the notion of measure distortion and develop a framework for analyzing arbitrary focused stochastic local search algorithms, recovering LLL algorithmizations as the special case of no distortion. Our framework takes as input an arbitrary algorithm of such type and an arbitrary probability measure and shows how to use the measure as a yardstick of algorithmic progress, even for algorithms designed independently of the measure."}],"_id":"7412","type":"journal_article","language":[{"iso":"eng"}],"month":"10","author":[{"first_name":"Dimitris","full_name":"Achlioptas, Dimitris","last_name":"Achlioptas"},{"last_name":"Iliopoulos","full_name":"Iliopoulos, Fotis","first_name":"Fotis"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"}],"scopus_import":"1","publication":"SIAM Journal on Computing","article_processing_charge":"No","volume":48,"date_created":"2020-01-30T09:27:32Z","page":"1583-1602"},{"date_updated":"2023-09-06T15:24:31Z","intvolume":"       222","status":"public","oa":1,"external_id":{"isi":["000495865300001"],"arxiv":["1801.01389"]},"year":"2019","issue":"2","title":"Bogoliubov theory in the Gross–Pitaevskii limit","publication_identifier":{"issn":["0001-5962"],"eissn":["1871-2509"]},"doi":"10.4310/acta.2019.v222.n2.a1","day":"07","isi":1,"article_type":"original","date_published":"2019-06-07T00:00:00Z","department":[{"_id":"RoSe"}],"oa_version":"Preprint","quality_controlled":"1","arxiv":1,"citation":{"chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Bogoliubov Theory in the Gross–Pitaevskii Limit.” <i>Acta Mathematica</i>. International Press of Boston, 2019. <a href=\"https://doi.org/10.4310/acta.2019.v222.n2.a1\">https://doi.org/10.4310/acta.2019.v222.n2.a1</a>.","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Bogoliubov theory in the Gross–Pitaevskii limit. <i>Acta Mathematica</i>. 2019;222(2):219-335. doi:<a href=\"https://doi.org/10.4310/acta.2019.v222.n2.a1\">10.4310/acta.2019.v222.n2.a1</a>","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., &#38; Schlein, B. (2019). Bogoliubov theory in the Gross–Pitaevskii limit. <i>Acta Mathematica</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/acta.2019.v222.n2.a1\">https://doi.org/10.4310/acta.2019.v222.n2.a1</a>","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2019. Bogoliubov theory in the Gross–Pitaevskii limit. Acta Mathematica. 222(2), 219–335.","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Acta Mathematica 222 (2019) 219–335.","mla":"Boccato, Chiara, et al. “Bogoliubov Theory in the Gross–Pitaevskii Limit.” <i>Acta Mathematica</i>, vol. 222, no. 2, International Press of Boston, 2019, pp. 219–335, doi:<a href=\"https://doi.org/10.4310/acta.2019.v222.n2.a1\">10.4310/acta.2019.v222.n2.a1</a>.","ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Bogoliubov theory in the Gross–Pitaevskii limit,” <i>Acta Mathematica</i>, vol. 222, no. 2. International Press of Boston, pp. 219–335, 2019."},"publication_status":"published","publication":"Acta Mathematica","article_processing_charge":"No","scopus_import":"1","type":"journal_article","month":"06","language":[{"iso":"eng"}],"author":[{"id":"342E7E22-F248-11E8-B48F-1D18A9856A87","last_name":"Boccato","first_name":"Chiara","full_name":"Boccato, Chiara"},{"last_name":"Brennecke","first_name":"Christian","full_name":"Brennecke, Christian"},{"last_name":"Cenatiempo","first_name":"Serena","full_name":"Cenatiempo, Serena"},{"last_name":"Schlein","full_name":"Schlein, Benjamin","first_name":"Benjamin"}],"page":"219-335","date_created":"2020-01-30T09:30:41Z","volume":222,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"url":"https://arxiv.org/abs/1801.01389","open_access":"1"}],"publisher":"International Press of Boston","_id":"7413","abstract":[{"lang":"eng","text":"We consider Bose gases consisting of N particles trapped in a box with volume one and interacting through a repulsive potential with scattering length of order N−1 (Gross–Pitaevskii regime). We determine the ground state energy and the low-energy excitation spectrum, up to errors vanishing as N→∞. Our results confirm Bogoliubov’s predictions."}]},{"year":"2019","date_created":"2020-01-30T10:06:15Z","page":"S11","isi":1,"doi":"10.1016/j.euroneuro.2019.09.039","day":"13","volume":29,"title":"S.16.03 A homozygous missense mutation in SLC7A5 leads to autism spectrum disorder and microcephaly","issue":"Supplement 6","publication_identifier":{"issn":["0924-977X"]},"status":"public","intvolume":"        29","article_processing_charge":"No","publication":"European Neuropsychopharmacology","date_updated":"2023-09-07T14:55:23Z","external_id":{"isi":["000502657500020"]},"language":[{"iso":"eng"}],"month":"12","author":[{"full_name":"Knaus, Lisa","first_name":"Lisa","last_name":"Knaus","id":"3B2ABCF4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dora-Clara","full_name":"Tarlungeanu, Dora-Clara","last_name":"Tarlungeanu","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","last_name":"Novarino","full_name":"Novarino, Gaia","first_name":"Gaia"}],"type":"journal_article","_id":"7414","quality_controlled":"1","citation":{"short":"L. Knaus, D.-C. Tarlungeanu, G. Novarino, European Neuropsychopharmacology 29 (2019) S11.","mla":"Knaus, Lisa, et al. “S.16.03 A Homozygous Missense Mutation in SLC7A5 Leads to Autism Spectrum Disorder and Microcephaly.” <i>European Neuropsychopharmacology</i>, vol. 29, no. Supplement 6, Elsevier, 2019, p. S11, doi:<a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.039\">10.1016/j.euroneuro.2019.09.039</a>.","ieee":"L. Knaus, D.-C. Tarlungeanu, and G. Novarino, “S.16.03 A homozygous missense mutation in SLC7A5 leads to autism spectrum disorder and microcephaly,” <i>European Neuropsychopharmacology</i>, vol. 29, no. Supplement 6. Elsevier, p. S11, 2019.","ista":"Knaus L, Tarlungeanu D-C, Novarino G. 2019. S.16.03 A homozygous missense mutation in SLC7A5 leads to autism spectrum disorder and microcephaly. European Neuropsychopharmacology. 29(Supplement 6), S11.","apa":"Knaus, L., Tarlungeanu, D.-C., &#38; Novarino, G. (2019). S.16.03 A homozygous missense mutation in SLC7A5 leads to autism spectrum disorder and microcephaly. <i>European Neuropsychopharmacology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.039\">https://doi.org/10.1016/j.euroneuro.2019.09.039</a>","ama":"Knaus L, Tarlungeanu D-C, Novarino G. S.16.03 A homozygous missense mutation in SLC7A5 leads to autism spectrum disorder and microcephaly. <i>European Neuropsychopharmacology</i>. 2019;29(Supplement 6):S11. doi:<a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.039\">10.1016/j.euroneuro.2019.09.039</a>","chicago":"Knaus, Lisa, Dora-Clara Tarlungeanu, and Gaia Novarino. “S.16.03 A Homozygous Missense Mutation in SLC7A5 Leads to Autism Spectrum Disorder and Microcephaly.” <i>European Neuropsychopharmacology</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.039\">https://doi.org/10.1016/j.euroneuro.2019.09.039</a>."},"publication_status":"published","date_published":"2019-12-13T00:00:00Z","article_type":"original","oa_version":"None","publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"GaNo"}]},{"page":"S11-S12","year":"2019","date_created":"2020-01-30T10:07:41Z","volume":29,"title":"S.16.05 Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development and autism","issue":"Supplement 6","publication_identifier":{"issn":["0924-977X"]},"isi":1,"doi":"10.1016/j.euroneuro.2019.09.040","day":"13","article_processing_charge":"No","date_updated":"2023-09-07T14:56:17Z","publication":"European Neuropsychopharmacology","status":"public","intvolume":"        29","author":[{"id":"4739D480-F248-11E8-B48F-1D18A9856A87","first_name":"Jasmin","full_name":"Morandell, Jasmin","last_name":"Morandell"},{"first_name":"Armel","full_name":"Nicolas, Armel","last_name":"Nicolas","id":"2A103192-F248-11E8-B48F-1D18A9856A87"},{"id":"29A8453C-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Lena A","first_name":"Lena A","last_name":"Schwarz"},{"full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"month":"12","type":"journal_article","external_id":{"isi":["000502657500021"]},"quality_controlled":"1","_id":"7415","citation":{"chicago":"Morandell, Jasmin, Armel Nicolas, Lena A Schwarz, and Gaia Novarino. “S.16.05 Illuminating the Role of the E3 Ubiquitin Ligase Cullin3 in Brain Development and Autism.” <i>European Neuropsychopharmacology</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.040\">https://doi.org/10.1016/j.euroneuro.2019.09.040</a>.","ama":"Morandell J, Nicolas A, Schwarz LA, Novarino G. S.16.05 Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development and autism. <i>European Neuropsychopharmacology</i>. 2019;29(Supplement 6):S11-S12. doi:<a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.040\">10.1016/j.euroneuro.2019.09.040</a>","apa":"Morandell, J., Nicolas, A., Schwarz, L. A., &#38; Novarino, G. (2019). S.16.05 Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development and autism. <i>European Neuropsychopharmacology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.040\">https://doi.org/10.1016/j.euroneuro.2019.09.040</a>","ista":"Morandell J, Nicolas A, Schwarz LA, Novarino G. 2019. S.16.05 Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development and autism. European Neuropsychopharmacology. 29(Supplement 6), S11–S12.","ieee":"J. Morandell, A. Nicolas, L. A. Schwarz, and G. Novarino, “S.16.05 Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development and autism,” <i>European Neuropsychopharmacology</i>, vol. 29, no. Supplement 6. Elsevier, pp. S11–S12, 2019.","short":"J. Morandell, A. Nicolas, L.A. Schwarz, G. Novarino, European Neuropsychopharmacology 29 (2019) S11–S12.","mla":"Morandell, Jasmin, et al. “S.16.05 Illuminating the Role of the E3 Ubiquitin Ligase Cullin3 in Brain Development and Autism.” <i>European Neuropsychopharmacology</i>, vol. 29, no. Supplement 6, Elsevier, 2019, pp. S11–12, doi:<a href=\"https://doi.org/10.1016/j.euroneuro.2019.09.040\">10.1016/j.euroneuro.2019.09.040</a>."},"publication_status":"published","date_published":"2019-12-13T00:00:00Z","article_type":"original","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"GaNo"},{"_id":"LifeSc"}],"oa_version":"None","publisher":"Elsevier"},{"date_updated":"2023-09-06T15:22:23Z","intvolume":"        38","status":"public","external_id":{"isi":["000498397300001"]},"year":"2019","title":"MIS compensation: Optimizing sampling techniques in multiple importance sampling","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"issue":"6","article_number":"151","doi":"10.1145/3355089.3356565","day":"01","isi":1,"article_type":"original","date_published":"2019-11-01T00:00:00Z","department":[{"_id":"ChWo"}],"oa_version":"None","quality_controlled":"1","publication_status":"published","citation":{"apa":"Karlík, O., Šik, M., Vévoda, P., Skrivan, T., &#38; Křivánek, J. (2019). MIS compensation: Optimizing sampling techniques in multiple importance sampling. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3355089.3356565\">https://doi.org/10.1145/3355089.3356565</a>","ama":"Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. MIS compensation: Optimizing sampling techniques in multiple importance sampling. <i>ACM Transactions on Graphics</i>. 2019;38(6). doi:<a href=\"https://doi.org/10.1145/3355089.3356565\">10.1145/3355089.3356565</a>","chicago":"Karlík, Ondřej, Martin Šik, Petr Vévoda, Tomas Skrivan, and Jaroslav Křivánek. “MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.” <i>ACM Transactions on Graphics</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3355089.3356565\">https://doi.org/10.1145/3355089.3356565</a>.","mla":"Karlík, Ondřej, et al. “MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.” <i>ACM Transactions on Graphics</i>, vol. 38, no. 6, 151, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3355089.3356565\">10.1145/3355089.3356565</a>.","short":"O. Karlík, M. Šik, P. Vévoda, T. Skrivan, J. Křivánek, ACM Transactions on Graphics 38 (2019).","ieee":"O. Karlík, M. Šik, P. Vévoda, T. Skrivan, and J. Křivánek, “MIS compensation: Optimizing sampling techniques in multiple importance sampling,” <i>ACM Transactions on Graphics</i>, vol. 38, no. 6. ACM, 2019.","ista":"Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. 2019. MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. 38(6), 151."},"publication":"ACM Transactions on Graphics","article_processing_charge":"No","scopus_import":"1","type":"journal_article","month":"11","language":[{"iso":"eng"}],"author":[{"full_name":"Karlík, Ondřej","first_name":"Ondřej","last_name":"Karlík"},{"last_name":"Šik","full_name":"Šik, Martin","first_name":"Martin"},{"full_name":"Vévoda, Petr","first_name":"Petr","last_name":"Vévoda"},{"id":"486A5A46-F248-11E8-B48F-1D18A9856A87","last_name":"Skrivan","full_name":"Skrivan, Tomas","first_name":"Tomas"},{"first_name":"Jaroslav","full_name":"Křivánek, Jaroslav","last_name":"Křivánek"}],"date_created":"2020-01-30T10:19:43Z","volume":38,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"ACM","_id":"7418","abstract":[{"lang":"eng","text":"Multiple importance sampling (MIS) has become an indispensable tool in Monte Carlo rendering, widely accepted as a near-optimal solution for combining different sampling techniques. But an MIS combination, using the common balance or power heuristics, often results in an overly defensive estimator, leading to high variance. We show that by generalizing the MIS framework, variance can be substantially reduced. Specifically, we optimize one of the combined sampling techniques so as to decrease the overall variance of the resulting MIS estimator. We apply the approach to the computation of direct illumination due to an HDR environment map and to the computation of global illumination using a path guiding algorithm. The implementation can be as simple as subtracting a constant value from the tabulated sampling density done entirely in a preprocessing step. This produces a consistent noise reduction in all our tests with no negative influence on run time, no artifacts or bias, and no failure cases."}]},{"type":"journal_article","author":[{"full_name":"Sahgal, Pranshu","first_name":"Pranshu","last_name":"Sahgal"},{"id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7698-3061","last_name":"Alanko","first_name":"Jonna H","full_name":"Alanko, Jonna H"},{"last_name":"Icha","first_name":"Jaroslav","full_name":"Icha, Jaroslav"},{"full_name":"Paatero, Ilkka","first_name":"Ilkka","last_name":"Paatero"},{"full_name":"Hamidi, Hellyeh","first_name":"Hellyeh","last_name":"Hamidi"},{"full_name":"Arjonen, Antti","first_name":"Antti","last_name":"Arjonen"},{"first_name":"Mika","full_name":"Pietilä, Mika","last_name":"Pietilä"},{"full_name":"Rokka, Anne","first_name":"Anne","last_name":"Rokka"},{"last_name":"Ivaska","full_name":"Ivaska, Johanna","first_name":"Johanna"}],"language":[{"iso":"eng"}],"month":"06","publication":"Journal of Cell Science","article_processing_charge":"No","volume":132,"date_created":"2020-01-30T10:31:42Z","main_file_link":[{"url":"https://doi.org/10.1242/jcs.233387","open_access":"1"}],"publisher":"The Company of Biologists","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"β1-integrins mediate cell–matrix interactions and their trafficking is important in the dynamic regulation of cell adhesion, migration and malignant processes, including cancer cell invasion. Here, we employ an RNAi screen to characterize regulators of integrin traffic and identify the association of Golgi-localized gamma ear-containing Arf-binding protein 2 (GGA2) with β1-integrin, and its role in recycling of active but not inactive β1-integrin receptors. Silencing of GGA2 limits active β1-integrin levels in focal adhesions and decreases cancer cell migration and invasion, which is in agreement with its ability to regulate the dynamics of active integrins. By using the proximity-dependent biotin identification (BioID) method, we identified two RAB family small GTPases, i.e. RAB13 and RAB10, as novel interactors of GGA2. Functionally, RAB13 silencing triggers the intracellular accumulation of active β1-integrin, and reduces integrin activity in focal adhesions and cell migration similarly to GGA2 depletion, indicating that both facilitate active β1-integrin recycling to the plasma membrane. Thus, GGA2 and RAB13 are important specificity determinants for integrin activity-dependent traffic.","lang":"eng"}],"_id":"7420","pmid":1,"external_id":{"isi":["000473327900017"],"pmid":["31076515"]},"oa":1,"intvolume":"       132","status":"public","date_updated":"2023-09-06T15:01:00Z","day":"07","doi":"10.1242/jcs.233387","article_number":"jcs233387","isi":1,"issue":"11","title":"GGA2 and RAB13 promote activity-dependent β1-integrin recycling","publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"year":"2019","oa_version":"Published Version","department":[{"_id":"MiSi"}],"article_type":"original","date_published":"2019-06-07T00:00:00Z","citation":{"chicago":"Sahgal, Pranshu, Jonna H Alanko, Jaroslav Icha, Ilkka Paatero, Hellyeh Hamidi, Antti Arjonen, Mika Pietilä, Anne Rokka, and Johanna Ivaska. “GGA2 and RAB13 Promote Activity-Dependent Β1-Integrin Recycling.” <i>Journal of Cell Science</i>. The Company of Biologists, 2019. <a href=\"https://doi.org/10.1242/jcs.233387\">https://doi.org/10.1242/jcs.233387</a>.","ama":"Sahgal P, Alanko JH, Icha J, et al. GGA2 and RAB13 promote activity-dependent β1-integrin recycling. <i>Journal of Cell Science</i>. 2019;132(11). doi:<a href=\"https://doi.org/10.1242/jcs.233387\">10.1242/jcs.233387</a>","apa":"Sahgal, P., Alanko, J. H., Icha, J., Paatero, I., Hamidi, H., Arjonen, A., … Ivaska, J. (2019). GGA2 and RAB13 promote activity-dependent β1-integrin recycling. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.233387\">https://doi.org/10.1242/jcs.233387</a>","ista":"Sahgal P, Alanko JH, Icha J, Paatero I, Hamidi H, Arjonen A, Pietilä M, Rokka A, Ivaska J. 2019. GGA2 and RAB13 promote activity-dependent β1-integrin recycling. Journal of Cell Science. 132(11), jcs233387.","ieee":"P. Sahgal <i>et al.</i>, “GGA2 and RAB13 promote activity-dependent β1-integrin recycling,” <i>Journal of Cell Science</i>, vol. 132, no. 11. The Company of Biologists, 2019.","mla":"Sahgal, Pranshu, et al. “GGA2 and RAB13 Promote Activity-Dependent Β1-Integrin Recycling.” <i>Journal of Cell Science</i>, vol. 132, no. 11, jcs233387, The Company of Biologists, 2019, doi:<a href=\"https://doi.org/10.1242/jcs.233387\">10.1242/jcs.233387</a>.","short":"P. Sahgal, J.H. Alanko, J. Icha, I. Paatero, H. Hamidi, A. Arjonen, M. Pietilä, A. Rokka, J. Ivaska, Journal of Cell Science 132 (2019)."},"publication_status":"published","quality_controlled":"1"},{"citation":{"chicago":"Toups, Melissa A, Nicolas Rodrigues, Nicolas Perrin, and Mark Kirkpatrick. “A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common Frog.” <i>Molecular Ecology</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/mec.14990\">https://doi.org/10.1111/mec.14990</a>.","ama":"Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. <i>Molecular Ecology</i>. 2019;28(8):1877-1889. doi:<a href=\"https://doi.org/10.1111/mec.14990\">10.1111/mec.14990</a>","apa":"Toups, M. A., Rodrigues, N., Perrin, N., &#38; Kirkpatrick, M. (2019). A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.14990\">https://doi.org/10.1111/mec.14990</a>","ista":"Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. 2019. A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. 28(8), 1877–1889.","ieee":"M. A. Toups, N. Rodrigues, N. Perrin, and M. Kirkpatrick, “A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog,” <i>Molecular Ecology</i>, vol. 28, no. 8. Wiley, pp. 1877–1889, 2019.","short":"M.A. Toups, N. Rodrigues, N. Perrin, M. Kirkpatrick, Molecular Ecology 28 (2019) 1877–1889.","mla":"Toups, Melissa A., et al. “A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common Frog.” <i>Molecular Ecology</i>, vol. 28, no. 8, Wiley, 2019, pp. 1877–89, doi:<a href=\"https://doi.org/10.1111/mec.14990\">10.1111/mec.14990</a>."},"publication_status":"published","quality_controlled":"1","oa_version":"None","department":[{"_id":"BeVi"}],"date_published":"2019-04-01T00:00:00Z","article_type":"original","isi":1,"doi":"10.1111/mec.14990","day":"01","issue":"8","title":"A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog","publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"year":"2019","external_id":{"isi":["000468200800004"],"pmid":["30576024"]},"status":"public","intvolume":"        28","date_updated":"2023-09-06T15:00:13Z","abstract":[{"lang":"eng","text":"X and Y chromosomes can diverge when rearrangements block recombination between them. Here we present the first genomic view of a reciprocal translocation that causes two physically unconnected pairs of chromosomes to be coinherited as sex chromosomes. In a population of the common frog (Rana temporaria), both pairs of X and Y chromosomes show extensive sequence differentiation, but not degeneration of the Y chromosomes. A new method based on gene trees shows both chromosomes are sex‐linked. Furthermore, the gene trees from the two Y chromosomes have identical topologies, showing they have been coinherited since the reciprocal translocation occurred. Reciprocal translocations can thus reshape sex linkage on a much greater scale compared with inversions, the type of rearrangement that is much better known in sex chromosome evolution, and they can greatly amplify the power of sexually antagonistic selection to drive genomic rearrangement. Two more populations show evidence of other rearrangements, suggesting that this species has unprecedented structural polymorphism in its sex chromosomes."}],"_id":"7421","pmid":1,"publisher":"Wiley","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":28,"date_created":"2020-01-30T10:33:05Z","page":"1877-1889","author":[{"last_name":"Toups","full_name":"Toups, Melissa A","first_name":"Melissa A","id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9752-7380"},{"first_name":"Nicolas","full_name":"Rodrigues, Nicolas","last_name":"Rodrigues"},{"full_name":"Perrin, Nicolas","first_name":"Nicolas","last_name":"Perrin"},{"first_name":"Mark","full_name":"Kirkpatrick, Mark","last_name":"Kirkpatrick"}],"language":[{"iso":"eng"}],"month":"04","type":"journal_article","article_processing_charge":"No","publication":"Molecular Ecology"},{"date_published":"2019-02-07T00:00:00Z","article_type":"original","oa_version":"Preprint","department":[{"_id":"GaTk"}],"arxiv":1,"quality_controlled":"1","citation":{"ama":"Sokolowski TR, Paijmans J, Bossen L, et al. eGFRD in all dimensions. <i>The Journal of Chemical Physics</i>. 2019;150(5). doi:<a href=\"https://doi.org/10.1063/1.5064867\">10.1063/1.5064867</a>","apa":"Sokolowski, T. R., Paijmans, J., Bossen, L., Miedema, T., Wehrens, M., Becker, N. B., … ten Wolde, P. R. (2019). eGFRD in all dimensions. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5064867\">https://doi.org/10.1063/1.5064867</a>","chicago":"Sokolowski, Thomas R, Joris Paijmans, Laurens Bossen, Thomas Miedema, Martijn Wehrens, Nils B. Becker, Kazunari Kaizu, Koichi Takahashi, Marileen Dogterom, and Pieter Rein ten Wolde. “EGFRD in All Dimensions.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2019. <a href=\"https://doi.org/10.1063/1.5064867\">https://doi.org/10.1063/1.5064867</a>.","short":"T.R. Sokolowski, J. Paijmans, L. Bossen, T. Miedema, M. Wehrens, N.B. Becker, K. Kaizu, K. Takahashi, M. Dogterom, P.R. ten Wolde, The Journal of Chemical Physics 150 (2019).","mla":"Sokolowski, Thomas R., et al. “EGFRD in All Dimensions.” <i>The Journal of Chemical Physics</i>, vol. 150, no. 5, 054108, AIP Publishing, 2019, doi:<a href=\"https://doi.org/10.1063/1.5064867\">10.1063/1.5064867</a>.","ieee":"T. R. Sokolowski <i>et al.</i>, “eGFRD in all dimensions,” <i>The Journal of Chemical Physics</i>, vol. 150, no. 5. AIP Publishing, 2019.","ista":"Sokolowski TR, Paijmans J, Bossen L, Miedema T, Wehrens M, Becker NB, Kaizu K, Takahashi K, Dogterom M, ten Wolde PR. 2019. eGFRD in all dimensions. The Journal of Chemical Physics. 150(5), 054108."},"publication_status":"published","status":"public","intvolume":"       150","date_updated":"2023-09-06T14:59:28Z","external_id":{"arxiv":["1708.09364"],"isi":["000458109300009"]},"oa":1,"year":"2019","isi":1,"day":"07","doi":"10.1063/1.5064867","article_number":"054108","title":"eGFRD in all dimensions","issue":"5","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"publisher":"AIP Publishing","main_file_link":[{"url":"https://arxiv.org/abs/1708.09364","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7422","abstract":[{"lang":"eng","text":"Biochemical reactions often occur at low copy numbers but at once in crowded and diverse environments. Space and stochasticity therefore play an essential role in biochemical networks. Spatial-stochastic simulations have become a prominent tool for understanding how stochasticity at the microscopic level influences the macroscopic behavior of such systems. While particle-based models guarantee the level of detail necessary to accurately describe the microscopic dynamics at very low copy numbers, the algorithms used to simulate them typically imply trade-offs between computational efficiency and biochemical accuracy. eGFRD (enhanced Green’s Function Reaction Dynamics) is an exact algorithm that evades such trade-offs by partitioning the N-particle system into M ≤ N analytically tractable one- and two-particle systems; the analytical solutions (Green’s functions) then are used to implement an event-driven particle-based scheme that allows particles to make large jumps in time and space while retaining access to their state variables at arbitrary simulation times. Here we present “eGFRD2,” a new eGFRD version that implements the principle of eGFRD in all dimensions, thus enabling efficient particle-based simulation of biochemical reaction-diffusion processes in the 3D cytoplasm, on 2D planes representing membranes, and on 1D elongated cylinders representative of, e.g., cytoskeletal tracks or DNA; in 1D, it also incorporates convective motion used to model active transport. We find that, for low particle densities, eGFRD2 is up to 6 orders of magnitude faster than conventional Brownian dynamics. We exemplify the capabilities of eGFRD2 by simulating an idealized model of Pom1 gradient formation, which involves 3D diffusion, active transport on microtubules, and autophosphorylation on the membrane, confirming recent experimental and theoretical results on this system to hold under genuinely stochastic conditions."}],"article_processing_charge":"No","publication":"The Journal of Chemical Physics","author":[{"orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","full_name":"Sokolowski, Thomas R","first_name":"Thomas R","last_name":"Sokolowski"},{"last_name":"Paijmans","full_name":"Paijmans, Joris","first_name":"Joris"},{"last_name":"Bossen","first_name":"Laurens","full_name":"Bossen, Laurens"},{"last_name":"Miedema","first_name":"Thomas","full_name":"Miedema, Thomas"},{"last_name":"Wehrens","full_name":"Wehrens, Martijn","first_name":"Martijn"},{"last_name":"Becker","full_name":"Becker, Nils B.","first_name":"Nils B."},{"first_name":"Kazunari","full_name":"Kaizu, Kazunari","last_name":"Kaizu"},{"first_name":"Koichi","full_name":"Takahashi, Koichi","last_name":"Takahashi"},{"last_name":"Dogterom","full_name":"Dogterom, Marileen","first_name":"Marileen"},{"full_name":"ten Wolde, Pieter Rein","first_name":"Pieter Rein","last_name":"ten Wolde"}],"month":"02","language":[{"iso":"eng"}],"type":"journal_article","date_created":"2020-01-30T10:34:36Z","volume":150},{"abstract":[{"text":"We compare finite rank perturbations of the following three ensembles of complex rectangular random matrices: First, a generalised Wishart ensemble with one random and two fixed correlation matrices introduced by Borodin and Péché, second, the product of two independent random matrices where one has correlated entries, and third, the case when the two random matrices become also coupled through a fixed matrix. The singular value statistics of all three ensembles is shown to be determinantal and we derive double contour integral representations for their respective kernels. Three different kernels are found in the limit of infinite matrix dimension at the origin of the spectrum. They depend on finite rank perturbations of the correlation and coupling matrices and are shown to be integrable. The first kernel (I) is found for two independent matrices from the second, and two weakly coupled matrices from the third ensemble. It generalises the Meijer G-kernel for two independent and uncorrelated matrices. The third kernel (III) is obtained for the generalised Wishart ensemble and for two strongly coupled matrices. It further generalises the perturbed Bessel kernel of Desrosiers and Forrester. Finally, kernel (II), found for the ensemble of two coupled matrices, provides an interpolation between the kernels (I) and (III), generalising previous findings of part of the authors.","lang":"eng"}],"_id":"7423","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.05224"}],"publisher":"Institute of Mathematical Statistics","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":55,"date_created":"2020-01-30T10:36:50Z","page":"441-479","type":"journal_article","month":"02","language":[{"iso":"eng"}],"author":[{"last_name":"Akemann","first_name":"Gernot","full_name":"Akemann, Gernot"},{"full_name":"Checinski, Tomasz","first_name":"Tomasz","last_name":"Checinski"},{"first_name":"Dangzheng","full_name":"Liu, Dangzheng","last_name":"Liu","id":"2F947E34-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Strahov, Eugene","first_name":"Eugene","last_name":"Strahov"}],"publication":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques","article_processing_charge":"No","citation":{"chicago":"Akemann, Gernot, Tomasz Checinski, Dangzheng Liu, and Eugene Strahov. “Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated to Two Wishart Ensembles.” <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>. Institute of Mathematical Statistics, 2019. <a href=\"https://doi.org/10.1214/18-aihp888\">https://doi.org/10.1214/18-aihp888</a>.","apa":"Akemann, G., Checinski, T., Liu, D., &#38; Strahov, E. (2019). Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-aihp888\">https://doi.org/10.1214/18-aihp888</a>","ama":"Akemann G, Checinski T, Liu D, Strahov E. Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>. 2019;55(1):441-479. doi:<a href=\"https://doi.org/10.1214/18-aihp888\">10.1214/18-aihp888</a>","ista":"Akemann G, Checinski T, Liu D, Strahov E. 2019. Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 55(1), 441–479.","short":"G. Akemann, T. Checinski, D. Liu, E. Strahov, Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 55 (2019) 441–479.","mla":"Akemann, Gernot, et al. “Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated to Two Wishart Ensembles.” <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>, vol. 55, no. 1, Institute of Mathematical Statistics, 2019, pp. 441–79, doi:<a href=\"https://doi.org/10.1214/18-aihp888\">10.1214/18-aihp888</a>.","ieee":"G. Akemann, T. Checinski, D. Liu, and E. Strahov, “Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles,” <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>, vol. 55, no. 1. Institute of Mathematical Statistics, pp. 441–479, 2019."},"publication_status":"published","quality_controlled":"1","arxiv":1,"oa_version":"Preprint","department":[{"_id":"LaEr"}],"article_type":"original","date_published":"2019-02-01T00:00:00Z","doi":"10.1214/18-aihp888","day":"01","isi":1,"issue":"1","title":"Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles","publication_identifier":{"issn":["0246-0203"]},"year":"2019","external_id":{"arxiv":["1704.05224"],"isi":["000456070200013"]},"oa":1,"intvolume":"        55","status":"public","date_updated":"2023-09-06T14:58:39Z"},{"year":"2019","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"day":"20","doi":"10.25537/dm.2019v24.1135-1177","isi":1,"publication_identifier":{"eissn":["1431-0643"],"issn":["1431-0635"]},"has_accepted_license":"1","title":"On derived equivalences of k3 surfaces in positive characteristic","intvolume":"        24","status":"public","date_updated":"2023-10-17T07:42:21Z","external_id":{"arxiv":["1809.08970"],"isi":["000517806400019"]},"oa":1,"quality_controlled":"1","arxiv":1,"citation":{"ista":"Srivastava TK. 2019. On derived equivalences of k3 surfaces in positive characteristic. Documenta Mathematica. 24, 1135–1177.","ieee":"T. K. Srivastava, “On derived equivalences of k3 surfaces in positive characteristic,” <i>Documenta Mathematica</i>, vol. 24. EMS Press, pp. 1135–1177, 2019.","mla":"Srivastava, Tanya K. “On Derived Equivalences of K3 Surfaces in Positive Characteristic.” <i>Documenta Mathematica</i>, vol. 24, EMS Press, 2019, pp. 1135–77, doi:<a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">10.25537/dm.2019v24.1135-1177</a>.","short":"T.K. Srivastava, Documenta Mathematica 24 (2019) 1135–1177.","chicago":"Srivastava, Tanya K. “On Derived Equivalences of K3 Surfaces in Positive Characteristic.” <i>Documenta Mathematica</i>. EMS Press, 2019. <a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">https://doi.org/10.25537/dm.2019v24.1135-1177</a>.","ama":"Srivastava TK. On derived equivalences of k3 surfaces in positive characteristic. <i>Documenta Mathematica</i>. 2019;24:1135-1177. doi:<a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">10.25537/dm.2019v24.1135-1177</a>","apa":"Srivastava, T. K. (2019). On derived equivalences of k3 surfaces in positive characteristic. <i>Documenta Mathematica</i>. EMS Press. <a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">https://doi.org/10.25537/dm.2019v24.1135-1177</a>"},"publication_status":"published","article_type":"original","date_published":"2019-05-20T00:00:00Z","file":[{"creator":"dernst","content_type":"application/pdf","file_id":"7438","date_created":"2020-02-03T06:26:12Z","file_name":"2019_DocumMath_Srivastava.pdf","file_size":469730,"checksum":"9a1a64bd49ab03fa4f738fb250fc4f90","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:58Z"}],"oa_version":"Published Version","department":[{"_id":"TaHa"}],"date_created":"2020-02-02T23:01:06Z","page":"1135-1177","file_date_updated":"2020-07-14T12:47:58Z","ddc":["510"],"volume":24,"scopus_import":"1","publication":"Documenta Mathematica","article_processing_charge":"No","type":"journal_article","author":[{"last_name":"Srivastava","first_name":"Tanya K","full_name":"Srivastava, Tanya K","id":"4D046628-F248-11E8-B48F-1D18A9856A87"}],"month":"05","language":[{"iso":"eng"}],"_id":"7436","abstract":[{"lang":"eng","text":"For an ordinary K3 surface over an algebraically closed field of positive characteristic we show that every automorphism lifts to characteristic zero. Moreover, we show that the Fourier-Mukai partners of an ordinary K3 surface are in one-to-one correspondence with the Fourier-Mukai partners of the geometric generic fiber of its canonical lift. We also prove that the explicit counting formula for Fourier-Mukai partners of the K3 surfaces with Picard rank two and with discriminant equal to minus of a prime number, in terms of the class number of the prime, holds over a field of positive characteristic as well. We show that the image of the derived autoequivalence group of a K3 surface of finite height in the group of isometries of its crystalline cohomology has index at least two. Moreover, we provide a conditional upper bound on the kernel of this natural cohomological descent map. Further, we give an extended remark in the appendix on the possibility of an F-crystal structure on the crystalline cohomology of a K3 surface over an algebraically closed field of positive characteristic and show that the naive F-crystal structure fails in being compatible with inner product. "}],"publisher":"EMS Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":"2019-June","date_created":"2020-02-02T23:01:06Z","page":"12481-12512","type":"conference","month":"06","language":[{"iso":"eng"}],"conference":{"start_date":"2019-06-10","end_date":"2019-06-15","name":"ICML: International Conference on Machine Learning","location":"Long Beach, CA, United States"},"author":[{"last_name":"Yu","full_name":"Yu, Chen","first_name":"Chen"},{"full_name":"Tang, Hanlin","first_name":"Hanlin","last_name":"Tang"},{"full_name":"Renggli, Cedric","first_name":"Cedric","last_name":"Renggli"},{"full_name":"Kassing, Simon","first_name":"Simon","last_name":"Kassing"},{"last_name":"Singla","full_name":"Singla, Ankit","first_name":"Ankit"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ce","full_name":"Zhang, Ce","last_name":"Zhang"},{"first_name":"Ji","full_name":"Liu, Ji","last_name":"Liu"}],"scopus_import":"1","publication":"36th International Conference on Machine Learning, ICML 2019","article_processing_charge":"No","abstract":[{"text":"Most of today's distributed machine learning systems assume reliable networks: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: Can we design machine learning systems that are tolerant to network unreliability during training? With this motivation, we focus on a theoretical problem of independent interest-given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability p of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of parameter servers. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable.","lang":"eng"}],"_id":"7437","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.07766"}],"publisher":"IMLS","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","isi":1,"publication_identifier":{"isbn":["9781510886988"]},"title":"Distributed learning over unreliable networks","year":"2019","external_id":{"arxiv":["1810.07766"],"isi":["000684034307036"]},"oa":1,"status":"public","date_updated":"2023-09-06T15:21:48Z","citation":{"ieee":"C. Yu <i>et al.</i>, “Distributed learning over unreliable networks,” in <i>36th International Conference on Machine Learning, ICML 2019</i>, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.","short":"C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.","mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” <i>36th International Conference on Machine Learning, ICML 2019</i>, vol. 2019–June, IMLS, 2019, pp. 12481–512.","ista":"Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu J. 2019. Distributed learning over unreliable networks. 36th International Conference on Machine Learning, ICML 2019. ICML: International Conference on Machine Learning vol. 2019–June, 12481–12512.","ama":"Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: <i>36th International Conference on Machine Learning, ICML 2019</i>. Vol 2019-June. IMLS; 2019:12481-12512.","apa":"Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., … Liu, J. (2019). Distributed learning over unreliable networks. In <i>36th International Conference on Machine Learning, ICML 2019</i> (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.","chicago":"Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In <i>36th International Conference on Machine Learning, ICML 2019</i>, 2019–June:12481–512. IMLS, 2019."},"publication_status":"published","quality_controlled":"1","arxiv":1,"oa_version":"Preprint","department":[{"_id":"DaAl"}],"date_published":"2019-06-01T00:00:00Z"},{"date_created":"2020-02-05T09:57:57Z","ddc":["530"],"volume":3,"file_date_updated":"2020-07-14T12:47:58Z","article_processing_charge":"No","publication":"Quantum","language":[{"iso":"eng"}],"author":[{"full_name":"Vukics, A.","first_name":"A.","last_name":"Vukics"},{"first_name":"A.","full_name":"Dombi, A.","last_name":"Dombi"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M","full_name":"Fink, Johannes M","last_name":"Fink"},{"last_name":"Domokos","full_name":"Domokos, P.","first_name":"P."}],"month":"06","type":"journal_article","_id":"7451","abstract":[{"lang":"eng","text":"We prove that the observable telegraph signal accompanying the bistability in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings model is the finite-size precursor of what in the thermodynamic limit is a genuine first-order phase transition. We construct a finite-size scaling of the system parameters to a well-defined thermodynamic limit, in which the system remains the same microscopic system, but the telegraph signal becomes macroscopic both in its timescale and intensity. The existence of such a finite-size scaling completes and justifies the classification of the photon-blockade-breakdown effect as a first-order dissipative quantum phase transition."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften","year":"2019","has_accepted_license":"1","publication_identifier":{"issn":["2521-327X"]},"title":"Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"day":"03","doi":"10.22331/q-2019-06-03-150","article_number":"150","date_updated":"2023-09-07T14:57:39Z","status":"public","intvolume":"         3","oa":1,"external_id":{"isi":["000469987500004"],"arxiv":["1809.09737"]},"arxiv":1,"quality_controlled":"1","citation":{"chicago":"Vukics, A., A. Dombi, Johannes M Fink, and P. Domokos. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019. <a href=\"https://doi.org/10.22331/q-2019-06-03-150\">https://doi.org/10.22331/q-2019-06-03-150</a>.","ama":"Vukics A, Dombi A, Fink JM, Domokos P. Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. <i>Quantum</i>. 2019;3. doi:<a href=\"https://doi.org/10.22331/q-2019-06-03-150\">10.22331/q-2019-06-03-150</a>","apa":"Vukics, A., Dombi, A., Fink, J. M., &#38; Domokos, P. (2019). Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. <a href=\"https://doi.org/10.22331/q-2019-06-03-150\">https://doi.org/10.22331/q-2019-06-03-150</a>","ista":"Vukics A, Dombi A, Fink JM, Domokos P. 2019. Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. Quantum. 3, 150.","ieee":"A. Vukics, A. Dombi, J. M. Fink, and P. Domokos, “Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition,” <i>Quantum</i>, vol. 3. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019.","short":"A. Vukics, A. Dombi, J.M. Fink, P. Domokos, Quantum 3 (2019).","mla":"Vukics, A., et al. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” <i>Quantum</i>, vol. 3, 150, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019, doi:<a href=\"https://doi.org/10.22331/q-2019-06-03-150\">10.22331/q-2019-06-03-150</a>."},"publication_status":"published","date_published":"2019-06-03T00:00:00Z","article_type":"original","department":[{"_id":"JoFi"}],"oa_version":"Published Version","file":[{"checksum":"26b9ba8f0155d183f1ee55295934a17f","file_size":5805248,"access_level":"open_access","relation":"main_file","file_name":"2019_Quantum_Vukics.pdf","date_updated":"2020-07-14T12:47:58Z","creator":"dernst","date_created":"2020-02-11T09:25:23Z","content_type":"application/pdf","file_id":"7483"}]},{"year":"2019","doi":"10.1007/978-3-319-91908-9_22","day":"05","publication_identifier":{"eissn":["0302-9743"],"isbn":["9783319919072"],"eisbn":["9783319919089"],"issn":["1611-3349"]},"title":"Continuous-time models for system design and analysis","status":"public","intvolume":"     10000","date_updated":"2022-09-06T08:25:52Z","oa":1,"quality_controlled":"1","publication_status":"published","citation":{"ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477.","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in <i>Computing and Software Science</i>, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>.","short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>.","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. <i>Computing and Software Science</i>. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &#38; Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &#38; G. Woeginger (Eds.), <i>Computing and Software Science</i> (Vol. 10000, pp. 452–477). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>"},"editor":[{"full_name":"Steffen, Bernhard","first_name":"Bernhard","last_name":"Steffen"},{"last_name":"Woeginger","full_name":"Woeginger, Gerhard","first_name":"Gerhard"}],"date_published":"2019-10-05T00:00:00Z","oa_version":"Published Version","series_title":"LNCS","department":[{"_id":"ToHe"}],"date_created":"2020-02-05T10:51:44Z","page":"452-477","volume":10000,"scopus_import":"1","article_processing_charge":"No","publication":"Computing and Software Science","author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","full_name":"Giacobbe, Mirco","first_name":"Mirco"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Larsen","first_name":"Kim G.","full_name":"Larsen, Kim G."},{"full_name":"Mikučionis, Marius","first_name":"Marius","last_name":"Mikučionis"}],"language":[{"iso":"eng"}],"month":"10","type":"book_chapter","_id":"7453","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","alternative_title":["Lecture Notes in Computer Science"],"abstract":[{"text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement.","lang":"eng"}],"publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-319-91908-9_22"}],"project":[{"grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"isi":1,"day":"01","article_number":"11138-11147","doi":"10.1109/CVPR.2019.01140","title":"Map inference via block-coordinate Frank-Wolfe algorithm","publication_identifier":{"isbn":["9781728132938"],"issn":["10636919"]},"year":"2019","external_id":{"isi":["000542649304076"],"arxiv":["1806.05049"]},"oa":1,"status":"public","date_updated":"2023-09-07T14:54:24Z","citation":{"ieee":"P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Long Beach, CA, United States, 2019, vol. 2019–June.","mla":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, vol. 2019–June, 11138–11147, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>.","short":"P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019.","ista":"Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2019–June, 11138–11147.","apa":"Swoboda, P., &#38; Kolmogorov, V. (2019). Map inference via block-coordinate Frank-Wolfe algorithm. In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i> (Vol. 2019–June). Long Beach, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>","ama":"Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>. Vol 2019-June. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>","chicago":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Vol. 2019–June. IEEE, 2019. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>."},"publication_status":"published","arxiv":1,"quality_controlled":"1","oa_version":"Preprint","department":[{"_id":"VlKo"}],"date_published":"2019-06-01T00:00:00Z","volume":"2019-June","date_created":"2020-02-09T23:00:52Z","language":[{"iso":"eng"}],"conference":{"start_date":"2019-06-15","end_date":"2019-06-20","name":"CVPR: Conference on Computer Vision and Pattern Recognition","location":"Long Beach, CA, United States"},"author":[{"last_name":"Swoboda","full_name":"Swoboda, Paul","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"month":"06","type":"conference","scopus_import":"1","article_processing_charge":"No","publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","abstract":[{"lang":"eng","text":"We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems."}],"_id":"7468","publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05049"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1},{"year":"2019","has_accepted_license":"1","publication_identifier":{"isbn":["9781728148038"],"issn":["15505499"]},"title":"Distillation-based training for multi-exit architectures","isi":1,"day":"01","doi":"10.1109/ICCV.2019.00144","date_updated":"2023-09-08T11:11:12Z","status":"public","oa":1,"external_id":{"isi":["000531438101047"]},"quality_controlled":"1","citation":{"mla":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” <i>IEEE International Conference on Computer Vision</i>, vol. 2019–October, IEEE, 2019, pp. 1355–64, doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>.","short":"M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision, IEEE, 2019, pp. 1355–1364.","ieee":"M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,” in <i>IEEE International Conference on Computer Vision</i>, Seoul, Korea, 2019, vol. 2019–October, pp. 1355–1364.","ista":"Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures. IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision vol. 2019–October, 1355–1364.","ama":"Phuong M, Lampert C. Distillation-based training for multi-exit architectures. In: <i>IEEE International Conference on Computer Vision</i>. Vol 2019-October. IEEE; 2019:1355-1364. doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>","apa":"Phuong, M., &#38; Lampert, C. (2019). Distillation-based training for multi-exit architectures. In <i>IEEE International Conference on Computer Vision</i> (Vol. 2019–October, pp. 1355–1364). Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>","chicago":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” In <i>IEEE International Conference on Computer Vision</i>, 2019–October:1355–64. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>."},"publication_status":"published","date_published":"2019-10-01T00:00:00Z","department":[{"_id":"ChLa"}],"oa_version":"Submitted Version","file":[{"date_created":"2020-02-11T09:06:39Z","content_type":"application/pdf","file_id":"7480","creator":"bphuong","date_updated":"2020-07-14T12:47:59Z","checksum":"7b77fb5c2d27c4c37a7612ba46a66117","file_size":735768,"access_level":"open_access","relation":"main_file","file_name":"main.pdf"}],"page":"1355-1364","date_created":"2020-02-11T09:06:57Z","volume":"2019-October","ddc":["000"],"file_date_updated":"2020-07-14T12:47:59Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9418"}]},"article_processing_charge":"No","publication":"IEEE International Conference on Computer Vision","scopus_import":"1","conference":{"start_date":"2019-10-27","end_date":"2019-11-02","name":"ICCV: International Conference on Computer Vision","location":"Seoul, Korea"},"language":[{"iso":"eng"}],"month":"10","author":[{"last_name":"Bui Thi Mai","first_name":"Phuong","full_name":"Bui Thi Mai, Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph"}],"type":"conference","_id":"7479","abstract":[{"text":"Multi-exit architectures, in which a stack of processing layers is interleaved with early output layers, allow the processing of a test example to stop early and thus save computation time and/or energy.  In this work, we propose a new training procedure for multi-exit architectures based on the principle of knowledge distillation. The method encourage searly exits to mimic later, more accurate exits, by matching their output probabilities.\r\nExperiments  on  CIFAR100  and  ImageNet  show  that distillation-based training significantly improves the accuracy of early exits while maintaining state-of-the-art accuracy  for  late  ones.   The  method  is  particularly  beneficial when  training  data  is  limited  and  it  allows  a  straightforward extension to semi-supervised learning,i.e. making use of unlabeled data at training time. Moreover, it takes only afew lines to implement and incurs almost no computational overhead at training time, and none at all at test time.","lang":"eng"}],"ec_funded":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}]},{"citation":{"chicago":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” In <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., 747–55. Elsevier, 2019. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>.","ama":"Cremer S, Kutzer M. Social immunity. In: Choe J, ed. <i>Encyclopedia of Animal Behavior</i>. 2nd ed. Elsevier; 2019:747-755. doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>","apa":"Cremer, S., &#38; Kutzer, M. (2019). Social immunity. In J. Choe (Ed.), <i>Encyclopedia of Animal Behavior</i> (2nd ed., pp. 747–755). Elsevier. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>","ista":"Cremer S, Kutzer M. 2019.Social immunity. In: Encyclopedia of Animal Behavior. , 747–755.","mla":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., Elsevier, 2019, pp. 747–55, doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>.","short":"S. Cremer, M. Kutzer, in:, J. Choe (Ed.), Encyclopedia of Animal Behavior, 2nd ed., Elsevier, 2019, pp. 747–755.","ieee":"S. Cremer and M. Kutzer, “Social immunity,” in <i>Encyclopedia of Animal Behavior</i>, 2nd ed., J. Choe, Ed. Elsevier, 2019, pp. 747–755."},"publication_status":"published","abstract":[{"text":"Social insects (i.e., ants, termites and the social bees and wasps) protect their colonies from disease using a combination of individual immunity and collectively performed defenses, termed social immunity. The first line of social immune defense is sanitary care, which is performed by colony members to protect their pathogen-exposed nestmates from developing an infection. If sanitary care fails and an infection becomes established, a second line of social immune defense is deployed to stop disease transmission within the colony and to protect the valuable queens, which together with the males are the reproductive individuals of the colony. Insect colonies are separated into these reproductive individuals and the sterile worker force, forming a superorganismal reproductive unit reminiscent of the differentiated germline and soma in a multicellular organism. Ultimately, the social immune response preserves the germline of the superorganism insect colony and increases overall fitness of the colony in case of disease. ","lang":"eng"}],"editor":[{"first_name":"Jae","full_name":"Choe, Jae","last_name":"Choe"}],"_id":"7513","quality_controlled":"1","oa_version":"None","publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"SyCr"}],"edition":"2","date_published":"2019-02-06T00:00:00Z","isi":1,"day":"06","doi":"10.1016/B978-0-12-809633-8.90721-0","publication_identifier":{"eisbn":["9780128132524"],"isbn":["9780128132517"]},"title":"Social immunity","year":"2019","date_created":"2020-02-23T23:00:36Z","page":"747-755","external_id":{"isi":["000248989500026"]},"month":"02","author":[{"last_name":"Cremer","first_name":"Sylvia","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kutzer","first_name":"Megan","full_name":"Kutzer, Megan","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8696-6978"}],"language":[{"iso":"eng"}],"type":"book_chapter","status":"public","scopus_import":"1","article_processing_charge":"No","publication":"Encyclopedia of Animal Behavior","date_updated":"2023-09-08T11:12:04Z"}]