[{"date_created":"2019-09-19T08:19:44Z","date_updated":"2023-10-18T08:49:17Z","author":[{"full_name":"Kopf, Aglaja","orcid":"0000-0002-2187-6656","id":"31DAC7B6-F248-11E8-B48F-1D18A9856A87","last_name":"Kopf","first_name":"Aglaja"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/feeling-like-a-cell/","relation":"press_release"}],"record":[{"relation":"part_of_dissertation","status":"public","id":"6328"},{"relation":"part_of_dissertation","status":"public","id":"15"},{"id":"6877","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Institute of Science and Technology Austria","year":"2019","file_date_updated":"2020-10-17T22:30:03Z","supervisor":[{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:6891","project":[{"grant_number":"W01250-B20","_id":"265E2996-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Nano-Analytics of Cellular Systems"}],"oa":1,"month":"07","publication_identifier":{"eissn":["2663-337X"],"isbn":["978-3-99078-002-2"]},"file":[{"embargo_to":"open_access","file_name":"Kopf_PhD_Thesis.docx","access_level":"closed","file_size":74735267,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"akopf","relation":"source_file","file_id":"6950","date_created":"2019-10-15T05:28:42Z","date_updated":"2020-10-17T22:30:03Z","checksum":"00d100d6468e31e583051e0a006b640c"},{"access_level":"open_access","file_name":"Kopf_PhD_Thesis1.pdf","creator":"akopf","file_size":52787224,"content_type":"application/pdf","embargo":"2020-10-16","file_id":"6951","relation":"main_file","checksum":"5d1baa899993ae6ca81aebebe1797000","date_updated":"2020-10-17T22:30:03Z","date_created":"2019-10-15T05:28:47Z"}],"oa_version":"Published Version","status":"public","title":"The implication of cytoskeletal dynamics on leukocyte migration","ddc":["570"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6891","abstract":[{"text":"While cells of mesenchymal or epithelial origin perform their effector functions in a purely anchorage dependent manner, cells derived from the hematopoietic lineage are not committed to operate only within a specific niche. Instead, these cells are able to function autonomously of the molecular composition in a broad range of tissue compartments. By this means, cells of the hematopoietic lineage retain the capacity to disseminate into connective tissue and recirculate between organs, building the foundation for essential processes such as tissue regeneration or immune surveillance. \r\nCells of the immune system, specifically leukocytes, are extraordinarily good at performing this task. These cells are able to flexibly shift their mode of migration between an adhesion-mediated and an adhesion-independent manner, instantaneously accommodating for any changes in molecular composition of the external scaffold. The key component driving directed leukocyte migration is the chemokine receptor 7, which guides the cell along gradients of chemokine ligand. Therefore, the physical destination of migrating leukocytes is purely deterministic, i.e. given by global directional cues such as chemokine gradients. \r\nNevertheless, these cells typically reside in three-dimensional scaffolds of inhomogeneous complexity, raising the question whether cells are able to locally discriminate between multiple optional migration routes. Current literature provides evidence that leukocytes, specifically dendritic cells, do indeed probe their surrounding by virtue of multiple explorative protrusions. However, it remains enigmatic how these cells decide which one is the more favorable route to follow and what are the key players involved in performing this task. Due to the heterogeneous environment of most tissues, and the vast adaptability of migrating leukocytes, at this time it is not clear to what extent leukocytes are able to optimize their migratory strategy by adapting their level of adhesiveness. And, given the fact that leukocyte migration is characterized by branched cell shapes in combination with high migration velocities, it is reasonable to assume that these cells require fine tuned shape maintenance mechanisms that tightly coordinate protrusion and adhesion dynamics in a spatiotemporal manner. \r\nTherefore, this study aimed to elucidate how rapidly migrating leukocytes opt for an ideal migratory path while maintaining a continuous cell shape and balancing adhesive forces to efficiently navigate through complex microenvironments. \r\nThe results of this study unraveled a role for the microtubule cytoskeleton in promoting the decision making process during path finding and for the first time point towards a microtubule-mediated function in cell shape maintenance of highly ramified cells such as dendritic cells. Furthermore, we found that migrating low-adhesive leukocytes are able to instantaneously adapt to increased tensile load by engaging adhesion receptors. This response was only occurring tangential to the substrate while adhesive properties in the vertical direction were not increased. As leukocytes are primed for rapid migration velocities, these results demonstrate that leukocyte integrins are able to confer a high level of traction forces parallel to the cell membrane along the direction of migration without wasting energy in gluing the cell to the substrate. \r\nThus, the data in the here presented thesis provide new insights into the pivotal role of cytoskeletal dynamics and the mechanisms of force transduction during leukocyte migration. \r\nThereby the here presented results help to further define fundamental principles underlying leukocyte migration and open up potential therapeutic avenues of clinical relevance.\r\n","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2019-07-24T00:00:00Z","page":"171","citation":{"short":"A. Kopf, The Implication of Cytoskeletal Dynamics on Leukocyte Migration, Institute of Science and Technology Austria, 2019.","mla":"Kopf, Aglaja. The Implication of Cytoskeletal Dynamics on Leukocyte Migration. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6891.","chicago":"Kopf, Aglaja. “The Implication of Cytoskeletal Dynamics on Leukocyte Migration.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6891.","ama":"Kopf A. The implication of cytoskeletal dynamics on leukocyte migration. 2019. doi:10.15479/AT:ISTA:6891","apa":"Kopf, A. (2019). The implication of cytoskeletal dynamics on leukocyte migration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6891","ieee":"A. Kopf, “The implication of cytoskeletal dynamics on leukocyte migration,” Institute of Science and Technology Austria, 2019.","ista":"Kopf A. 2019. The implication of cytoskeletal dynamics on leukocyte migration. Institute of Science and Technology Austria."},"day":"24","article_processing_charge":"No","has_accepted_license":"1","keyword":["cell biology","immunology","leukocyte","migration","microfluidics"]},{"article_type":"letter_note","page":"546-550","publication":"Nature","citation":{"apa":"Renkawitz, J., Kopf, A., Stopp, J. A., de Vries, I., Driscoll, M. K., Merrin, J., … Sixt, M. K. (2019). Nuclear positioning facilitates amoeboid migration along the path of least resistance. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1087-5","ieee":"J. Renkawitz et al., “Nuclear positioning facilitates amoeboid migration along the path of least resistance,” Nature, vol. 568. Springer Nature, pp. 546–550, 2019.","ista":"Renkawitz J, Kopf A, Stopp JA, de Vries I, Driscoll MK, Merrin J, Hauschild R, Welf ES, Danuser G, Fiolka R, Sixt MK. 2019. Nuclear positioning facilitates amoeboid migration along the path of least resistance. Nature. 568, 546–550.","ama":"Renkawitz J, Kopf A, Stopp JA, et al. Nuclear positioning facilitates amoeboid migration along the path of least resistance. Nature. 2019;568:546-550. doi:10.1038/s41586-019-1087-5","chicago":"Renkawitz, Jörg, Aglaja Kopf, Julian A Stopp, Ingrid de Vries, Meghan K. Driscoll, Jack Merrin, Robert Hauschild, et al. “Nuclear Positioning Facilitates Amoeboid Migration along the Path of Least Resistance.” Nature. Springer Nature, 2019. https://doi.org/10.1038/s41586-019-1087-5.","short":"J. Renkawitz, A. Kopf, J.A. Stopp, I. de Vries, M.K. Driscoll, J. Merrin, R. Hauschild, E.S. Welf, G. Danuser, R. Fiolka, M.K. Sixt, Nature 568 (2019) 546–550.","mla":"Renkawitz, Jörg, et al. “Nuclear Positioning Facilitates Amoeboid Migration along the Path of Least Resistance.” Nature, vol. 568, Springer Nature, 2019, pp. 546–50, doi:10.1038/s41586-019-1087-5."},"date_published":"2019-04-25T00:00:00Z","scopus_import":"1","day":"25","article_processing_charge":"No","title":"Nuclear positioning facilitates amoeboid migration along the path of least resistance","status":"public","intvolume":" 568","_id":"6328","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"During metazoan development, immune surveillance and cancer dissemination, cells migrate in complex three-dimensional microenvironments1,2,3. These spaces are crowded by cells and extracellular matrix, generating mazes with differently sized gaps that are typically smaller than the diameter of the migrating cell4,5. Most mesenchymal and epithelial cells and some—but not all—cancer cells actively generate their migratory path using pericellular tissue proteolysis6. By contrast, amoeboid cells such as leukocytes use non-destructive strategies of locomotion7, raising the question how these extremely fast cells navigate through dense tissues. Here we reveal that leukocytes sample their immediate vicinity for large pore sizes, and are thereby able to choose the path of least resistance. This allows them to circumnavigate local obstacles while effectively following global directional cues such as chemotactic gradients. Pore-size discrimination is facilitated by frontward positioning of the nucleus, which enables the cells to use their bulkiest compartment as a mechanical gauge. Once the nucleus and the closely associated microtubule organizing centre pass the largest pore, cytoplasmic protrusions still lingering in smaller pores are retracted. These retractions are coordinated by dynamic microtubules; when microtubules are disrupted, migrating cells lose coherence and frequently fragment into migratory cytoplasmic pieces. As nuclear positioning in front of the microtubule organizing centre is a typical feature of amoeboid migration, our findings link the fundamental organization of cellular polarity to the strategy of locomotion.","lang":"eng"}],"isi":1,"quality_controlled":"1","project":[{"grant_number":"281556","_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)"},{"call_identifier":"H2020","name":"Cellular navigation along spatial gradients","_id":"25FE9508-B435-11E9-9278-68D0E5697425","grant_number":"724373"},{"_id":"265FAEBA-B435-11E9-9278-68D0E5697425","grant_number":"W01250-B20","call_identifier":"FWF","name":"Nano-Analytics of Cellular Systems"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25A48D24-B435-11E9-9278-68D0E5697425","grant_number":"ALTF 1396-2014","name":"Molecular and system level view of immune cell migration"}],"external_id":{"isi":["000465594200050"],"pmid":["30944468"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7217284/"}],"oa":1,"acknowledged_ssus":[{"_id":"SSU"}],"language":[{"iso":"eng"}],"doi":"10.1038/s41586-019-1087-5","month":"04","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"MiSi"},{"_id":"NanoFab"},{"_id":"Bio"}],"year":"2019","pmid":1,"date_updated":"2024-03-27T23:30:39Z","date_created":"2019-04-17T06:52:28Z","volume":568,"author":[{"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":"Kopf, Aglaja","first_name":"Aglaja","last_name":"Kopf","id":"31DAC7B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2187-6656"},{"full_name":"Stopp, Julian A","id":"489E3F00-F248-11E8-B48F-1D18A9856A87","first_name":"Julian A","last_name":"Stopp"},{"id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","last_name":"de Vries","first_name":"Ingrid","full_name":"de Vries, Ingrid"},{"first_name":"Meghan K.","last_name":"Driscoll","full_name":"Driscoll, Meghan K."},{"full_name":"Merrin, Jack","last_name":"Merrin","first_name":"Jack","orcid":"0000-0001-5145-4609","id":"4515C308-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hauschild, Robert","last_name":"Hauschild","first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Welf, Erik S.","first_name":"Erik S.","last_name":"Welf"},{"last_name":"Danuser","first_name":"Gaudenz","full_name":"Danuser, Gaudenz"},{"full_name":"Fiolka, Reto","last_name":"Fiolka","first_name":"Reto"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"}],"related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/leukocytes-use-their-nucleus-as-a-ruler-to-choose-path-of-least-resistance/"}],"record":[{"id":"14697","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"6891"}]},"ec_funded":1},{"article_processing_charge":"No","day":"04","scopus_import":"1","date_published":"2019-09-04T00:00:00Z","citation":{"apa":"Contreras, X., & Hippenmeyer, S. (2019). Memo1 tiles the radial glial cell grid. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2019.08.021","ieee":"X. Contreras and S. Hippenmeyer, “Memo1 tiles the radial glial cell grid,” Neuron, vol. 103, no. 5. Elsevier, pp. 750–752, 2019.","ista":"Contreras X, Hippenmeyer S. 2019. Memo1 tiles the radial glial cell grid. Neuron. 103(5), 750–752.","ama":"Contreras X, Hippenmeyer S. Memo1 tiles the radial glial cell grid. Neuron. 2019;103(5):750-752. doi:10.1016/j.neuron.2019.08.021","chicago":"Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” Neuron. Elsevier, 2019. https://doi.org/10.1016/j.neuron.2019.08.021.","short":"X. Contreras, S. Hippenmeyer, Neuron 103 (2019) 750–752.","mla":"Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” Neuron, vol. 103, no. 5, Elsevier, 2019, pp. 750–52, doi:10.1016/j.neuron.2019.08.021."},"publication":"Neuron","page":"750-752","article_type":"letter_note","issue":"5","type":"journal_article","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6830","intvolume":" 103","status":"public","title":"Memo1 tiles the radial glial cell grid","publication_identifier":{"issn":["08966273"],"eissn":["10974199"]},"month":"09","doi":"10.1016/j.neuron.2019.08.021","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["31487522"],"isi":["000484400200002"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.neuron.2019.08.021"}],"quality_controlled":"1","isi":1,"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"7902"}]},"author":[{"full_name":"Contreras, Ximena","first_name":"Ximena","last_name":"Contreras","id":"475990FE-F248-11E8-B48F-1D18A9856A87"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"}],"volume":103,"date_updated":"2024-03-27T23:30:41Z","date_created":"2019-08-25T22:00:50Z","pmid":1,"year":"2019","publisher":"Elsevier","department":[{"_id":"SiHi"}],"publication_status":"published"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes","day":"07","citation":{"ista":"Adamowski M, Li L, Friml J. 2019. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 20(13), 3337.","apa":"Adamowski, M., Li, L., & Friml, J. (2019). Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms20133337","ieee":"M. Adamowski, L. Li, and J. Friml, “Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling,” International Journal of Molecular Sciences, vol. 20, no. 13. MDPI, 2019.","ama":"Adamowski M, Li L, Friml J. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 2019;20(13). doi:10.3390/ijms20133337","chicago":"Adamowski, Maciek, Lanxin Li, and Jiří Friml. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” International Journal of Molecular Sciences. MDPI, 2019. https://doi.org/10.3390/ijms20133337.","mla":"Adamowski, Maciek, et al. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” International Journal of Molecular Sciences, vol. 20, no. 13, 3337, MDPI, 2019, doi:10.3390/ijms20133337.","short":"M. Adamowski, L. Li, J. Friml, International Journal of Molecular Sciences 20 (2019)."},"publication":"International Journal of Molecular Sciences","article_type":"original","date_published":"2019-07-07T00:00:00Z","type":"journal_article","issue":"13","abstract":[{"text":"Cortical microtubule arrays in elongating epidermal cells in both the root and stem of plants have the propensity of dynamic reorientations that are correlated with the activation or inhibition of growth. Factors regulating plant growth, among them the hormone auxin, have been recognized as regulators of microtubule array orientations. Some previous work in the field has aimed at elucidating the causal relationship between cell growth, the signaling of auxin or other growth-regulating factors, and microtubule array reorientations, with various conclusions. Here, we revisit this problem of causality with a comprehensive set of experiments in Arabidopsis thaliana, using the now available pharmacological and genetic tools. We use isolated, auxin-depleted hypocotyls, an experimental system allowing for full control of both growth and auxin signaling. We demonstrate that reorientation of microtubules is not directly triggered by an auxin signal during growth activation. Instead, reorientation is triggered by the activation of the growth process itself and is auxin-independent in its nature. We discuss these findings in the context of previous relevant work, including that on the mechanical regulation of microtubule array orientation.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6627","intvolume":" 20","status":"public","title":"Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling","ddc":["580"],"oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:34Z","date_created":"2019-07-17T06:17:15Z","checksum":"dd9d1cbb933a72ceb666c9667890ac51","file_id":"6645","relation":"main_file","creator":"dernst","file_size":3330291,"content_type":"application/pdf","file_name":"2019_JournalMolecularScience_Adamowski.pdf","access_level":"open_access"}],"publication_identifier":{"eissn":["1422-0067"]},"month":"07","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":{"pmid":["31284661"],"isi":["000477041100221"]},"oa":1,"project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"quality_controlled":"1","isi":1,"doi":"10.3390/ijms20133337","language":[{"iso":"eng"}],"article_number":"3337","ec_funded":1,"file_date_updated":"2020-07-14T12:47:34Z","license":"https://creativecommons.org/licenses/by/4.0/","pmid":1,"year":"2019","publisher":"MDPI","department":[{"_id":"JiFr"}],"publication_status":"published","related_material":{"record":[{"id":"10083","relation":"dissertation_contains","status":"public"}]},"author":[{"first_name":"Maciek","last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257","full_name":"Adamowski, Maciek"},{"last_name":"Li","first_name":"Lanxin","orcid":"0000-0002-5607-272X","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Lanxin"},{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"volume":20,"date_updated":"2024-03-27T23:30:43Z","date_created":"2019-07-11T12:00:32Z"},{"_id":"7117","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 38","status":"public","ddc":["000"],"title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","oa_version":"Submitted Version","file":[{"checksum":"56a2fb019adcb556d2b022f5e5acb68c","date_created":"2019-11-26T14:24:26Z","date_updated":"2020-07-14T12:47:49Z","relation":"supplementary_material","file_id":"7119","title":"X-CAD Supplemental Material","file_size":1673176,"content_type":"application/pdf","creator":"bbickel","access_level":"open_access","file_name":"xcad_sup_mat_siga19.pdf"},{"date_created":"2019-11-26T14:24:27Z","date_updated":"2020-07-14T12:47:49Z","checksum":"5f29d76aceb5102e766cbab9b17d776e","relation":"main_file","title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","file_id":"7120","content_type":"application/pdf","file_size":14563618,"creator":"bbickel","description":"This is the author's version of the work.","file_name":"XCAD_authors_version.pdf","access_level":"open_access"},{"content_type":"video/mp4","file_size":259979129,"creator":"bbickel","access_level":"open_access","file_name":"XCAD_video.mp4","checksum":"0d31e123286cbec9e28b2001c2bb0d55","date_updated":"2020-07-14T12:47:49Z","date_created":"2019-11-26T14:27:37Z","relation":"main_file","file_id":"7121"}],"type":"journal_article","issue":"6","abstract":[{"text":"We propose a novel generic shape optimization method for CAD models based on the eXtended Finite Element Method (XFEM). Our method works directly on the intersection between the model and a regular simulation grid, without the need to mesh or remesh, thus removing a bottleneck of classical shape optimization strategies. This is made possible by a novel hierarchical integration scheme that accurately integrates finite element quantities with sub-element precision. For optimization, we efficiently compute analytical shape derivatives of the entire framework, from model intersection to integration rule generation and XFEM simulation. Moreover, we describe a differentiable projection of shape parameters onto a constraint manifold spanned by user-specified shape preservation, consistency, and manufacturability constraints. We demonstrate the utility of our approach by optimizing mass distribution, strength-to-weight ratio, and inverse elastic shape design objectives directly on parameterized 3D CAD models.","lang":"eng"}],"citation":{"ama":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 2019;38(6). doi:10.1145/3355089.3356576","ista":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 38(6), 157.","apa":"Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., & Bächer, M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356576","ieee":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer, “X-CAD: Optimizing CAD Models with Extended Finite Elements,” ACM Transactions on Graphics, vol. 38, no. 6. ACM, 2019.","mla":"Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” ACM Transactions on Graphics, vol. 38, no. 6, 157, ACM, 2019, doi:10.1145/3355089.3356576.","short":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM Transactions on Graphics 38 (2019).","chicago":"Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger, Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356576."},"publication":"ACM Transactions on Graphics","article_type":"original","date_published":"2019-11-06T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"06","year":"2019","department":[{"_id":"BeBi"}],"publisher":"ACM","publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12897"}]},"author":[{"full_name":"Hafner, Christian","first_name":"Christian","last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schumacher","first_name":"Christian","full_name":"Schumacher, Christian"},{"last_name":"Knoop","first_name":"Espen","full_name":"Knoop, Espen"},{"first_name":"Thomas","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1546-3265","full_name":"Auzinger, Thomas"},{"full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"},{"first_name":"Moritz","last_name":"Bächer","full_name":"Bächer, Moritz"}],"volume":38,"date_updated":"2024-03-27T23:30:46Z","date_created":"2019-11-26T14:22:09Z","article_number":"157","ec_funded":1,"file_date_updated":"2020-07-14T12:47:49Z","oa":1,"external_id":{"isi":["000498397300007"]},"project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"isi":1,"quality_controlled":"1","doi":"10.1145/3355089.3356576","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0730-0301"]},"month":"11"},{"citation":{"ieee":"N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle laden flows,” Physical Review Letters, vol. 122, no. 11. American Physical Society, 2019.","apa":"Agrawal, N., Choueiri, G. H., & Hof, B. (2019). Transition to turbulence in particle laden flows. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.122.114502","ista":"Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle laden flows. Physical Review Letters. 122(11), 114502.","ama":"Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows. Physical Review Letters. 2019;122(11). doi:10.1103/PhysRevLett.122.114502","chicago":"Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence in Particle Laden Flows.” Physical Review Letters. American Physical Society, 2019. https://doi.org/10.1103/PhysRevLett.122.114502.","short":"N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019).","mla":"Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.” Physical Review Letters, vol. 122, no. 11, 114502, American Physical Society, 2019, doi:10.1103/PhysRevLett.122.114502."},"publication":"Physical Review Letters","date_published":"2019-03-22T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"22","_id":"6189","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 122","status":"public","title":"Transition to turbulence in particle laden flows","oa_version":"Preprint","type":"journal_article","issue":"11","abstract":[{"text":"Suspended particles can alter the properties of fluids and in particular also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic) transition to turbulent puffs is affected by the addition of particles. Here weshow that in addition to this known transition, with increasing concentration a supercritical (i.e.,continuous) transition to a globally fluctuating state is found. At the same time the Newtonian-typetransition to puffs is delayed to larger Reynolds numbers. At even higher concentration only the globallyfluctuating state is found. The dynamics of particle laden flows are hence determined by two competinginstabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle inducedglobally fluctuating state at high, and a coexistence state at intermediate concentrations.","lang":"eng"}],"external_id":{"isi":["000461922000006"],"arxiv":["1809.06358"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.06358"}],"isi":1,"quality_controlled":"1","doi":"10.1103/PhysRevLett.122.114502","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00319007"],"eissn":["10797114"]},"month":"03","year":"2019","publisher":"American Physical Society","department":[{"_id":"BjHo"}],"publication_status":"published","related_material":{"record":[{"id":"9728","status":"public","relation":"dissertation_contains"}]},"author":[{"id":"469E6004-F248-11E8-B48F-1D18A9856A87","first_name":"Nishchal","last_name":"Agrawal","full_name":"Agrawal, Nishchal"},{"id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","first_name":"George H","last_name":"Choueiri","full_name":"Choueiri, George H"},{"orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn"}],"volume":122,"date_created":"2019-03-31T21:59:12Z","date_updated":"2024-03-27T23:30:47Z","article_number":"114502"},{"doi":"10.15479/AT:ISTA:6371","supervisor":[{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"oa":1,"project":[{"name":"Design principles underlying genetic switch architecture (DOC Fellowship)","grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425"}],"month":"05","publication_identifier":{"issn":["2663-337X"]},"author":[{"full_name":"Igler, Claudia","first_name":"Claudia","last_name":"Igler","id":"46613666-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"67","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"popular_science","id":"5585"}]},"date_updated":"2024-02-21T13:45:52Z","date_created":"2019-05-03T11:55:51Z","year":"2019","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"CaGu"}],"file_date_updated":"2021-02-11T11:17:13Z","date_published":"2019-05-03T00:00:00Z","citation":{"ama":"Igler C. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. 2019. doi:10.15479/AT:ISTA:6371","ista":"Igler C. 2019. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria.","ieee":"C. Igler, “On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation,” Institute of Science and Technology Austria, 2019.","apa":"Igler, C. (2019). On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6371","mla":"Igler, Claudia. On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6371.","short":"C. Igler, On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation, Institute of Science and Technology Austria, 2019.","chicago":"Igler, Claudia. “On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6371."},"page":"152","day":"03","article_processing_charge":"No","has_accepted_license":"1","keyword":["gene regulation","biophysics","transcription factor binding","bacteria"],"oa_version":"Published Version","file":[{"date_created":"2019-05-03T11:54:52Z","date_updated":"2021-02-11T11:17:13Z","checksum":"c0085d47c58c9cbcab1b0a783480f6da","relation":"main_file","embargo":"2020-05-02","file_id":"6373","content_type":"application/pdf","file_size":12597663,"creator":"cigler","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf","access_level":"open_access"},{"relation":"source_file","file_id":"6374","date_updated":"2020-07-14T12:47:28Z","date_created":"2019-05-03T11:54:54Z","checksum":"2eac954de1c8bbf7e6fb35ed0221ae8c","embargo_to":"open_access","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx","access_level":"closed","file_size":34644426,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"cigler"}],"_id":"6371","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation","status":"public","ddc":["576","579"],"abstract":[{"lang":"eng","text":"Decades of studies have revealed the mechanisms of gene regulation in molecular detail. We make use of such well-described regulatory systems to explore how the molecular mechanisms of protein-protein and protein-DNA interactions shape the dynamics and evolution of gene regulation. \r\n\r\ni) We uncover how the biophysics of protein-DNA binding determines the potential of regulatory networks to evolve and adapt, which can be captured using a simple mathematical model. \r\nii) The evolution of regulatory connections can lead to a significant amount of crosstalk between binding proteins. We explore the effect of crosstalk on gene expression from a target promoter, which seems to be modulated through binding competition at non-specific DNA sites. \r\niii) We investigate how the very same biophysical characteristics as in i) can generate significant fitness costs for cells through global crosstalk, meaning non-specific DNA binding across the genomic background. \r\niv) Binding competition between proteins at a target promoter is a prevailing regulatory feature due to the prevalence of co-regulation at bacterial promoters. However, the dynamics of these systems are not always straightforward to determine even if the molecular mechanisms of regulation are known. A detailed model of the biophysical interactions reveals that interference between the regulatory proteins can constitute a new, generic form of system memory that records the history of the input signals at the promoter. \r\n\r\nWe demonstrate how the biophysics of protein-DNA binding can be harnessed to investigate the principles that shape and ultimately limit cellular gene regulation. These results provide a basis for studies of higher-level functionality, which arises from the underlying regulation. \r\n"}],"type":"dissertation","alternative_title":["ISTA Thesis"]},{"citation":{"ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242. doi:10.13154/tches.v2018.i3.214-242","chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research, 2018. https://doi.org/10.13154/tches.v2018.i3.214-242.","mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242."},"publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","page":"214-242","article_type":"original","date_published":"2018-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10286","intvolume":" 2018","ddc":["000"],"status":"public","title":"Evaluation and monitoring of free running oscillators serving as source of randomness","oa_version":"Published Version","file":[{"success":1,"checksum":"b816b848f046c48a8357700d9305dce5","date_created":"2021-11-15T10:27:29Z","date_updated":"2021-11-15T10:27:29Z","file_id":"10289","relation":"main_file","creator":"cchlebak","content_type":"application/pdf","file_size":955755,"access_level":"open_access","file_name":"2018_IACR_Allini.pdf"}],"type":"journal_article","issue":"3","abstract":[{"text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.","lang":"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,"quality_controlled":"1","doi":"10.13154/tches.v2018.i3.214-242","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2569-2925"]},"month":"01","year":"2018","publisher":"International Association for Cryptologic Research","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"last_name":"Allini","first_name":"Elie Noumon","full_name":"Allini, Elie Noumon"},{"first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"},{"full_name":"Petura, Oto","first_name":"Oto","last_name":"Petura"},{"first_name":"Florent","last_name":"Bernard","full_name":"Bernard, Florent"},{"full_name":"Laban, Marek","last_name":"Laban","first_name":"Marek"},{"last_name":"Fischer","first_name":"Viktor","full_name":"Fischer, Viktor"}],"volume":2018,"date_created":"2021-11-14T23:01:25Z","date_updated":"2021-11-15T10:48:49Z","file_date_updated":"2021-11-15T10:27:29Z"},{"date_published":"2018-10-23T00:00:00Z","page":"233-253","publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k.","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k"},"day":"23","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"file_size":720893,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_EPiCs_Chatterjee.pdf","checksum":"1229aa8640bd6db610c85decf2265480","success":1,"date_created":"2022-05-17T07:51:08Z","date_updated":"2022-05-17T07:51:08Z","relation":"main_file","file_id":"11392"}],"status":"public","title":"Quasipolynomial set-based symbolic algorithms for parity games","ddc":["000"],"intvolume":" 57","_id":"10883","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","abstract":[{"lang":"eng","text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space."}],"alternative_title":["EPiC Series in Computing"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning","end_date":"2018-11-21","start_date":"2018-11-17","location":"Awassa, Ethiopia"},"doi":"10.29007/5z5k","quality_controlled":"1","project":[{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"oa":1,"external_id":{"arxiv":["1909.04983"]},"month":"10","publication_identifier":{"issn":["2398-7340"]},"date_updated":"2022-07-29T09:24:31Z","date_created":"2022-03-18T12:46:32Z","volume":57,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Dvořák, Wolfgang","first_name":"Wolfgang","last_name":"Dvořák"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"last_name":"Svozil","first_name":"Alexander","full_name":"Svozil, Alexander"}],"publication_status":"published","publisher":"EasyChair","department":[{"_id":"KrCh"}],"year":"2018","acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","file_date_updated":"2022-05-17T07:51:08Z","ec_funded":1},{"month":"10","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1806.10843"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.10843"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-01602-9_9","conference":{"location":"Munich, Germany","start_date":"2017-03-30","end_date":"2017-04-01","name":"MaLiQS: Macroscopic Limits of Quantum Systems"},"publist_id":"8045","ec_funded":1,"department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","year":"2018","volume":270,"date_updated":"2021-01-12T06:48:16Z","date_created":"2018-12-11T11:44:08Z","author":[{"last_name":"Leopold","first_name":"Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K"},{"full_name":"Pickl, Peter","last_name":"Pickl","first_name":"Peter"}],"scopus_import":1,"day":"27","page":"185 - 214","citation":{"chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9.","short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","mla":"Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp. 185–214, doi:10.1007/978-3-030-01602-9_9.","ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","apa":"Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. https://doi.org/10.1007/978-3-030-01602-9_9","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.","ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9"},"date_published":"2018-10-27T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm."}],"intvolume":" 270","title":"Mean-field limits of particles in interaction with quantised radiation fields","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11","oa_version":"Preprint"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1215","intvolume":" 31","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","status":"public","ddc":["519"],"pubrep_id":"712","file":[{"relation":"main_file","file_id":"5266","checksum":"47686d58ec21c164540f1a980ff2163f","date_updated":"2020-07-14T12:44:39Z","date_created":"2018-12-12T10:17:13Z","access_level":"open_access","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","content_type":"application/pdf","file_size":671125,"creator":"system"}],"oa_version":"Published Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus."}],"citation":{"chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2.","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","apa":"Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018.","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2"},"publication":"Journal of Theoretical Probability","page":"789-826","date_published":"2018-06-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","year":"2018","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","publisher":"Springer","department":[{"_id":"JaMa"}],"publication_status":"published","author":[{"first_name":"Franco","last_name":"Flandoli","full_name":"Flandoli, Franco"},{"full_name":"Russo, Francesco","last_name":"Russo","first_name":"Francesco"},{"id":"47491882-F248-11E8-B48F-1D18A9856A87","first_name":"Giovanni A","last_name":"Zanco","full_name":"Zanco, Giovanni A"}],"volume":31,"date_created":"2018-12-11T11:50:45Z","date_updated":"2021-01-12T06:49:09Z","publist_id":"6119","file_date_updated":"2020-07-14T12:44:39Z","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"},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"quality_controlled":"1","doi":"10.1007/s10959-016-0724-2","language":[{"iso":"eng"}],"month":"06"},{"oa_version":"Published Version","file":[{"file_name":"2018_LIPIcs_Fulek.pdf","access_level":"open_access","content_type":"application/pdf","file_size":718857,"creator":"dernst","relation":"main_file","file_id":"5701","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-17T12:33:52Z","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c"}],"intvolume":" 99","ddc":["510"],"status":"public","title":"Hanani-Tutte for approximating maps of graphs","_id":"185","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.","lang":"eng"}],"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"type":"conference","date_published":"2018-01-01T00:00:00Z","citation":{"short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.","ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39","apa":"Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39","ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39."},"has_accepted_license":"1","day":"01","scopus_import":1,"volume":99,"date_updated":"2021-01-12T06:53:36Z","date_created":"2018-12-11T11:45:04Z","author":[{"first_name":"Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav"},{"full_name":"Kynčl, Jan","first_name":"Jan","last_name":"Kynčl"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2018","publist_id":"7735","file_date_updated":"2020-07-14T12:45:19Z","article_number":"39","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2018.39","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"project":[{"name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF","grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","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"},"publication_identifier":{"isbn":["978-3-95977-066-8"]},"month":"01"},{"type":"conference","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"abstract":[{"lang":"eng","text":"Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"188","ddc":["000"],"status":"public","title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","intvolume":" 99","file":[{"file_id":"5724","relation":"main_file","checksum":"7509403803b3ac1aee94bbc2ad293d21","date_created":"2018-12-17T16:31:31Z","date_updated":"2020-07-14T12:45:20Z","access_level":"open_access","file_name":"2018_LIPIcs_Edelsbrunner.pdf","creator":"dernst","content_type":"application/pdf","file_size":489080}],"oa_version":"Published Version","scopus_import":1,"day":"11","has_accepted_license":"1","citation":{"short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.","mla":"Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35.","ama":"Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13."},"page":"35:1 - 35:13","date_published":"2018-06-11T00:00:00Z","file_date_updated":"2020-07-14T12:45:20Z","publist_id":"7733","year":"2018","acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga"},{"full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Hubert"}],"date_created":"2018-12-11T11:45:05Z","date_updated":"2021-01-12T06:53:48Z","volume":99,"month":"06","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"},"quality_controlled":"1","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"doi":"10.4230/LIPIcs.SoCG.2018.35","language":[{"iso":"eng"}]},{"file_date_updated":"2020-07-14T12:45:59Z","ec_funded":1,"article_number":"e00596","author":[{"full_name":"De Martino, Andrea","last_name":"De Martino","first_name":"Andrea"},{"full_name":"De Martino, Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5214-4706","first_name":"Daniele","last_name":"De Martino"}],"date_updated":"2021-01-12T07:40:46Z","date_created":"2018-12-11T11:45:44Z","volume":4,"year":"2018","publication_status":"published","publisher":"Elsevier","department":[{"_id":"GaTk"}],"month":"04","doi":"10.1016/j.heliyon.2018.e00596","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,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"abstract":[{"text":"A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data.","lang":"eng"}],"issue":"4","type":"journal_article","oa_version":"Published Version","file":[{"creator":"dernst","file_size":994490,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_Heliyon_DeMartino.pdf","checksum":"67010cf5e3b3e0637c659371714a715a","date_created":"2019-02-06T07:36:24Z","date_updated":"2020-07-14T12:45:59Z","file_id":"5929","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"306","ddc":["530"],"status":"public","title":"An introduction to the maximum entropy approach and its application to inference problems in biology","intvolume":" 4","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2018-04-01T00:00:00Z","publication":"Heliyon","citation":{"short":"A. De Martino, D. De Martino, Heliyon 4 (2018).","mla":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon, vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596.","chicago":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon. Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596.","ama":"De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 2018;4(4). doi:10.1016/j.heliyon.2018.e00596","apa":"De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596","ieee":"A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” Heliyon, vol. 4, no. 4. Elsevier, 2018.","ista":"De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596."}},{"day":"16","has_accepted_license":"1","article_processing_charge":"No","series_title":"MIMB","scopus_import":"1","date_published":"2018-10-16T00:00:00Z","page":"47 - 63","publication":"Morphogen Gradients ","citation":{"mla":"Zagórski, Marcin P., and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63, doi:10.1007/978-1-4939-8772-6_4.","short":"M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018, pp. 47–63.","chicago":"Zagórski, Marcin P, and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” In Morphogen Gradients , 1863:47–63. MIMB. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-8772-6_4.","ama":"Zagórski MP, Kicheva A. Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Vol 1863. MIMB. Springer Nature; 2018:47-63. doi:10.1007/978-1-4939-8772-6_4","ista":"Zagórski MP, Kicheva A. 2018.Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Methods in Molecular Biology, vol. 1863, 47–63.","ieee":"M. P. Zagórski and A. Kicheva, “Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube,” in Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63.","apa":"Zagórski, M. P., & Kicheva, A. (2018). Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In Morphogen Gradients (Vol. 1863, pp. 47–63). Springer Nature. https://doi.org/10.1007/978-1-4939-8772-6_4"},"abstract":[{"text":"Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube.","lang":"eng"}],"alternative_title":["Methods in Molecular Biology"],"type":"book_chapter","file":[{"access_level":"open_access","file_name":"2018_MIMB_Zagorski.pdf","file_size":4906815,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"8656","checksum":"2a97d0649fdcfcf1bdca7c8ad1dce71b","success":1,"date_created":"2020-10-13T14:20:37Z","date_updated":"2020-10-13T14:20:37Z"}],"oa_version":"Submitted Version","ddc":["570"],"status":"public","title":"Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube","intvolume":" 1863","_id":"37","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","publication_identifier":{"issn":["1064-3745"],"isbn":["978-1-4939-8771-9"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-1-4939-8772-6_4","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037"}],"oa":1,"file_date_updated":"2020-10-13T14:20:37Z","ec_funded":1,"publist_id":"8018","date_updated":"2021-01-12T07:49:03Z","date_created":"2018-12-11T11:44:17Z","volume":1863,"author":[{"full_name":"Zagórski, Marcin P","first_name":"Marcin P","last_name":"Zagórski","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7896-7762"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna"}],"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"AnKi"}],"year":"2018"},{"external_id":{"arxiv":["1709.04037"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1709.04037","open_access":"1"}],"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"conference":{"end_date":"2018-01-13","location":"Los Angeles, CA, USA","start_date":"2018-01-07","name":"POPL: Principles of Programming Languages"},"doi":"10.1145/3158122","language":[{"iso":"eng"}],"month":"01","year":"2018","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"ACM","author":[{"full_name":"Agrawal, Sheshansh","first_name":"Sheshansh","last_name":"Agrawal"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"}],"date_updated":"2021-01-12T07:42:07Z","date_created":"2018-12-11T11:45:50Z","volume":2,"article_number":"34","publist_id":"7540","citation":{"ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.","ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.","apa":"Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122","chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.","mla":"Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.","short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018."},"date_published":"2018-01-01T00:00:00Z","day":"01","_id":"325","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","status":"public","intvolume":" 2","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach."}],"issue":"POPL"},{"publication_status":"published","department":[{"_id":"E-Lib"}],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","year":"2018","date_updated":"2021-01-12T08:01:26Z","date_created":"2018-12-11T11:44:22Z","volume":71,"author":[{"id":"406048EC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2724-4614","first_name":"Barbara","last_name":"Petritsch","full_name":"Petritsch, Barbara"},{"full_name":"Porsche, Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","first_name":"Jana","last_name":"Porsche"}],"file_date_updated":"2020-07-14T12:46:38Z","publist_id":"8001","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.31263/voebm.v71i1.1993","month":"10","title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","status":"public","ddc":["020"],"intvolume":" 71","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"53","file":[{"checksum":"7ac61bade5f37db011ca435ebcf86797","date_updated":"2020-07-14T12:46:38Z","date_created":"2018-12-17T12:40:27Z","file_id":"5702","relation":"main_file","creator":"dernst","file_size":509434,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_VOEB_Petritsch.pdf"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation."}],"issue":"1","page":"199 - 206","publication":"VÖB Mitteilungen","citation":{"ieee":"B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.","apa":"Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993","ista":"Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.","ama":"Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993","chicago":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993.","short":"B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.","mla":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993."},"date_published":"2018-10-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1"},{"oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":595707,"file_name":"2017_DistribComp_Alistarh.pdf","access_level":"open_access","date_created":"2019-01-22T07:25:51Z","date_updated":"2020-07-14T12:46:38Z","checksum":"69b46e537acdcac745237ddb853fcbb5","file_id":"5867","relation":"main_file"}],"status":"public","title":"Communication-efficient randomized consensus","ddc":["000"],"intvolume":" 31","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"536","abstract":[{"text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.","lang":"eng"}],"issue":"6","type":"journal_article","date_published":"2018-11-01T00:00:00Z","page":"489-501","publication":"Distributed Computing","citation":{"short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.","ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1","apa":"Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1","ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501."},"day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":1,"date_created":"2018-12-11T11:47:01Z","date_updated":"2023-02-23T12:23:25Z","volume":31,"author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"full_name":"King, Valerie","first_name":"Valerie","last_name":"King"},{"first_name":"Jared","last_name":"Saia","full_name":"Saia, Jared"}],"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Springer","year":"2018","file_date_updated":"2020-07-14T12:46:38Z","publist_id":"7281","language":[{"iso":"eng"}],"doi":"10.1007/s00446-017-0315-1","quality_controlled":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"11","publication_identifier":{"issn":["01782770"]}},{"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1511.05953","open_access":"1"}],"external_id":{"arxiv":["1511.05953"]},"project":[{"grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF"}],"quality_controlled":"1","doi":"10.1007/s00220-017-3064-x","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00103616"]},"month":"05","year":"2018","department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","author":[{"last_name":"Napiórkowski","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M"},{"full_name":"Reuvers, Robin","first_name":"Robin","last_name":"Reuvers"},{"full_name":"Solovej, Jan","first_name":"Jan","last_name":"Solovej"}],"volume":360,"date_updated":"2021-01-12T08:02:35Z","date_created":"2018-12-11T11:47:09Z","publist_id":"7260","citation":{"chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.","short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x.","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x","ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.","ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.","ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x"},"publication":"Communications in Mathematical Physics","page":"347-403","date_published":"2018-05-01T00:00:00Z","scopus_import":1,"day":"01","_id":"554","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 360","status":"public","title":"The Bogoliubov free energy functional II: The dilute Limit","oa_version":"Submitted Version","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.)."}]},{"pmid":1,"year":"2018","department":[{"_id":"RySh"}],"editor":[{"full_name":"Skaper, Stephen D.","last_name":"Skaper","first_name":"Stephen D."}],"publisher":"Springer","publication_status":"published","author":[{"last_name":"Dimitrov","first_name":"Dimitar","full_name":"Dimitrov, Dimitar"},{"last_name":"Guillaud","first_name":"Laurent","full_name":"Guillaud, Laurent"},{"id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6170-2546","first_name":"Kohgaku","last_name":"Eguchi","full_name":"Eguchi, Kohgaku"},{"first_name":"Tomoyuki","last_name":"Takahashi","full_name":"Takahashi, Tomoyuki"}],"volume":1727,"date_updated":"2021-01-12T08:03:05Z","date_created":"2018-12-11T11:47:11Z","publist_id":"7252","file_date_updated":"2020-07-14T12:47:09Z","oa":1,"external_id":{"pmid":["29222783"]},"quality_controlled":"1","doi":"10.1007/978-1-4939-7571-6_15","language":[{"iso":"eng"}],"month":"01","_id":"562","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 1727","ddc":["570"],"title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","status":"public","file":[{"checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd","date_updated":"2020-07-14T12:47:09Z","date_created":"2019-11-19T07:47:43Z","file_id":"7046","relation":"main_file","creator":"dernst","file_size":787407,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_NeurotrophicFactors_Dimitrov.pdf"}],"oa_version":"Submitted Version","type":"book_chapter","alternative_title":["Methods in Molecular Biology"],"abstract":[{"text":"Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals.","lang":"eng"}],"citation":{"short":"D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215.","mla":"Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” Neurotrophic Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15, doi:10.1007/978-1-4939-7571-6_15.","chicago":"Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” In Neurotrophic Factors, edited by Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15.","ama":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215. doi:10.1007/978-1-4939-7571-6_15","ieee":"D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer, 2018, pp. 201–215.","apa":"Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors (Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15","ista":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215."},"publication":"Neurotrophic Factors","page":"201 - 215","date_published":"2018-01-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"01"}]