[{"citation":{"chicago":"Russo, Erica, Alvaro Teijeira, Kari Vaahtomeri, Ann Willrodt, Joël Bloch, Maximilian Nitschké, Laura Santambrogio, Dontscho Kerjaschki, Michael K Sixt, and Cornelia Halin. “Intralymphatic CCL21 Promotes Tissue Egress of Dendritic Cells through Afferent Lymphatic Vessels.” Cell Reports. Cell Press, 2016. https://doi.org/10.1016/j.celrep.2016.01.048.","ama":"Russo E, Teijeira A, Vaahtomeri K, et al. Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels. Cell Reports. 2016;14(7):1723-1734. doi:10.1016/j.celrep.2016.01.048","mla":"Russo, Erica, et al. “Intralymphatic CCL21 Promotes Tissue Egress of Dendritic Cells through Afferent Lymphatic Vessels.” Cell Reports, vol. 14, no. 7, Cell Press, 2016, pp. 1723–34, doi:10.1016/j.celrep.2016.01.048.","ista":"Russo E, Teijeira A, Vaahtomeri K, Willrodt A, Bloch J, Nitschké M, Santambrogio L, Kerjaschki D, Sixt MK, Halin C. 2016. Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels. Cell Reports. 14(7), 1723–1734.","apa":"Russo, E., Teijeira, A., Vaahtomeri, K., Willrodt, A., Bloch, J., Nitschké, M., … Halin, C. (2016). Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2016.01.048","short":"E. Russo, A. Teijeira, K. Vaahtomeri, A. Willrodt, J. Bloch, M. Nitschké, L. Santambrogio, D. Kerjaschki, M.K. Sixt, C. Halin, Cell Reports 14 (2016) 1723–1734.","ieee":"E. Russo et al., “Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels,” Cell Reports, vol. 14, no. 7. Cell Press, pp. 1723–1734, 2016."},"file":[{"date_updated":"2020-07-14T12:44:58Z","content_type":"application/pdf","file_size":5489897,"date_created":"2018-12-12T10:12:30Z","file_name":"IST-2016-515-v1+1_1-s2.0-S2211124716300262-main.pdf","access_level":"open_access","creator":"system","file_id":"4948","checksum":"c98c1151d5f1e5ce1643a83d8d7f3c29","relation":"main_file"}],"isi":1,"external_id":{"isi":["000370970200016"]},"day":"23","publication":"Cell Reports","scopus_import":"1","page":"1723 - 1734","title":"Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels","type":"journal_article","oa_version":"Published Version","date_published":"2016-02-23T00:00:00Z","quality_controlled":"1","month":"02","intvolume":" 14","publication_status":"published","date_updated":"2025-09-18T11:16:44Z","_id":"1490","doi":"10.1016/j.celrep.2016.01.048","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_processing_charge":"No","status":"public","pubrep_id":"515","ddc":["570"],"language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Russo, Erica","first_name":"Erica","last_name":"Russo"},{"full_name":"Teijeira, Alvaro","first_name":"Alvaro","last_name":"Teijeira"},{"orcid":"0000-0001-7829-3518","full_name":"Vaahtomeri, Kari","last_name":"Vaahtomeri","id":"368EE576-F248-11E8-B48F-1D18A9856A87","first_name":"Kari"},{"full_name":"Willrodt, Ann","last_name":"Willrodt","first_name":"Ann"},{"full_name":"Bloch, Joël","last_name":"Bloch","first_name":"Joël"},{"last_name":"Nitschké","first_name":"Maximilian","full_name":"Nitschké, Maximilian"},{"last_name":"Santambrogio","first_name":"Laura","full_name":"Santambrogio, Laura"},{"full_name":"Kerjaschki, Dontscho","last_name":"Kerjaschki","first_name":"Dontscho"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"},{"full_name":"Halin, Cornelia","first_name":"Cornelia","last_name":"Halin"}],"department":[{"_id":"MiSi"}],"abstract":[{"text":"To induce adaptive immunity, dendritic cells (DCs) migrate through afferent lymphatic vessels (LVs) to draining lymph nodes (dLNs). This process occurs in several consecutive steps. Upon entry into lymphatic capillaries, DCs first actively crawl into downstream collecting vessels. From there, they are next passively and rapidly transported to the dLN by lymph flow. Here, we describe a role for the chemokine CCL21 in intralymphatic DC crawling. Performing time-lapse imaging in murine skin, we found that blockade of CCL21-but not the absence of lymph flow-completely abolished DC migration from capillaries toward collecting vessels and reduced the ability of intralymphatic DCs to emigrate from skin. Moreover, we found that in vitro low laminar flow established a CCL21 gradient along lymphatic endothelial monolayers, thereby inducing downstream-directed DC migration. These findings reveal a role for intralymphatic CCL21 in promoting DC trafficking to dLNs, through the formation of a flow-induced gradient.","lang":"eng"}],"issue":"7","volume":14,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publisher":"Cell Press","publist_id":"5697","oa":1,"date_created":"2018-12-11T11:52:19Z","file_date_updated":"2020-07-14T12:44:58Z"},{"date_created":"2018-12-11T11:52:20Z","publisher":"American Mathematical Society","publist_id":"5692","oa":1,"volume":368,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"We study the ground state of a trapped Bose gas, starting from the full many-body Schrödinger Hamiltonian, and derive the non-linear Schrödinger energy functional in the limit of a large particle number, when the interaction potential converges slowly to a Dirac delta function. Our method is based on quantitative estimates on the discrepancy between the full many-body energy and its mean-field approximation using Hartree states. These are proved using finite dimensional localization and a quantitative version of the quantum de Finetti theorem. Our approach covers the case of attractive interactions in the regime of stability. In particular, our main new result is a derivation of the 2D attractive non-linear Schrödinger ground state.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1405.3220"}],"arxiv":1,"issue":"9","acknowledgement":"The authors acknowledge financial support from the European Research Council (FP7/2007-2013 Grant Agreement MNIQS 258023) and the ANR (Mathostaq project, ANR-13-JS01-0005-01). The second and third authors have benefited from the hospitality of the Institute for Mathematical Science of the National University of Singapore.","department":[{"_id":"RoSe"}],"author":[{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"full_name":"Nam, Phan","first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rougerie, Nicolas","first_name":"Nicolas","last_name":"Rougerie"}],"year":"2016","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","doi":"10.1090/tran/6537","month":"01","intvolume":" 368","quality_controlled":"1","_id":"1491","date_updated":"2025-09-18T11:15:32Z","publication_status":"published","date_published":"2016-01-01T00:00:00Z","oa_version":"Submitted Version","scopus_import":"1","title":"The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases","type":"journal_article","page":"6131 - 6157","external_id":{"arxiv":["1405.3220"],"isi":["000370726100004"]},"day":"01","publication":"Transactions of the American Mathematical Society","citation":{"apa":"Lewin, M., Nam, P., & Rougerie, N. (2016). The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/6537","short":"M. Lewin, P. Nam, N. Rougerie, Transactions of the American Mathematical Society 368 (2016) 6131–6157.","ieee":"M. Lewin, P. Nam, and N. Rougerie, “The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases,” Transactions of the American Mathematical Society, vol. 368, no. 9. American Mathematical Society, pp. 6131–6157, 2016.","ista":"Lewin M, Nam P, Rougerie N. 2016. The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases. Transactions of the American Mathematical Society. 368(9), 6131–6157.","chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “The Mean-Field Approximation and the Non-Linear Schrödinger Functional for Trapped Bose Gases.” Transactions of the American Mathematical Society. American Mathematical Society, 2016. https://doi.org/10.1090/tran/6537.","ama":"Lewin M, Nam P, Rougerie N. The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases. Transactions of the American Mathematical Society. 2016;368(9):6131-6157. doi:10.1090/tran/6537","mla":"Lewin, Mathieu, et al. “The Mean-Field Approximation and the Non-Linear Schrödinger Functional for Trapped Bose Gases.” Transactions of the American Mathematical Society, vol. 368, no. 9, American Mathematical Society, 2016, pp. 6131–57, doi:10.1090/tran/6537."},"isi":1},{"article_processing_charge":"No","doi":"10.1101/gad.276964.115","license":"https://creativecommons.org/licenses/by-nc/4.0/","intvolume":" 30","month":"03","quality_controlled":"1","_id":"1492","publication_status":"published","date_updated":"2025-09-18T11:14:08Z","date_published":"2016-03-01T00:00:00Z","oa_version":"Published Version","scopus_import":"1","title":"Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation","pmid":1,"type":"journal_article","page":"471 - 483","external_id":{"isi":["000370131500009"],"pmid":[" 26883363"]},"publication":"Genes and Development","day":"01","citation":{"ieee":"P. Marhavý et al., “Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation,” Genes and Development, vol. 30, no. 4. Cold Spring Harbor Laboratory Press, pp. 471–483, 2016.","short":"P. Marhavý, J.C. Montesinos López, A. Abuzeineh, D. Van Damme, J. Vermeer, J. Duclercq, H. Rakusova, P. Marhavá, J. Friml, N. Geldner, E. Benková, Genes and Development 30 (2016) 471–483.","apa":"Marhavý, P., Montesinos López, J. C., Abuzeineh, A., Van Damme, D., Vermeer, J., Duclercq, J., … Benková, E. (2016). Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation. Genes and Development. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/gad.276964.115","ama":"Marhavý P, Montesinos López JC, Abuzeineh A, et al. Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation. Genes and Development. 2016;30(4):471-483. doi:10.1101/gad.276964.115","mla":"Marhavý, Peter, et al. “Targeted Cell Elimination Reveals an Auxin-Guided Biphasic Mode of Lateral Root Initiation.” Genes and Development, vol. 30, no. 4, Cold Spring Harbor Laboratory Press, 2016, pp. 471–83, doi:10.1101/gad.276964.115.","chicago":"Marhavý, Peter, Juan C Montesinos López, Anas Abuzeineh, Daniël Van Damme, Joop Vermeer, Jérôme Duclercq, Hana Rakusova, et al. “Targeted Cell Elimination Reveals an Auxin-Guided Biphasic Mode of Lateral Root Initiation.” Genes and Development. Cold Spring Harbor Laboratory Press, 2016. https://doi.org/10.1101/gad.276964.115.","ista":"Marhavý P, Montesinos López JC, Abuzeineh A, Van Damme D, Vermeer J, Duclercq J, Rakusova H, Marhavá P, Friml J, Geldner N, Benková E. 2016. Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation. Genes and Development. 30(4), 471–483."},"isi":1,"file":[{"date_updated":"2020-07-14T12:44:58Z","content_type":"application/pdf","file_size":2757636,"date_created":"2019-01-25T09:56:11Z","access_level":"open_access","file_name":"2016_GeneDev_Marhavy.pdf","creator":"kschuh","checksum":"ea394498ee56270e021d1028a29358a0","relation":"main_file","file_id":"5883"}],"date_created":"2018-12-11T11:52:20Z","oa":1,"publist_id":"5691","publisher":"Cold Spring Harbor Laboratory Press","file_date_updated":"2020-07-14T12:44:58Z","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"has_accepted_license":"1","volume":30,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"To sustain a lifelong ability to initiate organs, plants retain pools of undifferentiated cells with a preserved prolif eration capacity. The root pericycle represents a unique tissue with conditional meristematic activity, and its tight control determines initiation of lateral organs. Here we show that the meristematic activity of the pericycle is constrained by the interaction with the adjacent endodermis. Release of these restraints by elimination of endo dermal cells by single-cell ablation triggers the pericycle to re-enter the cell cycle. We found that endodermis removal substitutes for the phytohormone auxin-dependent initiation of the pericycle meristematic activity. However, auxin is indispensable to steer the cell division plane orientation of new organ-defining divisions. We propose a dual, spatiotemporally distinct role for auxin during lateral root initiation. In the endodermis, auxin releases constraints arising from cell-to-cell interactions that compromise the pericycle meristematic activity, whereas, in the pericycle, auxin defines the orientation of the cell division plane to initiate lateral roots.","lang":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"}],"issue":"4","acknowledgement":"This work was supported by a European Research Council Starting Inde-pendent Research grant (ERC-2007-Stg-207362-HCPO to J.D.), Research Foundation-Flanders (G033711N to A.A.), and the Austrian Science Fund (FWF01_I1774S to E.B.). P.M. is indebted to the Federation of European Biochemical Sciences for a Long-Term Fellowship. ","corr_author":"1","department":[{"_id":"EvBe"}],"author":[{"last_name":"Marhavy","id":"3F45B078-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","orcid":"0000-0001-5227-5741","full_name":"Marhavy, Peter"},{"last_name":"Montesinos López","id":"310A8E3E-F248-11E8-B48F-1D18A9856A87","first_name":"Juan C","orcid":"0000-0001-9179-6099","full_name":"Montesinos López, Juan C"},{"full_name":"Abuzeineh, Anas","last_name":"Abuzeineh","first_name":"Anas"},{"full_name":"Van Damme, Daniël","last_name":"Van Damme","first_name":"Daniël"},{"full_name":"Vermeer, Joop","last_name":"Vermeer","first_name":"Joop"},{"full_name":"Duclercq, Jérôme","last_name":"Duclercq","first_name":"Jérôme"},{"full_name":"Rakusova, Hana","first_name":"Hana","last_name":"Rakusova"},{"first_name":"Petra","id":"44E59624-F248-11E8-B48F-1D18A9856A87","last_name":"Marhavá","full_name":"Marhavá, Petra"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"full_name":"Geldner, Niko","first_name":"Niko","last_name":"Geldner"},{"last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva"}],"language":[{"iso":"eng"}],"year":"2016","ddc":["570"],"status":"public"},{"scopus_import":"1","title":"A new method and a new scaling for deriving fermionic mean-field dynamics","type":"journal_article","oa_version":"Published Version","citation":{"ista":"Petrat SP, Pickl P. 2016. A new method and a new scaling for deriving fermionic mean-field dynamics. Mathematical Physics, Analysis and Geometry. 19(1), 3.","chicago":"Petrat, Sören P, and Peter Pickl. “A New Method and a New Scaling for Deriving Fermionic Mean-Field Dynamics.” Mathematical Physics, Analysis and Geometry. Springer, 2016. https://doi.org/10.1007/s11040-016-9204-2.","ama":"Petrat SP, Pickl P. A new method and a new scaling for deriving fermionic mean-field dynamics. Mathematical Physics, Analysis and Geometry. 2016;19(1). doi:10.1007/s11040-016-9204-2","mla":"Petrat, Sören P., and Peter Pickl. “A New Method and a New Scaling for Deriving Fermionic Mean-Field Dynamics.” Mathematical Physics, Analysis and Geometry, vol. 19, no. 1, 3, Springer, 2016, doi:10.1007/s11040-016-9204-2.","short":"S.P. Petrat, P. Pickl, Mathematical Physics, Analysis and Geometry 19 (2016).","apa":"Petrat, S. P., & Pickl, P. (2016). A new method and a new scaling for deriving fermionic mean-field dynamics. Mathematical Physics, Analysis and Geometry. Springer. https://doi.org/10.1007/s11040-016-9204-2","ieee":"S. P. Petrat and P. Pickl, “A new method and a new scaling for deriving fermionic mean-field dynamics,” Mathematical Physics, Analysis and Geometry, vol. 19, no. 1. Springer, 2016."},"isi":1,"file":[{"date_updated":"2020-07-14T12:44:58Z","content_type":"application/pdf","file_size":911310,"date_created":"2018-12-12T10:16:55Z","file_name":"IST-2016-514-v1+1_s11040-016-9204-2.pdf","access_level":"open_access","creator":"system","checksum":"eb5d2145ef0d377c4f78bf06e18f4529","relation":"main_file","file_id":"5246"}],"external_id":{"isi":["000374267300003"]},"day":"01","publication":"Mathematical Physics, Analysis and Geometry","license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.1007/s11040-016-9204-2","article_number":"3","article_processing_charge":"Yes (via OA deal)","date_published":"2016-03-01T00:00:00Z","ec_funded":1,"month":"03","intvolume":" 19","quality_controlled":"1","_id":"1493","publication_status":"published","date_updated":"2025-09-18T11:12:46Z","author":[{"orcid":"0000-0002-9166-5889","full_name":"Petrat, Sören P","last_name":"Petrat","id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","first_name":"Sören P"},{"full_name":"Pickl, Peter","last_name":"Pickl","first_name":"Peter"}],"year":"2016","language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"RoSe"}],"status":"public","pubrep_id":"514","ddc":["510","530"],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","date_created":"2018-12-11T11:52:20Z","publist_id":"5690","oa":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:44:58Z","abstract":[{"lang":"eng","text":"We introduce a new method for deriving the time-dependent Hartree or Hartree-Fock equations as an effective mean-field dynamics from the microscopic Schrödinger equation for fermionic many-particle systems in quantum mechanics. The method is an adaption of the method used in Pickl (Lett. Math. Phys. 97 (2) 151–164 2011) for bosonic systems to fermionic systems. It is based on a Gronwall type estimate for a suitable measure of distance between the microscopic solution and an antisymmetrized product state. We use this method to treat a new mean-field limit for fermions with long-range interactions in a large volume. Some of our results hold for singular attractive or repulsive interactions. We can also treat Coulomb interaction assuming either a mild singularity cutoff or certain regularity conditions on the solutions to the Hartree(-Fock) equations. In the considered limit, the kinetic and interaction energy are of the same order, while the average force is subleading. For some interactions, we prove that the Hartree(-Fock) dynamics is a more accurate approximation than a simpler dynamics that one would expect from the subleading force. With our method we also treat the mean-field limit coupled to a semiclassical limit, which was discussed in the literature before, and we recover some of the previous results. All results hold for initial data close (but not necessarily equal) to antisymmetrized product states and we always provide explicit rates of convergence."}],"issue":"1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","volume":19,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"year":"2016","language":[{"iso":"eng"}],"author":[{"id":"4787FE80-F248-11E8-B48F-1D18A9856A87","last_name":"Lemoult","first_name":"Grégoire M","full_name":"Lemoult, Grégoire M"},{"last_name":"Shi","id":"374A3F1A-F248-11E8-B48F-1D18A9856A87","first_name":"Liang","full_name":"Shi, Liang"},{"first_name":"Kerstin","last_name":"Avila","full_name":"Avila, Kerstin"},{"last_name":"Jalikop","id":"44A1D772-F248-11E8-B48F-1D18A9856A87","first_name":"Shreyas V","full_name":"Jalikop, Shreyas V"},{"full_name":"Avila, Marc","first_name":"Marc","last_name":"Avila"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"department":[{"_id":"BjHo"}],"status":"public","project":[{"name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425"},{"name":"Astrophysical instability of currents and turbulences","_id":"2511D90C-B435-11E9-9278-68D0E5697425","grant_number":"SFB 963 TP A8"}],"publist_id":"5685","publisher":"Nature Publishing Group","date_created":"2018-12-11T11:52:21Z","abstract":[{"lang":"eng","text":"Turbulence is one of the most frequently encountered non-equilibrium phenomena in nature, yet characterizing the transition that gives rise to turbulence in basic shear flows has remained an elusive task. Although, in recent studies, critical points marking the onset of sustained turbulence have been determined for several such flows, the physical nature of the transition could not be fully explained. In extensive experimental and computational studies we show for the example of Couette flow that the onset of turbulence is a second-order phase transition and falls into the directed percolation universality class. Consequently, the complex laminar–turbulent patterns distinctive for the onset of turbulence in shear flows result from short-range interactions of turbulent domains and are characterized by universal critical exponents. More generally, our study demonstrates that even high-dimensional systems far from equilibrium such as turbulence exhibit universality at onset and that here the collective dynamics obeys simple rules."}],"acknowledgement":"We thank P. Maier for providing valuable ideas and supporting us in the technical aspects. Discussions with D. Barkley, Y. Duguet, B. Eckhart, N. Goldenfeld, P. Manneville and K. Takeuchi are gratefully acknowledged. We acknowledge the Deutsche Forschungsgemeinschaft (Project No. FOR 1182), and the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589 for financial support. L.S. and B.H. acknowledge research funding by Deutsche Forschungsgemeinschaft (DFG) under Grant No. SFB 963/1 (project A8). Numerical simulations were performed thanks to the CPU time allocations of JUROPA in Juelich Supercomputing Center (project HGU17) and of the Max Planck Computing and Data Facility (Garching, Germany). Excellent technical support from M. Rampp on the hybrid code nsCouette is appreciated.","issue":"3","volume":12,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","page":"254 - 258","title":"Directed percolation phase transition to sustained turbulence in Couette flow","type":"journal_article","oa_version":"None","citation":{"ista":"Lemoult GM, Shi L, Avila K, Jalikop SV, Avila M, Hof B. 2016. Directed percolation phase transition to sustained turbulence in Couette flow. Nature Physics. 12(3), 254–258.","chicago":"Lemoult, Grégoire M, Liang Shi, Kerstin Avila, Shreyas V Jalikop, Marc Avila, and Björn Hof. “Directed Percolation Phase Transition to Sustained Turbulence in Couette Flow.” Nature Physics. Nature Publishing Group, 2016. https://doi.org/10.1038/nphys3675.","ama":"Lemoult GM, Shi L, Avila K, Jalikop SV, Avila M, Hof B. Directed percolation phase transition to sustained turbulence in Couette flow. Nature Physics. 2016;12(3):254-258. doi:10.1038/nphys3675","mla":"Lemoult, Grégoire M., et al. “Directed Percolation Phase Transition to Sustained Turbulence in Couette Flow.” Nature Physics, vol. 12, no. 3, Nature Publishing Group, 2016, pp. 254–58, doi:10.1038/nphys3675.","apa":"Lemoult, G. M., Shi, L., Avila, K., Jalikop, S. V., Avila, M., & Hof, B. (2016). Directed percolation phase transition to sustained turbulence in Couette flow. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys3675","short":"G.M. Lemoult, L. Shi, K. Avila, S.V. Jalikop, M. Avila, B. Hof, Nature Physics 12 (2016) 254–258.","ieee":"G. M. Lemoult, L. Shi, K. Avila, S. V. Jalikop, M. Avila, and B. Hof, “Directed percolation phase transition to sustained turbulence in Couette flow,” Nature Physics, vol. 12, no. 3. Nature Publishing Group, pp. 254–258, 2016."},"isi":1,"external_id":{"isi":["000371505200019"]},"day":"15","publication":"Nature Physics","doi":"10.1038/nphys3675","article_processing_charge":"No","ec_funded":1,"date_published":"2016-02-15T00:00:00Z","quality_controlled":"1","intvolume":" 12","month":"02","date_updated":"2025-09-18T11:11:31Z","publication_status":"published","_id":"1494"},{"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"publisher":"American Physical Society","oa":1,"publist_id":"5683","date_created":"2018-12-11T11:52:21Z","abstract":[{"lang":"eng","text":"The two-photon 1s2 2s 2p 3P0 1s22s2 1S0 transition in berylliumlike ions is theoretically investigated within a fully relativistic framework and a second-order perturbation theory. We focus our analysis on how electron correlation, as well as the negative-energy spectrum, can affect the forbidden E1M1 decay rate. For this purpose, we include the electronic correlation via an effective local potential and within a single configuration-state model. Due to its experimental interest, evaluations of decay rates are performed for berylliumlike xenon and uranium. We find that the negative-energy contribution can be neglected at the present level of accuracy in the evaluation of the decay rate. On the other hand, if contributions of electronic correlation are not carefully taken into account, it may change the lifetime of the metastable state by up to 20%. By performing a full-relativistic jj-coupling calculation, we found a decrease of the decay rate by two orders of magnitude compared to non-relativistic LS-coupling calculations, for the selected heavy ions."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1508.06169"}],"acknowledgement":"This research was supported in part by FCT, Portugal, through Project No. PTDC/FIS/117606/2010, financed by the European Community Fund FEDER through the COMPETE. ","arxiv":1,"issue":"3","volume":93,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2016","language":[{"iso":"eng"}],"author":[{"first_name":"Pedro","last_name":"Amaro","full_name":"Amaro, Pedro"},{"full_name":"Fratini, Filippo","last_name":"Fratini","first_name":"Filippo"},{"full_name":"Safari, Laleh","first_name":"Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","last_name":"Safari"},{"first_name":"Jorge","last_name":"Machado","full_name":"Machado, Jorge"},{"full_name":"Guerra, Mauro","last_name":"Guerra","first_name":"Mauro"},{"first_name":"Paul","last_name":"Indelicato","full_name":"Indelicato, Paul"},{"full_name":"Santos, José","first_name":"José","last_name":"Santos"}],"department":[{"_id":"MiLe"}],"status":"public","article_number":"032502","doi":"10.1103/PhysRevA.93.032502","article_processing_charge":"No","ec_funded":1,"date_published":"2016-03-07T00:00:00Z","quality_controlled":"1","intvolume":" 93","month":"03","publication_status":"published","date_updated":"2025-09-18T11:10:38Z","_id":"1496","scopus_import":"1","type":"journal_article","title":"Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model","oa_version":"Preprint","citation":{"ista":"Amaro P, Fratini F, Safari L, Machado J, Guerra M, Indelicato P, Santos J. 2016. Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model. Physical Review A - Atomic, Molecular, and Optical Physics. 93(3), 032502.","chicago":"Amaro, Pedro, Filippo Fratini, Laleh Safari, Jorge Machado, Mauro Guerra, Paul Indelicato, and José Santos. “Relativistic Evaluation of the Two-Photon Decay of the Metastable 1s22s2p3P0 State in Berylliumlike Ions with an Effective-Potential Model.” Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society, 2016. https://doi.org/10.1103/PhysRevA.93.032502.","ama":"Amaro P, Fratini F, Safari L, et al. Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model. Physical Review A - Atomic, Molecular, and Optical Physics. 2016;93(3). doi:10.1103/PhysRevA.93.032502","mla":"Amaro, Pedro, et al. “Relativistic Evaluation of the Two-Photon Decay of the Metastable 1s22s2p3P0 State in Berylliumlike Ions with an Effective-Potential Model.” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 93, no. 3, 032502, American Physical Society, 2016, doi:10.1103/PhysRevA.93.032502.","short":"P. Amaro, F. Fratini, L. Safari, J. Machado, M. Guerra, P. Indelicato, J. Santos, Physical Review A - Atomic, Molecular, and Optical Physics 93 (2016).","apa":"Amaro, P., Fratini, F., Safari, L., Machado, J., Guerra, M., Indelicato, P., & Santos, J. (2016). Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model. Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.93.032502","ieee":"P. Amaro et al., “Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model,” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 93, no. 3. American Physical Society, 2016."},"isi":1,"external_id":{"arxiv":["1508.06169"],"isi":["000371724100008"]},"day":"07","publication":"Physical Review A - Atomic, Molecular, and Optical Physics"},{"ddc":["570"],"pubrep_id":"561","status":"public","department":[{"_id":"KrCh"},{"_id":"NiBa"}],"author":[{"full_name":"Lohse, Konrad","last_name":"Lohse","first_name":"Konrad"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin"},{"first_name":"Simon","last_name":"Martin","full_name":"Martin, Simon"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"year":"2016","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","volume":202,"issue":"2","acknowledgement":"We thank Lynsey Bunnefeld for discussions throughout the project and Joshua Schraiber and one anonymous reviewer\r\nfor constructive comments on an earlier version of this manuscript. This work was supported by funding from the\r\nUnited Kingdom Natural Environment Research Council (to K.L.) (NE/I020288/1) and a grant from the European\r\nResearch Council (250152) (to N.H.B.).","abstract":[{"text":"The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proved difficult to exploit the information contained in the distribution of genealogies across the genome. We have previously shown that the generating function (GF) of genealogies can be used to analytically compute likelihoods of demographic models from configurations of mutations in short sequence blocks (Lohse et al. 2011). Although the GF has a simple, recursive form, the size of such likelihood calculations explodes quickly with the number of individuals and applications of this framework have so far been mainly limited to small samples (pairs and triplets) for which the GF can be written by hand. Here we investigate several strategies for exploiting the inherent symmetries of the coalescent. In particular, we show that the GF of genealogies can be decomposed into a set of equivalence classes that allows likelihood calculations from nontrivial samples. Using this strategy, we automated blockwise likelihood calculations for a general set of demographic scenarios in Mathematica. These histories may involve population size changes, continuous migration, discrete divergence, and admixture between multiple populations. To give a concrete example, we calculate the likelihood for a model of isolation with migration (IM), assuming two diploid samples without phase and outgroup information. We demonstrate the new inference scheme with an analysis of two individual butterfly genomes from the sister species Heliconius melpomene rosina and H. cydno.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:00Z","date_created":"2018-12-11T11:52:29Z","oa":1,"publisher":"Genetics Society of America","publist_id":"5658","has_accepted_license":"1","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"day":"01","publication":"Genetics","external_id":{"pmid":["26715666"],"isi":["000371304600032"]},"isi":1,"file":[{"date_updated":"2020-07-14T12:45:00Z","content_type":"application/pdf","date_created":"2018-12-12T10:16:51Z","file_name":"IST-2016-561-v1+1_Lohse_et_al_Genetics_2015.pdf","access_level":"open_access","file_size":957466,"relation":"main_file","checksum":"41c9b5d72e7fe4624dd22dfe622337d5","file_id":"5241","creator":"system"}],"citation":{"ista":"Lohse K, Chmelik M, Martin S, Barton NH. 2016. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 202(2), 775–786.","ama":"Lohse K, Chmelik M, Martin S, Barton NH. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 2016;202(2):775-786. doi:10.1534/genetics.115.183814","mla":"Lohse, Konrad, et al. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.” Genetics, vol. 202, no. 2, Genetics Society of America, 2016, pp. 775–86, doi:10.1534/genetics.115.183814.","chicago":"Lohse, Konrad, Martin Chmelik, Simon Martin, and Nicholas H Barton. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.115.183814.","ieee":"K. Lohse, M. Chmelik, S. Martin, and N. H. Barton, “Efficient strategies for calculating blockwise likelihoods under the coalescent,” Genetics, vol. 202, no. 2. Genetics Society of America, pp. 775–786, 2016.","apa":"Lohse, K., Chmelik, M., Martin, S., & Barton, N. H. (2016). Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.115.183814","short":"K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786."},"oa_version":"Preprint","type":"journal_article","title":"Efficient strategies for calculating blockwise likelihoods under the coalescent","pmid":1,"page":"775 - 786","scopus_import":"1","_id":"1518","date_updated":"2025-09-18T11:09:34Z","publication_status":"published","month":"02","intvolume":" 202","quality_controlled":"1","date_published":"2016-02-01T00:00:00Z","ec_funded":1,"article_processing_charge":"No","doi":"10.1534/genetics.115.183814"},{"author":[{"full_name":"Berrisford, John","last_name":"Berrisford","first_name":"John"},{"first_name":"Rozbeh","last_name":"Baradaran","full_name":"Baradaran, Rozbeh"},{"first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989"}],"language":[{"iso":"eng"}],"year":"2016","corr_author":"1","department":[{"_id":"LeSa"}],"status":"public","date_created":"2018-12-11T11:52:30Z","publisher":"Elsevier","publist_id":"5654","abstract":[{"text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation. It is the largest protein assembly of respiratory chains and one of the most elaborate redox membrane proteins known. Bacterial enzyme is about half the size of mitochondrial and thus provides its important "minimal" model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. We have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus, the membrane domain from Escherichia coli and recently of the intact, entire complex I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane helices). The 95. Å long electron transfer pathway through the enzyme proceeds from the primary electron acceptor flavin mononucleotide through seven conserved Fe-S clusters to the unusual elongated quinone-binding site at the interface with the membrane domain. Four putative proton translocation channels are found in the membrane domain, all linked by the central flexible axis containing charged residues. The redox energy of electron transfer is coupled to proton translocation by the as yet undefined mechanism proposed to involve long-range conformational changes. This article is part of a Special Issue entitled Respiratory complex I, edited by Volker Zickermann and Ulrich Brandt.","lang":"eng"}],"issue":"7","acknowledgement":"funded by the Medical Research Council (Grant number MC_U105674180)","volume":1857,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","title":"Structure of bacterial respiratory complex I","type":"journal_article","page":"892 - 901","oa_version":"None","citation":{"ama":"Berrisford J, Baradaran R, Sazanov LA. Structure of bacterial respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. 2016;1857(7):892-901. doi:10.1016/j.bbabio.2016.01.012","mla":"Berrisford, John, et al. “Structure of Bacterial Respiratory Complex I.” Biochimica et Biophysica Acta - Bioenergetics, vol. 1857, no. 7, Elsevier, 2016, pp. 892–901, doi:10.1016/j.bbabio.2016.01.012.","chicago":"Berrisford, John, Rozbeh Baradaran, and Leonid A Sazanov. “Structure of Bacterial Respiratory Complex I.” Biochimica et Biophysica Acta - Bioenergetics. Elsevier, 2016. https://doi.org/10.1016/j.bbabio.2016.01.012.","ista":"Berrisford J, Baradaran R, Sazanov LA. 2016. Structure of bacterial respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. 1857(7), 892–901.","ieee":"J. Berrisford, R. Baradaran, and L. A. Sazanov, “Structure of bacterial respiratory complex I,” Biochimica et Biophysica Acta - Bioenergetics, vol. 1857, no. 7. Elsevier, pp. 892–901, 2016.","apa":"Berrisford, J., Baradaran, R., & Sazanov, L. A. (2016). Structure of bacterial respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. Elsevier. https://doi.org/10.1016/j.bbabio.2016.01.012","short":"J. Berrisford, R. Baradaran, L.A. Sazanov, Biochimica et Biophysica Acta - Bioenergetics 1857 (2016) 892–901."},"isi":1,"external_id":{"isi":["000377727500005"]},"publication":"Biochimica et Biophysica Acta - Bioenergetics","day":"01","doi":"10.1016/j.bbabio.2016.01.012","article_processing_charge":"No","date_published":"2016-07-01T00:00:00Z","intvolume":" 1857","month":"07","quality_controlled":"1","_id":"1521","date_updated":"2025-09-18T11:08:50Z","publication_status":"published"},{"corr_author":"1","department":[{"_id":"UlWa"}],"author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Serhii","full_name":"Avvakumov, Serhii"}],"language":[{"iso":"eng"}],"year":"2016","status":"public","date_created":"2018-12-11T11:52:30Z","oa":1,"publisher":"Independent University of Moscow","publist_id":"5652","publication_identifier":{"eissn":["1609-4514"]},"volume":16,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","abstract":[{"text":"We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.3918"}],"issue":"1","arxiv":1,"acknowledgement":"I thank A. Skopenkov for telling me about the problem and for his useful remarks. I also thank A. Sossinsky,\r\nA. Zhubr, M. Skopenkov, P. Akhmetiev, and an anonymous referee for their feedback. Author was partially\r\nsupported by Dobrushin fellowship, 2013, and by RFBR grant 15-01-06302.","oa_version":"Preprint","scopus_import":"1","title":"The classification of certain linked 3-manifolds in 6-space","type":"journal_article","page":"1 - 25","external_id":{"arxiv":["1408.3918"]},"day":"01","publication":"Moscow Mathematical Journal","citation":{"mla":"Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.” Moscow Mathematical Journal, vol. 16, no. 1, Independent University of Moscow, 2016, pp. 1–25, doi:10.17323/1609-4514-2016-16-1-1-25.","ama":"Avvakumov S. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 2016;16(1):1-25. doi:10.17323/1609-4514-2016-16-1-1-25","chicago":"Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.” Moscow Mathematical Journal. Independent University of Moscow, 2016. https://doi.org/10.17323/1609-4514-2016-16-1-1-25.","ista":"Avvakumov S. 2016. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 16(1), 1–25.","ieee":"S. Avvakumov, “The classification of certain linked 3-manifolds in 6-space,” Moscow Mathematical Journal, vol. 16, no. 1. Independent University of Moscow, pp. 1–25, 2016.","short":"S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25.","apa":"Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. Independent University of Moscow. https://doi.org/10.17323/1609-4514-2016-16-1-1-25"},"article_processing_charge":"No","doi":"10.17323/1609-4514-2016-16-1-1-25","intvolume":" 16","month":"01","quality_controlled":"1","_id":"1522","date_updated":"2024-10-09T20:56:44Z","publication_status":"published","date_published":"2016-01-01T00:00:00Z"},{"article_processing_charge":"No","doi":"10.1090/proc/12824","_id":"1523","date_updated":"2025-09-18T11:07:39Z","publication_status":"published","intvolume":" 144","month":"04","quality_controlled":"1","date_published":"2016-04-01T00:00:00Z","oa_version":"Preprint","title":"On topological minors in random simplicial complexes","type":"journal_article","page":"1815 - 1828","scopus_import":"1","publication":"Proceedings of the American Mathematical Society","day":"01","external_id":{"arxiv":["1404.2106"],"isi":["000369298400040"]},"isi":1,"citation":{"mla":"Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial Complexes.” Proceedings of the American Mathematical Society, vol. 144, no. 4, American Mathematical Society, 2016, pp. 1815–28, doi:10.1090/proc/12824.","ama":"Gundert A, Wagner U. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 2016;144(4):1815-1828. doi:10.1090/proc/12824","chicago":"Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial Complexes.” Proceedings of the American Mathematical Society. American Mathematical Society, 2016. https://doi.org/10.1090/proc/12824.","ista":"Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 144(4), 1815–1828.","ieee":"A. Gundert and U. Wagner, “On topological minors in random simplicial complexes,” Proceedings of the American Mathematical Society, vol. 144, no. 4. American Mathematical Society, pp. 1815–1828, 2016.","apa":"Gundert, A., & Wagner, U. (2016). On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/12824","short":"A. Gundert, U. Wagner, Proceedings of the American Mathematical Society 144 (2016) 1815–1828."},"date_created":"2018-12-11T11:52:30Z","oa":1,"publist_id":"5650","publisher":"American Mathematical Society","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":144,"arxiv":1,"issue":"4","acknowledgement":"This research was supported by the Swiss National Science Foundation (SNF Projects 200021-125309 and 200020-138230","abstract":[{"lang":"eng","text":"For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k > 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.2106"}],"department":[{"_id":"UlWa"}],"corr_author":"1","author":[{"full_name":"Gundert, Anna","last_name":"Gundert","first_name":"Anna"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"language":[{"iso":"eng"}],"year":"2016","status":"public"},{"scopus_import":"1","page":"173 - 191","title":"Efficient reduction of kappa models by static inspection of the rule-set","type":"conference","oa_version":"Preprint","citation":{"chicago":"Beica, Andreea, Calin C Guet, and Tatjana Petrov. “Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set,” 9271:173–91. Springer, 2016. https://doi.org/10.1007/978-3-319-26916-0_10.","ama":"Beica A, Guet CC, Petrov T. Efficient reduction of kappa models by static inspection of the rule-set. In: Vol 9271. Springer; 2016:173-191. doi:10.1007/978-3-319-26916-0_10","mla":"Beica, Andreea, et al. Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set. Vol. 9271, Springer, 2016, pp. 173–91, doi:10.1007/978-3-319-26916-0_10.","ista":"Beica A, Guet CC, Petrov T. 2016. Efficient reduction of kappa models by static inspection of the rule-set. HSB: Hybrid Systems Biology, LNCS, vol. 9271, 173–191.","apa":"Beica, A., Guet, C. C., & Petrov, T. (2016). Efficient reduction of kappa models by static inspection of the rule-set (Vol. 9271, pp. 173–191). Presented at the HSB: Hybrid Systems Biology, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-319-26916-0_10","short":"A. Beica, C.C. Guet, T. Petrov, in:, Springer, 2016, pp. 173–191.","ieee":"A. Beica, C. C. Guet, and T. Petrov, “Efficient reduction of kappa models by static inspection of the rule-set,” presented at the HSB: Hybrid Systems Biology, Madrid, Spain, 2016, vol. 9271, pp. 173–191."},"external_id":{"arxiv":["1501.00440"]},"day":"10","doi":"10.1007/978-3-319-26916-0_10","article_processing_charge":"No","ec_funded":1,"date_published":"2016-01-10T00:00:00Z","quality_controlled":"1","intvolume":" 9271","month":"01","publication_status":"published","date_updated":"2025-06-04T12:06:27Z","_id":"1524","year":"2016","language":[{"iso":"eng"}],"author":[{"first_name":"Andreea","last_name":"Beica","full_name":"Beica, Andreea"},{"first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"},{"full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov"}],"corr_author":"1","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"status":"public","alternative_title":["LNCS"],"conference":{"location":"Madrid, Spain","start_date":"2015-09-04","end_date":"2015-09-05","name":"HSB: Hybrid Systems Biology"},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publist_id":"5649","oa":1,"publisher":"Springer","date_created":"2018-12-11T11:52:31Z","abstract":[{"lang":"eng","text":"When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations.\r\nOur algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.00440"}],"acknowledgement":"This research was supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734, and the SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2_148797.","arxiv":1,"volume":9271,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Springer","oa":1,"publist_id":"5647","date_created":"2018-12-11T11:52:32Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"volume":9583,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.01233"}],"acknowledgement":"This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","arxiv":1,"corr_author":"1","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"year":"2016","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"},{"full_name":"Samanta, Roopsha","first_name":"Roopsha","last_name":"Samanta","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"}],"conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2016-01-17","end_date":"2016-01-19","location":"St. Petersburg, FL, USA"},"status":"public","alternative_title":["LNCS"],"article_processing_charge":"No","doi":"10.1007/978-3-662-49122-5_12","quality_controlled":"1","month":"01","intvolume":" 9583","date_updated":"2025-09-18T11:06:25Z","publication_status":"published","_id":"1526","ec_funded":1,"date_published":"2016-01-01T00:00:00Z","oa_version":"Preprint","scopus_import":"1","page":"250 - 267","type":"conference","title":"Lipschitz robustness of timed I/O systems","external_id":{"isi":["000375148800012"],"arxiv":["1506.01233"]},"day":"01","citation":{"ama":"Henzinger TA, Otop J, Samanta R. Lipschitz robustness of timed I/O systems. In: Vol 9583. Springer; 2016:250-267. doi:10.1007/978-3-662-49122-5_12","mla":"Henzinger, Thomas A., et al. Lipschitz Robustness of Timed I/O Systems. Vol. 9583, Springer, 2016, pp. 250–67, doi:10.1007/978-3-662-49122-5_12.","chicago":"Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness of Timed I/O Systems,” 9583:250–67. Springer, 2016. https://doi.org/10.1007/978-3-662-49122-5_12.","ista":"Henzinger TA, Otop J, Samanta R. 2016. Lipschitz robustness of timed I/O systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583, 250–267.","ieee":"T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of timed I/O systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 250–267.","short":"T.A. Henzinger, J. Otop, R. Samanta, in:, Springer, 2016, pp. 250–267.","apa":"Henzinger, T. A., Otop, J., & Samanta, R. (2016). Lipschitz robustness of timed I/O systems (Vol. 9583, pp. 250–267). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. https://doi.org/10.1007/978-3-662-49122-5_12"},"isi":1},{"oa_version":"Preprint","type":"journal_article","title":"Optimal cost almost-sure reachability in POMDPs","page":"26 - 48","scopus_import":"1","day":"01","publication":"Artificial Intelligence","external_id":{"arxiv":["1411.3880"],"isi":["000372683700002"]},"isi":1,"citation":{"apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2016.01.007","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234. Elsevier, pp. 26–48, 2016.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 2016;234:26-48. doi:10.1016/j.artint.2016.01.007","mla":"Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence, vol. 234, Elsevier, 2016, pp. 26–48, doi:10.1016/j.artint.2016.01.007."},"article_processing_charge":"No","doi":"10.1016/j.artint.2016.01.007","_id":"1529","date_updated":"2025-09-18T11:05:09Z","publication_status":"published","intvolume":" 234","month":"05","quality_controlled":"1","date_published":"2016-05-01T00:00:00Z","ec_funded":1,"department":[{"_id":"KrCh"}],"corr_author":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin"},{"last_name":"Gupta","first_name":"Raghav","full_name":"Gupta, Raghav"},{"first_name":"Ayush","last_name":"Kanodia","full_name":"Kanodia, Ayush"}],"language":[{"iso":"eng"}],"year":"2016","status":"public","date_created":"2018-12-11T11:52:33Z","publist_id":"5642","oa":1,"publisher":"Elsevier","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5425"},{"status":"public","relation":"earlier_version","id":"1820"}]},"volume":234,"arxiv":1,"acknowledgement":"We thank Blai Bonet for helping us with RTDP-Bel. The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1411.3880"}],"abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest."}]},{"status":"public","corr_author":"1","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Nam, Phan","first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M"},{"last_name":"Solovej","first_name":"Jan","full_name":"Solovej, Jan"}],"volume":270,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"url":"http://arxiv.org/abs/1508.07321","open_access":"1"}],"abstract":[{"lang":"eng","text":"We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our sufficient conditions are optimal in the sense that they become necessary when the relevant one-body operators commute."}],"acknowledgement":"We thank Jan Dereziński for several inspiring discussions and useful remarks. We thank the referee for helpful comments. J.P.S. thanks the Erwin Schrödinger Institute for the hospitality during the thematic programme “Quantum many-body systems, random matrices, and disorder”. We gratefully acknowledge the financial supports by the European Union's Seventh Framework Programme under the ERC Advanced Grant ERC-2012-AdG 321029 (J.P.S.) and the REA grant agreement No. 291734 (P.T.N.), as well as the support of the National Science Center (NCN) grant No. 2012/07/N/ST1/03185 and the Austrian Science Fund (FWF) project No. P 27533-N27 (M.N.).","arxiv":1,"issue":"11","oa":1,"publist_id":"5626","publisher":"Academic Press","date_created":"2018-12-11T11:52:38Z","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF"}],"external_id":{"arxiv":["1508.07321"],"isi":["000375241700011"]},"publication":"Journal of Functional Analysis","day":"01","citation":{"apa":"Nam, P., Napiórkowski, M. M., & Solovej, J. (2016). Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. Academic Press. https://doi.org/10.1016/j.jfa.2015.12.007","short":"P. Nam, M.M. Napiórkowski, J. Solovej, Journal of Functional Analysis 270 (2016) 4340–4368.","ieee":"P. Nam, M. M. Napiórkowski, and J. Solovej, “Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations,” Journal of Functional Analysis, vol. 270, no. 11. Academic Press, pp. 4340–4368, 2016.","chicago":"Nam, Phan, Marcin M Napiórkowski, and Jan Solovej. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” Journal of Functional Analysis. Academic Press, 2016. https://doi.org/10.1016/j.jfa.2015.12.007.","ama":"Nam P, Napiórkowski MM, Solovej J. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. 2016;270(11):4340-4368. doi:10.1016/j.jfa.2015.12.007","mla":"Nam, Phan, et al. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” Journal of Functional Analysis, vol. 270, no. 11, Academic Press, 2016, pp. 4340–68, doi:10.1016/j.jfa.2015.12.007.","ista":"Nam P, Napiórkowski MM, Solovej J. 2016. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. 270(11), 4340–4368."},"isi":1,"oa_version":"Submitted Version","scopus_import":"1","page":"4340 - 4368","title":"Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations","type":"journal_article","quality_controlled":"1","month":"06","intvolume":" 270","publication_status":"published","date_updated":"2025-09-18T11:04:09Z","_id":"1545","ec_funded":1,"date_published":"2016-06-01T00:00:00Z","article_processing_charge":"No","doi":"10.1016/j.jfa.2015.12.007"},{"volume":58,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m > n^{1.5}. "}],"acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant (279307","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"6317","date_created":"2018-12-11T11:49:58Z","file_date_updated":"2018-12-12T10:16:02Z","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)"},"pubrep_id":"779","ddc":["000","004","006"],"status":"public","conference":{"location":"Krakow, Poland","start_date":"2016-08-22","end_date":"2016-08-26","name":"MFCS: Mathematical Foundations of Computer Science"},"alternative_title":["LIPIcs"],"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"quality_controlled":"1","month":"08","intvolume":" 58","date_updated":"2025-07-10T11:49:55Z","publication_status":"published","_id":"1068","ec_funded":1,"date_published":"2016-08-01T00:00:00Z","article_processing_charge":"No","article_number":"25","doi":"10.4230/LIPIcs.MFCS.2016.25","license":"https://creativecommons.org/licenses/by/3.0/","day":"01","citation":{"ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science, Krakow, Poland, 2016, vol. 58.","short":"K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science, Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25","ista":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 58, 25.","mla":"Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.25.","ama":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25."},"file":[{"file_size":632786,"file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf","access_level":"open_access","date_created":"2018-12-12T10:16:02Z","creator":"system","relation":"main_file","file_id":"5187","date_updated":"2018-12-12T10:16:02Z","content_type":"application/pdf"}],"oa_version":"Published Version","scopus_import":"1","type":"conference","title":"Conditionally optimal algorithms for generalized Büchi Games"},{"title":"On the skolem problem for continuous linear dynamical systems","type":"conference","scopus_import":"1","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5213","creator":"system","date_created":"2018-12-12T10:16:26Z","access_level":"open_access","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","file_size":521415,"content_type":"application/pdf","date_updated":"2018-12-12T10:16:26Z"}],"citation":{"ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","mla":"Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.100.","ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.100","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","apa":"Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"day":"01","doi":"10.4230/LIPIcs.ICALP.2016.100","article_number":"100","article_processing_charge":"No","date_published":"2016-08-01T00:00:00Z","ec_funded":1,"_id":"1069","date_updated":"2025-06-03T11:32:08Z","publication_status":"published","intvolume":" 55","month":"08","quality_controlled":"1","author":[{"full_name":"Chonev, Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","last_name":"Chonev","first_name":"Ventsislav K"},{"full_name":"Ouaknine, Joël","last_name":"Ouaknine","first_name":"Joël"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"language":[{"iso":"eng"}],"year":"2016","department":[{"_id":"KrCh"}],"alternative_title":["LIPIcs"],"status":"public","conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2016-07-15","start_date":"2016-07-12","location":"Rome, Italy"},"ddc":["004","006"],"pubrep_id":"778","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"file_date_updated":"2018-12-12T10:16:26Z","date_created":"2018-12-11T11:49:59Z","oa":1,"publist_id":"6314","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC Advanced Grant (267989: QUAREM).","abstract":[{"lang":"eng","text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":55},{"status":"public","alternative_title":["LIPIcs"],"conference":{"end_date":"2016-07-15","start_date":"2016-07-12","location":"Rome, Italy","name":"ICALP: Automata, Languages and Programming"},"ddc":["005"],"pubrep_id":"812","language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"department":[{"_id":"KrCh"}],"acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003, and European project Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for their insightful\r\ncomments and suggestions.\r\n","abstract":[{"lang":"eng","text":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We analogously consider quantifier exchange in extensions of CTL, and we present operators defined using basic operators of CTL* that express the occurrence of infinitely many synchronization points. We show that the model-checking problem remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide if the Next operator is allowed in the logics, thus the classical bisimulation quotient can be used for state-space reduction before model checking. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":55,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2018-12-12T10:08:52Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"6313","oa":1,"date_created":"2018-12-11T11:49:59Z","file":[{"file_size":546133,"date_created":"2018-12-12T10:08:52Z","access_level":"open_access","file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","creator":"system","relation":"main_file","file_id":"4714","date_updated":"2018-12-12T10:08:52Z","content_type":"application/pdf"}],"citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization Properties. Vol. 55, 98, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.98.","ama":"Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.","ieee":"K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","apa":"Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98"},"day":"01","type":"conference","title":"Computation tree logic for synchronization properties","scopus_import":"1","oa_version":"Published Version","ec_funded":1,"date_published":"2016-01-01T00:00:00Z","publication_status":"published","date_updated":"2025-06-03T11:18:54Z","_id":"1070","quality_controlled":"1","month":"01","intvolume":" 55","article_number":"98","doi":"10.4230/LIPIcs.ICALP.2016.98","article_processing_charge":"No"},{"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"file_date_updated":"2018-12-12T10:13:33Z","date_created":"2018-12-11T11:50:02Z","publist_id":"6299","publisher":"Nature Publishing Group","oa":1,"acknowledgement":"We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP); Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN.","abstract":[{"lang":"eng","text":"The asymmetric localization of proteins in the plasma membrane domains of eukaryotic cells is a fundamental manifestation of cell polarity that is central to multicellular organization and developmental patterning. In plants, the mechanisms underlying the polar localization of cargo proteins are still largely unknown and appear to be fundamentally distinct from those operating in mammals. Here, we present a systematic, quantitative comparative analysis of the polar delivery and subcellular localization of proteins that characterize distinct polar plasma membrane domains in plant cells. The combination of microscopic analyses and computational modeling revealed a mechanistic framework common to diverse polar cargos and underlying the establishment and maintenance of apical, basal, and lateral polar domains in plant cells. This mechanism depends on the polar secretion, constitutive endocytic recycling, and restricted lateral diffusion of cargos within the plasma membrane. Moreover, our observations suggest that polar cargo distribution involves the individual protein potential to form clusters within the plasma membrane and interact with the extracellular matrix. Our observations provide insights into the shared cellular mechanisms of polar cargo delivery and polarity maintenance in plant cells."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":2,"author":[{"first_name":"Łukasz","last_name":"Łangowski","full_name":"Łangowski, Łukasz"},{"full_name":"Wabnik, Krzysztof T","orcid":"0000-0001-7263-0560","first_name":"Krzysztof T","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","last_name":"Wabnik"},{"orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","last_name":"Li","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"full_name":"Naramoto, Satoshi","last_name":"Naramoto","first_name":"Satoshi"},{"last_name":"Tanaka","first_name":"Hirokazu","full_name":"Tanaka, Hirokazu"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"year":"2016","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"status":"public","ddc":["580"],"pubrep_id":"757","doi":"10.1038/celldisc.2016.18","article_number":"16018","article_processing_charge":"No","date_published":"2016-07-19T00:00:00Z","ec_funded":1,"_id":"1081","publication_status":"published","date_updated":"2025-09-22T14:19:46Z","intvolume":" 2","month":"07","quality_controlled":"1","title":"Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells","type":"journal_article","scopus_import":"1","oa_version":"Published Version","isi":1,"file":[{"file_size":5261671,"date_created":"2018-12-12T10:13:33Z","file_name":"IST-2017-757-v1+1_celldisc201618.pdf","access_level":"open_access","creator":"system","file_id":"5017","relation":"main_file","date_updated":"2018-12-12T10:13:33Z","content_type":"application/pdf"}],"citation":{"chicago":"Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste, Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.","ama":"Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2016;2. doi:10.1038/celldisc.2016.18","mla":"Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery, vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.","ista":"Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2, 16018.","short":"Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J. Friml, Cell Discovery 2 (2016).","apa":"Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H., & Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. Nature Publishing Group. https://doi.org/10.1038/celldisc.2016.18","ieee":"Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells,” Cell Discovery, vol. 2. Nature Publishing Group, 2016."},"publication":"Cell Discovery","day":"19","external_id":{"isi":["000414797400001"]}},{"publication_identifier":{"issn":["2325-887X"]},"volume":43,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.22489/cinc.2016.090-500","open_access":"1"}],"abstract":[{"text":"The main goal of the SCP-ECG standard is to address ECG data and related metadata structuring, semantics and syntax, with the objective of facilitating interoperability and thus supporting and promoting the exchange of the relevant information for unary and serial ECG diagnosis. Starting with version V3.0, the standard now also provides support for the storage of continuous, long-term ECG recordings and affords a repository for selected ECG sequences and the related metadata to accommodate stress tests, drug trials and protocol-based ECG recordings. The global and per-lead measurements sections have been extended and three new sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand annotations. The used terminology and the provided measurements and annotations have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis has also been put on harmonizing the Universal Statement Codes with the CDISC and the categorized AHA statement codes and similarly the drug and implanted devices codes with the ATC and NASPE/BPEG codes. ","lang":"eng"}],"acknowledgement":"The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen Wagner for their in depth review and constructive comments.","oa":1,"publisher":"Computing in Cardiology","date_created":"2022-03-03T10:43:10Z","conference":{"start_date":"2016-09-11","end_date":"2016-09-14","location":"Vancouver, Canada","name":"CinC: Computing in Cardiology"},"status":"public","department":[{"_id":"CampIT"}],"language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Rubel, Paul","first_name":"Paul","last_name":"Rubel"},{"first_name":"Danilo","last_name":"Pani","full_name":"Pani, Danilo"},{"full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl"},{"first_name":"Jocelyne","last_name":"Fayn","full_name":"Fayn, Jocelyne"},{"full_name":"Badilini, Fabio","last_name":"Badilini","first_name":"Fabio"},{"full_name":"Macfarlane, Peter","first_name":"Peter","last_name":"Macfarlane"},{"full_name":"Varri, Alpo","last_name":"Varri","first_name":"Alpo"}],"quality_controlled":"1","intvolume":" 43","month":"03","publication_status":"published","date_updated":"2022-03-04T07:34:45Z","_id":"10810","date_published":"2016-03-01T00:00:00Z","article_processing_charge":"No","doi":"10.22489/cinc.2016.090-500","publication":"2016 Computing in Cardiology Conference","day":"01","citation":{"chicago":"Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini, Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” In 2016 Computing in Cardiology Conference, 43:309–12. Computing in Cardiology, 2016. https://doi.org/10.22489/cinc.2016.090-500.","mla":"Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” 2016 Computing in Cardiology Conference, vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:10.22489/cinc.2016.090-500.","ama":"Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In: 2016 Computing in Cardiology Conference. Vol 43. Computing in Cardiology; 2016:309-312. doi:10.22489/cinc.2016.090-500","ista":"Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing in Cardiology vol. 43, 309–312.","apa":"Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P., & Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In 2016 Computing in Cardiology Conference (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology. https://doi.org/10.22489/cinc.2016.090-500","short":"P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri, in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp. 309–312.","ieee":"P. Rubel et al., “SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography,” in 2016 Computing in Cardiology Conference, Vancouver, Canada, 2016, vol. 43, pp. 309–312."},"oa_version":"Published Version","scopus_import":"1","page":"309-312","type":"conference","title":"SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography"},{"department":[{"_id":"GaTk"}],"year":"2016","language":[{"iso":"eng"}],"author":[{"full_name":"Chalk, Matthew J","orcid":"0000-0001-7782-4436","first_name":"Matthew J","last_name":"Chalk","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Olivier","last_name":"Marre","full_name":"Marre, Olivier"},{"orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper"}],"alternative_title":["Advances in Neural Information Processing Systems"],"conference":{"location":"Barcelona, Spain","start_date":"2016-12-05","end_date":"2016-12-10","name":"NIPS: Neural Information Processing Systems"},"status":"public","publist_id":"6298","oa":1,"publisher":"Neural Information Processing Systems Foundation","date_created":"2018-12-11T11:50:03Z","volume":29,"related_material":{"link":[{"relation":"other","url":"https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximises information about a relevance variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximising a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm to recover features that are both relevant and sparse. Finally, we demonstrate how kernelised versions of the algorithm can be used to address a broad range of problems with non-linear relation between X and Y.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1605.07332","open_access":"1"}],"arxiv":1,"oa_version":"Preprint","scopus_import":"1","page":"1965-1973","title":"Relevant sparse codes with variational information bottleneck","type":"conference","external_id":{"arxiv":["1605.07332"]},"day":"01","citation":{"ista":"Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational information bottleneck. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 1965–1973.","chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing Systems Foundation, 2016.","mla":"Chalk, Matthew J., et al. Relevant Sparse Codes with Variational Information Bottleneck. Vol. 29, Neural Information Processing Systems Foundation, 2016, pp. 1965–73.","ama":"Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information bottleneck. In: Vol 29. Neural Information Processing Systems Foundation; 2016:1965-1973.","apa":"Chalk, M. J., Marre, O., & Tkačik, G. (2016). Relevant sparse codes with variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems Foundation.","short":"M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems Foundation, 2016, pp. 1965–1973.","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational information bottleneck,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973."},"article_processing_charge":"No","quality_controlled":"1","intvolume":" 29","month":"12","publication_status":"published","date_updated":"2025-06-03T11:33:51Z","_id":"1082","date_published":"2016-12-01T00:00:00Z"}]