[{"month":"09","publisher":"Springer","citation":{"chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>.","ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>","ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., &#38; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>","mla":"Bogomolov, Sergiy, et al. <i>Conic Abstractions for Hybrid Systems</i>. Vol. 10419, Springer, 2017, pp. 116–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>.","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132.","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132."},"has_accepted_license":"1","quality_controlled":"1","volume":"10419 ","pubrep_id":"831","article_processing_charge":"No","page":"116 - 132","_id":"647","corr_author":"1","status":"public","file_date_updated":"2020-07-14T12:47:31Z","department":[{"_id":"ToHe"}],"ddc":["005"],"scopus_import":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6894"}]},"oa":1,"publist_id":"7129","date_updated":"2026-04-08T07:47:13Z","external_id":{"isi":["000611678300007"]},"file":[{"checksum":"faf546914ba29bcf9974ee36b6b16750","relation":"main_file","access_level":"open_access","file_name":"IST-2017-831-v1+1_main.pdf","file_id":"4956","date_updated":"2020-07-14T12:47:31Z","creator":"system","file_size":3806864,"date_created":"2018-12-12T10:12:38Z","content_type":"application/pdf"}],"date_published":"2017-09-01T00:00:00Z","abstract":[{"text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems.","lang":"eng"}],"oa_version":"Submitted Version","day":"01","author":[{"orcid":"0000-0002-0686-0365","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy"},{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Kong","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui","orcid":"0000-0002-3066-6941"}],"publication_status":"published","isi":1,"language":[{"iso":"eng"}],"type":"conference","title":"Conic abstractions for hybrid systems","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"alternative_title":["LNCS"],"date_created":"2018-12-11T11:47:41Z","conference":{"location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems","start_date":"2017-09-05","end_date":"2017-09-07"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2017","publication_identifier":{"isbn":["978-331965764-6"]},"doi":"10.1007/978-3-319-65765-3_7"},{"date_updated":"2026-04-08T14:17:06Z","publist_id":"6407","oa":1,"degree_awarded":"PhD","file_date_updated":"2020-07-14T12:48:18Z","department":[{"_id":"VlKo"}],"ddc":["004"],"status":"public","_id":"992","corr_author":"1","page":"97","ec_funded":1,"article_processing_charge":"No","pubrep_id":"815","citation":{"ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>","chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>.","ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","mla":"Rolinek, Michal. <i>Complexity of Constraint Satisfaction</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>.","apa":"Rolinek, M. (2017). <i>Complexity of constraint satisfaction</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>"},"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"month":"05","OA_place":"publisher","acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","doi":"10.15479/AT:ISTA:th_815","publication_identifier":{"issn":["2663-337X"]},"year":"2017","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"date_created":"2018-12-11T11:49:35Z","type":"dissertation","title":"Complexity of constraint satisfaction","project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"language":[{"iso":"eng"}],"publication_status":"published","author":[{"first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal","last_name":"Rolinek"}],"day":"01","oa_version":"Published Version","abstract":[{"lang":"eng","text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language)."}],"file":[{"creator":"system","date_updated":"2020-07-14T12:48:18Z","content_type":"application/pdf","date_created":"2018-12-12T10:07:55Z","file_size":786145,"checksum":"81761fb939acb7585c36629f765b4373","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","file_id":"4654","access_level":"open_access","relation":"main_file"},{"date_updated":"2020-07-14T12:48:18Z","creator":"dernst","file_size":5936337,"content_type":"application/zip","date_created":"2019-04-05T08:43:24Z","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","relation":"source_file","access_level":"closed","file_id":"6208","file_name":"2017_Thesis_Rolinek_source.zip"}],"date_published":"2017-05-01T00:00:00Z"},{"oa":1,"date_updated":"2026-05-05T06:46:39Z","_id":"21615","status":"public","scopus_import":"1","arxiv":1,"citation":{"chicago":"Massuda, Aviram, Charles Roques-Carmes, Yujia Yang, Steven E. Kooi, Yi Yang, Chitraang Murdia, Karl K. Berggren, Ido Kaminer, and Marin Soljačić. “Smith-Purcell Radiation from Low-Energy Electrons.” In <i>Conference on Lasers and Electro-Optics</i>. Optica Publishing Group, 2017. <a href=\"https://doi.org/10.1364/cleo_qels.2017.fm3h.6\">https://doi.org/10.1364/cleo_qels.2017.fm3h.6</a>.","ama":"Massuda A, Roques-Carmes C, Yang Y, et al. Smith-Purcell radiation from low-energy electrons. In: <i>Conference on Lasers and Electro-Optics</i>. Optica Publishing Group; 2017. doi:<a href=\"https://doi.org/10.1364/cleo_qels.2017.fm3h.6\">10.1364/cleo_qels.2017.fm3h.6</a>","ieee":"A. Massuda <i>et al.</i>, “Smith-Purcell radiation from low-energy electrons,” in <i>Conference on Lasers and Electro-Optics</i>, San Jose, CA, United States, 2017.","apa":"Massuda, A., Roques-Carmes, C., Yang, Y., Kooi, S. E., Yang, Y., Murdia, C., … Soljačić, M. (2017). Smith-Purcell radiation from low-energy electrons. In <i>Conference on Lasers and Electro-Optics</i>. San Jose, CA, United States: Optica Publishing Group. <a href=\"https://doi.org/10.1364/cleo_qels.2017.fm3h.6\">https://doi.org/10.1364/cleo_qels.2017.fm3h.6</a>","mla":"Massuda, Aviram, et al. “Smith-Purcell Radiation from Low-Energy Electrons.” <i>Conference on Lasers and Electro-Optics</i>, FM3H.6, Optica Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1364/cleo_qels.2017.fm3h.6\">10.1364/cleo_qels.2017.fm3h.6</a>.","ista":"Massuda A, Roques-Carmes C, Yang Y, Kooi SE, Yang Y, Murdia C, Berggren KK, Kaminer I, Soljačić M. 2017. Smith-Purcell radiation from low-energy electrons. Conference on Lasers and Electro-Optics. CLEO: Fundamental Science, FM3H.6.","short":"A. Massuda, C. Roques-Carmes, Y. Yang, S.E. Kooi, Y. Yang, C. Murdia, K.K. Berggren, I. Kaminer, M. Soljačić, in:, Conference on Lasers and Electro-Optics, Optica Publishing Group, 2017."},"quality_controlled":"1","OA_type":"green","article_processing_charge":"No","extern":"1","month":"05","OA_place":"repository","publisher":"Optica Publishing Group","date_created":"2026-03-30T12:22:48Z","conference":{"end_date":"2017-05-19","location":"San Jose, CA, United States","start_date":"2017-05-14","name":"CLEO: Fundamental Science"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["9781943580279"]},"year":"2017","article_number":"FM3H.6","doi":"10.1364/cleo_qels.2017.fm3h.6","publication_status":"published","language":[{"iso":"eng"}],"title":"Smith-Purcell radiation from low-energy electrons","type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1710.05358","open_access":"1"}],"oa_version":"Preprint","day":"01","author":[{"first_name":"Aviram","full_name":"Massuda, Aviram","last_name":"Massuda"},{"last_name":"Roques-Carmes","full_name":"Roques-Carmes, Charles","id":"e2e68fc9-6505-11ef-a541-eb4e72cc3e82","first_name":"Charles"},{"first_name":"Yujia","last_name":"Yang","full_name":"Yang, Yujia"},{"first_name":"Steven E.","full_name":"Kooi, Steven E.","last_name":"Kooi"},{"first_name":"Yi","full_name":"Yang, Yi","last_name":"Yang"},{"last_name":"Murdia","full_name":"Murdia, Chitraang","first_name":"Chitraang"},{"last_name":"Berggren","full_name":"Berggren, Karl K.","first_name":"Karl K."},{"first_name":"Ido","last_name":"Kaminer","full_name":"Kaminer, Ido"},{"full_name":"Soljačić, Marin","last_name":"Soljačić","first_name":"Marin"}],"external_id":{"arxiv":["1710.05358"]},"date_published":"2017-05-01T00:00:00Z","publication":"Conference on Lasers and Electro-Optics","abstract":[{"lang":"eng","text":"Focused electron beams can induce electromagnetic radiation from periodic surfaces. We have used low-energy electrons (1.5-6kV) to induce visible light emission from nanoscale gratings (50nm and 60nm). Our results coincide well with numerical simulations."}]},{"citation":{"mla":"Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin Loebl et al., Springer, 2017, pp. 407–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">10.1007/978-3-319-44479-6_17</a>.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nešetřil, &#38; R. Thomas (Eds.), <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i> (pp. 407–447). Springer. <a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">https://doi.org/10.1007/978-3-319-44479-6_17</a>","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J. Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, Springer, 2017, pp. 407–447.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. , 407–447.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers.” In <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin Loebl, Jaroslav Nešetřil, and Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">https://doi.org/10.1007/978-3-319-44479-6_17</a>.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>. A Journey Through Discrete Mathematics. Springer; 2017:407-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">10.1007/978-3-319-44479-6_17</a>","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly numbers via betti numbers,” in <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017, pp. 407–447."},"quality_controlled":"1","article_processing_charge":"No","page":"407 - 447","month":"10","publisher":"Springer","related_material":{"record":[{"id":"1512","relation":"earlier_version","status":"public"}]},"oa":1,"publist_id":"7399","date_updated":"2026-06-18T18:48:49Z","_id":"424","status":"public","ddc":["500"],"department":[{"_id":"UlWa"}],"scopus_import":"1","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1310.4613","open_access":"1"}],"oa_version":"Published Version","day":"06","author":[{"full_name":"Goaoc, Xavier","last_name":"Goaoc","first_name":"Xavier"},{"first_name":"Pavel","full_name":"Paták, Pavel","last_name":"Paták"},{"full_name":"Patakova, Zuzana","last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683"},{"orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","last_name":"Tancer","first_name":"Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"date_published":"2017-10-06T00:00:00Z","external_id":{"arxiv":["1310.4613"]},"publication":"A Journey through Discrete Mathematics: A Tribute to Jiri Matousek","abstract":[{"text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b, d) such that the following holds. If F is a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤ i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced Z2-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these [d/2] first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map C*(K)→C*(Rd).","lang":"eng"}],"date_created":"2018-12-11T11:46:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Loebl","full_name":"Loebl, Martin","first_name":"Martin"},{"full_name":"Nešetřil, Jaroslav","last_name":"Nešetřil","first_name":"Jaroslav"},{"full_name":"Thomas, Robin","last_name":"Thomas","first_name":"Robin"}],"year":"2017","publication_identifier":{"isbn":["978-331944479-6"]},"doi":"10.1007/978-3-319-44479-6_17","series_title":"A Journey Through Discrete Mathematics","publication_status":"published","language":[{"iso":"eng"}],"title":"Bounding helly numbers via betti numbers","type":"book_chapter"},{"department":[{"_id":"KrPi"}],"_id":"1177","status":"public","date_updated":"2025-09-22T09:49:20Z","oa":1,"publist_id":"6177","publisher":"Springer","intvolume":"        74","month":"04","article_processing_charge":"No","page":"1321 - 1362","citation":{"ista":"Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.","short":"C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.","mla":"Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” <i>Algorithmica</i>, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:<a href=\"https://doi.org/10.1007/s00453-015-9997-6\">10.1007/s00453-015-9997-6</a>.","apa":"Kamath Hosdurg, C., &#38; Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-015-9997-6\">https://doi.org/10.1007/s00453-015-9997-6</a>","ieee":"C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound,” <i>Algorithmica</i>, vol. 74, no. 4. Springer, pp. 1321–1362, 2016.","ama":"Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. <i>Algorithmica</i>. 2016;74(4):1321-1362. doi:<a href=\"https://doi.org/10.1007/s00453-015-9997-6\">10.1007/s00453-015-9997-6</a>","chicago":"Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” <i>Algorithmica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00453-015-9997-6\">https://doi.org/10.1007/s00453-015-9997-6</a>."},"quality_controlled":"1","volume":74,"language":[{"iso":"eng"}],"isi":1,"title":"A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound","type":"journal_article","publication_status":"published","year":"2016","acknowledgement":"We are grateful to the anonymous reviewers for their insightful comments. The\r\ndetailed reports helped us a lot to address the technical mistakes as well as to improve the overall presentation of the paper.","doi":"10.1007/s00453-015-9997-6","date_created":"2018-12-11T11:50:33Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of (Formula presented.) , where (Formula presented.) denotes the upper bound on the underlying random oracle calls and (Formula presented.) , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of ‘dependence’ and ‘independence’ conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of (Formula presented.). By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent."}],"external_id":{"isi":["000373640000005"]},"date_published":"2016-04-01T00:00:00Z","publication":"Algorithmica","day":"01","author":[{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Sanjit","last_name":"Chatterjee","full_name":"Chatterjee, Sanjit"}],"main_file_link":[{"url":"http://eprint.iacr.org/2013/651","open_access":"1"}],"issue":"4","oa_version":"Submitted Version"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2016.46"}],"oa_version":"Published Version","day":"18","author":[{"first_name":"Gramoz","full_name":"Goranci, Gramoz","last_name":"Goranci"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"full_name":"Thorup, Mikkel","last_name":"Thorup","first_name":"Mikkel"}],"date_published":"2016-08-18T00:00:00Z","external_id":{"arxiv":["1611.06500"]},"publication":"24th Annual European Symposium on Algorithms","abstract":[{"lang":"eng","text":"We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with ~O(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC 2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997].\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(n log n/epsilon^2) space Monte-Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+epsilon)-approximation to the minimum cut. The algorithm has ~O(1) amortized update-time and constant query-time."}],"date_created":"2022-08-12T10:58:32Z","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Aarhus, Denmark","start_date":"2016-08-22","name":"ESA: Annual European Symposium on Algorithms","end_date":"2016-08-24"},"year":"2016","article_number":"46","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-015-6"]},"doi":"10.4230/LIPICS.ESA.2016.46","publication_status":"published","language":[{"iso":"eng"}],"title":"Incremental exact min-cut in poly-logarithmic amortized update time","type":"conference","citation":{"chicago":"Goranci, Gramoz, Monika Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” In <i>24th Annual European Symposium on Algorithms</i>, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">https://doi.org/10.4230/LIPICS.ESA.2016.46</a>.","ama":"Goranci G, Henzinger M, Thorup M. Incremental exact min-cut in poly-logarithmic amortized update time. In: <i>24th Annual European Symposium on Algorithms</i>. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">10.4230/LIPICS.ESA.2016.46</a>","ieee":"G. Goranci, M. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in <i>24th Annual European Symposium on Algorithms</i>, Aarhus, Denmark, 2016, vol. 57.","apa":"Goranci, G., Henzinger, M., &#38; Thorup, M. (2016). Incremental exact min-cut in poly-logarithmic amortized update time. In <i>24th Annual European Symposium on Algorithms</i> (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">https://doi.org/10.4230/LIPICS.ESA.2016.46</a>","mla":"Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” <i>24th Annual European Symposium on Algorithms</i>, vol. 57, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.46\">10.4230/LIPICS.ESA.2016.46</a>.","ista":"Goranci G, Henzinger M, Thorup M. 2016. Incremental exact min-cut in poly-logarithmic amortized update time. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 46.","short":"G. Goranci, M. Henzinger, M. Thorup, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"quality_controlled":"1","volume":57,"article_processing_charge":"No","extern":"1","month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"        57","oa":1,"date_updated":"2024-11-06T11:58:55Z","_id":"11834","status":"public","arxiv":1,"scopus_import":"1"},{"year":"2016","publication_identifier":{"isbn":["978-3-95977-015-6"],"issn":["1868-8969"]},"article_number":"48","doi":"10.4230/LIPICS.ESA.2016.48","date_created":"2022-08-12T11:05:41Z","alternative_title":["LIPIcs"],"conference":{"start_date":"2016-08-22","name":"ESA: Annual European Symposium on Algorithms","location":"Aarhus, Denmark","end_date":"2016-08-24"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","title":"Incremental and fully dynamic subgraph connectivity for emergency planning","publication_status":"published","day":"18","author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Stefan","full_name":"Neumann, Stefan","last_name":"Neumann"}],"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2016.48","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"During the last 10 years it has become popular to study dynamic graph problems in a emergency planning or sensitivity setting: Instead of considering the general fully dynamic problem, we only have to process a single batch update of size d; after the update we have to answer queries.\r\n\r\nIn this paper, we consider the dynamic subgraph connectivity problem with sensitivity d: We are given a graph of which some vertices are activated and some are deactivated. After that we get a single update in which the states of up to $d$ vertices are changed. Then we get a sequence of connectivity queries in the subgraph of activated vertices.\r\n\r\nWe present the first fully dynamic algorithm for this problem which has an update and query time only slightly worse than the best decremental algorithm. In addition, we present the first incremental algorithm which is tight with respect to the best known conditional lower bound; moreover, the algorithm is simple and we believe it is implementable and efficient in practice."}],"date_published":"2016-08-18T00:00:00Z","external_id":{"arxiv":["1611.05248"]},"publication":"24th Annual European Symposium on Algorithms","date_updated":"2024-11-06T11:59:06Z","oa":1,"arxiv":1,"scopus_import":"1","_id":"11835","status":"public","article_processing_charge":"No","citation":{"ieee":"M. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity for emergency planning,” in <i>24th Annual European Symposium on Algorithms</i>, Aarhus, Denmark, 2016, vol. 57.","chicago":"Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” In <i>24th Annual European Symposium on Algorithms</i>, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.48\">https://doi.org/10.4230/LIPICS.ESA.2016.48</a>.","ama":"Henzinger M, Neumann S. Incremental and fully dynamic subgraph connectivity for emergency planning. In: <i>24th Annual European Symposium on Algorithms</i>. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.48\">10.4230/LIPICS.ESA.2016.48</a>","short":"M. Henzinger, S. Neumann, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Henzinger M, Neumann S. 2016. Incremental and fully dynamic subgraph connectivity for emergency planning. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 48.","mla":"Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” <i>24th Annual European Symposium on Algorithms</i>, vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.48\">10.4230/LIPICS.ESA.2016.48</a>.","apa":"Henzinger, M., &#38; Neumann, S. (2016). Incremental and fully dynamic subgraph connectivity for emergency planning. In <i>24th Annual European Symposium on Algorithms</i> (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2016.48\">https://doi.org/10.4230/LIPICS.ESA.2016.48</a>"},"volume":57,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"        57","extern":"1","month":"08"},{"month":"08","extern":"1","intvolume":"        55","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":55,"quality_controlled":"1","citation":{"ieee":"Y. K. Cheung, G. Goranci, and M. Henzinger, “Graph minors for preserving terminal distances approximately - lower and upper bounds,” in <i>43rd International Colloquium on Automata, Languages, and Programming</i>, Rome, Italy, 2016, vol. 55.","ama":"Cheung YK, Goranci G, Henzinger M. Graph minors for preserving terminal distances approximately - lower and upper bounds. In: <i>43rd International Colloquium on Automata, Languages, and Programming</i>. Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2016.131\">10.4230/LIPICS.ICALP.2016.131</a>","chicago":"Cheung, Yun Kuen, Gramoz Goranci, and Monika Henzinger. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” In <i>43rd International Colloquium on Automata, Languages, and Programming</i>, Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2016.131\">https://doi.org/10.4230/LIPICS.ICALP.2016.131</a>.","short":"Y.K. Cheung, G. Goranci, M. Henzinger, in:, 43rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Cheung YK, Goranci G, Henzinger M. 2016. Graph minors for preserving terminal distances approximately - lower and upper bounds. 43rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 55, 131.","mla":"Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” <i>43rd International Colloquium on Automata, Languages, and Programming</i>, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2016.131\">10.4230/LIPICS.ICALP.2016.131</a>.","apa":"Cheung, Y. K., Goranci, G., &#38; Henzinger, M. (2016). Graph minors for preserving terminal distances approximately - lower and upper bounds. In <i>43rd International Colloquium on Automata, Languages, and Programming</i> (Vol. 55). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2016.131\">https://doi.org/10.4230/LIPICS.ICALP.2016.131</a>"},"article_processing_charge":"No","status":"public","_id":"11836","scopus_import":"1","arxiv":1,"oa":1,"date_updated":"2024-11-06T11:58:15Z","publication":"43rd International Colloquium on Automata, Languages, and Programming","date_published":"2016-08-23T00:00:00Z","external_id":{"arxiv":["1604.08342"]},"abstract":[{"lang":"eng","text":"Given a graph where vertices are partitioned into k terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately. The distortion of a compressed graph is the maximum multiplicative blow-up of distances between all pairs of terminals. We study the trade-off between the number of non-terminals and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem, in which all non-terminals must be removed.\r\n\r\nWe introduce a novel black-box reduction to convert any lower bound on distortion for the SPR problem into a super-linear lower bound on the number of non-terminals, with the same distortion, for our problem. This allows us to show that there exist graphs such that every minor with distortion less than 2 / 2.5 / 3 must have Omega(k^2) / Omega(k^{5/4}) / Omega(k^{6/5}) non-terminals, plus more trade-offs in between. The black-box reduction has an interesting consequence: if the tight lower bound on distortion for the SPR problem is super-constant, then allowing any O(k) non-terminals will not help improving the lower bound to a constant.\r\n\r\nWe also build on the existing results on spanners, distance oracles and connected 0-extensions to show a number of upper bounds for general graphs, planar graphs, graphs that exclude a fixed minor and bounded treewidth graphs. Among others, we show that any graph admits a minor with O(log k) distortion and O(k^2) non-terminals, and any planar graph admits a minor with\r\n1 + epsilon distortion and ~O((k/epsilon)^2) non-terminals."}],"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ICALP.2016.131","open_access":"1"}],"author":[{"first_name":"Yun Kuen","full_name":"Cheung, Yun Kuen","last_name":"Cheung"},{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"day":"23","publication_status":"published","title":"Graph minors for preserving terminal distances approximately - lower and upper bounds","type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2016-07-15","start_date":"2016-07-12","name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Rome, Italy"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"date_created":"2022-08-12T11:16:01Z","doi":"10.4230/LIPICS.ICALP.2016.131","year":"2016","article_number":"131","publication_identifier":{"isbn":["978-3-95977-013-2"],"issn":["1868-8969"]}},{"citation":{"ieee":"O. Musin and A. Nikitenko, “Optimal packings of congruent circles on a square flat torus,” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1. Springer, pp. 1–20, 2016.","chicago":"Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00454-015-9742-6\">https://doi.org/10.1007/s00454-015-9742-6</a>.","ama":"Musin O, Nikitenko A. Optimal packings of congruent circles on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. 2016;55(1):1-20. doi:<a href=\"https://doi.org/10.1007/s00454-015-9742-6\">10.1007/s00454-015-9742-6</a>","short":"O. Musin, A. Nikitenko, Discrete &#38; Computational Geometry 55 (2016) 1–20.","ista":"Musin O, Nikitenko A. 2016. Optimal packings of congruent circles on a square flat torus. Discrete &#38; Computational Geometry. 55(1), 1–20.","mla":"Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1, Springer, 2016, pp. 1–20, doi:<a href=\"https://doi.org/10.1007/s00454-015-9742-6\">10.1007/s00454-015-9742-6</a>.","apa":"Musin, O., &#38; Nikitenko, A. (2016). Optimal packings of congruent circles on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9742-6\">https://doi.org/10.1007/s00454-015-9742-6</a>"},"quality_controlled":"1","volume":55,"article_processing_charge":"No","page":"1 - 20","month":"01","publisher":"Springer","intvolume":"        55","oa":1,"publist_id":"6111","date_updated":"2025-09-22T09:32:23Z","_id":"1222","status":"public","department":[{"_id":"HeEd"}],"scopus_import":"1","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1212.0649"}],"issue":"1","oa_version":"Preprint","day":"01","author":[{"first_name":"Oleg","last_name":"Musin","full_name":"Musin, Oleg"},{"orcid":"0000-0002-0659-3201","last_name":"Nikitenko","full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton"}],"external_id":{"isi":["000367625500001"],"arxiv":["1212.0649"]},"date_published":"2016-01-01T00:00:00Z","publication":"Discrete & Computational Geometry","abstract":[{"lang":"eng","text":"We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason—the problem of “super resolution of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs."}],"date_created":"2018-12-11T11:50:48Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2016","acknowledgement":"We wish to thank Alexey Tarasov, Vladislav Volkov and Brittany Fasy for some useful comments and remarks, and especially Thom Sulanke for modifying surftri to suit our purposes. Oleg R. Musin was partially supported by the NSF Grant DMS-1400876 and by the RFBR Grant 15-01-99563. Anton V. Nikitenko was supported by the Chebyshev Laboratory (Department of Mathematics and Mechanics, St. Petersburg State University) under RF Government Grant 11.G34.31.0026.","doi":"10.1007/s00454-015-9742-6","publication_status":"published","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","title":"Optimal packings of congruent circles on a square flat torus"},{"publication_status":"published","article_type":"original","title":"Modelling the hydrological response of debris-free and debris-covered glaciers to present climatic conditions in the semiarid Andes of central Chile","type":"journal_article","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-20T08:14:40Z","doi":"10.1002/hyp.10971","keyword":["Water Science and Technology"],"publication_identifier":{"issn":["0885-6087"]},"year":"2016","publication":"Hydrological Processes","date_published":"2016-07-28T00:00:00Z","abstract":[{"lang":"eng","text":"We apply the process-based, distributed TOPKAPI-ETH glacio-hydrological model to a glacierized catchment (19% glacierized) in the semiarid Andes of central Chile. The semiarid Andes provides vital freshwater resources to valleys in Chile and Argentina, but only few glacio-hydrological modelling studies have been conducted, and its dominant hydrological processes remain poorly understood. The catchment contains two debris-free glaciers reaching down to 3900 m asl (Bello and Yeso glaciers) and one debris-covered avalanche-fed glacier reaching to 3200 m asl (Piramide Glacier). Our main objective is to compare the mass balance and runoff contributions of both glacier types under current climatic conditions. We use a unique dataset of field measurements collected over two ablation seasons combined with the distributed TOPKAPI-ETH model that includes physically oriented parameterizations of snow and ice ablation, gravitational distribution of snow, snow albedo evolution and the ablation of debris-covered ice. Model outputs indicate that while the mass balance of Bello and Yeso glaciers is mostly explained by temperature gradients, the Piramide Glacier mass balance is governed by debris thickness and avalanches and has a clear non-linear profile with elevation as a result. Despite the thermal insulation effect of the debris cover, the mass balance and contribution to runoff from debris-free and debris-covered glaciers are similar in magnitude, mainly because of elevation differences. However, runoff contributions are distinct in time and seasonality with ice melt starting approximately four weeks earlier from the debris-covered glacier, what is of relevance for water resources management. At the catchment scale, snowmelt is the dominant contributor to runoff during both years. However, during the driest year of our simulations, ice melt contributes 42 ± 8% and 67 ± 6% of the annual and summer runoff, respectively. Sensitivity analyses show that runoff is most sensitive to temperature and precipitation gradients, melt factors and debris cover thickness. "}],"oa_version":"None","issue":"22","author":[{"first_name":"A.","last_name":"Ayala","full_name":"Ayala, A."},{"last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"first_name":"S.","last_name":"MacDonell","full_name":"MacDonell, S."},{"full_name":"McPhee, J.","last_name":"McPhee","first_name":"J."},{"first_name":"S.","full_name":"Vivero, S.","last_name":"Vivero"},{"last_name":"Campos","full_name":"Campos, C.","first_name":"C."},{"first_name":"P.","full_name":"Egli, P.","last_name":"Egli"}],"day":"28","status":"public","_id":"12615","scopus_import":"1","date_updated":"2023-02-24T11:29:28Z","month":"07","extern":"1","intvolume":"        30","publisher":"Wiley","volume":30,"quality_controlled":"1","citation":{"ieee":"A. Ayala <i>et al.</i>, “Modelling the hydrological response of debris-free and debris-covered glaciers to present climatic conditions in the semiarid Andes of central Chile,” <i>Hydrological Processes</i>, vol. 30, no. 22. Wiley, pp. 4036–4058, 2016.","ama":"Ayala A, Pellicciotti F, MacDonell S, et al. Modelling the hydrological response of debris-free and debris-covered glaciers to present climatic conditions in the semiarid Andes of central Chile. <i>Hydrological Processes</i>. 2016;30(22):4036-4058. doi:<a href=\"https://doi.org/10.1002/hyp.10971\">10.1002/hyp.10971</a>","chicago":"Ayala, A., Francesca Pellicciotti, S. MacDonell, J. McPhee, S. Vivero, C. Campos, and P. Egli. “Modelling the Hydrological Response of Debris-Free and Debris-Covered Glaciers to Present Climatic Conditions in the Semiarid Andes of Central Chile.” <i>Hydrological Processes</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/hyp.10971\">https://doi.org/10.1002/hyp.10971</a>.","ista":"Ayala A, Pellicciotti F, MacDonell S, McPhee J, Vivero S, Campos C, Egli P. 2016. Modelling the hydrological response of debris-free and debris-covered glaciers to present climatic conditions in the semiarid Andes of central Chile. Hydrological Processes. 30(22), 4036–4058.","short":"A. Ayala, F. Pellicciotti, S. MacDonell, J. McPhee, S. Vivero, C. Campos, P. Egli, Hydrological Processes 30 (2016) 4036–4058.","mla":"Ayala, A., et al. “Modelling the Hydrological Response of Debris-Free and Debris-Covered Glaciers to Present Climatic Conditions in the Semiarid Andes of Central Chile.” <i>Hydrological Processes</i>, vol. 30, no. 22, Wiley, 2016, pp. 4036–58, doi:<a href=\"https://doi.org/10.1002/hyp.10971\">10.1002/hyp.10971</a>.","apa":"Ayala, A., Pellicciotti, F., MacDonell, S., McPhee, J., Vivero, S., Campos, C., &#38; Egli, P. (2016). Modelling the hydrological response of debris-free and debris-covered glaciers to present climatic conditions in the semiarid Andes of central Chile. <i>Hydrological Processes</i>. Wiley. <a href=\"https://doi.org/10.1002/hyp.10971\">https://doi.org/10.1002/hyp.10971</a>"},"page":"4036-4058","article_processing_charge":"No"},{"scopus_import":"1","status":"public","_id":"12617","date_updated":"2023-02-24T10:54:02Z","oa":1,"intvolume":"        10","publisher":"Copernicus Publications","month":"09","extern":"1","page":"2075-2097","article_processing_charge":"No","volume":10,"quality_controlled":"1","citation":{"chicago":"Ragettli, Silvan, Tobias Bolch, and Francesca Pellicciotti. “Heterogeneous Glacier Thinning Patterns over the Last 40 Years in Langtang Himal, Nepal.” <i>The Cryosphere</i>. Copernicus Publications, 2016. <a href=\"https://doi.org/10.5194/tc-10-2075-2016\">https://doi.org/10.5194/tc-10-2075-2016</a>.","ama":"Ragettli S, Bolch T, Pellicciotti F. Heterogeneous glacier thinning patterns over the last 40 years in Langtang Himal, Nepal. <i>The Cryosphere</i>. 2016;10(5):2075-2097. doi:<a href=\"https://doi.org/10.5194/tc-10-2075-2016\">10.5194/tc-10-2075-2016</a>","ieee":"S. Ragettli, T. Bolch, and F. Pellicciotti, “Heterogeneous glacier thinning patterns over the last 40 years in Langtang Himal, Nepal,” <i>The Cryosphere</i>, vol. 10, no. 5. Copernicus Publications, pp. 2075–2097, 2016.","apa":"Ragettli, S., Bolch, T., &#38; Pellicciotti, F. (2016). Heterogeneous glacier thinning patterns over the last 40 years in Langtang Himal, Nepal. <i>The Cryosphere</i>. Copernicus Publications. <a href=\"https://doi.org/10.5194/tc-10-2075-2016\">https://doi.org/10.5194/tc-10-2075-2016</a>","mla":"Ragettli, Silvan, et al. “Heterogeneous Glacier Thinning Patterns over the Last 40 Years in Langtang Himal, Nepal.” <i>The Cryosphere</i>, vol. 10, no. 5, Copernicus Publications, 2016, pp. 2075–97, doi:<a href=\"https://doi.org/10.5194/tc-10-2075-2016\">10.5194/tc-10-2075-2016</a>.","short":"S. Ragettli, T. Bolch, F. Pellicciotti, The Cryosphere 10 (2016) 2075–2097.","ista":"Ragettli S, Bolch T, Pellicciotti F. 2016. Heterogeneous glacier thinning patterns over the last 40 years in Langtang Himal, Nepal. The Cryosphere. 10(5), 2075–2097."},"title":"Heterogeneous glacier thinning patterns over the last 40 years in Langtang Himal, Nepal","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","article_type":"original","keyword":["Earth-Surface Processes","Water Science and Technology"],"doi":"10.5194/tc-10-2075-2016","publication_identifier":{"issn":["1994-0424"]},"year":"2016","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-20T08:14:51Z","abstract":[{"text":"This study presents volume and mass changes of seven (five partially debris-covered, two debris-free) glaciers in the upper Langtang catchment in Nepal. We use a digital elevation model (DEM) from 1974 stereo Hexagon satellite data and seven DEMs derived from 2006–2015 stereo or tri-stereo satellite imagery (e.g., SPOT6/7). The availability of multiple independent DEM differences allows the identification of a robust signal and narrowing down of the uncertainty about recent volume changes. The volume changes calculated over several multiyear periods between 2006 and 2015 consistently indicate that glacier thinning has accelerated with respect to the period 1974–2006. We calculate an ensemble-mean elevation change rate of –0.45 ± 0.18 m a−1 for 2006–2015, while for the period 1974–2006 we compute a rate of −0.24 ± 0.08 m a−1. However, the behavior of glaciers in the study area is heterogeneous, and the presence or absence of debris does not seem to be a good predictor for mass balance trends. Debris-covered tongues have nonlinear thinning profiles, and we show that recent accelerations in thinning correlate with the presence of supraglacial cliffs and lakes. At stagnating glacier areas near the glacier front, however, thinning rates decreased with time or remained constant. The April 2015 Nepal earthquake triggered large avalanches in the study catchment. Analysis of two post-earthquake DEMs revealed that the avalanche deposit volumes remaining 6 months after the earthquake are negligible in comparison to 2006–2015 elevation changes. However, the deposits compensate about 40 % the mass loss of debris-covered tongues of 1 average year.","lang":"eng"}],"publication":"The Cryosphere","date_published":"2016-09-14T00:00:00Z","author":[{"full_name":"Ragettli, Silvan","last_name":"Ragettli","first_name":"Silvan"},{"full_name":"Bolch, Tobias","last_name":"Bolch","first_name":"Tobias"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"day":"14","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5194/tc-10-2075-2016"}],"issue":"5"},{"oa":1,"date_updated":"2023-02-24T10:11:46Z","_id":"12625","status":"public","scopus_import":"1","citation":{"mla":"Kraaijenbrink, Philip, et al. “Seasonal Surface Velocities of a Himalayan Glacier Derived by Automated Correlation of Unmanned Aerial Vehicle Imagery.” <i>Annals of Glaciology</i>, vol. 57, no. 71, International Glaciological Society, 2016, pp. 103–13, doi:<a href=\"https://doi.org/10.3189/2016aog71a072\">10.3189/2016aog71a072</a>.","apa":"Kraaijenbrink, P., Meijer, S. W., Shea, J. M., Pellicciotti, F., De Jong, S. M., &#38; Immerzeel, W. W. (2016). Seasonal surface velocities of a Himalayan glacier derived by automated correlation of unmanned aerial vehicle imagery. <i>Annals of Glaciology</i>. International Glaciological Society. <a href=\"https://doi.org/10.3189/2016aog71a072\">https://doi.org/10.3189/2016aog71a072</a>","short":"P. Kraaijenbrink, S.W. Meijer, J.M. Shea, F. Pellicciotti, S.M. De Jong, W.W. Immerzeel, Annals of Glaciology 57 (2016) 103–113.","ista":"Kraaijenbrink P, Meijer SW, Shea JM, Pellicciotti F, De Jong SM, Immerzeel WW. 2016. Seasonal surface velocities of a Himalayan glacier derived by automated correlation of unmanned aerial vehicle imagery. Annals of Glaciology. 57(71), 103–113.","ama":"Kraaijenbrink P, Meijer SW, Shea JM, Pellicciotti F, De Jong SM, Immerzeel WW. Seasonal surface velocities of a Himalayan glacier derived by automated correlation of unmanned aerial vehicle imagery. <i>Annals of Glaciology</i>. 2016;57(71):103-113. doi:<a href=\"https://doi.org/10.3189/2016aog71a072\">10.3189/2016aog71a072</a>","chicago":"Kraaijenbrink, Philip, Sander W. Meijer, Joseph M. Shea, Francesca Pellicciotti, Steven M. De Jong, and Walter W. Immerzeel. “Seasonal Surface Velocities of a Himalayan Glacier Derived by Automated Correlation of Unmanned Aerial Vehicle Imagery.” <i>Annals of Glaciology</i>. International Glaciological Society, 2016. <a href=\"https://doi.org/10.3189/2016aog71a072\">https://doi.org/10.3189/2016aog71a072</a>.","ieee":"P. Kraaijenbrink, S. W. Meijer, J. M. Shea, F. Pellicciotti, S. M. De Jong, and W. W. Immerzeel, “Seasonal surface velocities of a Himalayan glacier derived by automated correlation of unmanned aerial vehicle imagery,” <i>Annals of Glaciology</i>, vol. 57, no. 71. International Glaciological Society, pp. 103–113, 2016."},"quality_controlled":"1","volume":57,"article_processing_charge":"No","page":"103-113","extern":"1","month":"03","publisher":"International Glaciological Society","intvolume":"        57","date_created":"2023-02-20T08:15:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0260-3055"],"eissn":["1727-5644"]},"year":"2016","doi":"10.3189/2016aog71a072","keyword":["Earth-Surface Processes"],"article_type":"original","publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","title":"Seasonal surface velocities of a Himalayan glacier derived by automated correlation of unmanned aerial vehicle imagery","issue":"71","main_file_link":[{"url":"https://doi.org/10.3189/2016AoG71A072","open_access":"1"}],"oa_version":"Published Version","day":"01","author":[{"first_name":"Philip","full_name":"Kraaijenbrink, Philip","last_name":"Kraaijenbrink"},{"full_name":"Meijer, Sander W.","last_name":"Meijer","first_name":"Sander W."},{"first_name":"Joseph M.","last_name":"Shea","full_name":"Shea, Joseph M."},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"},{"full_name":"De Jong, Steven M.","last_name":"De Jong","first_name":"Steven M."},{"first_name":"Walter W.","last_name":"Immerzeel","full_name":"Immerzeel, Walter W."}],"date_published":"2016-03-01T00:00:00Z","publication":"Annals of Glaciology","abstract":[{"text":"Debris-covered glaciers play an important role in the high-altitude water cycle in the Himalaya, yet their dynamics are poorly understood, partly because of the difficult fieldwork conditions. In this study we therefore deploy an unmanned aerial vehicle (UAV) three times (May 2013, October 2013 and May 2014) over the debris-covered Lirung Glacier in Nepal. The acquired data are processed into orthomosaics and elevation models by a Structure from Motion workflow, and seasonal surface velocity is derived using frequency cross-correlation. In order to obtain optimal surface velocity products, the effects of different input data and correlator configurations are evaluated, which reveals that the orthomosaic as input paired with moderate correlator settings provides the best results. The glacier has considerable spatial and seasonal differences in surface velocity, with maximum summer and winter velocities 6 and 2.5 m a-1, respectively, in the upper part of the tongue, while the lower part is nearly stagnant. It is hypothesized that the higher velocities during summer are caused by basal sliding due to increased lubrication of the bed. We conclude that UAVs have great potential to quantify seasonal and annual variations in flow and can help to further our understanding of debris-covered glaciers.","lang":"eng"}]},{"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"}],"external_id":{"arxiv":["1408.3918"]},"date_published":"2016-01-01T00:00:00Z","publication":"Moscow Mathematical Journal","day":"01","author":[{"full_name":"Avvakumov, Serhii","last_name":"Avvakumov","first_name":"Serhii","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"}],"issue":"1","main_file_link":[{"url":"http://arxiv.org/abs/1408.3918","open_access":"1"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"title":"The classification of certain linked 3-manifolds in 6-space","type":"journal_article","article_type":"original","publication_status":"published","publication_identifier":{"eissn":["1609-4514"]},"year":"2016","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.","doi":"10.17323/1609-4514-2016-16-1-1-25","date_created":"2018-12-11T11:52:30Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Independent University of Moscow","intvolume":"        16","month":"01","article_processing_charge":"No","page":"1 - 25","citation":{"mla":"Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.” <i>Moscow Mathematical Journal</i>, vol. 16, no. 1, Independent University of Moscow, 2016, pp. 1–25, doi:<a href=\"https://doi.org/10.17323/1609-4514-2016-16-1-1-25\">10.17323/1609-4514-2016-16-1-1-25</a>.","apa":"Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space. <i>Moscow Mathematical Journal</i>. Independent University of Moscow. <a href=\"https://doi.org/10.17323/1609-4514-2016-16-1-1-25\">https://doi.org/10.17323/1609-4514-2016-16-1-1-25</a>","short":"S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25.","ista":"Avvakumov S. 2016. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 16(1), 1–25.","chicago":"Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.” <i>Moscow Mathematical Journal</i>. Independent University of Moscow, 2016. <a href=\"https://doi.org/10.17323/1609-4514-2016-16-1-1-25\">https://doi.org/10.17323/1609-4514-2016-16-1-1-25</a>.","ama":"Avvakumov S. The classification of certain linked 3-manifolds in 6-space. <i>Moscow Mathematical Journal</i>. 2016;16(1):1-25. doi:<a href=\"https://doi.org/10.17323/1609-4514-2016-16-1-1-25\">10.17323/1609-4514-2016-16-1-1-25</a>","ieee":"S. Avvakumov, “The classification of certain linked 3-manifolds in 6-space,” <i>Moscow Mathematical Journal</i>, vol. 16, no. 1. Independent University of Moscow, pp. 1–25, 2016."},"volume":16,"quality_controlled":"1","department":[{"_id":"UlWa"}],"arxiv":1,"scopus_import":"1","corr_author":"1","_id":"1522","status":"public","date_updated":"2024-10-09T20:56:44Z","oa":1,"publist_id":"5652"},{"oa":1,"date_updated":"2024-03-27T08:23:11Z","_id":"15245","status":"public","scopus_import":"1","arxiv":1,"citation":{"ista":"Zhang SN et al. 2016. eXTP: Enhanced X-ray timing and polarization mission. Proceedings of the SPIE. vol. 9905, 99051Q.","short":"S.N. Zhang, M. Feroci, A. Santangelo, Y.W. Dong, H. Feng, F.J. Lu, K. Nandra, Z.S. Wang, S. Zhang, E. Bozzo, S. Brandt, A. De Rosa, L.J. Gou, M. Hernanz, M. van der Klis, X.D. Li, Y. Liu, P. Orleanski, G. Pareschi, M. Pohl, J. Poutanen, J.L. Qu, S. Schanne, L. Stella, P. Uttley, A. Watts, R.X. Xu, W.F. Yu, J.J.M. in ’t Zand, S. Zane, L. Alvarez, L. Amati, L. Baldini, C. Bambi, S. Basso, S. Bhattacharyya, R. Bellazzini, T. Belloni, P. Bellutti, S. Bianchi, A. Brez, M. Bursa, V. Burwitz, C. Budtz-Jørgensen, I. Caiazzo, R. Campana, X.L. Cao, P. Casella, C.Y. Chen, L. Chen, T. Chen, Y. Chen, Y. Chen, Y.P. Chen, M. Civitani, F. Coti Zelati, W. Cui, W.W. Cui, Z.G. Dai, E. Del Monte, D. de Martino, S. Di Cosimo, S. Diebold, M. Dovciak, I. Donnarumma, V. Doroshenko, P. Esposito, Y. Evangelista, Y. Favre, P. Friedrich, F. Fuschino, J.L. Galvez, Z.L. Gao, M.Y. Ge, O. Gevin, D. Goetz, D.W. Han, J. Heyl, J. Horak, W. Hu, F. Huang, Q.S. Huang, R. Hudec, D. Huppenkothen, G.L. Israel, A. Ingram, V. Karas, D. Karelin, P.A. Jenke, L. Ji, S. Korpela, D. Kunneriath, C. Labanti, G. Li, X. Li, Z.S. Li, E.W. Liang, O. Limousin, L. Lin, Z.X. Ling, H.B. Liu, H.W. Liu, Z. Liu, B. Lu, N. Lund, D. Lai, B. Luo, T. Luo, B. Ma, S. Mahmoodifar, M. Marisaldi, A. Martindale, N. Meidinger, Y.P. Men, M. Michalska, R. Mignani, M. Minuti, S. Motta, F. Muleri, J. Neilsen, M. Orlandini, A.T. Pan, A. Patruno, E. Perinati, A. Picciotto, C. Piemonte, M. Pinchera, A. Rachevski, M. Rapisarda, N. Rea, E.M.R. Rossi, A. Rubini, G. Sala, X.W. Shu, C. Sgro, Z.X. Shen, P. Soffitta, L.M. Song, G. Spandre, G. Stratta, T.E. Strohmayer, L. Sun, J. Svoboda, G. Tagliaferri, C. Tenzer, T. Hong, R. Taverna, G. Torok, R. Turolla, S. Vacchi, J. Wang, D. Walton, K. Wang, J.F. Wang, R.J. Wang, Y.F. Wang, S.S. Weng, J. Wilms, B. Winter, X. Wu, X.F. Wu, S.L. Xiong, Y.P. Xu, Y.Q. Xue, Z. Yan, S. Yang, X. Yang, Y.J. Yang, F. Yuan, W.M. Yuan, Y.F. Yuan, G. Zampa, N. Zampa, A. Zdziarski, C. Zhang, C.L. Zhang, L. Zhang, X. Zhang, Z. Zhang, W.D. Zhang, S.J. Zheng, P. Zhou, X.L. Zhou, in:, Proceedings of the SPIE, SPIE, 2016.","mla":"Zhang, S. N., et al. “EXTP: Enhanced X-Ray Timing and Polarization Mission.” <i>Proceedings of the SPIE</i>, vol. 9905, 99051Q, SPIE, 2016, doi:<a href=\"https://doi.org/10.1117/12.2232034\">10.1117/12.2232034</a>.","apa":"Zhang, S. N., Feroci, M., Santangelo, A., Dong, Y. W., Feng, H., Lu, F. J., … Zhou, X. L. (2016). eXTP: Enhanced X-ray timing and polarization mission. In <i>Proceedings of the SPIE</i> (Vol. 9905). SPIE. <a href=\"https://doi.org/10.1117/12.2232034\">https://doi.org/10.1117/12.2232034</a>","ieee":"S. N. Zhang <i>et al.</i>, “eXTP: Enhanced X-ray timing and polarization mission,” in <i>Proceedings of the SPIE</i>, 2016, vol. 9905.","chicago":"Zhang, S. N., M. Feroci, A. Santangelo, Y. W. Dong, H. Feng, F. J. Lu, K. Nandra, et al. “EXTP: Enhanced X-Ray Timing and Polarization Mission.” In <i>Proceedings of the SPIE</i>, Vol. 9905. SPIE, 2016. <a href=\"https://doi.org/10.1117/12.2232034\">https://doi.org/10.1117/12.2232034</a>.","ama":"Zhang SN, Feroci M, Santangelo A, et al. eXTP: Enhanced X-ray timing and polarization mission. In: <i>Proceedings of the SPIE</i>. Vol 9905. SPIE; 2016. doi:<a href=\"https://doi.org/10.1117/12.2232034\">10.1117/12.2232034</a>"},"quality_controlled":"1","volume":9905,"article_processing_charge":"No","extern":"1","month":"07","publisher":"SPIE","intvolume":"      9905","date_created":"2024-03-26T10:42:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"99051Q ","year":"2016","publication_identifier":{"issn":["0277-786X"]},"doi":"10.1117/12.2232034","publication_status":"published","language":[{"iso":"eng"}],"title":"eXTP: Enhanced X-ray timing and polarization mission","type":"conference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1607.08823"}],"oa_version":"Preprint","day":"01","author":[{"first_name":"S. N.","full_name":"Zhang, S. N.","last_name":"Zhang"},{"first_name":"M.","last_name":"Feroci","full_name":"Feroci, M."},{"full_name":"Santangelo, A.","last_name":"Santangelo","first_name":"A."},{"last_name":"Dong","full_name":"Dong, Y. W.","first_name":"Y. W."},{"last_name":"Feng","full_name":"Feng, H.","first_name":"H."},{"full_name":"Lu, F. J.","last_name":"Lu","first_name":"F. J."},{"last_name":"Nandra","full_name":"Nandra, K.","first_name":"K."},{"full_name":"Wang, Z. S.","last_name":"Wang","first_name":"Z. S."},{"full_name":"Zhang, S.","last_name":"Zhang","first_name":"S."},{"first_name":"E.","full_name":"Bozzo, E.","last_name":"Bozzo"},{"full_name":"Brandt, S.","last_name":"Brandt","first_name":"S."},{"first_name":"A.","last_name":"De Rosa","full_name":"De Rosa, A."},{"last_name":"Gou","full_name":"Gou, L. J.","first_name":"L. J."},{"first_name":"M.","last_name":"Hernanz","full_name":"Hernanz, M."},{"full_name":"van der Klis, M.","last_name":"van der Klis","first_name":"M."},{"full_name":"Li, X. D.","last_name":"Li","first_name":"X. D."},{"first_name":"Y.","last_name":"Liu","full_name":"Liu, Y."},{"full_name":"Orleanski, P.","last_name":"Orleanski","first_name":"P."},{"full_name":"Pareschi, G.","last_name":"Pareschi","first_name":"G."},{"first_name":"M.","last_name":"Pohl","full_name":"Pohl, M."},{"full_name":"Poutanen, J.","last_name":"Poutanen","first_name":"J."},{"first_name":"J. L.","full_name":"Qu, J. L.","last_name":"Qu"},{"first_name":"S.","full_name":"Schanne, S.","last_name":"Schanne"},{"last_name":"Stella","full_name":"Stella, L.","first_name":"L."},{"full_name":"Uttley, P.","last_name":"Uttley","first_name":"P."},{"first_name":"A.","full_name":"Watts, A.","last_name":"Watts"},{"first_name":"R. X.","full_name":"Xu, R. X.","last_name":"Xu"},{"first_name":"W. F.","full_name":"Yu, W. F.","last_name":"Yu"},{"first_name":"J. J. M.","full_name":"in ’t Zand, J. J. M.","last_name":"in ’t Zand"},{"last_name":"Zane","full_name":"Zane, S.","first_name":"S."},{"last_name":"Alvarez","full_name":"Alvarez, L.","first_name":"L."},{"first_name":"L.","last_name":"Amati","full_name":"Amati, L."},{"last_name":"Baldini","full_name":"Baldini, L.","first_name":"L."},{"full_name":"Bambi, C.","last_name":"Bambi","first_name":"C."},{"first_name":"S.","full_name":"Basso, S.","last_name":"Basso"},{"full_name":"Bhattacharyya, S.","last_name":"Bhattacharyya","first_name":"S."},{"first_name":"R.","last_name":"Bellazzini","full_name":"Bellazzini, R."},{"full_name":"Belloni, T.","last_name":"Belloni","first_name":"T."},{"full_name":"Bellutti, P.","last_name":"Bellutti","first_name":"P."},{"first_name":"S.","last_name":"Bianchi","full_name":"Bianchi, S."},{"last_name":"Brez","full_name":"Brez, A.","first_name":"A."},{"first_name":"M.","last_name":"Bursa","full_name":"Bursa, M."},{"last_name":"Burwitz","full_name":"Burwitz, V.","first_name":"V."},{"full_name":"Budtz-Jørgensen, C.","last_name":"Budtz-Jørgensen","first_name":"C."},{"last_name":"Caiazzo","full_name":"Caiazzo, Ilaria","id":"8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d","first_name":"Ilaria","orcid":"0000-0002-4770-5388"},{"first_name":"R.","last_name":"Campana","full_name":"Campana, R."},{"last_name":"Cao","full_name":"Cao, X. L.","first_name":"X. L."},{"last_name":"Casella","full_name":"Casella, P.","first_name":"P."},{"last_name":"Chen","full_name":"Chen, C. Y.","first_name":"C. Y."},{"full_name":"Chen, L.","last_name":"Chen","first_name":"L."},{"first_name":"T.","full_name":"Chen, T.","last_name":"Chen"},{"first_name":"Y.","last_name":"Chen","full_name":"Chen, Y."},{"last_name":"Chen","full_name":"Chen, Y.","first_name":"Y."},{"first_name":"Y. P.","last_name":"Chen","full_name":"Chen, Y. P."},{"first_name":"M.","last_name":"Civitani","full_name":"Civitani, M."},{"first_name":"F.","full_name":"Coti Zelati, F.","last_name":"Coti Zelati"},{"last_name":"Cui","full_name":"Cui, W.","first_name":"W."},{"first_name":"W. W.","full_name":"Cui, W. W.","last_name":"Cui"},{"first_name":"Z. G.","last_name":"Dai","full_name":"Dai, Z. G."},{"first_name":"E.","last_name":"Del Monte","full_name":"Del Monte, E."},{"first_name":"D.","last_name":"de Martino","full_name":"de Martino, D."},{"last_name":"Di Cosimo","full_name":"Di Cosimo, S.","first_name":"S."},{"last_name":"Diebold","full_name":"Diebold, S.","first_name":"S."},{"first_name":"M.","full_name":"Dovciak, M.","last_name":"Dovciak"},{"last_name":"Donnarumma","full_name":"Donnarumma, I.","first_name":"I."},{"first_name":"V.","last_name":"Doroshenko","full_name":"Doroshenko, V."},{"last_name":"Esposito","full_name":"Esposito, P.","first_name":"P."},{"first_name":"Y.","full_name":"Evangelista, Y.","last_name":"Evangelista"},{"first_name":"Y.","last_name":"Favre","full_name":"Favre, Y."},{"last_name":"Friedrich","full_name":"Friedrich, P.","first_name":"P."},{"first_name":"F.","full_name":"Fuschino, F.","last_name":"Fuschino"},{"first_name":"J. L.","full_name":"Galvez, J. L.","last_name":"Galvez"},{"last_name":"Gao","full_name":"Gao, Z. L.","first_name":"Z. L."},{"first_name":"M. Y.","full_name":"Ge, M. Y.","last_name":"Ge"},{"first_name":"O.","last_name":"Gevin","full_name":"Gevin, O."},{"full_name":"Goetz, D.","last_name":"Goetz","first_name":"D."},{"full_name":"Han, D. W.","last_name":"Han","first_name":"D. W."},{"first_name":"J.","full_name":"Heyl, J.","last_name":"Heyl"},{"full_name":"Horak, J.","last_name":"Horak","first_name":"J."},{"first_name":"W.","last_name":"Hu","full_name":"Hu, W."},{"first_name":"F.","last_name":"Huang","full_name":"Huang, F."},{"last_name":"Huang","full_name":"Huang, Q. S.","first_name":"Q. S."},{"first_name":"R.","last_name":"Hudec","full_name":"Hudec, R."},{"last_name":"Huppenkothen","full_name":"Huppenkothen, D.","first_name":"D."},{"full_name":"Israel, G. L.","last_name":"Israel","first_name":"G. L."},{"full_name":"Ingram, A.","last_name":"Ingram","first_name":"A."},{"full_name":"Karas, V.","last_name":"Karas","first_name":"V."},{"first_name":"D.","last_name":"Karelin","full_name":"Karelin, D."},{"last_name":"Jenke","full_name":"Jenke, P. A.","first_name":"P. A."},{"first_name":"L.","last_name":"Ji","full_name":"Ji, L."},{"full_name":"Korpela, S.","last_name":"Korpela","first_name":"S."},{"first_name":"D.","last_name":"Kunneriath","full_name":"Kunneriath, D."},{"first_name":"C.","last_name":"Labanti","full_name":"Labanti, C."},{"first_name":"G.","last_name":"Li","full_name":"Li, G."},{"full_name":"Li, X.","last_name":"Li","first_name":"X."},{"first_name":"Z. S.","full_name":"Li, Z. S.","last_name":"Li"},{"last_name":"Liang","full_name":"Liang, E. W.","first_name":"E. W."},{"last_name":"Limousin","full_name":"Limousin, O.","first_name":"O."},{"first_name":"L.","full_name":"Lin, L.","last_name":"Lin"},{"first_name":"Z. X.","last_name":"Ling","full_name":"Ling, Z. X."},{"last_name":"Liu","full_name":"Liu, H. B.","first_name":"H. B."},{"first_name":"H. W.","full_name":"Liu, H. W.","last_name":"Liu"},{"last_name":"Liu","full_name":"Liu, Z.","first_name":"Z."},{"first_name":"B.","full_name":"Lu, B.","last_name":"Lu"},{"full_name":"Lund, N.","last_name":"Lund","first_name":"N."},{"first_name":"D.","last_name":"Lai","full_name":"Lai, D."},{"first_name":"B.","full_name":"Luo, B.","last_name":"Luo"},{"full_name":"Luo, T.","last_name":"Luo","first_name":"T."},{"last_name":"Ma","full_name":"Ma, B.","first_name":"B."},{"last_name":"Mahmoodifar","full_name":"Mahmoodifar, S.","first_name":"S."},{"first_name":"M.","full_name":"Marisaldi, M.","last_name":"Marisaldi"},{"full_name":"Martindale, A.","last_name":"Martindale","first_name":"A."},{"first_name":"N.","full_name":"Meidinger, N.","last_name":"Meidinger"},{"first_name":"Y. P.","full_name":"Men, Y. P.","last_name":"Men"},{"full_name":"Michalska, M.","last_name":"Michalska","first_name":"M."},{"last_name":"Mignani","full_name":"Mignani, R.","first_name":"R."},{"full_name":"Minuti, M.","last_name":"Minuti","first_name":"M."},{"first_name":"S.","full_name":"Motta, S.","last_name":"Motta"},{"last_name":"Muleri","full_name":"Muleri, F.","first_name":"F."},{"first_name":"J.","full_name":"Neilsen, J.","last_name":"Neilsen"},{"last_name":"Orlandini","full_name":"Orlandini, M.","first_name":"M."},{"first_name":"A. T.","last_name":"Pan","full_name":"Pan, A. T."},{"first_name":"A.","full_name":"Patruno, A.","last_name":"Patruno"},{"full_name":"Perinati, E.","last_name":"Perinati","first_name":"E."},{"last_name":"Picciotto","full_name":"Picciotto, A.","first_name":"A."},{"first_name":"C.","full_name":"Piemonte, C.","last_name":"Piemonte"},{"full_name":"Pinchera, M.","last_name":"Pinchera","first_name":"M."},{"last_name":"Rachevski","full_name":"Rachevski, A.","first_name":"A."},{"last_name":"Rapisarda","full_name":"Rapisarda, M.","first_name":"M."},{"last_name":"Rea","full_name":"Rea, N.","first_name":"N."},{"last_name":"Rossi","full_name":"Rossi, E. M. R.","first_name":"E. M. R."},{"first_name":"A.","last_name":"Rubini","full_name":"Rubini, A."},{"first_name":"G.","full_name":"Sala, G.","last_name":"Sala"},{"last_name":"Shu","full_name":"Shu, X. W.","first_name":"X. W."},{"first_name":"C.","last_name":"Sgro","full_name":"Sgro, C."},{"first_name":"Z. X.","full_name":"Shen, Z. X.","last_name":"Shen"},{"full_name":"Soffitta, P.","last_name":"Soffitta","first_name":"P."},{"first_name":"L. M.","last_name":"Song","full_name":"Song, L. M."},{"first_name":"G.","full_name":"Spandre, G.","last_name":"Spandre"},{"first_name":"G.","full_name":"Stratta, G.","last_name":"Stratta"},{"first_name":"T. E.","full_name":"Strohmayer, T. E.","last_name":"Strohmayer"},{"first_name":"L.","last_name":"Sun","full_name":"Sun, L."},{"first_name":"J.","full_name":"Svoboda, J.","last_name":"Svoboda"},{"full_name":"Tagliaferri, G.","last_name":"Tagliaferri","first_name":"G."},{"first_name":"C.","full_name":"Tenzer, C.","last_name":"Tenzer"},{"full_name":"Hong, T.","last_name":"Hong","first_name":"T."},{"first_name":"R.","full_name":"Taverna, R.","last_name":"Taverna"},{"first_name":"G.","last_name":"Torok","full_name":"Torok, G."},{"last_name":"Turolla","full_name":"Turolla, R.","first_name":"R."},{"full_name":"Vacchi, S.","last_name":"Vacchi","first_name":"S."},{"first_name":"J.","last_name":"Wang","full_name":"Wang, J."},{"last_name":"Walton","full_name":"Walton, D.","first_name":"D."},{"last_name":"Wang","full_name":"Wang, K.","first_name":"K."},{"last_name":"Wang","full_name":"Wang, J. F.","first_name":"J. F."},{"first_name":"R. J.","last_name":"Wang","full_name":"Wang, R. J."},{"full_name":"Wang, Y. F.","last_name":"Wang","first_name":"Y. F."},{"first_name":"S. S.","last_name":"Weng","full_name":"Weng, S. S."},{"first_name":"J.","last_name":"Wilms","full_name":"Wilms, J."},{"last_name":"Winter","full_name":"Winter, B.","first_name":"B."},{"last_name":"Wu","full_name":"Wu, X.","first_name":"X."},{"last_name":"Wu","full_name":"Wu, X. F.","first_name":"X. F."},{"last_name":"Xiong","full_name":"Xiong, S. L.","first_name":"S. L."},{"first_name":"Y. P.","last_name":"Xu","full_name":"Xu, Y. P."},{"last_name":"Xue","full_name":"Xue, Y. Q.","first_name":"Y. Q."},{"first_name":"Z.","full_name":"Yan, Z.","last_name":"Yan"},{"full_name":"Yang, S.","last_name":"Yang","first_name":"S."},{"first_name":"X.","last_name":"Yang","full_name":"Yang, X."},{"first_name":"Y. J.","full_name":"Yang, Y. J.","last_name":"Yang"},{"full_name":"Yuan, F.","last_name":"Yuan","first_name":"F."},{"first_name":"W. M.","full_name":"Yuan, W. M.","last_name":"Yuan"},{"last_name":"Yuan","full_name":"Yuan, Y. F.","first_name":"Y. F."},{"first_name":"G.","last_name":"Zampa","full_name":"Zampa, G."},{"full_name":"Zampa, N.","last_name":"Zampa","first_name":"N."},{"first_name":"A.","last_name":"Zdziarski","full_name":"Zdziarski, A."},{"first_name":"C.","full_name":"Zhang, C.","last_name":"Zhang"},{"first_name":"C. L.","full_name":"Zhang, C. L.","last_name":"Zhang"},{"first_name":"L.","full_name":"Zhang, L.","last_name":"Zhang"},{"last_name":"Zhang","full_name":"Zhang, X.","first_name":"X."},{"first_name":"Z.","full_name":"Zhang, Z.","last_name":"Zhang"},{"first_name":"W. D.","last_name":"Zhang","full_name":"Zhang, W. D."},{"full_name":"Zheng, S. J.","last_name":"Zheng","first_name":"S. J."},{"last_name":"Zhou","full_name":"Zhou, P.","first_name":"P."},{"first_name":"X. L.","full_name":"Zhou, X. L.","last_name":"Zhou"}],"external_id":{"arxiv":["1607.08823"]},"date_published":"2016-07-01T00:00:00Z","publication":"Proceedings of the SPIE","abstract":[{"lang":"eng","text":"eXTP is a science mission designed to study the state of matter under extreme conditions of density, gravity and magnetism. Primary goals are the determination of the equation of state of matter at supra-nuclear density, the measurement of QED effects in highly magnetized star, and the study of accretion in the strong-field regime of gravity. Primary targets include isolated and binary neutron stars, strong magnetic field systems like magnetars, and stellar-mass and supermassive black holes. The mission carries a unique and unprecedented suite of state-of-the-art scientific instruments enabling for the first time ever the simultaneous spectral-timing-polarimetry studies of cosmic sources in the energy range from 0.5-30 keV (and beyond). Key elements of the payload are: the Spectroscopic Focusing Array (SFA) - a set of 11 X-ray optics for a total effective area of ∼0.9 m2 and 0.6 m2 at 2 keV and 6 keV respectively, equipped with Silicon Drift Detectors offering <180 eV spectral resolution; the Large Area Detector (LAD) - a deployable set of 640 Silicon Drift Detectors, for a total effective area of ∼3.4 m2, between 6 and 10 keV, and spectral resolution better than 250 eV; the Polarimetry Focusing Array (PFA) - a set of 2 X-ray telescope, for a total effective area of 250 cm2 at 2 keV, equipped with imaging gas pixel photoelectric polarimeters; the Wide Field Monitor (WFM) - a set of 3 coded mask wide field units, equipped with position-sensitive Silicon Drift Detectors, each covering a 90 degrees x 90 degrees field of view. The eXTP international consortium includes major institutions of the Chinese Academy of Sciences and Universities in China, as well as major institutions in several European countries and the United States. The predecessor of eXTP, the XTP mission concept, has been selected and funded as one of the so-called background missions in the Strategic Priority Space Science Program of the Chinese Academy of Sciences since 2011. The strong European participation has significantly enhanced the scientific capabilities of eXTP. The planned launch date of the mission is earlier than 2025."}]},{"date_updated":"2025-09-18T10:58:31Z","publist_id":"5550","oa":1,"scopus_import":"1","department":[{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:45:07Z","ddc":["570"],"status":"public","_id":"1616","corr_author":"1","page":"668 - 682","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"article_processing_charge":"No","quality_controlled":"1","pubrep_id":"469","volume":26,"citation":{"ieee":"J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats,” <i>Hippocampus</i>, vol. 26, no. 5. Wiley, pp. 668–682, 2016.","ama":"Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. <i>Hippocampus</i>. 2016;26(5):668-682. doi:<a href=\"https://doi.org/10.1002/hipo.22550\">10.1002/hipo.22550</a>","chicago":"Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” <i>Hippocampus</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/hipo.22550\">https://doi.org/10.1002/hipo.22550</a>.","ista":"Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. 26(5), 668–682.","short":"J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016) 668–682.","apa":"Kowalski, J., Gan, J., Jonas, P. M., &#38; Pernia-Andrade, A. (2016). Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. <i>Hippocampus</i>. Wiley. <a href=\"https://doi.org/10.1002/hipo.22550\">https://doi.org/10.1002/hipo.22550</a>","mla":"Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” <i>Hippocampus</i>, vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:<a href=\"https://doi.org/10.1002/hipo.22550\">10.1002/hipo.22550</a>."},"has_accepted_license":"1","intvolume":"        26","publisher":"Wiley","month":"05","doi":"10.1002/hipo.22550","acknowledgement":"The authors thank Jose Guzman for critically reading prior versions of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices, A. Schlögl for efﬁcient pro-gramming, F. Marr for technical assistance, and E. Kramberger for manuscript editing.","publication_identifier":{"issn":["1050-9631"],"eissn":["1098-1063"]},"year":"2016","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:03Z","type":"journal_article","title":"Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats","language":[{"iso":"eng"}],"isi":1,"publication_status":"published","author":[{"full_name":"Kowalski, Janina","last_name":"Kowalski","first_name":"Janina","id":"3F3CA136-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gan, Jian","last_name":"Gan","first_name":"Jian","id":"3614E438-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"first_name":"Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","full_name":"Pernia-Andrade, Alejandro","last_name":"Pernia-Andrade"}],"day":"01","oa_version":"Published Version","issue":"5","abstract":[{"lang":"eng","text":"The hippocampus plays a key role in learning and memory. Previous studies suggested that the main types of principal neurons, dentate gyrus granule cells (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal neurons. It has been assumed but never shown that such different activity may be caused by differential synaptic excitation. To test this hypothesis, we performed high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo. In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine the underlying mechanisms, we quantitatively assessed the frequency of spontaneous excitatory synaptic input, the passive membrane properties, and the active membrane characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3 and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition. Thus, differential synaptic excitation is not responsible for differences in firing. Moreover, the three types of hippocampal neurons markedly differed in their passive properties. While GCs showed the most negative membrane potential, CA3 pyramidal neurons had the highest input resistance and the slowest membrane time constant. The three types of neurons also differed in the active membrane characteristics. GCs showed the highest action potential threshold, but displayed the largest gain of the input-output curves. In conclusion, our results reveal that differential firing of the three main types of hippocampal principal neurons in vivo is not primarily caused by differences in the characteristics of the synaptic input, but by the distinct properties of synaptic integration and input-output transformation."}],"publication":"Hippocampus","date_published":"2016-05-01T00:00:00Z","file":[{"relation":"main_file","access_level":"open_access","file_name":"IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf","file_id":"5033","checksum":"284b72b12fbe15474833ed3d4549f86b","file_size":905348,"content_type":"application/pdf","date_created":"2018-12-12T10:13:47Z","date_updated":"2020-07-14T12:45:07Z","creator":"system"}],"external_id":{"isi":["000374666700011"]}},{"doi":"10.3847/0004-637x/828/2/110","publication_identifier":{"issn":["0004-637X","1538-4357"]},"year":"2016","article_number":"110","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-05T13:44:44Z","type":"journal_article","title":"Is there a maximum mass for black holes in galactic nuclei?","language":[{"iso":"eng"}],"publication_status":"published","article_type":"original","author":[{"first_name":"Kohei","last_name":"Inayoshi","full_name":"Inayoshi, Kohei"},{"full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"}],"day":"12","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1601.02611"}],"issue":"2","abstract":[{"text":"The largest observed supermassive black holes (SMBHs) have a mass of M_BH ~ 10^{10} M_sun, nearly independent of redshift, from the local (z~0) to the early (z>6) Universe. We suggest that the growth of SMBHs above a few 10^{10} M_sun is prevented by small-scale accretion physics, independent of the properties of their host galaxies or of cosmology. Growing more massive BHs requires a gas supply rate from galactic scales onto a nuclear region as high as >10^3 M_sun/yr. At such a high accretion rate, most of the gas converts to stars at large radii (~10-100 pc), well before reaching the BH. We adopt a simple model (Thompson et al. 2005) for a star-forming accretion disk, and find that the accretion rate in the sub-pc nuclear region is reduced to the smaller value of at most a few M_sun/yr. This prevents SMBHs from growing above ~10^{11} M_sun in the age of the Universe. Furthermore, once a SMBH reaches a sufficiently high mass, this rate falls below the critical value at which the accretion flow becomes advection dominated. Once this transition occurs, BH feeding can be suppressed by strong outflows and jets from hot gas near the BH. We find that the maximum SMBH mass, given by this transition, is between M_{BH,max} ~ (1-6) * 10^{10} M_sun, depending primarily on the efficiency of angular momentum transfer inside the galactic disk, and not on other properties of the host galaxy.","lang":"eng"}],"publication":"The Astrophysical Journal","date_published":"2016-09-12T00:00:00Z","external_id":{"arxiv":["1601.02611"]},"date_updated":"2024-09-24T08:11:51Z","oa":1,"arxiv":1,"scopus_import":"1","status":"public","_id":"17618","article_processing_charge":"No","quality_controlled":"1","volume":828,"citation":{"apa":"Inayoshi, K., &#38; Haiman, Z. (2016). Is there a maximum mass for black holes in galactic nuclei? <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/0004-637x/828/2/110\">https://doi.org/10.3847/0004-637x/828/2/110</a>","mla":"Inayoshi, Kohei, and Zoltán Haiman. “Is There a Maximum Mass for Black Holes in Galactic Nuclei?” <i>The Astrophysical Journal</i>, vol. 828, no. 2, 110, American Astronomical Society, 2016, doi:<a href=\"https://doi.org/10.3847/0004-637x/828/2/110\">10.3847/0004-637x/828/2/110</a>.","short":"K. Inayoshi, Z. Haiman, The Astrophysical Journal 828 (2016).","ista":"Inayoshi K, Haiman Z. 2016. Is there a maximum mass for black holes in galactic nuclei? The Astrophysical Journal. 828(2), 110.","chicago":"Inayoshi, Kohei, and Zoltán Haiman. “Is There a Maximum Mass for Black Holes in Galactic Nuclei?” <i>The Astrophysical Journal</i>. American Astronomical Society, 2016. <a href=\"https://doi.org/10.3847/0004-637x/828/2/110\">https://doi.org/10.3847/0004-637x/828/2/110</a>.","ama":"Inayoshi K, Haiman Z. Is there a maximum mass for black holes in galactic nuclei? <i>The Astrophysical Journal</i>. 2016;828(2). doi:<a href=\"https://doi.org/10.3847/0004-637x/828/2/110\">10.3847/0004-637x/828/2/110</a>","ieee":"K. Inayoshi and Z. Haiman, “Is there a maximum mass for black holes in galactic nuclei?,” <i>The Astrophysical Journal</i>, vol. 828, no. 2. American Astronomical Society, 2016."},"intvolume":"       828","publisher":"American Astronomical Society","month":"09","extern":"1"},{"month":"04","extern":"1","intvolume":"       459","publisher":"Oxford University Press","volume":459,"quality_controlled":"1","citation":{"ieee":"K. Inayoshi, Z. Haiman, and J. P. Ostriker, “Hyper-Eddington accretion flows on to massive black holes,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 459, no. 4. Oxford University Press, pp. 3738–3755, 2016.","ama":"Inayoshi K, Haiman Z, Ostriker JP. Hyper-Eddington accretion flows on to massive black holes. <i>Monthly Notices of the Royal Astronomical Society</i>. 2016;459(4):3738-3755. doi:<a href=\"https://doi.org/10.1093/mnras/stw836\">10.1093/mnras/stw836</a>","chicago":"Inayoshi, Kohei, Zoltán Haiman, and Jeremiah P. Ostriker. “Hyper-Eddington Accretion Flows on to Massive Black Holes.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/mnras/stw836\">https://doi.org/10.1093/mnras/stw836</a>.","ista":"Inayoshi K, Haiman Z, Ostriker JP. 2016. Hyper-Eddington accretion flows on to massive black holes. Monthly Notices of the Royal Astronomical Society. 459(4), 3738–3755.","short":"K. Inayoshi, Z. Haiman, J.P. Ostriker, Monthly Notices of the Royal Astronomical Society 459 (2016) 3738–3755.","apa":"Inayoshi, K., Haiman, Z., &#38; Ostriker, J. P. (2016). Hyper-Eddington accretion flows on to massive black holes. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stw836\">https://doi.org/10.1093/mnras/stw836</a>","mla":"Inayoshi, Kohei, et al. “Hyper-Eddington Accretion Flows on to Massive Black Holes.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 459, no. 4, Oxford University Press, 2016, pp. 3738–55, doi:<a href=\"https://doi.org/10.1093/mnras/stw836\">10.1093/mnras/stw836</a>."},"page":"3738-3755","article_processing_charge":"No","status":"public","_id":"17709","scopus_import":"1","oa":1,"date_updated":"2024-09-25T12:00:22Z","publication":"Monthly Notices of the Royal Astronomical Society","date_published":"2016-04-12T00:00:00Z","abstract":[{"text":"We study very-high rate spherically symmetric accretion flows onto a massive black hole (BH; 10^2 < M_BH < 10^6 Msun) embedded in a dense gas cloud with a low abundance of metals, performing one-dimensional hydrodynamical simulations which include multi-frequency radiation transfer and non-equilibrium primordial chemistry. We find that rapid gas supply from the Bondi radius at a hyper-Eddington rate can occur without being impeded by radiation feedback when (n/10^5 cm^-3) > (M_BH/10^4Msun)^{-1}(T/10^4 K)^{3/2}, where n and T are the density and temperature of ambient gas outside of the Bondi radius. The resulting accretion rate in this regime is steady, and larger than 3000 times the Eddington rate. At lower Bondi rates, the accretion is episodic due to radiative feedback and the average rate is limited below the Eddington rate. For the hyper-Eddington case, the steady solution consists of two parts: a radiation-dominated central core, where photon trapping due to electron scattering is important, and an accreting envelope which follows a Bondi profile with T~8000 K. When the emergent luminosity is limited below the Eddington luminosity because of photon trapping, radiation from the central region does not affect the gas dynamics at larger scales. We apply our result to the rapid formation of massive BHs in protogalaxies with a virial temperature of T_vir> 10^4 K. Once a seed BH forms at the center of the galaxy, it can grow up to a maximum ~10^5 (T_vir/10^4 K) Msun via gas accretion independent of the initial BH mass. Finally, we discuss possible observational signatures of rapidly accreting BHs with/without allowance for dust. We suggest that these systems could explain Lya emitters without X-rays and luminous infrared sources with hot dust emission, respectively.","lang":"eng"}],"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1093/mnras/stw836","open_access":"1"}],"issue":"4","author":[{"full_name":"Inayoshi, Kohei","last_name":"Inayoshi","first_name":"Kohei"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","last_name":"Haiman","full_name":"Haiman, Zoltán"},{"last_name":"Ostriker","full_name":"Ostriker, Jeremiah P.","first_name":"Jeremiah P."}],"day":"12","publication_status":"published","article_type":"original","title":"Hyper-Eddington accretion flows on to massive black holes","type":"journal_article","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-06T08:54:12Z","doi":"10.1093/mnras/stw836","year":"2016","publication_identifier":{"issn":["0035-8711","1365-2966"]}},{"date_updated":"2021-01-12T08:19:22Z","doi":"10.1073/pnas.1609604113","publication_identifier":{"issn":["0027-8424","1091-6490"]},"year":"2016","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-18T10:06:58Z","type":"journal_article","title":"A ring-shaped conduit connects the mother cell and forespore during sporulation in Bacillus subtilis","language":[{"iso":"eng"}],"status":"public","publication_status":"published","article_type":"original","_id":"8452","author":[{"first_name":"Christopher D. A.","last_name":"Rodrigues","full_name":"Rodrigues, Christopher D. A."},{"last_name":"Henry","full_name":"Henry, Xavier","first_name":"Xavier"},{"first_name":"Emmanuelle","last_name":"Neumann","full_name":"Neumann, Emmanuelle"},{"last_name":"Kurauskas","full_name":"Kurauskas, Vilius","first_name":"Vilius"},{"last_name":"Bellard","full_name":"Bellard, Laure","first_name":"Laure"},{"first_name":"Yann","full_name":"Fichou, Yann","last_name":"Fichou"},{"orcid":"0000-0002-9350-7606","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","last_name":"Schanda"},{"last_name":"Schoehn","full_name":"Schoehn, Guy","first_name":"Guy"},{"first_name":"David Z.","full_name":"Rudner, David Z.","last_name":"Rudner"},{"first_name":"Cecile","last_name":"Morlot","full_name":"Morlot, Cecile"}],"page":"11585-11590","article_processing_charge":"No","day":"28","oa_version":"None","quality_controlled":"1","volume":113,"issue":"41","citation":{"mla":"Rodrigues, Christopher D. A., et al. “A Ring-Shaped Conduit Connects the Mother Cell and Forespore during Sporulation in Bacillus Subtilis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 113, no. 41, National Academy of Sciences, 2016, pp. 11585–90, doi:<a href=\"https://doi.org/10.1073/pnas.1609604113\">10.1073/pnas.1609604113</a>.","apa":"Rodrigues, C. D. A., Henry, X., Neumann, E., Kurauskas, V., Bellard, L., Fichou, Y., … Morlot, C. (2016). A ring-shaped conduit connects the mother cell and forespore during sporulation in Bacillus subtilis. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1609604113\">https://doi.org/10.1073/pnas.1609604113</a>","short":"C.D.A. Rodrigues, X. Henry, E. Neumann, V. Kurauskas, L. Bellard, Y. Fichou, P. Schanda, G. Schoehn, D.Z. Rudner, C. Morlot, Proceedings of the National Academy of Sciences 113 (2016) 11585–11590.","ista":"Rodrigues CDA, Henry X, Neumann E, Kurauskas V, Bellard L, Fichou Y, Schanda P, Schoehn G, Rudner DZ, Morlot C. 2016. A ring-shaped conduit connects the mother cell and forespore during sporulation in Bacillus subtilis. Proceedings of the National Academy of Sciences. 113(41), 11585–11590.","chicago":"Rodrigues, Christopher D. A., Xavier Henry, Emmanuelle Neumann, Vilius Kurauskas, Laure Bellard, Yann Fichou, Paul Schanda, Guy Schoehn, David Z. Rudner, and Cecile Morlot. “A Ring-Shaped Conduit Connects the Mother Cell and Forespore during Sporulation in Bacillus Subtilis.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2016. <a href=\"https://doi.org/10.1073/pnas.1609604113\">https://doi.org/10.1073/pnas.1609604113</a>.","ama":"Rodrigues CDA, Henry X, Neumann E, et al. A ring-shaped conduit connects the mother cell and forespore during sporulation in Bacillus subtilis. <i>Proceedings of the National Academy of Sciences</i>. 2016;113(41):11585-11590. doi:<a href=\"https://doi.org/10.1073/pnas.1609604113\">10.1073/pnas.1609604113</a>","ieee":"C. D. A. Rodrigues <i>et al.</i>, “A ring-shaped conduit connects the mother cell and forespore during sporulation in Bacillus subtilis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 113, no. 41. National Academy of Sciences, pp. 11585–11590, 2016."},"intvolume":"       113","abstract":[{"text":"During spore formation in Bacillus subtilis a transenvelope complex is assembled across the double membrane that separates the mother cell and forespore. This complex (called the “A–Q complex”) is required to maintain forespore development and is composed of proteins with remote homology to components of type II, III, and IV secretion systems found in Gram-negative bacteria. Here, we show that one of these proteins, SpoIIIAG, which has remote homology to ring-forming proteins found in type III secretion systems, assembles into an oligomeric ring in the periplasmic-like space between the two membranes. Three-dimensional reconstruction of images generated by cryo-electron microscopy indicates that the SpoIIIAG ring has a cup-and-saucer architecture with a 6-nm central pore. Structural modeling of SpoIIIAG generated a 24-member ring with dimensions similar to those of the EM-derived saucer. Point mutations in the predicted oligomeric interface disrupted ring formation in vitro and impaired forespore gene expression and efficient spore formation in vivo. Taken together, our data provide strong support for the model in which the A–Q transenvelope complex contains a conduit that connects the mother cell and forespore. We propose that a set of stacked rings spans the intermembrane space, as has been found for type III secretion systems.","lang":"eng"}],"publisher":"National Academy of Sciences","publication":"Proceedings of the National Academy of Sciences","month":"09","date_published":"2016-09-28T00:00:00Z","extern":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7339","conference":{"end_date":"2016-09-08","name":"NP: Nonlinear Photonics","start_date":"2016-09-05","location":"Sydney, Australia"},"date_created":"2018-12-11T11:46:43Z","alternative_title":["Optics InfoBase Conference Papers"],"date_updated":"2023-10-17T12:16:43Z","doi":"10.1364/NP.2016.NTh3A.6","year":"2016","status":"public","publication_status":"published","_id":"482","type":"conference","scopus_import":"1","title":"Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator","language":[{"iso":"eng"}],"department":[{"_id":"JoFi"}],"oa_version":"None","quality_controlled":"1","citation":{"apa":"Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics, Sydney, Australia: Optica Publishing Group. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>","mla":"Rueda, Alfredo, et al. <i>Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator</i>. Optica Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>.","ista":"Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .","short":"A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing Group, 2016.","ama":"Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing Group; 2016. doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>","chicago":"Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing Group, 2016. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>.","ieee":"A. Rueda <i>et al.</i>, “Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics, Sydney, Australia, 2016."},"author":[{"full_name":"Rueda, Alfredo","last_name":"Rueda","first_name":"Alfredo"},{"last_name":"Sedlmeir","full_name":"Sedlmeir, Florian","first_name":"Florian"},{"last_name":"Collodo","full_name":"Collodo, Michele","first_name":"Michele"},{"last_name":"Vogl","full_name":"Vogl, Ulrich","first_name":"Ulrich"},{"full_name":"Stiller, Birgit","last_name":"Stiller","first_name":"Birgit"},{"last_name":"Schunk","full_name":"Schunk, Gerhard","first_name":"Gerhard"},{"full_name":"Strekalov, Dmitry","last_name":"Strekalov","first_name":"Dmitry"},{"first_name":"Christoph","last_name":"Marquardt","full_name":"Marquardt, Christoph"},{"orcid":"0000-0001-8112-028X","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","last_name":"Fink"},{"last_name":"Painter","full_name":"Painter, Oskar","first_name":"Oskar"},{"first_name":"Gerd","full_name":"Leuchs, Gerd","last_name":"Leuchs"},{"first_name":"Harald","full_name":"Schwefel, Harald","last_name":"Schwefel"}],"day":"29","article_processing_charge":"No","month":"08","date_published":"2016-08-29T00:00:00Z","abstract":[{"lang":"eng","text":"Nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band is achieved within a crystalline whispering gallery mode resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth."}],"publisher":"Optica Publishing Group"},{"date_created":"2018-12-12T12:31:31Z","oa":1,"license":"https://creativecommons.org/publicdomain/zero/1.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2016","doi":"10.15479/AT:ISTA:46","date_updated":"2024-02-21T13:50:21Z","keyword":["discrete tomography"],"_id":"5557","contributor":[{"contributor_type":"data_collector","first_name":"Jan","last_name":"Kuske"}],"status":"public","file_date_updated":"2020-07-14T12:47:02Z","department":[{"_id":"VlKo"}],"ddc":["006"],"title":"Synthetic discrete tomography problems","type":"research_data","citation":{"ieee":"P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science and Technology Austria, 2016.","chicago":"Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>.","ama":"Swoboda P. Synthetic discrete tomography problems. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>","short":"P. Swoboda, (2016).","ista":"Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","apa":"Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>","mla":"Swoboda, Paul. <i>Synthetic Discrete Tomography Problems</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>."},"has_accepted_license":"1","oa_version":"Published Version","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"article_processing_charge":"No","day":"20","author":[{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul"}],"datarep_id":"46","file":[{"creator":"system","date_updated":"2020-07-14T12:47:02Z","content_type":"application/zip","date_created":"2018-12-12T13:05:19Z","file_size":36058401,"checksum":"aa5a16a0dc888da7186fb8fc45e88439","file_name":"IST-2016-46-v1+1_discrete_tomography_synthetic.zip","file_id":"5645","relation":"main_file","access_level":"open_access"}],"date_published":"2016-09-20T00:00:00Z","month":"09","publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","text":"Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and 256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5."}]}]
