[{"status":"public","quality_controlled":"1","publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","publisher":"Society for Industrial and Applied Mathematics","date_created":"2022-08-16T12:28:27Z","extern":"1","month":"01","page":"470 - 489","doi":"10.1137/1.9781611974782.30","language":[{"iso":"eng"}],"author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"type":"conference","day":"01","conference":{"location":"Barcelona, Spain","name":"SODA: Symposium on Discrete Algorithms","end_date":"2017-01-19","start_date":"2017-01-16"},"title":"Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time","citation":{"apa":"Bhattacharya, S., Henzinger, M. H., &#38; Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611974782.30\">https://doi.org/10.1137/1.9781611974782.30</a>","ama":"Bhattacharya S, Henzinger MH, Nanongkai D. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In: <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 0. Society for Industrial and Applied Mathematics; 2017:470-489. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.30\">10.1137/1.9781611974782.30</a>","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.","mla":"Bhattacharya, Sayan, et al. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 0, Society for Industrial and Applied Mathematics, 2017, pp. 470–89, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.30\">10.1137/1.9781611974782.30</a>.","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Barcelona, Spain, 2017, vol. 0, pp. 470–489.","ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 0, 470–489.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 0:470–89. Society for Industrial and Applied Mathematics, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.30\">https://doi.org/10.1137/1.9781611974782.30</a>."},"volume":"0","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1704.02844","open_access":"1"}],"publication_status":"published","_id":"11874","date_published":"2017-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised update time for this problem, even after allowing for randomisation. Specifically, Bernstein and Stein [ICALP 2015, SODA 2016] have the best known worst case update time. They present a deterministic data structure with approximation ratio (3/2 + ∊) and worst case update time O(m1/4/ ∊2), where m is the number of edges in the graph. In recent past, Gupta and Peng [FOCS 2013] gave a deterministic data structure with approximation ratio (1+ ∊) and worst case update time  No known randomised data structure beats the worst case update times of these two results. In contrast, the paper by Onak and Rubinfeld [STOC 2010] gave a randomised data structure with approximation ratio O(1) and amortised update time O(log2 n), where n is the number of nodes in the graph. This was later improved by Baswana, Gupta and Sen [FOCS 2011] and Solomon [FOCS 2016], leading to a randomised date structure with approximation ratio 2 and amortised update time O(1).\r\n\r\nWe bridge the polynomial gap between the worst case and amortised update times for this problem, without using any randomisation. We present a deterministic data structure with approximation ratio (2 + ∊) and worst case update time O(log3 n), for all sufficiently small constants ∊."}],"article_processing_charge":"No","arxiv":1,"publication_identifier":{"eisbn":["978-161197478-2"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T11:54:22Z","external_id":{"arxiv":["1704.02844"]},"scopus_import":"1","year":"2017","oa_version":"Preprint"},{"publication_identifier":{"eissn":["1433-0490"],"issn":["1432-4350"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:29:58Z","oa_version":"Published Version","year":"2017","article_type":"original","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00224-017-9759-8"}],"publication_status":"published","volume":61,"article_processing_charge":"No","issue":"4","_id":"11903","abstract":[{"text":"Online social networks allow the collection of large amounts of data about the influence between users connected by a friendship-like relationship. When distributing items among agents forming a social network, this information allows us to exploit network externalities that each agent receives from his neighbors that get the same item. In this paper we consider Friends-of-Friends (2-hop) network externalities, i.e., externalities that not only depend on the neighbors that get the same item but also on neighbors of neighbors. For these externalities we study a setting where multiple different items are assigned to unit-demand agents. Specifically, we study the problem of welfare maximization under different types of externality functions. Let n be the number of agents and m be the number of items. Our contributions are the following: (1) We show that welfare maximization is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop) externalities it is NP-hard to approximate social welfare better than (1−1/e). (2) On the positive side we present (i) an 𝑂(𝑛√)-approximation algorithm for general concave externality functions, (ii) an O(log m)-approximation algorithm for linear externality functions, and (iii) a 518(1−1/𝑒)-approximation algorithm for 2-hop step function externalities. We also improve the result from [7] for 1-hop step function externalities by giving a 12(1−1/𝑒)-approximation algorithm.","lang":"eng"}],"date_published":"2017-11-01T00:00:00Z","related_material":{"record":[{"relation":"earlier_version","id":"11837","status":"public"}]},"doi":"10.1007/s00224-017-9759-8","language":[{"iso":"eng"}],"title":"Welfare maximization with friends-of-friends network externalities","citation":{"apa":"Bhattacharya, S., Dvořák, W., Henzinger, M. H., &#38; Starnberger, M. (2017). Welfare maximization with friends-of-friends network externalities. <i>Theory of Computing Systems</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00224-017-9759-8\">https://doi.org/10.1007/s00224-017-9759-8</a>","ama":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. Welfare maximization with friends-of-friends network externalities. <i>Theory of Computing Systems</i>. 2017;61(4):948-986. doi:<a href=\"https://doi.org/10.1007/s00224-017-9759-8\">10.1007/s00224-017-9759-8</a>","short":"S. Bhattacharya, W. Dvořák, M.H. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.","mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” <i>Theory of Computing Systems</i>, vol. 61, no. 4, Springer Nature, 2017, pp. 948–86, doi:<a href=\"https://doi.org/10.1007/s00224-017-9759-8\">10.1007/s00224-017-9759-8</a>.","ista":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. 2017. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 61(4), 948–986.","ieee":"S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” <i>Theory of Computing Systems</i>, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.","chicago":"Bhattacharya, Sayan, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” <i>Theory of Computing Systems</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/s00224-017-9759-8\">https://doi.org/10.1007/s00224-017-9759-8</a>."},"author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"last_name":"Dvořák","full_name":"Dvořák, Wolfgang","first_name":"Wolfgang"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Martin","full_name":"Starnberger, Martin","last_name":"Starnberger"}],"type":"journal_article","day":"01","publisher":"Springer Nature","intvolume":"        61","status":"public","publication":"Theory of Computing Systems","quality_controlled":"1","page":"948-986","date_created":"2022-08-17T11:14:12Z","month":"11","extern":"1"},{"publisher":"Springer","status":"public","intvolume":"        79","publication":"Bulletin of Mathematical Biology","quality_controlled":"1","department":[{"_id":"NiBa"}],"page":"525-559","date_created":"2018-12-11T11:50:38Z","month":"03","project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","doi":"10.1007/s11538-016-0244-3","language":[{"iso":"eng"}],"title":"Existence of traveling waves for the generalized F–KPP equation","citation":{"mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>.","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3. Springer, pp. 525–559, 2017.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>.","apa":"Kollár, R., &#38; Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. 2017;79(3):525-559. doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559."},"ec_funded":1,"author":[{"full_name":"Kollár, Richard","first_name":"Richard","last_name":"Kollár"},{"full_name":"Novak, Sebastian","first_name":"Sebastian","last_name":"Novak","orcid":"0000-0002-2519-824X","id":"461468AE-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","day":"01","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00944"}],"publication_status":"published","volume":79,"issue":"3","_id":"1191","date_published":"2017-03-01T00:00:00Z","abstract":[{"text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.","lang":"eng"}],"scopus_import":1,"date_updated":"2025-05-28T11:42:46Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2017","oa_version":"Preprint","publist_id":"6160"},{"day":"01","type":"conference","author":[{"id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr","first_name":"Alexandr","last_name":"Kazda"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov"},{"first_name":"Michal","full_name":"Rolinek, Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"citation":{"chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>.","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.","mla":"Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>","apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>"},"conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2017-01-16","end_date":"2017-01019","location":"Barcelona, Spain"},"title":"Even delta-matroids and the complexity of planar Boolean CSPs","language":[{"iso":"eng"}],"doi":"10.1137/1.9781611974782.20","related_material":{"record":[{"status":"public","relation":"later_version","id":"6032"}]},"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"month":"01","date_created":"2018-12-11T11:50:38Z","page":"307 - 326","quality_controlled":"1","department":[{"_id":"VlKo"}],"status":"public","publisher":"SIAM","isi":1,"publist_id":"6159","year":"2017","oa_version":"Submitted Version","date_updated":"2023-09-20T11:20:26Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000426965800020"]},"publication_identifier":{"isbn":["978-161197478-2"]},"_id":"1192","date_published":"2017-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary."}],"article_processing_charge":"No","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1602.03124","open_access":"1"}],"oa":1},{"publication_identifier":{"issn":["07308566"]},"scopus_import":"1","external_id":{"isi":["000408311200013"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2025-07-14T09:09:58Z","year":"2017","oa_version":"Submitted Version","publist_id":"6157","main_file_link":[{"url":"https://arxiv.org/abs/1611.01063","open_access":"1"}],"oa":1,"publication_status":"published","volume":52,"article_processing_charge":"No","issue":"1","abstract":[{"lang":"eng","text":"Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples. "}],"_id":"1194","date_published":"2017-01-01T00:00:00Z","related_material":{"record":[{"status":"public","id":"14539","relation":"dissertation_contains"}]},"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"doi":"10.1145/3009837.3009873","language":[{"iso":"eng"}],"title":"Stochastic invariants for probabilistic termination","conference":{"location":"Paris, France","name":"POPL: Principles of Programming Languages","start_date":"2017-01-15","end_date":"2017-01-21"},"citation":{"ama":"Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>","apa":"Chatterjee, K., Novotný, P., &#38; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>","short":"K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Invariants for Probabilistic Termination</i>. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>.","chicago":"Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>.","ista":"Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.","ieee":"K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160."},"ec_funded":1,"type":"conference","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novotny","full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zikelic","full_name":"Zikelic, Djordje","first_name":"Djordje"}],"alternative_title":["ACM SIGPLAN Notices"],"day":"01","isi":1,"publisher":"ACM","status":"public","intvolume":"        52","department":[{"_id":"KrCh"}],"quality_controlled":"1","page":"145 - 160","date_created":"2018-12-11T11:50:39Z","month":"01"},{"publist_id":"6154","year":"2017","oa_version":"None","external_id":{"isi":["000390637000011"]},"scopus_import":"1","date_updated":"2023-09-20T11:18:50Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","abstract":[{"text":"We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model.","lang":"eng"}],"_id":"1196","date_published":"2017-02-01T00:00:00Z","publication_status":"published","volume":23,"citation":{"mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, Elsevier, 2017, pp. 166–90, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>.","ieee":"T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23. Elsevier, pp. 166–190, 2017.","ista":"Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>.","apa":"Henzinger, T. A., &#38; Otop, J. (2017). Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>","ama":"Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23:166-190. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>","short":"T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190."},"ec_funded":1,"title":"Model measuring for discrete and hybrid systems","day":"01","type":"journal_article","author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"}],"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this article is available via: https://repository.ist.ac.at/171/","language":[{"iso":"eng"}],"doi":"10.1016/j.nahs.2016.09.001","page":"166 - 190","month":"02","date_created":"2018-12-11T11:50:39Z","publisher":"Elsevier","isi":1,"publication":"Nonlinear Analysis: Hybrid Systems","quality_controlled":"1","department":[{"_id":"ToHe"}],"intvolume":"        23","status":"public"},{"page":"11796-11893","month":"06","extern":"1","date_created":"2022-08-24T11:07:46Z","publisher":"American Chemical Society","publication":"Chemical Reviews","quality_controlled":"1","status":"public","intvolume":"       117","citation":{"ama":"Plutschack MB, Pieber B, Gilmore K, Seeberger PH. The Hitchhiker’s Guide to flow chemistry. <i>Chemical Reviews</i>. 2017;117(18):11796-11893. doi:<a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">10.1021/acs.chemrev.7b00183</a>","apa":"Plutschack, M. B., Pieber, B., Gilmore, K., &#38; Seeberger, P. H. (2017). The Hitchhiker’s Guide to flow chemistry. <i>Chemical Reviews</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">https://doi.org/10.1021/acs.chemrev.7b00183</a>","short":"M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews 117 (2017) 11796–11893.","mla":"Plutschack, Matthew B., et al. “The Hitchhiker’s Guide to Flow Chemistry.” <i>Chemical Reviews</i>, vol. 117, no. 18, American Chemical Society, 2017, pp. 11796–893, doi:<a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">10.1021/acs.chemrev.7b00183</a>.","chicago":"Plutschack, Matthew B., Bartholomäus Pieber, Kerry Gilmore, and Peter H. Seeberger. “The Hitchhiker’s Guide to Flow Chemistry.” <i>Chemical Reviews</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">https://doi.org/10.1021/acs.chemrev.7b00183</a>.","ieee":"M. B. Plutschack, B. Pieber, K. Gilmore, and P. H. Seeberger, “The Hitchhiker’s Guide to flow chemistry,” <i>Chemical Reviews</i>, vol. 117, no. 18. American Chemical Society, pp. 11796–11893, 2017.","ista":"Plutschack MB, Pieber B, Gilmore K, Seeberger PH. 2017. The Hitchhiker’s Guide to flow chemistry. Chemical Reviews. 117(18), 11796–11893."},"title":"The Hitchhiker’s Guide to flow chemistry","day":"01","author":[{"last_name":"Plutschack","full_name":"Plutschack, Matthew B.","first_name":"Matthew B."},{"last_name":"Pieber","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"first_name":"Kerry","full_name":"Gilmore, Kerry","last_name":"Gilmore"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"}],"type":"journal_article","pmid":1,"language":[{"iso":"eng"}],"doi":"10.1021/acs.chemrev.7b00183","article_processing_charge":"No","issue":"18","date_published":"2017-06-01T00:00:00Z","_id":"11961","abstract":[{"text":"Flow chemistry involves the use of channels or tubing to conduct a reaction in a continuous stream rather than in a flask. Flow equipment provides chemists with unique control over reaction parameters enhancing reactivity or in some cases enabling new reactions. This relatively young technology has received a remarkable amount of attention in the past decade with many reports on what can be done in flow. Until recently, however, the question, “Should we do this in flow?” has merely been an afterthought. This review introduces readers to the basic principles and fundamentals of flow chemistry and critically discusses recent flow chemistry accounts.","lang":"eng"}],"publication_status":"published","volume":117,"article_type":"original","year":"2017","oa_version":"None","external_id":{"pmid":["28570059"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:09:28Z","publication_identifier":{"issn":["0009-2665"],"eissn":["1520-6890"]}},{"extern":"1","month":"09","date_created":"2022-08-25T10:47:51Z","page":"129-136","quality_controlled":"1","publication":"Journal of Flow Chemistry","intvolume":"         7","status":"public","publisher":"AKJournals","day":"01","type":"journal_article","author":[{"last_name":"Pieber","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X"},{"first_name":"Kerry","full_name":"Gilmore, Kerry","last_name":"Gilmore"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"}],"citation":{"apa":"Pieber, B., Gilmore, K., &#38; Seeberger, P. H. (2017). Integrated flow processing - challenges in continuous multistep synthesis. <i>Journal of Flow Chemistry</i>. AKJournals. <a href=\"https://doi.org/10.1556/1846.2017.00016\">https://doi.org/10.1556/1846.2017.00016</a>","ama":"Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges in continuous multistep synthesis. <i>Journal of Flow Chemistry</i>. 2017;7(3-4):129-136. doi:<a href=\"https://doi.org/10.1556/1846.2017.00016\">10.1556/1846.2017.00016</a>","short":"B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136.","mla":"Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” <i>Journal of Flow Chemistry</i>, vol. 7, no. 3–4, AKJournals, 2017, pp. 129–36, doi:<a href=\"https://doi.org/10.1556/1846.2017.00016\">10.1556/1846.2017.00016</a>.","ista":"Pieber B, Gilmore K, Seeberger PH. 2017. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 7(3–4), 129–136.","ieee":"B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing - challenges in continuous multistep synthesis,” <i>Journal of Flow Chemistry</i>, vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.","chicago":"Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” <i>Journal of Flow Chemistry</i>. AKJournals, 2017. <a href=\"https://doi.org/10.1556/1846.2017.00016\">https://doi.org/10.1556/1846.2017.00016</a>."},"title":"Integrated flow processing - challenges in continuous multistep synthesis","language":[{"iso":"eng"}],"doi":"10.1556/1846.2017.00016","_id":"11976","date_published":"2017-09-01T00:00:00Z","abstract":[{"lang":"eng","text":"The way organic multistep synthesis is performed is changing due to the adoption of flow chemical techniques, which has enabled the development of improved methods to make complex molecules. The modular nature of the technique provides not only access to target molecules via linear flow approaches but also for the targeting of structural cores with single systems. This perspective article summarizes the state of the art of continuous multistep synthesis and discusses the main challenges and opportunities in this area."}],"issue":"3-4","article_processing_charge":"No","volume":7,"publication_status":"published","oa":1,"main_file_link":[{"url":"https://doi.org/10.1556/1846.2017.00016","open_access":"1"}],"article_type":"original","oa_version":"Published Version","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T10:10:02Z","scopus_import":"1","publication_identifier":{"eissn":["2063-0212"],"issn":["2062-249X"]}},{"day":"01","author":[{"last_name":"Moser","first_name":"Thomas","full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","citation":{"mla":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3, Springer, 2017, pp. 533–52, doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>.","chicago":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>.","ista":"Moser T, Seiringer R. 2017. Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. 107(3), 533–552.","ieee":"T. Moser and R. Seiringer, “Triviality of a model of particles with point interactions in the thermodynamic limit,” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3. Springer, pp. 533–552, 2017.","ama":"Moser T, Seiringer R. Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. 2017;107(3):533-552. doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>","apa":"Moser, T., &#38; Seiringer, R. (2017). Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>","short":"T. Moser, R. Seiringer, Letters in Mathematical Physics 107 (2017) 533–552."},"title":"Triviality of a model of particles with point interactions in the thermodynamic limit","language":[{"iso":"eng"}],"ddc":["510","539"],"doi":"10.1007/s11005-016-0915-x","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","related_material":{"record":[{"status":"public","id":"52","relation":"dissertation_contains"}]},"project":[{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"month":"03","date_created":"2018-12-11T11:50:40Z","page":" 533 - 552","quality_controlled":"1","department":[{"_id":"RoSe"}],"publication":"Letters in Mathematical Physics","status":"public","intvolume":"       107","publisher":"Springer","isi":1,"publist_id":"6152","year":"2017","has_accepted_license":"1","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T11:18:13Z","external_id":{"isi":["000394280200007"]},"scopus_import":"1","publication_identifier":{"issn":["03779017"]},"file":[{"file_size":587207,"creator":"system","file_name":"IST-2016-723-v1+1_s11005-016-0915-x.pdf","checksum":"c0c835def162c1bc52f978fad26e3c2f","access_level":"open_access","date_updated":"2020-07-14T12:44:38Z","file_id":"5296","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:17:40Z"}],"date_published":"2017-03-01T00:00:00Z","_id":"1198","abstract":[{"lang":"eng","text":"We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles."}],"issue":"3","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2020-07-14T12:44:38Z","volume":107,"pubrep_id":"723","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","oa":1},{"_id":"1199","abstract":[{"lang":"eng","text":"Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects."}],"date_published":"2017-01-01T00:00:00Z","article_processing_charge":"No","volume":118,"publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/"}],"publist_id":"6151","year":"2017","oa_version":"Submitted Version","date_updated":"2025-05-28T11:42:47Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000392229100011"]},"scopus_import":"1","month":"01","date_created":"2018-12-11T11:50:40Z","page":"96 - 109","quality_controlled":"1","department":[{"_id":"NiBa"}],"publication":"Heredity","status":"public","intvolume":"       118","publisher":"Nature Publishing Group","isi":1,"day":"01","type":"journal_article","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton"}],"ec_funded":1,"citation":{"ama":"Barton NH. How does epistasis influence the response to selection? <i>Heredity</i>. 2017;118:96-109. doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>","apa":"Barton, N. H. (2017). How does epistasis influence the response to selection? <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>","short":"N.H. Barton, Heredity 118 (2017) 96–109.","mla":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>.","chicago":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>.","ieee":"N. H. Barton, “How does epistasis influence the response to selection?,” <i>Heredity</i>, vol. 118. Nature Publishing Group, pp. 96–109, 2017.","ista":"Barton NH. 2017. How does epistasis influence the response to selection? Heredity. 118, 96–109."},"title":"How does epistasis influence the response to selection?","language":[{"iso":"eng"}],"doi":"10.1038/hdy.2016.109","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"related_material":{"record":[{"relation":"research_data","id":"9710","status":"public"}]}},{"status":"public","intvolume":"       349","publication":"Communications in Mathematical Physics","department":[{"_id":"LaEr"}],"quality_controlled":"1","isi":1,"publisher":"Springer","date_created":"2018-12-11T11:50:43Z","month":"02","page":"947 - 990","ddc":["530"],"doi":"10.1007/s00220-016-2805-6","language":[{"iso":"eng"}],"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"type":"journal_article","author":[{"full_name":"Bao, Zhigang","first_name":"Zhigang","last_name":"Bao","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3036-1475"},{"last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","full_name":"Schnelli, Kevin","first_name":"Kevin","last_name":"Schnelli"}],"day":"01","title":"Local law of addition of random matrices on optimal scale","citation":{"short":"Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349 (2017) 947–990.","ama":"Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. 2017;349(3):947-990. doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2017). Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices on optimal scale,” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3. Springer, pp. 947–990, 2017.","ista":"Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. 349(3), 947–990.","mla":"Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3, Springer, 2017, pp. 947–90, doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>."},"ec_funded":1,"pubrep_id":"722","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":349,"file_date_updated":"2020-07-14T12:44:39Z","oa":1,"publication_status":"published","abstract":[{"text":"The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix.","lang":"eng"}],"_id":"1207","date_published":"2017-02-01T00:00:00Z","file":[{"content_type":"application/pdf","relation":"main_file","file_id":"5102","date_created":"2018-12-12T10:14:47Z","file_name":"IST-2016-722-v1+1_s00220-016-2805-6.pdf","creator":"system","file_size":1033743,"date_updated":"2020-07-14T12:44:39Z","access_level":"open_access","checksum":"ddff79154c3daf27237de5383b1264a9"}],"article_processing_charge":"Yes (via OA deal)","issue":"3","publication_identifier":{"issn":["00103616"]},"external_id":{"isi":["000393696700005"]},"scopus_import":"1","date_updated":"2023-09-20T11:16:57Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","year":"2017","has_accepted_license":"1","publist_id":"6141"},{"publist_id":"6142","year":"2017","oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T11:17:21Z","scopus_import":"1","external_id":{"isi":["000411712300012"]},"publication_identifier":{"issn":["13697412"]},"abstract":[{"lang":"eng","text":"We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ&gt;1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd."}],"_id":"1208","date_published":"2017-09-01T00:00:00Z","issue":"4","article_processing_charge":"No","volume":79,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.5604"}],"oa":1,"day":"01","author":[{"last_name":"Zwiernik","full_name":"Zwiernik, Piotr","first_name":"Piotr"},{"last_name":"Uhler","full_name":"Uhler, Caroline","first_name":"Caroline","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Donald","full_name":"Richards, Donald","last_name":"Richards"}],"type":"journal_article","citation":{"mla":"Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>.","ista":"Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 79(4), 1269–1292.","ieee":"P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for linear Gaussian covariance models,” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292, 2017.","chicago":"Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>.","apa":"Zwiernik, P., Uhler, C., &#38; Richards, D. (2017). Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>","ama":"Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society Series B: Statistical Methodology</i>. 2017;79(4):1269-1292. doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>","short":"P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society. Series B: Statistical Methodology 79 (2017) 1269–1292."},"title":"Maximum likelihood estimation for linear Gaussian covariance models","language":[{"iso":"eng"}],"doi":"10.1111/rssb.12217","project":[{"name":"Gaussian Graphical Models: Theory and Applications","grant_number":"Y 903-N35","call_identifier":"FWF","_id":"2530CA10-B435-11E9-9278-68D0E5697425"}],"month":"09","date_created":"2018-12-11T11:50:43Z","page":"1269 - 1292","quality_controlled":"1","department":[{"_id":"CaUh"}],"publication":"Journal of the Royal Statistical Society. Series B: Statistical Methodology","status":"public","intvolume":"        79","publisher":"Wiley-Blackwell","isi":1},{"page":"636-655","date_created":"2018-12-11T11:50:44Z","month":"05","publisher":"Springer","status":"public","intvolume":"       167","department":[{"_id":"BjHo"}],"quality_controlled":"1","publication":"Journal of Statistical Physics","title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","citation":{"ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","apa":"Budanur, N. B., &#38; Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. 2017;167(3-4):636-655. doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>"},"type":"journal_article","author":[{"full_name":"Budanur, Nazmi B","first_name":"Nazmi B","last_name":"Budanur","orcid":"0000-0003-0423-5010","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Predrag","full_name":"Cvitanović, Predrag","last_name":"Cvitanović"}],"day":"01","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","doi":"10.1007/s10955-016-1672-z","ddc":["530"],"language":[{"iso":"eng"}],"issue":"3-4","date_published":"2017-05-01T00:00:00Z","_id":"1211","abstract":[{"lang":"eng","text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here."}],"file":[{"date_created":"2018-12-12T10:18:01Z","content_type":"application/pdf","relation":"main_file","file_id":"5319","checksum":"3e971d09eb167761aa0888ed415b0056","date_updated":"2020-07-14T12:44:39Z","access_level":"open_access","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","creator":"system","file_size":2820207}],"oa":1,"publication_status":"published","volume":167,"pubrep_id":"782","file_date_updated":"2020-07-14T12:44:39Z","year":"2017","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"6136","date_updated":"2021-01-12T06:49:07Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1},{"publication_identifier":{"issn":["0091679X"]},"acknowledged_ssus":[{"_id":"Bio"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T11:16:30Z","external_id":{"isi":["000403542900022"]},"scopus_import":"1","year":"2017","oa_version":"None","publist_id":"6134","editor":[{"last_name":"Echard","first_name":"Arnaud ","full_name":"Echard, Arnaud "}],"volume":137,"publication_status":"published","abstract":[{"text":"Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal structure that assembles at the site of division. Its primary component is FtsZ, a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various models for the role of FtsZ have been suggested. However, important information about the architecture and dynamics of FtsZ filaments during cytokinesis is still missing. One reason for this lack of knowledge has been the small size of bacteria, which has made it difficult to resolve the orientation and dynamics of individual FtsZ filaments in the Z-ring. While superresolution microscopy experiments have helped to gain more information about the organization of the Z-ring in the dividing cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize during assembly and disassembly of the Z-ring. In this chapter, we explain how to use an in vitro reconstitution approach to investigate the self-organization of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor FtsA. We show how to perform single-molecule experiments to study the behavior of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA filament network. We describe how to analyze the dynamics of single molecules and explain why this information can help to shed light onto possible mechanism of Z-ring constriction. We believe that similar experimental approaches will be useful to study the mechanism of membrane-based polymerization of other cytoskeletal systems, not only from prokaryotic but also eukaryotic origin.","lang":"eng"}],"_id":"1213","date_published":"2017-12-01T00:00:00Z","article_processing_charge":"No","doi":"10.1016/bs.mcb.2016.03.036","language":[{"iso":"eng"}],"acknowledgement":"Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell).","project":[{"_id":"2596EAB6-B435-11E9-9278-68D0E5697425","name":"Synthesis of bacterial cell wall","grant_number":"ALTF 2015-1163"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"alternative_title":["Methods in Cell Biology"],"author":[{"first_name":"Natalia","full_name":"Baranova, Natalia","last_name":"Baranova","orcid":"0000-0002-3086-9124","id":"38661662-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Loose","first_name":"Martin","full_name":"Loose, Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724"}],"type":"book_chapter","day":"01","title":"Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers","ec_funded":1,"citation":{"chicago":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In <i>Cytokinesis</i>, edited by Arnaud  Echard, 137:355–70. Academic Press, 2017. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>.","ieee":"N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers,” in <i>Cytokinesis</i>, vol. 137, A. Echard, Ed. Academic Press, 2017, pp. 355–370.","ista":"Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol. 137, 355–370.","mla":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” <i>Cytokinesis</i>, edited by Arnaud  Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>.","short":"N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press, 2017, pp. 355–370.","ama":"Baranova NS, Loose M. Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. <i>Cytokinesis</i>. Vol 137. Academic Press; 2017:355-370. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>","apa":"Baranova, N. S., &#38; Loose, M. (2017). Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), <i>Cytokinesis</i> (Vol. 137, pp. 355–370). Academic Press. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>"},"intvolume":"       137","status":"public","quality_controlled":"1","department":[{"_id":"MaLo"}],"publication":"Cytokinesis","isi":1,"publisher":"Academic Press","date_created":"2018-12-11T11:50:45Z","month":"12","page":"355 - 370"},{"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7611288/","open_access":"1"}],"oa":1,"publication_status":"published","volume":50,"issue":"1","article_processing_charge":"No","_id":"12193","date_published":"2017-12-18T00:00:00Z","abstract":[{"text":"DNA methylation regulates eukaryotic gene expression and is extensively reprogrammed during animal development. However, whether developmental methylation reprogramming during the sporophytic life cycle of flowering plants regulates genes is presently unknown. Here we report a distinctive gene-targeted RNA-directed DNA methylation (RdDM) activity in the Arabidopsis thaliana male sexual lineage that regulates gene expression in meiocytes. Loss of sexual-lineage-specific RdDM causes mis-splicing of the MPS1 gene (also known as PRD2), thereby disrupting meiosis. Our results establish a regulatory paradigm in which de novo methylation creates a cell-lineage-specific epigenetic signature that controls gene expression and contributes to cellular function in flowering plants.","lang":"eng"}],"publication_identifier":{"eissn":["1546-1718"],"issn":["1061-4036"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-18T07:21:53Z","external_id":{"pmid":["29255257"]},"scopus_import":"1","year":"2017","oa_version":"None","article_type":"original","publisher":"Nature Research","intvolume":"        50","status":"public","quality_controlled":"1","department":[{"_id":"XiFe"}],"publication":"Nature Genetics","page":"130-137","date_created":"2023-01-16T09:18:05Z","month":"12","acknowledgement":"We thank Daniel Zilberman for intellectual contributions to this work and assistance with manuscript preparation. We also thank Caroline Dean, Kirsten Bomblies, Vinod Kumar, Siobhan Brady and Sophien Kamoun for comments on the manuscript, Hugh Dickinson and Josephine Hellberg for developing the meiocyte isolation method, Giles Oldroyd for the pGWB13-Bar vector, Elisa Fiume for the pMDC107-NTF vector, Matthew Hartley, Matthew Couchman and Tjelvar Sten Gunnar Olsson for bioinformatics support, and the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant Calder) for their assistance with microscopy. This work was funded by a Biotechnology and Biological Sciences Research Council (BBSRC) David Phillips Fellowship (BBL0250431) to X.F., a BBSRC grant (BBM01973X1) to J.H., and a Sainsbury PhD Studentship to J.W.","pmid":1,"doi":"10.1038/s41588-017-0008-5","language":[{"iso":"eng"}],"keyword":["Genetics"],"title":"Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis","citation":{"ama":"Walker J, Gao H, Zhang J, et al. Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. <i>Nature Genetics</i>. 2017;50(1):130-137. doi:<a href=\"https://doi.org/10.1038/s41588-017-0008-5\">10.1038/s41588-017-0008-5</a>","apa":"Walker, J., Gao, H., Zhang, J., Aldridge, B., Vickers, M., Higgins, J. D., &#38; Feng, X. (2017). Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. <i>Nature Genetics</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41588-017-0008-5\">https://doi.org/10.1038/s41588-017-0008-5</a>","short":"J. Walker, H. Gao, J. Zhang, B. Aldridge, M. Vickers, J.D. Higgins, X. Feng, Nature Genetics 50 (2017) 130–137.","mla":"Walker, James, et al. “Sexual-Lineage-Specific DNA Methylation Regulates Meiosis in Arabidopsis.” <i>Nature Genetics</i>, vol. 50, no. 1, Nature Research, 2017, pp. 130–37, doi:<a href=\"https://doi.org/10.1038/s41588-017-0008-5\">10.1038/s41588-017-0008-5</a>.","chicago":"Walker, James, Hongbo Gao, Jingyi Zhang, Billy Aldridge, Martin Vickers, James D. Higgins, and Xiaoqi Feng. “Sexual-Lineage-Specific DNA Methylation Regulates Meiosis in Arabidopsis.” <i>Nature Genetics</i>. Nature Research, 2017. <a href=\"https://doi.org/10.1038/s41588-017-0008-5\">https://doi.org/10.1038/s41588-017-0008-5</a>.","ieee":"J. Walker <i>et al.</i>, “Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis,” <i>Nature Genetics</i>, vol. 50, no. 1. Nature Research, pp. 130–137, 2017.","ista":"Walker J, Gao H, Zhang J, Aldridge B, Vickers M, Higgins JD, Feng X. 2017. Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. Nature Genetics. 50(1), 130–137."},"author":[{"first_name":"James","full_name":"Walker, James","last_name":"Walker"},{"first_name":"Hongbo","full_name":"Gao, Hongbo","last_name":"Gao"},{"full_name":"Zhang, Jingyi","first_name":"Jingyi","last_name":"Zhang"},{"first_name":"Billy","full_name":"Aldridge, Billy","last_name":"Aldridge"},{"last_name":"Vickers","full_name":"Vickers, Martin","first_name":"Martin"},{"last_name":"Higgins","first_name":"James D.","full_name":"Higgins, James D."},{"orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","full_name":"Feng, Xiaoqi","first_name":"Xiaoqi","last_name":"Feng"}],"type":"journal_article","day":"18"},{"intvolume":"        45","status":"public","publication":"European Journal of Neuroscience","quality_controlled":"1","department":[{"_id":"GaNo"}],"isi":1,"publisher":"Wiley-Blackwell","date_created":"2018-12-11T11:50:50Z","month":"01","page":"45 - 57","doi":"10.1111/ejn.13418","ddc":["616"],"language":[{"iso":"eng"}],"pmid":1,"acknowledgement":"This work was supported by grants of the Austrian Science Fund (FWF) P23585B09 to M.W. and F3506 to H.H.S. and the “Wiener Wissenschafts-, Forschungs- und Technologiefonds” (Vienna Science and Technology Fund; WWTF) CS15-033 to M.W.","type":"journal_article","author":[{"full_name":"Sauerzopf, Ulrich","first_name":"Ulrich","last_name":"Sauerzopf"},{"last_name":"Sacco","first_name":"Roberto","full_name":"Sacco, Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Niello, Marco","first_name":"Marco","last_name":"Niello"},{"first_name":"Ana","full_name":"Weidenauer, Ana","last_name":"Weidenauer"},{"last_name":"Praschak Rieder","first_name":"Nicole","full_name":"Praschak Rieder, Nicole"},{"full_name":"Sitte, Harald","first_name":"Harald","last_name":"Sitte"},{"last_name":"Willeit","full_name":"Willeit, Matthaeus","first_name":"Matthaeus"}],"day":"01","title":"Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence","citation":{"short":"U. Sauerzopf, R. Sacco, G. Novarino, M. Niello, A. Weidenauer, N. Praschak Rieder, H. Sitte, M. Willeit, European Journal of Neuroscience 45 (2017) 45–57.","ama":"Sauerzopf U, Sacco R, Novarino G, et al. Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. <i>European Journal of Neuroscience</i>. 2017;45(1):45-57. doi:<a href=\"https://doi.org/10.1111/ejn.13418\">10.1111/ejn.13418</a>","apa":"Sauerzopf, U., Sacco, R., Novarino, G., Niello, M., Weidenauer, A., Praschak Rieder, N., … Willeit, M. (2017). Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/ejn.13418\">https://doi.org/10.1111/ejn.13418</a>","chicago":"Sauerzopf, Ulrich, Roberto Sacco, Gaia Novarino, Marco Niello, Ana Weidenauer, Nicole Praschak Rieder, Harald Sitte, and Matthaeus Willeit. “Are Reprogrammed Cells a Useful Tool for Studying Dopamine Dysfunction in Psychotic Disorders? A Review of the Current Evidence.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/ejn.13418\">https://doi.org/10.1111/ejn.13418</a>.","ieee":"U. Sauerzopf <i>et al.</i>, “Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence,” <i>European Journal of Neuroscience</i>, vol. 45, no. 1. Wiley-Blackwell, pp. 45–57, 2017.","ista":"Sauerzopf U, Sacco R, Novarino G, Niello M, Weidenauer A, Praschak Rieder N, Sitte H, Willeit M. 2017. Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. European Journal of Neuroscience. 45(1), 45–57.","mla":"Sauerzopf, Ulrich, et al. “Are Reprogrammed Cells a Useful Tool for Studying Dopamine Dysfunction in Psychotic Disorders? A Review of the Current Evidence.” <i>European Journal of Neuroscience</i>, vol. 45, no. 1, Wiley-Blackwell, 2017, pp. 45–57, doi:<a href=\"https://doi.org/10.1111/ejn.13418\">10.1111/ejn.13418</a>."},"pubrep_id":"738","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":45,"file_date_updated":"2020-07-14T12:44:39Z","oa":1,"publication_status":"published","_id":"1228","date_published":"2017-01-01T00:00:00Z","abstract":[{"text":"Since 2006, reprogrammed cells have increasingly been used as a biomedical research technique in addition to neuro-psychiatric methods. These rapidly evolving techniques allow for the generation of neuronal sub-populations, and have sparked interest not only in monogenetic neuro-psychiatric diseases, but also in poly-genetic and poly-aetiological disorders such as schizophrenia (SCZ) and bipolar disorder (BPD). This review provides a summary of 19 publications on reprogrammed adult somatic cells derived from patients with SCZ, and five publications using this technique in patients with BPD. As both disorders are complex and heterogeneous, there is a plurality of hypotheses to be tested in vitro. In SCZ, data on alterations of dopaminergic transmission in vitro are sparse, despite the great explanatory power of the so-called DA hypothesis of SCZ. Some findings correspond to perturbations of cell energy metabolism, and observations in reprogrammed cells suggest neuro-developmental alterations. Some studies also report on the efficacy of medicinal compounds to revert alterations observed in cellular models. However, due to the paucity of replication studies, no comprehensive conclusions can be drawn from studies using reprogrammed cells at the present time. In the future, findings from cell culture methods need to be integrated with clinical, epidemiological, pharmacological and imaging data in order to generate a more comprehensive picture of SCZ and BPD.","lang":"eng"}],"file":[{"date_created":"2018-12-12T10:10:48Z","content_type":"application/pdf","relation":"main_file","file_id":"4838","date_updated":"2020-07-14T12:44:39Z","access_level":"open_access","checksum":"c572cf02be8fbb7020cfcfb892182e4c","file_name":"IST-2017-738-v1+1_Sauerzopf_et_al-2017-European_Journal_of_Neuroscience.pdf","file_size":169145,"creator":"system"}],"article_processing_charge":"No","issue":"1","scopus_import":"1","external_id":{"pmid":["27690184"],"isi":["000392487100005"]},"date_updated":"2023-09-20T11:16:01Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","has_accepted_license":"1","year":"2017","article_type":"review","publist_id":"6106"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:49:14Z","external_id":{"arxiv":["1705.03530"]},"publist_id":"7931","year":"2017","oa_version":"Preprint","publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.03530"}],"volume":13,"arxiv":1,"issue":"11","_id":"123","date_published":"2017-07-24T00:00:00Z","abstract":[{"lang":"eng","text":"The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with materials whose stiffness lies between these extremes. Here we introduce a new phenomenon that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By dropping hydrogel spheres onto hot surfaces we find that, rather than hovering, they energetically bounce several times their diameter for minutes at a time. With high-speed video during a single impact, we uncover high-frequency microscopic gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden agitations constitute work cycles that harvest mechanical energy from the vapour and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical energy into a widely used class of soft materials, with potential relevance to fields such as active matter, soft robotics and microfluidics."}],"acknowledgement":"A.S. acknowledges funding from the Delta Institute for Theoretical Physics and the hospitality of the IBS Center for Theoretical Physics of Complex Systems, Daejeon, South Korea. We acknowledge funding from the Netherlands Organisation for Scientific Research through grants VICI No. NWO-680-47-609 (M.v.H. and S.R.W.), VENI No. NWO-680-47-445 (C.C.) and VENI No. NWO-680-47-453 (S.R.W.).","language":[{"iso":"eng"}],"doi":"10.1038/nphys4194","citation":{"mla":"Waitukaitis, Scott R., et al. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” <i>Nature Physics</i>, vol. 13, no. 11, Nature Publishing Group, 2017, pp. 1095–99, doi:<a href=\"https://doi.org/10.1038/nphys4194\">10.1038/nphys4194</a>.","chicago":"Waitukaitis, Scott R, Antal Zuiderwijk, Anton Souslov, Corentin Coulais, and Martin Van Hecke. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” <i>Nature Physics</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/nphys4194\">https://doi.org/10.1038/nphys4194</a>.","ista":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. 2017. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 13(11), 1095–1099.","ieee":"S. R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, and M. Van Hecke, “Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing,” <i>Nature Physics</i>, vol. 13, no. 11. Nature Publishing Group, pp. 1095–1099, 2017.","ama":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. <i>Nature Physics</i>. 2017;13(11):1095-1099. doi:<a href=\"https://doi.org/10.1038/nphys4194\">10.1038/nphys4194</a>","apa":"Waitukaitis, S. R., Zuiderwijk, A., Souslov, A., Coulais, C., &#38; Van Hecke, M. (2017). Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. <i>Nature Physics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nphys4194\">https://doi.org/10.1038/nphys4194</a>","short":"S.R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, M. Van Hecke, Nature Physics 13 (2017) 1095–1099."},"title":"Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing","day":"24","author":[{"first_name":"Scott R","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zuiderwijk, Antal","first_name":"Antal","last_name":"Zuiderwijk"},{"last_name":"Souslov","first_name":"Anton","full_name":"Souslov, Anton"},{"first_name":"Corentin","full_name":"Coulais, Corentin","last_name":"Coulais"},{"last_name":"Van Hecke","first_name":"Martin","full_name":"Van Hecke, Martin"}],"type":"journal_article","publisher":"Nature Publishing Group","quality_controlled":"1","publication":"Nature Physics","status":"public","intvolume":"        13","page":"1095 - 1099","extern":"1","month":"07","date_created":"2018-12-11T11:44:45Z"},{"volume":10328,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.00198"}],"publication_status":"published","date_published":"2017-05-24T00:00:00Z","_id":"12571","abstract":[{"text":"We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices.","lang":"eng"}],"article_processing_charge":"No","arxiv":1,"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319592497"],"eisbn":["9783319592503"]},"scopus_import":"1","external_id":{"arxiv":["1611.00198"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-20T07:57:24Z","year":"2017","oa_version":"Preprint","status":"public","intvolume":"     10328","publication":"19th International Conference on Integer Programming and Combinatorial Optimization","quality_controlled":"1","publisher":"Springer Nature","date_created":"2023-02-20T07:52:31Z","month":"05","extern":"1","page":"86-98","doi":"10.1007/978-3-319-59250-3_8","language":[{"iso":"eng"}],"author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"full_name":"Chakrabarty, Deeparnab","first_name":"Deeparnab","last_name":"Chakrabarty"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"}],"type":"conference","alternative_title":["LNCS"],"day":"24","title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","conference":{"name":"IPCO: Integer Programming and Combinatorial Optimization","start_date":"2017-06-26","end_date":"2017-06-28","location":"Waterloo, ON, Canada"},"citation":{"short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.","apa":"Bhattacharya, S., Chakrabarty, D., &#38; Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In <i>19th International Conference on Integer Programming and Combinatorial Optimization</i> (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">https://doi.org/10.1007/978-3-319-59250-3_8</a>","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>. Vol 10328. Springer Nature; 2017:86-98. doi:<a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">10.1007/978-3-319-59250-3_8</a>","ista":"Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.","ieee":"S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” In <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>, 10328:86–98. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">https://doi.org/10.1007/978-3-319-59250-3_8</a>.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:<a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">10.1007/978-3-319-59250-3_8</a>."}},{"title":"Centreline and cross-glacier air temperature variability on an Alpine glacier: Assessing temperature distribution methods and their influence on melt model calculations","citation":{"mla":"SHAW, THOMAS E., et al. “Centreline and Cross-Glacier Air Temperature Variability on an Alpine Glacier: Assessing Temperature Distribution Methods and Their Influence on Melt Model Calculations.” <i>Journal of Glaciology</i>, vol. 63, no. 242, Cambridge University Press, 2017, pp. 973–88, doi:<a href=\"https://doi.org/10.1017/jog.2017.65\">10.1017/jog.2017.65</a>.","ista":"SHAW TE, BROCK BW, AYALA Á, RUTTER N, Pellicciotti F. 2017. Centreline and cross-glacier air temperature variability on an Alpine glacier: Assessing temperature distribution methods and their influence on melt model calculations. Journal of Glaciology. 63(242), 973–988.","ieee":"T. E. SHAW, B. W. BROCK, Á. AYALA, N. RUTTER, and F. Pellicciotti, “Centreline and cross-glacier air temperature variability on an Alpine glacier: Assessing temperature distribution methods and their influence on melt model calculations,” <i>Journal of Glaciology</i>, vol. 63, no. 242. Cambridge University Press, pp. 973–988, 2017.","chicago":"SHAW, THOMAS E., BEN W. BROCK, ÁLVARO AYALA, NICK RUTTER, and Francesca Pellicciotti. “Centreline and Cross-Glacier Air Temperature Variability on an Alpine Glacier: Assessing Temperature Distribution Methods and Their Influence on Melt Model Calculations.” <i>Journal of Glaciology</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jog.2017.65\">https://doi.org/10.1017/jog.2017.65</a>.","apa":"SHAW, T. E., BROCK, B. W., AYALA, Á., RUTTER, N., &#38; Pellicciotti, F. (2017). Centreline and cross-glacier air temperature variability on an Alpine glacier: Assessing temperature distribution methods and their influence on melt model calculations. <i>Journal of Glaciology</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jog.2017.65\">https://doi.org/10.1017/jog.2017.65</a>","ama":"SHAW TE, BROCK BW, AYALA Á, RUTTER N, Pellicciotti F. Centreline and cross-glacier air temperature variability on an Alpine glacier: Assessing temperature distribution methods and their influence on melt model calculations. <i>Journal of Glaciology</i>. 2017;63(242):973-988. doi:<a href=\"https://doi.org/10.1017/jog.2017.65\">10.1017/jog.2017.65</a>","short":"T.E. SHAW, B.W. BROCK, Á. AYALA, N. RUTTER, F. Pellicciotti, Journal of Glaciology 63 (2017) 973–988."},"author":[{"first_name":"THOMAS E.","full_name":"SHAW, THOMAS E.","last_name":"SHAW"},{"last_name":"BROCK","first_name":"BEN W.","full_name":"BROCK, BEN W."},{"full_name":"AYALA, ÁLVARO","first_name":"ÁLVARO","last_name":"AYALA"},{"full_name":"RUTTER, NICK","first_name":"NICK","last_name":"RUTTER"},{"first_name":"Francesca","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"type":"journal_article","day":"01","doi":"10.1017/jog.2017.65","keyword":["Earth-Surface Processes"],"language":[{"iso":"eng"}],"page":"973-988","date_created":"2023-02-20T08:13:47Z","month":"12","extern":"1","publisher":"Cambridge University Press","intvolume":"        63","status":"public","publication":"Journal of Glaciology","quality_controlled":"1","year":"2017","oa_version":"Published Version","article_type":"original","publication_identifier":{"eissn":["1727-5652"],"issn":["0022-1430"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-28T11:30:34Z","article_processing_charge":"No","issue":"242","date_published":"2017-12-01T00:00:00Z","_id":"12608","abstract":[{"lang":"eng","text":"The spatio-temporal distribution of air temperature over mountain glaciers can demonstrate complex patterns, yet it is often represented simplistically using linear vertical temperature gradients (VTGs) extrapolated from off-glacier locations. We analyse a network of centreline and lateral air temperature observations at Tsanteleina Glacier, Italy, during summer 2015. On average, VTGs are steep (&lt;−0.0065 °C m<jats:sup>−1</jats:sup>), but they are shallow under warm ambient conditions when the correlation between air temperature and elevation becomes weaker. Published along-flowline temperature distribution methods explain centreline observations well, including warming on the lower glacier tongue, but cannot estimate lateral temperature variability. Application of temperature distribution methods improves simulation of melt rates (RMSE) in an energy-balance model by up to 36% compared to the environmental lapse rate extrapolated from an off-glacier station. However, results suggest that model parameters are not easily transferable to glaciers with a small fetch without recalibration. Such methods have potential to improve estimates of temperature across a glacier, but their parameter transferability should be further linked to the glacier and atmospheric characteristics. Furthermore, ‘cold spots’, which can be &gt;2°C cooler than expected for their elevation, whose occurrence is not predicted by the temperature distribution models, are identified at one-quarter of the measurement sites."}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/jog.2017.65"}],"publication_status":"published","volume":63},{"author":[{"first_name":"A.","full_name":"AYALA, A.","last_name":"AYALA"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti"},{"last_name":"PELEG","full_name":"PELEG, N.","first_name":"N."},{"last_name":"BURLANDO","full_name":"BURLANDO, P.","first_name":"P."}],"type":"journal_article","day":"01","title":"Melt and surface sublimation across a glacier in a dry environment: distributed energy-balance modelling of Juncal Norte Glacier, Chile","citation":{"apa":"AYALA, A., Pellicciotti, F., PELEG, N., &#38; BURLANDO, P. (2017). Melt and surface sublimation across a glacier in a dry environment: distributed energy-balance modelling of Juncal Norte Glacier, Chile. <i>Journal of Glaciology</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jog.2017.46\">https://doi.org/10.1017/jog.2017.46</a>","ama":"AYALA A, Pellicciotti F, PELEG N, BURLANDO P. Melt and surface sublimation across a glacier in a dry environment: distributed energy-balance modelling of Juncal Norte Glacier, Chile. <i>Journal of Glaciology</i>. 2017;63(241):803-822. doi:<a href=\"https://doi.org/10.1017/jog.2017.46\">10.1017/jog.2017.46</a>","short":"A. AYALA, F. Pellicciotti, N. PELEG, P. BURLANDO, Journal of Glaciology 63 (2017) 803–822.","mla":"AYALA, A., et al. “Melt and Surface Sublimation across a Glacier in a Dry Environment: Distributed Energy-Balance Modelling of Juncal Norte Glacier, Chile.” <i>Journal of Glaciology</i>, vol. 63, no. 241, Cambridge University Press, 2017, pp. 803–22, doi:<a href=\"https://doi.org/10.1017/jog.2017.46\">10.1017/jog.2017.46</a>.","ieee":"A. AYALA, F. Pellicciotti, N. PELEG, and P. BURLANDO, “Melt and surface sublimation across a glacier in a dry environment: distributed energy-balance modelling of Juncal Norte Glacier, Chile,” <i>Journal of Glaciology</i>, vol. 63, no. 241. Cambridge University Press, pp. 803–822, 2017.","ista":"AYALA A, Pellicciotti F, PELEG N, BURLANDO P. 2017. Melt and surface sublimation across a glacier in a dry environment: distributed energy-balance modelling of Juncal Norte Glacier, Chile. Journal of Glaciology. 63(241), 803–822.","chicago":"AYALA, A., Francesca Pellicciotti, N. PELEG, and P. BURLANDO. “Melt and Surface Sublimation across a Glacier in a Dry Environment: Distributed Energy-Balance Modelling of Juncal Norte Glacier, Chile.” <i>Journal of Glaciology</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jog.2017.46\">https://doi.org/10.1017/jog.2017.46</a>."},"doi":"10.1017/jog.2017.46","language":[{"iso":"eng"}],"keyword":["Earth-Surface Processes"],"date_created":"2023-02-20T08:13:53Z","extern":"1","month":"10","page":"803-822","status":"public","intvolume":"        63","quality_controlled":"1","publication":"Journal of Glaciology","publisher":"Cambridge University Press","oa_version":"Published Version","year":"2017","article_type":"original","publication_identifier":{"issn":["0022-1430"],"eissn":["1727-5652"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-28T11:28:19Z","scopus_import":"1","date_published":"2017-10-01T00:00:00Z","_id":"12609","abstract":[{"lang":"eng","text":"Previous estimates of melt and surface sublimation on glaciers of the subtropical semiarid Andes (29–34°S) have been obtained at few specific locations, but it is not clear how ablation components vary across the entire extent of a glacier in this dry environment. Here, we simulate the distributed energy and mass balance of Juncal Norte Glacier (33°S) during a 2-month summer period. Forcing fields of near-surface air temperature and wind speed are generated using two methods accounting for the main physical processes that shape their spatial variations. Simulated meteorological variables and ablation agree well with observations on the glacier tongue and reveal complex patterns of energy and mass fluxes. Ablation decreases from 70 mm w.e. d<jats:sup>−1</jats:sup> at the low-albedo glacier terminus (~3000 m), where almost 100% of total ablation corresponds to melt, to &lt;5 mm w.e. d<jats:sup>−1</jats:sup> at wind-exposed, strong-radiated sites above 5500 m, where surface sublimation represents &gt;75% of total ablation. Our simulations provide the first glacier-scale estimates of ablation components on a glacier in the study region and better reproduce the observed and expected spatial variations of melt and surface sublimation, in comparison with more simple assumptions, such as linear gradients and uniform wind speeds."}],"issue":"241","article_processing_charge":"No","volume":63,"oa":1,"main_file_link":[{"url":"https://doi.org/10.1017/jog.2017.46","open_access":"1"}],"publication_status":"published"}]