[{"ddc":["000"],"abstract":[{"text":"In this thesis we discuss the exact security of message authentications codes HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). PMAC is a block-cipher based mode of operation, which also happens to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, under two assumptions. Unfortunately, for many instantiations of HMAC one of them has been found to be wrong. To restore the provable guarantees for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure variable input-length PRF. For adversaries making q queries, each of length at most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one initially XORs a mask to every message block, where the mask for the i th block is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is the i -th codeword of the Gray code. Our attack applies more generally to any sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As for NMAC , our first contribution is a simpler and uniform proof: If f is an ε -secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length at most ` blocks each. We also show that this ε + `qδ bound is basically tight by constructing an f for which an attack with advantage `qδ exists. Moreover, we analyze the PRF-security of a modification of NMAC called NI by An and Bellare that avoids the constant rekeying on multi-block messages in NMAC and allows for an information-theoretic analysis. We carry out such an analysis, obtaining a tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2 q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved by using τ i ’s that are k -wise independent, for k &gt; 1 (the original has k = 1). We observe that the security of PMAC will not increase in general if k = 2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether k = 3 is already sufficient to get this level of security is left as an open problem. Keywords: Message authentication codes, Pseudorandom functions, HMAC, PMAC. ","lang":"eng"}],"publication_status":"published","title":"(The exact security of) Message authentication codes","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:48:12Z","date_published":"2017-06-26T00:00:00Z","citation":{"ama":"Rybar M. (The exact security of) Message authentication codes. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_828\">10.15479/AT:ISTA:th_828</a>","ista":"Rybar M. 2017. (The exact security of) Message authentication codes. Institute of Science and Technology Austria.","chicago":"Rybar, Michal. “(The Exact Security of) Message Authentication Codes.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_828\">https://doi.org/10.15479/AT:ISTA:th_828</a>.","apa":"Rybar, M. (2017). <i>(The exact security of) Message authentication codes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_828\">https://doi.org/10.15479/AT:ISTA:th_828</a>","ieee":"M. Rybar, “(The exact security of) Message authentication codes,” Institute of Science and Technology Austria, 2017.","mla":"Rybar, Michal. <i>(The Exact Security of) Message Authentication Codes</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_828\">10.15479/AT:ISTA:th_828</a>.","short":"M. Rybar, (The Exact Security of) Message Authentication Codes, Institute of Science and Technology Austria, 2017."},"date_updated":"2023-09-07T12:02:28Z","department":[{"_id":"KrPi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","related_material":{"record":[{"id":"2082","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"6196","relation":"part_of_dissertation"}]},"publist_id":"6810","oa":1,"year":"2017","doi":"10.15479/AT:ISTA:th_828","page":"86","day":"26","file":[{"file_name":"IST-2017-828-v1+3_2017_Rybar_thesis.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:10:13Z","date_updated":"2020-07-14T12:48:12Z","file_id":"4799","checksum":"ff8639ec4bded6186f44c7bd3ee26804","creator":"system","access_level":"open_access","file_size":847400,"relation":"main_file"},{"content_type":"application/zip","date_created":"2019-04-05T08:24:11Z","date_updated":"2020-07-14T12:48:12Z","file_name":"2017_Thesis_Rybar_source.zip","relation":"source_file","file_id":"6202","checksum":"3462101745ce8ad199c2d0f75dae4a7e","creator":"dernst","access_level":"closed","file_size":26054879}],"month":"06","has_accepted_license":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","author":[{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","full_name":"Rybar, Michal","last_name":"Rybar","first_name":"Michal"}],"pubrep_id":"828","_id":"838","type":"dissertation","date_created":"2018-12-11T11:48:46Z","status":"public","publication_identifier":{"issn":["2663-337X"]}},{"license":"https://creativecommons.org/licenses/by-sa/4.0/","status":"public","publication_identifier":{"issn":["2663-337X"]},"_id":"839","type":"dissertation","date_created":"2018-12-11T11:48:47Z","ec_funded":1,"pubrep_id":"855","author":[{"id":"357A6A66-F248-11E8-B48F-1D18A9856A87","full_name":"Hahn, David","first_name":"David","last_name":"Hahn"}],"oa_version":"Published Version","project":[{"call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:14:46Z","date_updated":"2020-07-14T12:48:13Z","content_type":"application/pdf","file_name":"IST-2017-855-v1+1_thesis_online_pdfA.pdf","relation":"main_file","access_level":"open_access","file_size":14596191,"file_id":"5100","checksum":"6c1ae8c90bfaba5e089417fefbc4a272","creator":"system"},{"content_type":"application/zip","date_created":"2019-04-05T08:40:30Z","date_updated":"2020-07-14T12:48:13Z","file_name":"2017_thesis_Hahn_source.zip","relation":"source_file","checksum":"421672f68d563b029869c5cf1713f919","file_id":"6207","creator":"dernst","access_level":"closed","file_size":15060566}],"has_accepted_license":"1","month":"08","year":"2017","day":"14","doi":"10.15479/AT:ISTA:th_855","page":"124","acknowledgement":"ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all, let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for supporting me throughout my PhD. Obviously, none of this work would\r\nhave been possible without you.\r\nFurthermore, Thank You to all the people who have contributed to this work in various\r\nways, in particular Martin Schanz and his group for providing and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel, and all the members – past and present – of his\r\nand Chris’ research groups at IST Austria for always providing honest and insightful\r\nfeedback throughout many joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs only virtual objects have been harmed in the process of creating this work, I would\r\nlike to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo” models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different ways.\r\n","oa":1,"publist_id":"6809","related_material":{"record":[{"status":"public","id":"1362","relation":"part_of_dissertation"},{"status":"public","id":"1633","relation":"part_of_dissertation"},{"status":"public","relation":"popular_science","id":"5568"}]},"supervisor":[{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan"}],"alternative_title":["ISTA Thesis"],"tmp":{"image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","degree_awarded":"PhD","citation":{"apa":"Hahn, D. (2017). <i>Brittle fracture simulation with boundary elements for computer graphics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">https://doi.org/10.15479/AT:ISTA:th_855</a>","ama":"Hahn D. Brittle fracture simulation with boundary elements for computer graphics. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">10.15479/AT:ISTA:th_855</a>","chicago":"Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer Graphics.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">https://doi.org/10.15479/AT:ISTA:th_855</a>.","ista":"Hahn D. 2017. Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria.","ieee":"D. Hahn, “Brittle fracture simulation with boundary elements for computer graphics,” Institute of Science and Technology Austria, 2017.","short":"D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer Graphics, Institute of Science and Technology Austria, 2017.","mla":"Hahn, David. <i>Brittle Fracture Simulation with Boundary Elements for Computer Graphics</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">10.15479/AT:ISTA:th_855</a>."},"department":[{"_id":"ChWo"}],"date_updated":"2024-02-21T13:48:02Z","title":"Brittle fracture simulation with boundary elements for computer graphics","date_published":"2017-08-14T00:00:00Z","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:48:13Z","ddc":["004","005","006","531","621"],"publication_status":"published","abstract":[{"text":"This thesis describes a brittle fracture simulation method for visual effects applications. Building upon a symmetric Galerkin boundary element method, we first compute stress intensity factors following the theory of linear elastic fracture mechanics. We then use these stress intensities to simulate the motion of a propagating crack front at a significantly higher resolution than the overall deformation of the breaking object. Allowing for spatial variations of the material's toughness during crack propagation produces visually realistic, highly-detailed fracture surfaces. Furthermore, we introduce approximations for stress intensities and crack opening displacements, resulting in both practical speed-up and theoretically superior runtime complexity compared to previous methods. While we choose a quasi-static approach to fracture mechanics, ignoring dynamic deformations, we also couple our fracture simulation framework to a standard rigid-body dynamics solver, enabling visual effects artists to simulate both large scale motion, as well as fracturing due to collision forces in a combined system. As fractures inside of an object grow, their geometry must be represented both in the coarse boundary element mesh, as well as at the desired fine output resolution. Using a boundary element method, we avoid complicated volumetric meshing operations. Instead we describe a simple set of surface meshing operations that allow us to progressively add cracks to the mesh of an object and still re-use all previously computed entries of the linear boundary element system matrix. On the high resolution level, we opt for an implicit surface representation. We then describe how to capture fracture surfaces during crack propagation, as well as separate the individual fragments resulting from the fracture process, based on this implicit representation. We show results obtained with our method, either solving the full boundary element system in every time step, or alternatively using our fast approximations. These results demonstrate that both of these methods perform well in basic test cases and produce realistic fracture surfaces. Furthermore we show that our fast approximations substantially out-perform the standard approach in more demanding scenarios. Finally, these two methods naturally combine, using the full solution while the problem size is manageably small and switching to the fast approximations later on. The resulting hybrid method gives the user a direct way to choose between speed and accuracy of the simulation. ","lang":"eng"}]},{"article_processing_charge":"No","acknowledged_ssus":[{"_id":"M-Shop"}],"volume":17,"language":[{"iso":"eng"}],"issue":"9","file":[{"file_size":2449546,"access_level":"open_access","creator":"system","file_id":"4951","checksum":"761371a0129b2aa442424b9561450ece","relation":"main_file","file_name":"IST-2017-865-v1+1_acs.nanolett.7b02627.pdf","date_updated":"2020-07-14T12:48:13Z","date_created":"2018-12-12T10:12:33Z","content_type":"application/pdf"}],"month":"08","has_accepted_license":"1","author":[{"full_name":"Vukusic, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","last_name":"Vukusic","first_name":"Lada"},{"last_name":"Kukucka","first_name":"Josip","full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hannes","last_name":"Watzinger","full_name":"Watzinger, Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Katsaros","first_name":"Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios"}],"oa_version":"Published Version","project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497","_id":"25517E86-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","ec_funded":1,"pubrep_id":"865","status":"public","publication_identifier":{"issn":["15306984"]},"type":"journal_article","_id":"840","date_created":"2018-12-11T11:48:47Z","title":"Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry","publisher":"American Chemical Society","date_published":"2017-08-10T00:00:00Z","file_date_updated":"2020-07-14T12:48:13Z","isi":1,"ddc":["539"],"abstract":[{"text":"Heavy holes confined in quantum dots are predicted to be promising candidates for the realization of spin qubits with long coherence times. Here we focus on such heavy-hole states confined in germanium hut wires. By tuning the growth density of the latter we can realize a T-like structure between two neighboring wires. Such a structure allows the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot, with charge-transfer signals as high as 0.3 e. By integrating the T-like structure into a radiofrequency reflectometry setup, single-shot measurements allowing the extraction of hole tunneling times are performed. The extracted tunneling times of less than 10 μs are attributed to the small effective mass of Ge heavy-hole states and pave the way toward projective spin readout measurements.","lang":"eng"}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["000411043500078"]},"citation":{"mla":"Vukušić, Lada, et al. “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.” <i>Nano Letters</i>, vol. 17, no. 9, American Chemical Society, 2017, pp. 5706–10, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">10.1021/acs.nanolett.7b02627</a>.","short":"L. Vukušić, J. Kukucka, H. Watzinger, G. Katsaros, Nano Letters 17 (2017) 5706–5710.","ieee":"L. Vukušić, J. Kukucka, H. Watzinger, and G. Katsaros, “Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry,” <i>Nano Letters</i>, vol. 17, no. 9. American Chemical Society, pp. 5706–5710, 2017.","chicago":"Vukušić, Lada, Josip Kukucka, Hannes Watzinger, and Georgios Katsaros. “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.” <i>Nano Letters</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">https://doi.org/10.1021/acs.nanolett.7b02627</a>.","ista":"Vukušić L, Kukucka J, Watzinger H, Katsaros G. 2017. Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. Nano Letters. 17(9), 5706–5710.","ama":"Vukušić L, Kukucka J, Watzinger H, Katsaros G. Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. <i>Nano Letters</i>. 2017;17(9):5706-5710. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">10.1021/acs.nanolett.7b02627</a>","apa":"Vukušić, L., Kukucka, J., Watzinger, H., &#38; Katsaros, G. (2017). Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">https://doi.org/10.1021/acs.nanolett.7b02627</a>"},"date_updated":"2023-09-26T15:50:22Z","department":[{"_id":"GeKa"}],"publication":"Nano Letters","intvolume":"        17","publist_id":"6808","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"status":"public","relation":"dissertation_contains","id":"69"},{"relation":"dissertation_contains","id":"7996","status":"public"}]},"scopus_import":"1","page":"5706 - 5710","doi":"10.1021/acs.nanolett.7b02627","year":"2017","day":"10","oa":1},{"intvolume":"       167","arxiv":1,"publication":"Duke Mathematical Journal","day":"08","doi":"10.1215/00127094-2017-0038","page":"175-209","year":"2017","oa":1,"date_published":"2017-12-08T00:00:00Z","publisher":"Duke University Press","title":"On the marked length spectrum of generic strictly convex billiard tables","abstract":[{"lang":"eng","text":"In this paper we show that for a generic strictly convex domain, one can recover the eigendata corresponding to Aubry–Mather periodic orbits of the induced billiard map from the (maximal) marked length spectrum of the domain."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1603.08838"]},"date_updated":"2021-01-12T08:19:11Z","extern":"1","citation":{"ista":"Huang G, Kaloshin V, Sorrentino A. 2017. On the marked length spectrum of generic strictly convex billiard tables. Duke Mathematical Journal. 167(1), 175–209.","ama":"Huang G, Kaloshin V, Sorrentino A. On the marked length spectrum of generic strictly convex billiard tables. <i>Duke Mathematical Journal</i>. 2017;167(1):175-209. doi:<a href=\"https://doi.org/10.1215/00127094-2017-0038\">10.1215/00127094-2017-0038</a>","chicago":"Huang, Guan, Vadim Kaloshin, and Alfonso Sorrentino. “On the Marked Length Spectrum of Generic Strictly Convex Billiard Tables.” <i>Duke Mathematical Journal</i>. Duke University Press, 2017. <a href=\"https://doi.org/10.1215/00127094-2017-0038\">https://doi.org/10.1215/00127094-2017-0038</a>.","apa":"Huang, G., Kaloshin, V., &#38; Sorrentino, A. (2017). On the marked length spectrum of generic strictly convex billiard tables. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2017-0038\">https://doi.org/10.1215/00127094-2017-0038</a>","ieee":"G. Huang, V. Kaloshin, and A. Sorrentino, “On the marked length spectrum of generic strictly convex billiard tables,” <i>Duke Mathematical Journal</i>, vol. 167, no. 1. Duke University Press, pp. 175–209, 2017.","mla":"Huang, Guan, et al. “On the Marked Length Spectrum of Generic Strictly Convex Billiard Tables.” <i>Duke Mathematical Journal</i>, vol. 167, no. 1, Duke University Press, 2017, pp. 175–209, doi:<a href=\"https://doi.org/10.1215/00127094-2017-0038\">10.1215/00127094-2017-0038</a>.","short":"G. Huang, V. Kaloshin, A. Sorrentino, Duke Mathematical Journal 167 (2017) 175–209."},"status":"public","publication_identifier":{"issn":["0012-7094"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1603.08838"}],"date_created":"2020-09-17T10:42:42Z","type":"journal_article","_id":"8423","article_type":"original","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":167,"month":"12","issue":"1","author":[{"first_name":"Guan","last_name":"Huang","full_name":"Huang, Guan"},{"full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","last_name":"Kaloshin","first_name":"Vadim"},{"full_name":"Sorrentino, Alfonso","last_name":"Sorrentino","first_name":"Alfonso"}],"quality_controlled":"1","oa_version":"Preprint"},{"publication_identifier":{"issn":["0003-486X"]},"main_file_link":[{"url":"https://arxiv.org/abs/1606.00230","open_access":"1"}],"status":"public","date_created":"2020-09-17T10:46:42Z","article_type":"original","type":"journal_article","_id":"8427","author":[{"full_name":"De Simoi, Jacopo","first_name":"Jacopo","last_name":"De Simoi"},{"id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim","last_name":"Kaloshin","first_name":"Vadim","orcid":"0000-0002-6051-2628"},{"first_name":"Qiaoling","last_name":"Wei","full_name":"Wei, Qiaoling"}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"volume":186,"article_processing_charge":"No","month":"07","issue":"1","day":"01","year":"2017","page":"277-314","doi":"10.4007/annals.2017.186.1.7","oa":1,"arxiv":1,"intvolume":"       186","publication":"Annals of Mathematics","external_id":{"arxiv":["1606.00230"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T08:19:12Z","citation":{"ieee":"J. De Simoi, V. Kaloshin, and Q. Wei, “Dynamical spectral rigidity among Z2-symmetric strictly convex domains close to a circle,” <i>Annals of Mathematics</i>, vol. 186, no. 1. Annals of Mathematics, pp. 277–314, 2017.","apa":"De Simoi, J., Kaloshin, V., &#38; Wei, Q. (2017). Dynamical spectral rigidity among Z2-symmetric strictly convex domains close to a circle. <i>Annals of Mathematics</i>. Annals of Mathematics. <a href=\"https://doi.org/10.4007/annals.2017.186.1.7\">https://doi.org/10.4007/annals.2017.186.1.7</a>","ista":"De Simoi J, Kaloshin V, Wei Q. 2017. Dynamical spectral rigidity among Z2-symmetric strictly convex domains close to a circle. Annals of Mathematics. 186(1), 277–314.","chicago":"De Simoi, Jacopo, Vadim Kaloshin, and Qiaoling Wei. “Dynamical Spectral Rigidity among Z2-Symmetric Strictly Convex Domains Close to a Circle.” <i>Annals of Mathematics</i>. Annals of Mathematics, 2017. <a href=\"https://doi.org/10.4007/annals.2017.186.1.7\">https://doi.org/10.4007/annals.2017.186.1.7</a>.","ama":"De Simoi J, Kaloshin V, Wei Q. Dynamical spectral rigidity among Z2-symmetric strictly convex domains close to a circle. <i>Annals of Mathematics</i>. 2017;186(1):277-314. doi:<a href=\"https://doi.org/10.4007/annals.2017.186.1.7\">10.4007/annals.2017.186.1.7</a>","short":"J. De Simoi, V. Kaloshin, Q. Wei, Annals of Mathematics 186 (2017) 277–314.","mla":"De Simoi, Jacopo, et al. “Dynamical Spectral Rigidity among Z2-Symmetric Strictly Convex Domains Close to a Circle.” <i>Annals of Mathematics</i>, vol. 186, no. 1, Annals of Mathematics, 2017, pp. 277–314, doi:<a href=\"https://doi.org/10.4007/annals.2017.186.1.7\">10.4007/annals.2017.186.1.7</a>."},"publisher":"Annals of Mathematics","date_published":"2017-07-01T00:00:00Z","title":"Dynamical spectral rigidity among Z2-symmetric strictly convex domains close to a circle","publication_status":"published","abstract":[{"lang":"eng","text":"We show that any sufficiently (finitely) smooth ℤ₂-symmetric strictly convex domain sufficiently close to a circle is dynamically spectrally rigid; i.e., all deformations among domains in the same class that preserve the length of all periodic orbits of the associated billiard flow must necessarily be isometric deformations. This gives a partial answer to a question of P. Sarnak."}]},{"citation":{"ieee":"T. D. Browning, V. Kumaraswamy, and R. Steiner, “Twisted Linnik implies optimal covering exponent for S3,” <i>International Mathematics Research Notices</i>. Oxford University Press, 2017.","apa":"Browning, T. D., Kumaraswamy, V., &#38; Steiner, R. (2017). Twisted Linnik implies optimal covering exponent for S3. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnx116\">https://doi.org/10.1093/imrn/rnx116</a>","chicago":"Browning, Timothy D, Vinay Kumaraswamy, and Rapael Steiner. “Twisted Linnik Implies Optimal Covering Exponent for S3.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/imrn/rnx116\">https://doi.org/10.1093/imrn/rnx116</a>.","ama":"Browning TD, Kumaraswamy V, Steiner R. Twisted Linnik implies optimal covering exponent for S3. <i>International Mathematics Research Notices</i>. 2017. doi:<a href=\"https://doi.org/10.1093/imrn/rnx116\">10.1093/imrn/rnx116</a>","ista":"Browning TD, Kumaraswamy V, Steiner R. 2017. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices.","mla":"Browning, Timothy D., et al. “Twisted Linnik Implies Optimal Covering Exponent for S3.” <i>International Mathematics Research Notices</i>, Oxford University Press, 2017, doi:<a href=\"https://doi.org/10.1093/imrn/rnx116\">10.1093/imrn/rnx116</a>.","short":"T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research Notices (2017)."},"oa_version":"None","date_updated":"2021-01-12T06:52:32Z","quality_controlled":"1","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1609.06097"]},"author":[{"orcid":"0000-0002-8314-0177","last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kumaraswamy, Vinay","last_name":"Kumaraswamy","first_name":"Vinay"},{"full_name":"Steiner, Rapael","first_name":"Rapael","last_name":"Steiner"}],"abstract":[{"text":"We show that a twisted variant of Linnik’s conjecture on sums of Kloosterman sums leads to an optimal covering exponent for S3.","lang":"eng"}],"publication_status":"published","month":"06","article_processing_charge":"No","title":"Twisted Linnik implies optimal covering exponent for S3","date_published":"2017-06-19T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Oxford University Press","type":"journal_article","_id":"169","oa":1,"date_created":"2018-12-11T11:44:59Z","year":"2017","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.06097"}],"day":"19","status":"public","doi":"10.1093/imrn/rnx116","publication":"International Mathematics Research Notices","publist_id":"7752","arxiv":1},{"citation":{"ista":"Browning TD, Schindler D. 2017. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices.","chicago":"Browning, Timothy D, and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/imrn/rnx252\">https://doi.org/10.1093/imrn/rnx252</a>.","ama":"Browning TD, Schindler D. Strong approximation and a conjecture of Harpaz and Wittenberg. <i>International Mathematics Research Notices</i>. 2017. doi:<a href=\"https://doi.org/10.1093/imrn/rnx252\">10.1093/imrn/rnx252</a>","apa":"Browning, T. D., &#38; Schindler, D. (2017). Strong approximation and a conjecture of Harpaz and Wittenberg. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnx252\">https://doi.org/10.1093/imrn/rnx252</a>","ieee":"T. D. Browning and D. Schindler, “Strong approximation and a conjecture of Harpaz and Wittenberg,” <i>International Mathematics Research Notices</i>. Oxford University Press, 2017.","short":"T.D. Browning, D. Schindler, International Mathematics Research Notices (2017).","mla":"Browning, Timothy D., and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” <i>International Mathematics Research Notices</i>, Oxford University Press, 2017, doi:<a href=\"https://doi.org/10.1093/imrn/rnx252\">10.1093/imrn/rnx252</a>."},"oa_version":"None","extern":"1","quality_controlled":"1","date_updated":"2021-01-12T06:52:45Z","external_id":{"arxiv":["1509.07744"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"},{"last_name":"Schindler","first_name":"Damaris","full_name":"Schindler, Damaris"}],"month":"10","publication_status":"published","abstract":[{"text":"We study strong approximation for some algebraic varieties over ℚ which are defined using norm forms. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg.","lang":"eng"}],"title":"Strong approximation and a conjecture of Harpaz and Wittenberg","article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Oxford University Press","date_published":"2017-10-30T00:00:00Z","type":"journal_article","_id":"172","date_created":"2018-12-11T11:45:00Z","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1509.07744","open_access":"1"}],"doi":"10.1093/imrn/rnx252","status":"public","day":"30","year":"2017","publication":"International Mathematics Research Notices","arxiv":1,"publist_id":"7749"},{"publication":"Scandinavian Journal of Statistics","arxiv":1,"publist_id":"5060","intvolume":"        44","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6473"}]},"day":"01","year":"2017","page":"285 - 306","doi":"10.1111/sjos.12251","oa":1,"title":"Exact goodness-of-fit testing for the Ising model","publisher":"Wiley-Blackwell","date_published":"2017-06-01T00:00:00Z","isi":1,"publication_status":"published","abstract":[{"lang":"eng","text":"The Ising model is one of the simplest and most famous models of interacting systems. It was originally proposed to model ferromagnetic interactions in statistical physics and is now widely used to model spatial processes in many areas such as ecology, sociology, and genetics, usually without testing its goodness-of-fit. Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model. The theory of Markov bases has been developed in algebraic statistics for exact goodness-of-fit testing using a Monte Carlo approach. However, this beautiful theory has fallen short of its promise for applications, because finding a Markov basis is usually computationally intractable. We develop a Monte Carlo method for exact goodness-of-fit testing for the Ising model which avoids computing a Markov basis and also leads to a better connectivity of the Markov chain and hence to a faster convergence. We show how this method can be applied to analyze the spatial organization of receptors on the cell membrane."}],"external_id":{"isi":["000400985000001"],"arxiv":["1410.1242"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. 2017;44(2):285-306. doi:<a href=\"https://doi.org/10.1111/sjos.12251\">10.1111/sjos.12251</a>","ista":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. 2017. Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of Statistics. 44(2), 285–306.","chicago":"Martin Del Campo Sanchez, Abraham, Sarah A Cepeda Humerez, and Caroline Uhler. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal of Statistics</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/sjos.12251\">https://doi.org/10.1111/sjos.12251</a>.","apa":"Martin Del Campo Sanchez, A., Cepeda Humerez, S. A., &#38; Uhler, C. (2017). Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/sjos.12251\">https://doi.org/10.1111/sjos.12251</a>","ieee":"A. Martin Del Campo Sanchez, S. A. Cepeda Humerez, and C. Uhler, “Exact goodness-of-fit testing for the Ising model,” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2. Wiley-Blackwell, pp. 285–306, 2017.","mla":"Martin Del Campo Sanchez, Abraham, et al. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2, Wiley-Blackwell, 2017, pp. 285–306, doi:<a href=\"https://doi.org/10.1111/sjos.12251\">10.1111/sjos.12251</a>.","short":"A. Martin Del Campo Sanchez, S.A. Cepeda Humerez, C. Uhler, Scandinavian Journal of Statistics 44 (2017) 285–306."},"department":[{"_id":"GaTk"}],"date_updated":"2023-09-19T15:13:27Z","main_file_link":[{"url":"http://arxiv.org/abs/1410.1242","open_access":"1"}],"status":"public","publication_identifier":{"issn":["03036898"]},"_id":"2016","type":"journal_article","date_created":"2018-12-11T11:55:13Z","volume":44,"article_processing_charge":"No","language":[{"iso":"eng"}],"issue":"2","month":"06","author":[{"full_name":"Martin Del Campo Sanchez, Abraham","first_name":"Abraham","last_name":"Martin Del Campo Sanchez"},{"last_name":"Cepeda Humerez","first_name":"Sarah A","full_name":"Cepeda Humerez, Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline"}],"oa_version":"Preprint","quality_controlled":"1"},{"file":[{"checksum":"33cfb59674e91f82e3738396d3fb3776","file_id":"4710","creator":"system","access_level":"open_access","file_size":18569590,"relation":"main_file","file_name":"IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:08:48Z","date_updated":"2020-07-14T12:45:24Z"},{"date_created":"2019-04-05T08:33:14Z","date_updated":"2020-07-14T12:45:24Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"2017_Pleska_Maros_Thesis.docx","relation":"source_file","access_level":"closed","file_size":2801649,"checksum":"dcc239968decb233e7f98cf1083d8c26","file_id":"6204","creator":"dernst"}],"month":"10","has_accepted_license":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"name":"Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level (DOC Fellowship)","_id":"251D65D8-B435-11E9-9278-68D0E5697425","grant_number":"24210"}],"author":[{"orcid":"0000-0001-7460-7479","last_name":"Pleska","first_name":"Maros","full_name":"Pleska, Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"916","_id":"202","type":"dissertation","date_created":"2018-12-11T11:45:10Z","publication_identifier":{"issn":["2663-337X"]},"status":"public","ddc":["576","579"],"abstract":[{"lang":"eng","text":"Restriction-modification (RM) represents the simplest and possibly the most widespread mechanism of self/non-self discrimination in nature. In order to provide bacteria with immunity against bacteriophages and other parasitic genetic elements, RM systems rely on a balance between two enzymes: the restriction enzyme, which cleaves non-self DNA at specific restriction sites, and the modification enzyme, which tags the host’s DNA as self and thus protects it from cleavage. In this thesis, I use population and single-cell level experiments in combination with mathematical modeling to study different aspects of the interplay between RM systems, bacteria and bacteriophages. First, I analyze how mutations in phage restriction sites affect the probability of phage escape – an inherently stochastic process, during which phages accidently get modified instead of restricted. Next, I use single-cell experiments to show that RM systems can, with a low probability, attack the genome of their bacterial host and that this primitive form of autoimmunity leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally, I investigate the nature of interactions between bacteria, RM systems and temperate bacteriophages to find that, as a consequence of phage escape and its impact on population dynamics, RM systems can promote acquisition of symbiotic bacteriophages, rather than limit it. The results presented here uncover new fundamental biological properties of RM systems and highlight their importance in the ecology and evolution of bacteria, bacteriophages and their interactions."}],"publication_status":"published","title":"Biology of restriction-modification systems at the single-cell and population level","file_date_updated":"2020-07-14T12:45:24Z","date_published":"2017-10-01T00:00:00Z","publisher":"Institute of Science and Technology Austria","citation":{"mla":"Pleska, Maros. <i>Biology of Restriction-Modification Systems at the Single-Cell and Population Level</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">10.15479/AT:ISTA:th_916</a>.","short":"M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell and Population Level, Institute of Science and Technology Austria, 2017.","chicago":"Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell and Population Level.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">https://doi.org/10.15479/AT:ISTA:th_916</a>.","ama":"Pleska M. Biology of restriction-modification systems at the single-cell and population level. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">10.15479/AT:ISTA:th_916</a>","ista":"Pleska M. 2017. Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria.","apa":"Pleska, M. (2017). <i>Biology of restriction-modification systems at the single-cell and population level</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">https://doi.org/10.15479/AT:ISTA:th_916</a>","ieee":"M. Pleska, “Biology of restriction-modification systems at the single-cell and population level,” Institute of Science and Technology Austria, 2017."},"date_updated":"2023-09-15T12:04:56Z","department":[{"_id":"CaGu"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","supervisor":[{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet"}],"related_material":{"record":[{"id":"1243","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"561"},{"status":"public","relation":"part_of_dissertation","id":"457"}]},"publist_id":"7711","oa":1,"day":"01","year":"2017","page":"126","doi":"10.15479/AT:ISTA:th_916","acknowledgement":"During my PhD studies, I received help from many people, all of which unfortunately cannot be listed here. I thank them deeply and hope that I never made them regret their kindness.\r\nI would like to express my deepest gratitude to Călin Guet, who went far beyond his responsibilities as an advisor and was to me also a great mentor and a friend. Călin never questioned my potential or lacked compassion and I cannot thank him enough for cultivating in me an independent scientist. I was amazed by his ability to recognize the most fascinating scientific problems in objects of study that others would find mundane. I hope I adopted at least a fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his support and especially for giving me the best possible example of how one can practice excellent science with humor and style. Working with Bruce was a true privilege.\r\nI thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI thank all our lab members: Tobias Bergmiller for his guidance, especially in the first years of my research, and for being a good friend throughout; Remy Chait for staying in the lab at unreasonable hours and for the good laughs at bad jokes we shared; Anna Staron for supportively listening to my whines whenever I had to run a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek for always being nice to me, no matter how much bench space I took from her.\r\nI thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally, I would like to thank my family and especially my wife Edita, who sacrificed a lot so that I can pursue my goals and dreams.\r\n"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"short":"L. Shi, B. Hof, M. Rampp, M. Avila, Physics of Fluids 29 (2017).","mla":"Shi, Liang, et al. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” <i>Physics of Fluids</i>, vol. 29, no. 4, 044107, American Institute of Physics, 2017, doi:<a href=\"https://doi.org/10.1063/1.4981525\">10.1063/1.4981525</a>.","ieee":"L. Shi, B. Hof, M. Rampp, and M. Avila, “Hydrodynamic turbulence in quasi Keplerian rotating flows,” <i>Physics of Fluids</i>, vol. 29, no. 4. American Institute of Physics, 2017.","ama":"Shi L, Hof B, Rampp M, Avila M. Hydrodynamic turbulence in quasi Keplerian rotating flows. <i>Physics of Fluids</i>. 2017;29(4). doi:<a href=\"https://doi.org/10.1063/1.4981525\">10.1063/1.4981525</a>","ista":"Shi L, Hof B, Rampp M, Avila M. 2017. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 29(4), 044107.","chicago":"Shi, Liang, Björn Hof, Markus Rampp, and Marc Avila. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” <i>Physics of Fluids</i>. American Institute of Physics, 2017. <a href=\"https://doi.org/10.1063/1.4981525\">https://doi.org/10.1063/1.4981525</a>.","apa":"Shi, L., Hof, B., Rampp, M., &#38; Avila, M. (2017). Hydrodynamic turbulence in quasi Keplerian rotating flows. <i>Physics of Fluids</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4981525\">https://doi.org/10.1063/1.4981525</a>"},"department":[{"_id":"BjHo"}],"date_updated":"2021-01-12T08:08:15Z","title":"Hydrodynamic turbulence in quasi Keplerian rotating flows","date_published":"2017-04-01T00:00:00Z","publisher":"American Institute of Physics","publication_status":"published","abstract":[{"lang":"eng","text":"We report a direct-numerical-simulation study of the Taylor-Couette flow in the quasi-Keplerian regime at shear Reynolds numbers up to (105). Quasi-Keplerian rotating flow has been investigated for decades as a simplified model system to study the origin of turbulence in accretion disks that is not fully understood. The flow in this study is axially periodic and thus the experimental end-wall effects on the stability of the flow are avoided. Using optimal linear perturbations as initial conditions, our simulations find no sustained turbulence: the strong initial perturbations distort the velocity profile and trigger turbulence that eventually decays."}],"year":"2017","day":"01","doi":"10.1063/1.4981525","oa":1,"publication":"Physics of Fluids","publist_id":"7072","intvolume":"        29","scopus_import":1,"author":[{"full_name":"Shi, Liang","first_name":"Liang","last_name":"Shi"},{"orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rampp","first_name":"Markus","full_name":"Rampp, Markus"},{"full_name":"Avila, Marc","first_name":"Marc","last_name":"Avila"}],"oa_version":"Submitted Version","quality_controlled":"1","project":[{"name":"Astrophysical instability of currents and turbulences","grant_number":"SFB 963  TP A8","_id":"2511D90C-B435-11E9-9278-68D0E5697425"}],"volume":29,"language":[{"iso":"eng"}],"article_number":"044107","issue":"4","month":"04","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.01714"}],"publication_identifier":{"issn":["10706631"]},"status":"public","type":"journal_article","_id":"662","date_created":"2018-12-11T11:47:47Z"},{"day":"01","page":"163 - 172","year":"2017","doi":"10.1145/3049797.3049814","oa":1,"publication":"Proceedings of the 20th International Conference on Hybrid Systems","publist_id":"7067","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th International Conference on Hybrid Systems. HSCC: Hybrid Systems Computation and Control , 163–172.","ama":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: <i>Proceedings of the 20th International Conference on Hybrid Systems</i>. ACM; 2017:163-172. doi:<a href=\"https://doi.org/10.1145/3049797.3049814\">10.1145/3049797.3049814</a>","chicago":"Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, 163–72. ACM, 2017. <a href=\"https://doi.org/10.1145/3049797.3049814\">https://doi.org/10.1145/3049797.3049814</a>.","apa":"Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., &#38; Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In <i>Proceedings of the 20th International Conference on Hybrid Systems</i> (pp. 163–172). Pittsburgh, PA, United States: ACM. <a href=\"https://doi.org/10.1145/3049797.3049814\">https://doi.org/10.1145/3049797.3049814</a>","ieee":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, Pittsburgh, PA, United States, 2017, pp. 163–172.","mla":"Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, ACM, 2017, pp. 163–72, doi:<a href=\"https://doi.org/10.1145/3049797.3049814\">10.1145/3049797.3049814</a>.","short":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172."},"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:08:17Z","title":"Safety verification of nonlinear hybrid systems based on invariant clusters","file_date_updated":"2020-07-14T12:47:34Z","publisher":"ACM","date_published":"2017-04-01T00:00:00Z","ddc":["000"],"publication_status":"published","abstract":[{"lang":"eng","text":"In this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete invariants by assigning different values to u→ so that every trajectory of the system can be overapproximated precisely by the intersection of a group of concrete invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant cluster can be obtained by first computing the remainder of the Lie derivative of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations obtained from the coefficients of the remainder. Based on invariant clusters and sum-of-squares (SOS) programming, we present a new method for the safety verification of hybrid systems. Experiments on nonlinear benchmark systems from biology and control theory show that our approach is efficient. "}],"publication_identifier":{"isbn":["978-145034590-3"]},"status":"public","_id":"663","type":"conference","date_created":"2018-12-11T11:47:47Z","conference":{"end_date":"2017-04-20","start_date":"2017-04-18","location":"Pittsburgh, PA, United States","name":"HSCC: Hybrid Systems Computation and Control "},"pubrep_id":"817","author":[{"last_name":"Kong","first_name":"Hui","orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui"},{"last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian"},{"full_name":"Jiang, Yu","last_name":"Jiang","first_name":"Yu"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2017-817-v1+1_p163-kong.pdf","date_updated":"2020-07-14T12:47:34Z","date_created":"2018-12-12T10:11:20Z","content_type":"application/pdf","file_size":1650530,"access_level":"open_access","creator":"system","checksum":"b7667434cbf5b5f0ade3bea1dbe5bf63","file_id":"4873","relation":"main_file"}],"has_accepted_license":"1","month":"04"},{"day":"26","year":"2017","doi":"10.1016/j.cels.2017.03.001","page":"393 - 403","oa":1,"publist_id":"7061","intvolume":"         4","publication":"Cell Systems","scopus_import":1,"related_material":{"record":[{"id":"818","relation":"dissertation_contains","status":"public"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"department":[{"_id":"ToBo"},{"_id":"GaTk"}],"date_updated":"2023-09-07T12:00:25Z","citation":{"ista":"Mitosch K, Rieckh G, Bollenbach MT. 2017. Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment. Cell Systems. 4(4), 393–403.","chicago":"Mitosch, Karin, Georg Rieckh, and Mark Tobias Bollenbach. “Noisy Response to Antibiotic Stress Predicts Subsequent Single Cell Survival in an Acidic Environment.” <i>Cell Systems</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cels.2017.03.001\">https://doi.org/10.1016/j.cels.2017.03.001</a>.","ama":"Mitosch K, Rieckh G, Bollenbach MT. Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment. <i>Cell Systems</i>. 2017;4(4):393-403. doi:<a href=\"https://doi.org/10.1016/j.cels.2017.03.001\">10.1016/j.cels.2017.03.001</a>","apa":"Mitosch, K., Rieckh, G., &#38; Bollenbach, M. T. (2017). Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment. <i>Cell Systems</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cels.2017.03.001\">https://doi.org/10.1016/j.cels.2017.03.001</a>","ieee":"K. Mitosch, G. Rieckh, and M. T. Bollenbach, “Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment,” <i>Cell Systems</i>, vol. 4, no. 4. Cell Press, pp. 393–403, 2017.","mla":"Mitosch, Karin, et al. “Noisy Response to Antibiotic Stress Predicts Subsequent Single Cell Survival in an Acidic Environment.” <i>Cell Systems</i>, vol. 4, no. 4, Cell Press, 2017, pp. 393–403, doi:<a href=\"https://doi.org/10.1016/j.cels.2017.03.001\">10.1016/j.cels.2017.03.001</a>.","short":"K. Mitosch, G. Rieckh, M.T. Bollenbach, Cell Systems 4 (2017) 393–403."},"file_date_updated":"2020-07-14T12:47:35Z","date_published":"2017-04-26T00:00:00Z","publisher":"Cell Press","title":"Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment","publication_status":"published","abstract":[{"lang":"eng","text":"Antibiotics elicit drastic changes in microbial gene expression, including the induction of stress response genes. While certain stress responses are known to “cross-protect” bacteria from other stressors, it is unclear whether cellular responses to antibiotics have a similar protective role. By measuring the genome-wide transcriptional response dynamics of Escherichia coli to four antibiotics, we found that trimethoprim induces a rapid acid stress response that protects bacteria from subsequent exposure to acid. Combining microfluidics with time-lapse imaging to monitor survival and acid stress response in single cells revealed that the noisy expression of the acid resistance operon gadBC correlates with single-cell survival. Cells with higher gadBC expression following trimethoprim maintain higher intracellular pH and survive the acid stress longer. The seemingly random single-cell survival under acid stress can therefore be predicted from gadBC expression and rationalized in terms of GadB/C molecular function. Overall, we provide a roadmap for identifying the molecular mechanisms of single-cell cross-protection between antibiotics and other stressors."}],"ddc":["576","610"],"publication_identifier":{"issn":["24054712"]},"status":"public","date_created":"2018-12-11T11:47:48Z","_id":"666","type":"journal_article","ec_funded":1,"pubrep_id":"901","author":[{"id":"39B66846-F248-11E8-B48F-1D18A9856A87","full_name":"Mitosch, Karin","first_name":"Karin","last_name":"Mitosch"},{"full_name":"Rieckh, Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Rieckh"},{"full_name":"Bollenbach, Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","first_name":"Tobias","last_name":"Bollenbach"}],"project":[{"call_identifier":"FP7","grant_number":"303507","_id":"25E83C2C-B435-11E9-9278-68D0E5697425","name":"Optimality principles in responses to antibiotics"},{"name":"Revealing the mechanisms underlying drug interactions","grant_number":"P27201-B22","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Revealing the fundamental limits of cell growth","grant_number":"RGP0042/2013","_id":"25EB3A80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"volume":4,"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","month":"04","file":[{"relation":"main_file","creator":"system","file_id":"5041","checksum":"04ff20011c3d9a601c514aa999a5fe1a","file_size":2438660,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:35Z","date_created":"2018-12-12T10:13:54Z","file_name":"IST-2017-901-v1+1_1-s2.0-S2405471217300868-main.pdf"}],"issue":"4"},{"date_created":"2019-07-24T13:55:25Z","oa":1,"type":"conference","_id":"6679","status":"public","page":"1-7","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.05497"}],"doi":"10.1109/glocom.2017.8254940","year":"2017","day":"01","conference":{"location":"Singapore, Singapore","name":"GLOBECOM: Global Communications Conference","start_date":"2017-12-04","end_date":"2017-12-08"},"arxiv":1,"publication":"2017 IEEE Global Communications Conference","date_updated":"2021-01-12T08:08:34Z","quality_controlled":"1","extern":"1","citation":{"chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Hamed Hassani, Ruediger Urbanke, and Warren Gross. “Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance.” In <i>2017 IEEE Global Communications Conference</i>, 1–7. IEEE, 2017. <a href=\"https://doi.org/10.1109/glocom.2017.8254940\">https://doi.org/10.1109/glocom.2017.8254940</a>.","ista":"Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. 2017. Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. 2017 IEEE Global Communications Conference. GLOBECOM: Global Communications Conference, 1–7.","ama":"Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. In: <i>2017 IEEE Global Communications Conference</i>. IEEE; 2017:1-7. doi:<a href=\"https://doi.org/10.1109/glocom.2017.8254940\">10.1109/glocom.2017.8254940</a>","apa":"Hashemi, S. A., Mondelli, M., Hassani, H., Urbanke, R., &#38; Gross, W. (2017). Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. In <i>2017 IEEE Global Communications Conference</i> (pp. 1–7). Singapore, Singapore: IEEE. <a href=\"https://doi.org/10.1109/glocom.2017.8254940\">https://doi.org/10.1109/glocom.2017.8254940</a>","ieee":"S. A. Hashemi, M. Mondelli, H. Hassani, R. Urbanke, and W. Gross, “Partitioned list decoding of polar codes: Analysis and improvement of finite length performance,” in <i>2017 IEEE Global Communications Conference</i>, Singapore, Singapore, 2017, pp. 1–7.","mla":"Hashemi, Seyyed Ali, et al. “Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance.” <i>2017 IEEE Global Communications Conference</i>, IEEE, 2017, pp. 1–7, doi:<a href=\"https://doi.org/10.1109/glocom.2017.8254940\">10.1109/glocom.2017.8254940</a>.","short":"S.A. Hashemi, M. Mondelli, H. Hassani, R. Urbanke, W. Gross, in:, 2017 IEEE Global Communications Conference, IEEE, 2017, pp. 1–7."},"oa_version":"Preprint","author":[{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"last_name":"Urbanke","first_name":"Ruediger","full_name":"Urbanke, Ruediger"},{"full_name":"Gross, Warren","first_name":"Warren","last_name":"Gross"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1705.05497"]},"abstract":[{"lang":"eng","text":"Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of decoding algorithms with good error performance and efficient hardware implementation. One of the leading candidates in this regard is represented by successive-cancellation list (SCL) decoding. However, its hardware implementation requires a large amount of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly reduce the memory consumption [1]. In this paper, we examine the paradigm of PSCL decoding from both theoretical and practical standpoints: (i) by changing the construction of the code, we are able to improve the performance at no additional computational, latency or memory cost, (ii) we present an optimal scheme to allocate cyclic redundancy checks (CRCs), and (iii) we provide an upper bound on the list size that allows MAP performance."}],"publication_status":"published","month":"12","language":[{"iso":"eng"}],"publisher":"IEEE","date_published":"2017-12-01T00:00:00Z","title":"Partitioned list decoding of polar codes: Analysis and improvement of finite length performance"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Horsthemke, Markus, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” <i>Journal of Biological Chemistry</i>, vol. 292, no. 17, American Society for Biochemistry and Molecular Biology, 2017, pp. 7258–73, doi:<a href=\"https://doi.org/10.1074/jbc.M116.766923\">10.1074/jbc.M116.766923</a>.","short":"M. Horsthemke, A. Bachg, K. Groll, S. Moyzio, B. Müther, S. Hemkemeyer, R. Wedlich Söldner, M.K. Sixt, S. Tacke, M. Bähler, P. Hanley, Journal of Biological Chemistry 292 (2017) 7258–7273.","ieee":"M. Horsthemke <i>et al.</i>, “Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion,” <i>Journal of Biological Chemistry</i>, vol. 292, no. 17. American Society for Biochemistry and Molecular Biology, pp. 7258–7273, 2017.","ista":"Horsthemke M, Bachg A, Groll K, Moyzio S, Müther B, Hemkemeyer S, Wedlich Söldner R, Sixt MK, Tacke S, Bähler M, Hanley P. 2017. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 292(17), 7258–7273.","ama":"Horsthemke M, Bachg A, Groll K, et al. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. <i>Journal of Biological Chemistry</i>. 2017;292(17):7258-7273. doi:<a href=\"https://doi.org/10.1074/jbc.M116.766923\">10.1074/jbc.M116.766923</a>","chicago":"Horsthemke, Markus, Anne Bachg, Katharina Groll, Sven Moyzio, Barbara Müther, Sandra Hemkemeyer, Roland Wedlich Söldner, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2017. <a href=\"https://doi.org/10.1074/jbc.M116.766923\">https://doi.org/10.1074/jbc.M116.766923</a>.","apa":"Horsthemke, M., Bachg, A., Groll, K., Moyzio, S., Müther, B., Hemkemeyer, S., … Hanley, P. (2017). Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M116.766923\">https://doi.org/10.1074/jbc.M116.766923</a>"},"date_updated":"2021-01-12T08:08:34Z","department":[{"_id":"MiSi"}],"title":"Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion","publisher":"American Society for Biochemistry and Molecular Biology","date_published":"2017-04-28T00:00:00Z","file_date_updated":"2020-07-14T12:47:37Z","ddc":["570"],"abstract":[{"text":"Macrophage filopodia, finger-like membrane protrusions, were first implicated in phagocytosis more than 100 years ago, but little is still known about the involvement of these actin-dependent structures in particle clearance. Using spinning disk confocal microscopy to image filopodial dynamics in mouse resident Lifeact-EGFP macrophages, we show that filopodia, or filopodia-like structures, support pathogen clearance by multiple means. Filopodia supported the phagocytic uptake of bacterial (Escherichia coli) particles by (i) capturing along the filopodial shaft and surfing toward the cell body, the most common mode of capture; (ii) capturing via the tip followed by retraction; (iii) combinations of surfing and retraction; or (iv) sweeping actions. In addition, filopodia supported the uptake of zymosan (Saccharomyces cerevisiae) particles by (i) providing fixation, (ii) capturing at the tip and filopodia-guided actin anterograde flow with phagocytic cup formation, and (iii) the rapid growth of new protrusions. To explore the role of filopodia-inducing Cdc42, we generated myeloid-restricted Cdc42 knock-out mice. Cdc42-deficient macrophages exhibited rapid phagocytic cup kinetics, but reduced particle clearance, which could be explained by the marked rounded-up morphology of these cells. Macrophages lacking Myo10, thought to act downstream of Cdc42, had normal morphology, motility, and phagocytic cup formation, but displayed markedly reduced filopodia formation. In conclusion, live-cell imaging revealed multiple mechanisms involving macrophage filopodia in particle capture and engulfment. Cdc42 is not critical for filopodia or phagocytic cup formation, but plays a key role in driving macrophage lamellipodial spreading.","lang":"eng"}],"publication_status":"published","day":"28","doi":"10.1074/jbc.M116.766923","page":"7258 - 7273","year":"2017","oa":1,"publication":"Journal of Biological Chemistry","intvolume":"       292","publist_id":"7059","scopus_import":1,"author":[{"full_name":"Horsthemke, Markus","first_name":"Markus","last_name":"Horsthemke"},{"full_name":"Bachg, Anne","last_name":"Bachg","first_name":"Anne"},{"last_name":"Groll","first_name":"Katharina","full_name":"Groll, Katharina"},{"full_name":"Moyzio, Sven","last_name":"Moyzio","first_name":"Sven"},{"full_name":"Müther, Barbara","last_name":"Müther","first_name":"Barbara"},{"full_name":"Hemkemeyer, Sandra","last_name":"Hemkemeyer","first_name":"Sandra"},{"last_name":"Wedlich Söldner","first_name":"Roland","full_name":"Wedlich Söldner, Roland"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"first_name":"Sebastian","last_name":"Tacke","full_name":"Tacke, Sebastian"},{"first_name":"Martin","last_name":"Bähler","full_name":"Bähler, Martin"},{"full_name":"Hanley, Peter","last_name":"Hanley","first_name":"Peter"}],"oa_version":"Published Version","quality_controlled":"1","volume":292,"language":[{"iso":"eng"}],"issue":"17","file":[{"file_name":"2017_JBC_Horsthemke.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:37Z","date_created":"2019-10-24T15:25:42Z","creator":"dernst","file_id":"6971","checksum":"d488162874326a4bb056065fa549dc4a","file_size":5647880,"access_level":"open_access","relation":"main_file"}],"has_accepted_license":"1","month":"04","status":"public","publication_identifier":{"issn":["00219258"]},"type":"journal_article","_id":"668","article_type":"original","date_created":"2018-12-11T11:47:49Z"},{"citation":{"apa":"Synek, L., Vukašinović, N., Kulich, I., Hála, M., Aldorfová, K., Fendrych, M., &#38; Žárský, V. (2017). EXO70C2 is a key regulatory factor for optimal tip growth of pollen. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.01282\">https://doi.org/10.1104/pp.16.01282</a>","ama":"Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. <i>Plant Physiology</i>. 2017;174(1):223-240. doi:<a href=\"https://doi.org/10.1104/pp.16.01282\">10.1104/pp.16.01282</a>","ista":"Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 174(1), 223–240.","chicago":"Synek, Lukáš, Nemanja Vukašinović, Ivan Kulich, Michal Hála, Klára Aldorfová, Matyas Fendrych, and Viktor Žárský. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.01282\">https://doi.org/10.1104/pp.16.01282</a>.","ieee":"L. Synek <i>et al.</i>, “EXO70C2 is a key regulatory factor for optimal tip growth of pollen,” <i>Plant Physiology</i>, vol. 174, no. 1. American Society of Plant Biologists, pp. 223–240, 2017.","short":"L. Synek, N. Vukašinović, I. Kulich, M. Hála, K. Aldorfová, M. Fendrych, V. Žárský, Plant Physiology 174 (2017) 223–240.","mla":"Synek, Lukáš, et al. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” <i>Plant Physiology</i>, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 223–40, doi:<a href=\"https://doi.org/10.1104/pp.16.01282\">10.1104/pp.16.01282</a>."},"date_updated":"2021-01-12T08:08:35Z","department":[{"_id":"JiFr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["28356503"]},"ddc":["580"],"abstract":[{"lang":"eng","text":"The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis as an effector of small GTPases in polarized cell growth. In land plants, several exocyst subunits are encoded by double or triple paralogs, culminating in tens of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed seven isoforms expressed in pollen. Genetic and microscopic analyses of single mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes revealed that only a loss-of-function EXO70C2 allele resulted in a significant male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2 pollen tubes could frequently recover and restart their speedy elongation, resulting in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background, resulted in a complete pollen-specific transmission defect, suggesting redundant functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed under the control of their native promoters, localized in the cytoplasm of pollen grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization, and genetic effect suggest an unconventional EXO70 function possibly as a regulator of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes. "}],"publication_status":"published","title":"EXO70C2 is a key regulatory factor for optimal tip growth of pollen","file_date_updated":"2020-07-14T12:47:37Z","publisher":"American Society of Plant Biologists","date_published":"2017-05-01T00:00:00Z","pmid":1,"oa":1,"day":"01","year":"2017","doi":"10.1104/pp.16.01282","page":"223 - 240","scopus_import":1,"publication":"Plant Physiology","intvolume":"       174","publist_id":"7058","oa_version":"Submitted Version","quality_controlled":"1","author":[{"last_name":"Synek","first_name":"Lukáš","full_name":"Synek, Lukáš"},{"full_name":"Vukašinović, Nemanja","first_name":"Nemanja","last_name":"Vukašinović"},{"first_name":"Ivan","last_name":"Kulich","full_name":"Kulich, Ivan"},{"first_name":"Michal","last_name":"Hála","full_name":"Hála, Michal"},{"full_name":"Aldorfová, Klára","last_name":"Aldorfová","first_name":"Klára"},{"first_name":"Matyas","last_name":"Fendrych","orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87","full_name":"Fendrych, Matyas"},{"full_name":"Žárský, Viktor","last_name":"Žárský","first_name":"Viktor"}],"issue":"1","file":[{"checksum":"97155acc6aa5f0d0a78e0589a932fe02","file_id":"7041","creator":"dernst","access_level":"open_access","file_size":2176903,"relation":"main_file","file_name":"2017_PlantPhysio_Synek.pdf","content_type":"application/pdf","date_created":"2019-11-18T16:16:18Z","date_updated":"2020-07-14T12:47:37Z"}],"has_accepted_license":"1","month":"05","article_processing_charge":"No","volume":174,"language":[{"iso":"eng"}],"_id":"669","type":"journal_article","article_type":"original","date_created":"2018-12-11T11:47:49Z","status":"public","publication_identifier":{"issn":["00320889"]}},{"quality_controlled":"1","project":[{"grant_number":"P 24352-N23","_id":"25357BD2-B435-11E9-9278-68D0E5697425","name":"Deep Pictures: Creating Visual and Haptic Vector Images","call_identifier":"FWF"}],"oa_version":"Published Version","author":[{"first_name":"Camille","last_name":"Schreck","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","full_name":"Schreck, Camille"},{"first_name":"Damien","last_name":"Rohmer","full_name":"Rohmer, Damien"},{"last_name":"Hahmann","first_name":"Stefanie","full_name":"Hahmann, Stefanie"}],"month":"05","issue":"2","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":36,"date_created":"2018-12-11T11:47:49Z","type":"journal_article","_id":"670","article_type":"original","main_file_link":[{"url":"https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf","open_access":"1"}],"status":"public","publication_identifier":{"issn":["01677055"]},"date_updated":"2021-01-12T08:08:37Z","department":[{"_id":"ChWo"}],"citation":{"apa":"Schreck, C., Rohmer, D., &#38; Hahmann, S. (2017). Interactive paper tearing. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13110\">https://doi.org/10.1111/cgf.13110</a>","ama":"Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. <i>Computer Graphics Forum</i>. 2017;36(2):95-106. doi:<a href=\"https://doi.org/10.1111/cgf.13110\">10.1111/cgf.13110</a>","ista":"Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer Graphics Forum. 36(2), 95–106.","chicago":"Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper Tearing.” <i>Computer Graphics Forum</i>. Wiley, 2017. <a href=\"https://doi.org/10.1111/cgf.13110\">https://doi.org/10.1111/cgf.13110</a>.","ieee":"C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” <i>Computer Graphics Forum</i>, vol. 36, no. 2. Wiley, pp. 95–106, 2017.","mla":"Schreck, Camille, et al. “Interactive Paper Tearing.” <i>Computer Graphics Forum</i>, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:<a href=\"https://doi.org/10.1111/cgf.13110\">10.1111/cgf.13110</a>.","short":"C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears.","lang":"eng"}],"publication_status":"published","ddc":["000"],"publisher":"Wiley","date_published":"2017-05-01T00:00:00Z","title":"Interactive paper tearing","oa":1,"year":"2017","doi":"10.1111/cgf.13110","page":"95 - 106","day":"01","scopus_import":1,"intvolume":"        36","publist_id":"7056","publication":"Computer Graphics Forum"},{"status":"public","publication_identifier":{"issn":["00278424"]},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/","open_access":"1"}],"date_created":"2018-12-11T11:47:50Z","type":"journal_article","_id":"671","ec_funded":1,"author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X"},{"full_name":"Martinez, Vaquero","first_name":"Vaquero","last_name":"Martinez"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"project":[{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","volume":114,"month":"05","issue":"18","page":"4715 - 4720","year":"2017","doi":"10.1073/pnas.1621239114","day":"02","oa":1,"intvolume":"       114","publist_id":"7053","publication":"PNAS","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["28420786"]},"date_updated":"2021-01-12T08:08:37Z","department":[{"_id":"KrCh"}],"citation":{"ista":"Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.","chicago":"Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1621239114\">https://doi.org/10.1073/pnas.1621239114</a>.","ama":"Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. <i>PNAS</i>. 2017;114(18):4715-4720. doi:<a href=\"https://doi.org/10.1073/pnas.1621239114\">10.1073/pnas.1621239114</a>","apa":"Hilbe, C., Martinez, V., Chatterjee, K., &#38; Nowak, M. (2017). Memory-n strategies of direct reciprocity. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1621239114\">https://doi.org/10.1073/pnas.1621239114</a>","ieee":"C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” <i>PNAS</i>, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.","mla":"Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:<a href=\"https://doi.org/10.1073/pnas.1621239114\">10.1073/pnas.1621239114</a>.","short":"C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720."},"date_published":"2017-05-02T00:00:00Z","publisher":"National Academy of Sciences","pmid":1,"title":"Memory-n strategies of direct reciprocity","abstract":[{"lang":"eng","text":"Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation."}],"publication_status":"published"},{"date_created":"2018-12-11T11:47:50Z","type":"journal_article","_id":"672","publication_identifier":{"issn":["22111247"]},"status":"public","pubrep_id":"900","ec_funded":1,"quality_controlled":"1","project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556","call_identifier":"FP7"},{"name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","grant_number":"Y 564-B12","call_identifier":"FWF"}],"oa_version":"Published Version","author":[{"full_name":"Vaahtomeri, Kari","id":"368EE576-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7829-3518","last_name":"Vaahtomeri","first_name":"Kari"},{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus","last_name":"Brown","first_name":"Markus"},{"orcid":"0000-0001-9843-3522","first_name":"Robert","last_name":"Hauschild","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","full_name":"De Vries, Ingrid","last_name":"De Vries","first_name":"Ingrid"},{"id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F","first_name":"Alexander F","last_name":"Leithner"},{"last_name":"Mehling","first_name":"Matthias","orcid":"0000-0001-8599-1226","id":"3C23B994-F248-11E8-B48F-1D18A9856A87","full_name":"Mehling, Matthias"},{"orcid":"0000-0001-9735-5315","last_name":"Kaufmann","first_name":"Walter","full_name":"Kaufmann, Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K"}],"has_accepted_license":"1","month":"05","file":[{"file_name":"IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf","date_created":"2018-12-12T10:14:54Z","date_updated":"2020-07-14T12:47:38Z","content_type":"application/pdf","access_level":"open_access","file_size":2248814,"file_id":"5109","checksum":"8fdddaab1f1d76a6ec9ca94dcb6b07a2","creator":"system","relation":"main_file"}],"issue":"5","language":[{"iso":"eng"}],"volume":19,"article_processing_charge":"Yes","oa":1,"page":"902 - 909","year":"2017","doi":"10.1016/j.celrep.2017.04.027","day":"02","scopus_import":1,"publist_id":"7052","intvolume":"        19","publication":"Cell Reports","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"EM-Fac"}],"date_updated":"2023-02-23T12:50:09Z","citation":{"ista":"Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.","ama":"Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>. 2017;19(5):902-909. doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">10.1016/j.celrep.2017.04.027</a>","chicago":"Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">https://doi.org/10.1016/j.celrep.2017.04.027</a>.","apa":"Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling, M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">https://doi.org/10.1016/j.celrep.2017.04.027</a>","ieee":"K. Vaahtomeri <i>et al.</i>, “Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia,” <i>Cell Reports</i>, vol. 19, no. 5. Cell Press, pp. 902–909, 2017.","mla":"Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>, vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">10.1016/j.celrep.2017.04.027</a>.","short":"K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling, W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration.","lang":"eng"}],"ddc":["570"],"file_date_updated":"2020-07-14T12:47:38Z","publisher":"Cell Press","date_published":"2017-05-02T00:00:00Z","title":"Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia"},{"abstract":[{"lang":"eng","text":"Consider the problem of constructing a polar code of block length N for the transmission over a given channel W. Typically this requires to compute the reliability of all the N synthetic channels and then to include those that are sufficiently reliable. However, we know from [1], [2] that there is a partial order among the synthetic channels. Hence, it is natural to ask whether we can exploit it to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order [1], [2], we can construct a polar code by computing the reliability of roughly N/ log 3/2 N synthetic channels. Such a set of synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists in reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general and it can be used to further improve the complexity of the construction problem in case a new partial order on the synthetic channels of polar codes is discovered."}],"publication_status":"published","month":"06","title":"Construction of polar codes with sublinear complexity","publisher":"IEEE","date_published":"2017-06-15T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” <i>2017 IEEE International Symposium on Information Theory </i>, IEEE, 2017, pp. 1853–57, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006850\">10.1109/isit.2017.8006850</a>.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, in:, 2017 IEEE International Symposium on Information Theory , IEEE, 2017, pp. 1853–1857.","ama":"Mondelli M, Hassani SH, Urbanke R. Construction of polar codes with sublinear complexity. In: <i>2017 IEEE International Symposium on Information Theory </i>. IEEE; 2017:1853-1857. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006850\">10.1109/isit.2017.8006850</a>","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” In <i>2017 IEEE International Symposium on Information Theory </i>, 1853–57. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006850\">https://doi.org/10.1109/isit.2017.8006850</a>.","ista":"Mondelli M, Hassani SH, Urbanke R. 2017. Construction of polar codes with sublinear complexity. 2017 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1853–1857.","apa":"Mondelli, M., Hassani, S. H., &#38; Urbanke, R. (2017). Construction of polar codes with sublinear complexity. In <i>2017 IEEE International Symposium on Information Theory </i> (pp. 1853–1857). Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006850\">https://doi.org/10.1109/isit.2017.8006850</a>","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” in <i>2017 IEEE International Symposium on Information Theory </i>, Aachen, Germany, 2017, pp. 1853–1857."},"date_updated":"2023-02-23T12:49:08Z","extern":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1612.05295"]},"author":[{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"},{"full_name":"Hassani, S. Hamed","first_name":"S. Hamed","last_name":"Hassani"},{"last_name":"Urbanke","first_name":"Rudiger","full_name":"Urbanke, Rudiger"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"6663"}]},"publication":"2017 IEEE International Symposium on Information Theory ","arxiv":1,"conference":{"name":"ISIT: International Symposium on Information Theory","location":"Aachen, Germany","end_date":"2017-06-30","start_date":"2017-06-25"},"type":"conference","_id":"6729","date_created":"2019-07-30T07:14:18Z","oa":1,"publication_identifier":{"isbn":["9781509040964"],"eissn":["2157-8117"]},"page":"1853-1857","main_file_link":[{"url":"https://arxiv.org/abs/1612.05295","open_access":"1"}],"doi":"10.1109/isit.2017.8006850","day":"15","year":"2017","status":"public"},{"article_processing_charge":"No","volume":95,"language":[{"iso":"eng"}],"issue":"5","article_number":"053103","month":"05","author":[{"full_name":"Altmeyer, Sebastian","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5964-0203","last_name":"Altmeyer","first_name":"Sebastian"},{"full_name":"Lueptow, Richard","last_name":"Lueptow","first_name":"Richard"}],"oa_version":"Submitted Version","status":"public","publication_identifier":{"issn":["2470-0045"]},"main_file_link":[{"url":"https://arxiv.org/pdf/physics/0505164.pdf","open_access":"1"}],"_id":"673","type":"journal_article","date_created":"2018-12-11T11:47:50Z","title":"Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow","publisher":"American Physical Society","date_published":"2017-05-10T00:00:00Z","abstract":[{"lang":"eng","text":"We present a numerical study of wavy supercritical cylindrical Couette flow between counter-rotating cylinders in which the wavy pattern propagates either prograde with the inner cylinder or retrograde opposite the rotation of the inner cylinder. The wave propagation reversals from prograde to retrograde and vice versa occur at distinct values of the inner cylinder Reynolds number when the associated frequency of the wavy instability vanishes. The reversal occurs for both twofold and threefold symmetric wavy vortices. Moreover, the wave propagation reversal only occurs for sufficiently strong counter-rotation. The flow pattern reversal appears to be intrinsic in the system as either periodic boundary conditions or fixed end wall boundary conditions for different system sizes always result in the wave propagation reversal. We present a detailed bifurcation sequence and parameter space diagram with respect to retrograde behavior of wavy flows. The retrograde propagation of the instability occurs when the inner Reynolds number is about two times the outer Reynolds number. The mechanism for the retrograde propagation is associated with the inviscidly unstable region near the inner cylinder and the direction of the global average azimuthal velocity. Flow dynamics, spatio-temporal behavior, global mean angular velocity, and torque of the flow with the wavy pattern are explored."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"S. Altmeyer and R. Lueptow, “Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow,” <i>Physical Review E</i>, vol. 95, no. 5. American Physical Society, 2017.","ama":"Altmeyer S, Lueptow R. Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. 2017;95(5). doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">10.1103/PhysRevE.95.053103</a>","ista":"Altmeyer S, Lueptow R. 2017. Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. Physical Review E. 95(5), 053103.","chicago":"Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review E</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">https://doi.org/10.1103/PhysRevE.95.053103</a>.","apa":"Altmeyer, S., &#38; Lueptow, R. (2017). Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">https://doi.org/10.1103/PhysRevE.95.053103</a>","short":"S. Altmeyer, R. Lueptow, Physical Review E 95 (2017).","mla":"Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review E</i>, vol. 95, no. 5, 053103, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">10.1103/PhysRevE.95.053103</a>."},"date_updated":"2023-10-10T13:30:03Z","department":[{"_id":"BjHo"}],"publication":"Physical Review E","intvolume":"        95","publist_id":"7049","scopus_import":"1","doi":"10.1103/PhysRevE.95.053103","year":"2017","day":"10","oa":1}]