[{"_id":"1390","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"author":[{"last_name":"D'Antoni","first_name":"Loris","full_name":"D'Antoni, Loris"},{"full_name":"Samanta, Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","last_name":"Samanta","first_name":"Roopsha"},{"first_name":"Rishabh","last_name":"Singh","full_name":"Singh, Rishabh"}],"day":"13","year":"2016","date_updated":"2021-01-12T06:50:21Z","abstract":[{"text":"The goal of automatic program repair is to identify a set of syntactic changes that can turn a program that is incorrect with respect\r\nto a given specification into a correct one. Existing program repair techniques typically aim to find any program that meets the given specification. Such “best-effort” strategies can end up generating a program that is quite different from the original one. Novel techniques have been proposed to compute syntactically minimal program fixes, but the smallest syntactic fix to a program can still significantly alter the original program’s behaviour. We propose a new approach to program repair based on program distances, which can quantify changes not only to the program syntax but also to the program semantics. We call this the quantitative program repair problem where the “optimal” repair is derived using multiple distances. We implement a solution to the quantitative repair\r\nproblem in a prototype tool called Qlose\r\n(Quantitatively close), using the program synthesizer Sketch. We evaluate the effectiveness of different distances in obtaining desirable repairs by evaluating\r\nQlose on programs taken from educational tools such as CodeHunt and edX.","lang":"eng"}],"ec_funded":1,"month":"07","alternative_title":["LNCS"],"title":"QLOSE: Program repair with quantitative objectives","publisher":"Springer","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_published":"2016-07-13T00:00:00Z","oa_version":"None","type":"conference","page":"383 - 401","date_created":"2018-12-11T11:51:45Z","publication_status":"published","conference":{"start_date":"2016-07-17","name":"CAV: Computer Aided Verification","end_date":"2016-07-23","location":"Toronto, Canada"},"doi":"10.1007/978-3-319-41540-6_21","citation":{"short":"L. D’Antoni, R. Samanta, R. Singh, in:, Springer, 2016, pp. 383–401.","ama":"D’Antoni L, Samanta R, Singh R. QLOSE: Program repair with quantitative objectives. In: Vol 9780. Springer; 2016:383-401. doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">10.1007/978-3-319-41540-6_21</a>","ieee":"L. D’Antoni, R. Samanta, and R. Singh, “QLOSE: Program repair with quantitative objectives,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 383–401.","chicago":"D’Antoni, Loris, Roopsha Samanta, and Rishabh Singh. “QLOSE: Program Repair with Quantitative Objectives,” 9780:383–401. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">https://doi.org/10.1007/978-3-319-41540-6_21</a>.","apa":"D’Antoni, L., Samanta, R., &#38; Singh, R. (2016). QLOSE: Program repair with quantitative objectives (Vol. 9780, pp. 383–401). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">https://doi.org/10.1007/978-3-319-41540-6_21</a>","mla":"D’Antoni, Loris, et al. <i>QLOSE: Program Repair with Quantitative Objectives</i>. Vol. 9780, Springer, 2016, pp. 383–401, doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">10.1007/978-3-319-41540-6_21</a>.","ista":"D’Antoni L, Samanta R, Singh R. 2016. QLOSE: Program repair with quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 9780, 383–401."},"intvolume":"      9780","quality_controlled":"1","volume":9780,"publist_id":"5819","scopus_import":1},{"date_updated":"2023-09-07T11:58:33Z","abstract":[{"text":"We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as &quot;the first array cell contains the array length,&quot; and &quot;the array contains equally many minimal and maximal elements.&quot; These properties cannot be expressed in quantified fragments of the theory of arrays, nor in the theory of concatenation. Using reduction to counter machines, we show that the satisfiability problem of AFL is PSPACE-complete, and with a natural restriction the complexity decreases to NP. We also show that adding either universal quantifiers or concatenation leads to undecidability.\r\nAFL contains terms that fold a function over an array. We demonstrate that folding, a well-known concept from functional languages, allows us to concisely summarize loops that count over arrays, which occurs frequently in real-life programs. We provide a tool that can discharge proof obligations in AFL, and we demonstrate on practical examples that our decision procedure can solve a broad range of problems in symbolic testing and program verification.","lang":"eng"}],"year":"2016","_id":"1391","status":"public","oa":1,"month":"07","ec_funded":1,"publication_status":"published","conference":{"location":"Toronto, Canada","end_date":"2016-07-23","name":"CAV: Computer Aided Verification","start_date":"2016-07-17"},"doi":"10.1007/978-3-319-41540-6_13","oa_version":"Preprint","date_published":"2016-07-13T00:00:00Z","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1603.06850","open_access":"1"}],"intvolume":"      9780","citation":{"chicago":"Daca, Przemyslaw, Thomas A Henzinger, and Andrey Kupriyanov. “Array Folds Logic,” 9780:230–48. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">https://doi.org/10.1007/978-3-319-41540-6_13</a>.","apa":"Daca, P., Henzinger, T. A., &#38; Kupriyanov, A. (2016). Array folds logic (Vol. 9780, pp. 230–248). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">https://doi.org/10.1007/978-3-319-41540-6_13</a>","mla":"Daca, Przemyslaw, et al. <i>Array Folds Logic</i>. Vol. 9780, Springer, 2016, pp. 230–48, doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">10.1007/978-3-319-41540-6_13</a>.","ista":"Daca P, Henzinger TA, Kupriyanov A. 2016. Array folds logic. CAV: Computer Aided Verification, LNCS, vol. 9780, 230–248.","short":"P. Daca, T.A. Henzinger, A. Kupriyanov, in:, Springer, 2016, pp. 230–248.","ieee":"P. Daca, T. A. Henzinger, and A. Kupriyanov, “Array folds logic,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 230–248.","ama":"Daca P, Henzinger TA, Kupriyanov A. Array folds logic. In: Vol 9780. Springer; 2016:230-248. doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">10.1007/978-3-319-41540-6_13</a>"},"day":"13","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"author":[{"full_name":"Daca, Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Andrey","last_name":"Kupriyanov","id":"2C311BF8-F248-11E8-B48F-1D18A9856A87","full_name":"Kupriyanov, Andrey"}],"publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Array folds logic","alternative_title":["LNCS"],"page":"230 - 248","date_created":"2018-12-11T11:51:45Z","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"publist_id":"5818","volume":9780,"quality_controlled":"1","related_material":{"record":[{"id":"1155","status":"public","relation":"dissertation_contains"}]}},{"year":"2016","abstract":[{"text":"The solution space of genome-scale models of cellular metabolism provides a map between physically\r\nviable flux configurations and cellular metabolic phenotypes described, at the most basic level, by the\r\ncorresponding growth rates. By sampling the solution space of E. coliʼs metabolic network, we show\r\nthat empirical growth rate distributions recently obtained in experiments at single-cell resolution can\r\nbe explained in terms of a trade-off between the higher fitness of fast-growing phenotypes and the\r\nhigher entropy of slow-growing ones. Based on this, we propose a minimal model for the evolution of\r\na large bacterial population that captures this trade-off. The scaling relationships observed in\r\nexperiments encode, in such frameworks, for the same distance from the maximum achievable growth\r\nrate, the same degree of growth rate maximization, and/or the same rate of phenotypic change. Being\r\ngrounded on genome-scale metabolic network reconstructions, these results allow for multiple\r\nimplications and extensions in spite of the underlying conceptual simplicity.","lang":"eng"}],"issue":"3","date_updated":"2021-01-12T06:50:23Z","_id":"1394","article_number":"036005","oa":1,"status":"public","ec_funded":1,"month":"05","doi":"10.1088/1478-3975/13/3/036005","publication_status":"published","date_published":"2016-05-27T00:00:00Z","oa_version":"Preprint","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1601.03243","open_access":"1"}],"intvolume":"        13","citation":{"ieee":"D. De Martino, F. Capuani, and A. De Martino, “Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli,” <i>Physical Biology</i>, vol. 13, no. 3. IOP Publishing Ltd., 2016.","ama":"De Martino D, Capuani F, De Martino A. Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. <i>Physical Biology</i>. 2016;13(3). doi:<a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">10.1088/1478-3975/13/3/036005</a>","short":"D. De Martino, F. Capuani, A. De Martino, Physical Biology 13 (2016).","apa":"De Martino, D., Capuani, F., &#38; De Martino, A. (2016). Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. <i>Physical Biology</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">https://doi.org/10.1088/1478-3975/13/3/036005</a>","ista":"De Martino D, Capuani F, De Martino A. 2016. Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. Physical Biology. 13(3), 036005.","mla":"De Martino, Daniele, et al. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” <i>Physical Biology</i>, vol. 13, no. 3, 036005, IOP Publishing Ltd., 2016, doi:<a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">10.1088/1478-3975/13/3/036005</a>.","chicago":"De Martino, Daniele, Fabrizio Capuani, and Andrea De Martino. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” <i>Physical Biology</i>. IOP Publishing Ltd., 2016. <a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">https://doi.org/10.1088/1478-3975/13/3/036005</a>."},"day":"27","acknowledgement":"The research leading to these results has received funding from the from the Marie\r\nCurie Action ITN NETADIS, grant agreement no. 290038.","author":[{"last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele"},{"full_name":"Capuani, Fabrizio","first_name":"Fabrizio","last_name":"Capuani"},{"first_name":"Andrea","last_name":"De Martino","full_name":"De Martino, Andrea"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"title":"Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IOP Publishing Ltd.","publication":"Physical Biology","date_created":"2018-12-11T11:51:46Z","department":[{"_id":"GaTk"}],"language":[{"iso":"eng"}],"type":"journal_article","publist_id":"5815","volume":13,"quality_controlled":"1"},{"ddc":["570"],"file_date_updated":"2021-02-22T11:48:44Z","citation":{"short":"R.K. Mishra, Synaptic Plasticity Rules at CA3-CA3 Recurrent Synapses in Hippocampus, Institute of Science and Technology Austria, 2016.","ieee":"R. K. Mishra, “Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus,” Institute of Science and Technology Austria, 2016.","ama":"Mishra RK. Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus. 2016.","chicago":"Mishra, Rajiv Kumar. “Synaptic Plasticity Rules at CA3-CA3 Recurrent Synapses in Hippocampus.” Institute of Science and Technology Austria, 2016.","apa":"Mishra, R. K. (2016). <i>Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus</i>. Institute of Science and Technology Austria.","mla":"Mishra, Rajiv Kumar. <i>Synaptic Plasticity Rules at CA3-CA3 Recurrent Synapses in Hippocampus</i>. Institute of Science and Technology Austria, 2016.","ista":"Mishra RK. 2016. Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus. Institute of Science and Technology Austria."},"publication_status":"published","date_published":"2016-03-01T00:00:00Z","oa_version":"Published Version","oa":1,"publication_identifier":{"issn":["2663-337X"]},"status":"public","month":"03","year":"2016","abstract":[{"lang":"eng","text":"CA3 pyramidal neurons are thought to pay a key role in memory storage and pattern completion by activity-dependent synaptic plasticity between CA3-CA3 recurrent excitatory synapses. To examine the induction rules of synaptic plasticity at CA3-CA3 synapses, we performed whole-cell patch-clamp recordings in acute hippocampal slices from rats (postnatal 21-24 days) at room temperature. Compound excitatory postsynaptic potentials (ESPSs) were recorded by tract stimulation in stratum oriens in the presence of 10 µM gabazine. High-frequency stimulation (HFS) induced N-methyl-D-aspartate (NMDA) receptor-dependent long-term potentiation (LTP). Although LTP by HFS did not requier postsynaptic spikes, it was blocked by Na+-channel blockers suggesting that local active processes (e.g.) dendritic spikes) may contribute to LTP induction without requirement of a somatic action potential (AP). We next examined the properties of spike timing-dependent plasticity (STDP) at CA3-CA3 synapses. Unexpectedly, low-frequency pairing of EPSPs and backpropagated action potentialy (bAPs) induced LTP, independent of temporal order. The STDP curve was symmetric and broad, with a half-width of ~150 ms. Consistent with these specific STDP induction properties, post-presynaptic sequences led to a supralinear summation of spine [Ca2+] transients. Furthermore, in autoassociative network models, storage and recall was substantially more robust with symmetric than with asymmetric STDP rules. In conclusion, we found associative forms of LTP at CA3-CA3 recurrent collateral synapses with distinct induction rules. LTP induced by HFS may be associated with dendritic spikes. In contrast, low frequency pairing of pre- and postsynaptic activity induced LTP only if EPSP-AP were temporally very close. Together, these induction mechanisms of synaptiic plasticity may contribute to memory storage in the CA3-CA3 microcircuit at different ranges of activity."}],"date_updated":"2023-09-07T11:55:26Z","_id":"1396","article_processing_charge":"No","publist_id":"5811","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"1432"}]},"page":"83","date_created":"2018-12-11T11:51:46Z","has_accepted_license":"1","department":[{"_id":"PeJo"}],"language":[{"iso":"eng"}],"type":"dissertation","title":"Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Institute of Science and Technology Austria","supervisor":[{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"day":"01","file":[{"date_created":"2019-08-09T12:14:46Z","date_updated":"2020-07-14T12:44:48Z","file_name":"Thesis_Mishra_Rajiv (Final).pdf","access_level":"closed","checksum":"5a010a838faf040f7064f3cfb802f743","creator":"dernst","file_id":"6782","file_size":2407572,"relation":"main_file","content_type":"application/pdf"},{"content_type":"application/pdf","relation":"main_file","success":1,"file_size":2407572,"creator":"dernst","checksum":"81b26d9ede92c99f1d8cc6fa1d04cbbb","file_id":"9183","access_level":"open_access","date_updated":"2021-02-22T11:48:44Z","file_name":"2016_RajivMishra_Thesis.pdf","date_created":"2021-02-22T11:48:44Z"}],"author":[{"full_name":"Mishra, Rajiv Kumar","first_name":"Rajiv Kumar","id":"46CB58F2-F248-11E8-B48F-1D18A9856A87","last_name":"Mishra"}]},{"publication_status":"published","date_created":"2018-12-11T11:51:47Z","page":"232","oa_version":"None","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"date_published":"2016-02-01T00:00:00Z","publist_id":"5810","article_processing_charge":"No","citation":{"short":"M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, Institute of Science and Technology Austria, 2016.","ieee":"M. Chmelik, “Algorithms for partially observable markov decision processes,” Institute of Science and Technology Austria, 2016.","ama":"Chmelik M. Algorithms for partially observable markov decision processes. 2016.","apa":"Chmelik, M. (2016). <i>Algorithms for partially observable markov decision processes</i>. Institute of Science and Technology Austria.","ista":"Chmelik M. 2016. Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.","mla":"Chmelik, Martin. <i>Algorithms for Partially Observable Markov Decision Processes</i>. Institute of Science and Technology Austria, 2016.","chicago":"Chmelik, Martin. “Algorithms for Partially Observable Markov Decision Processes.” Institute of Science and Technology Austria, 2016."},"date_updated":"2023-09-07T11:54:58Z","abstract":[{"lang":"eng","text":"We study partially observable Markov decision processes (POMDPs) with objectives used in verification and artificial intelligence. The qualitative analysis problem given a POMDP and an objective asks whether there is a strategy (policy) to ensure that the objective is satisfied almost surely (with probability 1), resp. with positive probability (with probability greater than 0). For POMDPs with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the payoff of an infinite path is the long-run average of the rewards, we consider two types of path constraints: (i) a quantitative limit-average constraint defines the set of paths where the payoff is at least a given threshold L1 = 1. Our main results for qualitative limit-average constraint under almost-sure winning are as follows: (i) the problem of deciding the existence of a finite-memory controller is EXPTIME-complete; and (ii) the problem of deciding the existence of an infinite-memory controller is undecidable. For quantitative limit-average constraints we show that the problem of deciding the existence of a finite-memory controller is undecidable. We present a prototype implementation of our EXPTIME algorithm. For POMDPs with w-regular conditions specified as parity objectives, while the qualitative analysis problems are known to be undecidable even for very special case of parity objectives, we establish decidability (with optimal complexity) of the qualitative analysis problems for POMDPs with parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. Based on our theoretical algorithms we also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of well-known POMDP examples for robotics applications. For POMDPs with a set of target states and an integer cost associated with every transition, we study the optimization objective that asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely. We show that for general integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double and exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms that extend existing algorithms for POMDPs with finite-horizon objectives. We show experimentally that it performs well in many examples of interest. We study more deeply the problem of almost-sure reachability, where  given a set of target states, the question is to decide whether there is a strategy to ensure that the target set is reached almost surely. While in general the problem EXPTIME-complete, in many practical cases strategies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. We first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. Decentralized POMDPs (DEC-POMDPs) extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. In this work we consider Goal DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the real-time dynamic programming approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. In the end we present a short summary of a few other results related to verification of MDPs and POMDPs."}],"day":"01","year":"2016","author":[{"first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"}],"_id":"1397","status":"public","publisher":"Institute of Science and Technology Austria","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Algorithms for partially observable markov decision processes","publication_identifier":{"issn":["2663-337X"]},"month":"02","degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"supervisor":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}]},{"acknowledgement":"I am indebted to many people for their support during my PhD, but I particularly wish to thank Nick Barton for his guidance and intuition, and for encouraging me to take the time to look beyond the immediate topic of my PhD to understand the broader context. I am also especially grateful to David Field his bottomless patience, invaluable advice on experimental design, analysis and scientific writing, and for tireless work on the population surveys and genomic work without most of my thesis could not have happened. \r\n\r\nIt has been a pleasure to work with the combined strengths of the groups at The John Innes Centre, University of Toulouse and IST Austria. Thanks to Enrico Coen and his group for hosting me in Norwich in 2011 and especially for setting up the tag experiment. \r\n\r\nI thank David Field, Desmond Bradley and Maria Clara Melo-Hurtado for organising field collections, as well as Monique Burrus and Christophe Andalo and a large number of volunteers for their e ff orts helping with the field work. Furthermore I thank Coline Jaworski for providing seeds and for her input into the design of the experimental arrays, and Matthew Couchman for maintaining the database of. \r\n\r\nIn addition to those mentioned above, I am grateful to Melinda Pickup, Spencer Barrett, and four anonymous reviewers for their insightful comments on sections of this manuscript. I also thank Jana Porsche for her e ff orts in tracking down the more obscure references for chapter 5, and Jon Bollback for his advice about the analysis. \r\n\r\nI am indebted to Jon Ågren for his patience whilst I finished this thesis, and to Sylvia Cremer and Magnus Nordborg for taking the time to read and evaluate the thesis given a shorter deadline than was fair. \r\n\r\nA very positive aspect of my PhD has been the supportive atmosphere of IST. In particular, I have come to appreciate the enormous support from our group assistants Nicole Hotzy, Julia Asimakis, Christine Ostermann and Jerneja Beslagic. I also thank Christian Chaloupka and Stefan Hipfinger for their enthusiasm and readiness to help where possible in setting up our greenhouse and experiments. ","day":"18","author":[{"last_name":"Ellis","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-8511-0254","full_name":"Ellis, Thomas"}],"file":[{"checksum":"a89b17ff27cf92c9a15f6b3d46bd7e53","file_id":"5106","creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:44:48Z","file_name":"IST-2016-526-v1+1_Ellis_signed_thesis.pdf","date_created":"2018-12-12T10:14:51Z","relation":"main_file","content_type":"application/pdf","file_size":11928241}],"publisher":"Institute of Science and Technology Austria","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"The role of pollinator-mediated selection in the maintenance of a flower color polymorphism in an Antirrhinum majus hybrid zone","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","supervisor":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","page":"130","date_created":"2018-12-11T11:51:47Z","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"publist_id":"5809","article_processing_charge":"No","pubrep_id":"526","related_material":{"record":[{"id":"5553","relation":"popular_science","status":"public"},{"status":"public","relation":"popular_science","id":"5551"},{"status":"public","relation":"popular_science","id":"5552"}]},"date_updated":"2024-02-21T13:51:39Z","abstract":[{"text":"Hybrid zones represent evolutionary laboratories, where recombination brings together alleles in combinations which have not previously been tested by selection. This provides an excellent opportunity to test the effect of molecular variation on fitness, and how this variation is able to spread through populations in a natural context. The snapdragon Antirrhinum majus is polymorphic in the wild for two loci controlling the distribution of yellow and magenta floral pigments. Where the yellow A. m. striatum and the magenta A. m. pseudomajus meet along a valley in the Spanish Pyrenees they form a stable hybrid zone Alleles at these loci recombine to give striking transgressive variation for flower colour. The sharp transition in phenotype over ~1km implies strong selection maintaining the hybrid zone. An indirect assay of pollinator visitation in the field found that pollinators forage in a positive-frequency dependent manner on Antirrhinum, matching previous data on fruit set. Experimental arrays and paternity analysis of wild-pollinated seeds demonstrated assortative mating for pigmentation alleles, and that pollinator behaviour alone is sufficient to explain this pattern. Selection by pollinators should be sufficiently strong to maintain the hybrid zone, although other mechanisms may be at work. At a broader scale I examined evolutionary transitions between yellow and anthocyanin pigmentation in the tribe Antirrhinae, and found that selection has acted strate that pollinators are a major determinant of reproductive success and mating patterns in wild Antirrhinum.","lang":"eng"}],"year":"2016","_id":"1398","status":"public","oa":1,"publication_identifier":{"issn":["2663-337X"]},"month":"02","publication_status":"published","doi":"10.15479/AT:ISTA:TH_526 ","oa_version":"Published Version","date_published":"2016-02-18T00:00:00Z","file_date_updated":"2020-07-14T12:44:48Z","ddc":["576"],"citation":{"short":"T. Ellis, The Role of Pollinator-Mediated Selection in the Maintenance of a Flower Color Polymorphism in an Antirrhinum Majus Hybrid Zone, Institute of Science and Technology Austria, 2016.","ama":"Ellis T. The role of pollinator-mediated selection in the maintenance of a flower color polymorphism in an Antirrhinum majus hybrid zone. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_526 \">10.15479/AT:ISTA:TH_526 </a>","ieee":"T. Ellis, “The role of pollinator-mediated selection in the maintenance of a flower color polymorphism in an Antirrhinum majus hybrid zone,” Institute of Science and Technology Austria, 2016.","apa":"Ellis, T. (2016). <i>The role of pollinator-mediated selection in the maintenance of a flower color polymorphism in an Antirrhinum majus hybrid zone</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_526 \">https://doi.org/10.15479/AT:ISTA:TH_526 </a>","ista":"Ellis T. 2016. The role of pollinator-mediated selection in the maintenance of a flower color polymorphism in an Antirrhinum majus hybrid zone. Institute of Science and Technology Austria.","mla":"Ellis, Thomas. <i>The Role of Pollinator-Mediated Selection in the Maintenance of a Flower Color Polymorphism in an Antirrhinum Majus Hybrid Zone</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_526 \">10.15479/AT:ISTA:TH_526 </a>.","chicago":"Ellis, Thomas. “The Role of Pollinator-Mediated Selection in the Maintenance of a Flower Color Polymorphism in an Antirrhinum Majus Hybrid Zone.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_526 \">https://doi.org/10.15479/AT:ISTA:TH_526 </a>."}},{"ddc":["510"],"file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"intvolume":"        56","citation":{"short":"P. Franek, M. Krcál, Discrete &#38; Computational Geometry 56 (2016) 126–164.","ieee":"P. Franek and M. Krcál, “On computability and triviality of well groups,” <i>Discrete &#38; Computational Geometry</i>, vol. 56, no. 1. Springer, pp. 126–164, 2016.","ama":"Franek P, Krcál M. On computability and triviality of well groups. <i>Discrete &#38; Computational Geometry</i>. 2016;56(1):126-164. doi:<a href=\"https://doi.org/10.1007/s00454-016-9794-2\">10.1007/s00454-016-9794-2</a>","chicago":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00454-016-9794-2\">https://doi.org/10.1007/s00454-016-9794-2</a>.","ista":"Franek P, Krcál M. 2016. On computability and triviality of well groups. Discrete &#38; Computational Geometry. 56(1), 126–164.","mla":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” <i>Discrete &#38; Computational Geometry</i>, vol. 56, no. 1, Springer, 2016, pp. 126–64, doi:<a href=\"https://doi.org/10.1007/s00454-016-9794-2\">10.1007/s00454-016-9794-2</a>.","apa":"Franek, P., &#38; Krcál, M. (2016). On computability and triviality of well groups. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-016-9794-2\">https://doi.org/10.1007/s00454-016-9794-2</a>"},"publication_status":"published","doi":"10.1007/s00454-016-9794-2","date_published":"2016-07-01T00:00:00Z","oa_version":"Published Version","oa":1,"status":"public","ec_funded":1,"month":"07","year":"2016","date_updated":"2023-02-23T10:02:11Z","abstract":[{"lang":"eng","text":"The concept of well group in a special but important case captures homological properties of the zero set of a continuous map (Formula presented.) on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within (Formula presented.) distance r from f for a given (Formula presented.). The main drawback of the approach is that the computability of well groups was shown only when (Formula presented.) or (Formula presented.). Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of (Formula presented.) by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and (Formula presented.), our approximation of the (Formula presented.)th well group is exact. For the second part, we find examples of maps (Formula presented.) with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status."}],"issue":"1","_id":"1408","publist_id":"5799","article_processing_charge":"Yes (via OA deal)","pubrep_id":"614","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1510"}]},"quality_controlled":"1","volume":56,"page":"126 - 164","date_created":"2018-12-11T11:51:51Z","publication":"Discrete & Computational Geometry","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"type":"journal_article","title":"On computability and triviality of well groups","publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","file":[{"access_level":"open_access","creator":"system","file_id":"4846","checksum":"e0da023abf6b72abd8c6a8c76740d53c","date_created":"2018-12-12T10:10:55Z","file_name":"IST-2016-614-v1+1_s00454-016-9794-2.pdf","date_updated":"2020-07-14T12:44:53Z","file_size":905303,"content_type":"application/pdf","relation":"main_file"}],"project":[{"call_identifier":"FWF","name":"Robust invariants of Nonlinear Systems","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","grant_number":"M01980"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"author":[{"first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","full_name":"Franek, Peter"},{"full_name":"Krcál, Marek","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál"}]},{"volume":25,"quality_controlled":"1","pubrep_id":"772","publist_id":"5798","department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Molecular Ecology","page":"2325 - 2332","date_created":"2018-12-11T11:51:51Z","has_accepted_license":"1","title":"Genomics of hybridization and its evolutionary consequences","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley-Blackwell","file":[{"date_created":"2018-12-12T10:10:12Z","date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2017-772-v1+1_AbbotEtAl2016-3.pdf","access_level":"open_access","checksum":"ede7d0b8a471754f71f17e2b20f3135b","file_id":"4797","creator":"system","file_size":226137,"relation":"main_file","content_type":"application/pdf"}],"author":[{"full_name":"Abbott, Richard","last_name":"Abbott","first_name":"Richard"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H"},{"full_name":"Good, Jeffrey","first_name":"Jeffrey","last_name":"Good"}],"day":"08","citation":{"chicago":"Abbott, Richard, Nicholas H Barton, and Jeffrey Good. “Genomics of Hybridization and Its Evolutionary Consequences.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/mec.13685\">https://doi.org/10.1111/mec.13685</a>.","apa":"Abbott, R., Barton, N. H., &#38; Good, J. (2016). Genomics of hybridization and its evolutionary consequences. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.13685\">https://doi.org/10.1111/mec.13685</a>","ista":"Abbott R, Barton NH, Good J. 2016. Genomics of hybridization and its evolutionary consequences. Molecular Ecology. 25(11), 2325–2332.","mla":"Abbott, Richard, et al. “Genomics of Hybridization and Its Evolutionary Consequences.” <i>Molecular Ecology</i>, vol. 25, no. 11, Wiley-Blackwell, 2016, pp. 2325–32, doi:<a href=\"https://doi.org/10.1111/mec.13685\">10.1111/mec.13685</a>.","short":"R. Abbott, N.H. Barton, J. Good, Molecular Ecology 25 (2016) 2325–2332.","ieee":"R. Abbott, N. H. Barton, and J. Good, “Genomics of hybridization and its evolutionary consequences,” <i>Molecular Ecology</i>, vol. 25, no. 11. Wiley-Blackwell, pp. 2325–2332, 2016.","ama":"Abbott R, Barton NH, Good J. Genomics of hybridization and its evolutionary consequences. <i>Molecular Ecology</i>. 2016;25(11):2325-2332. doi:<a href=\"https://doi.org/10.1111/mec.13685\">10.1111/mec.13685</a>"},"intvolume":"        25","ddc":["576"],"file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"date_published":"2016-06-08T00:00:00Z","oa_version":"Submitted Version","doi":"10.1111/mec.13685","publication_status":"published","month":"06","oa":1,"status":"public","_id":"1409","year":"2016","issue":"11","date_updated":"2021-01-12T06:50:33Z"},{"publication_status":"published","doi":"10.1016/j.plantsci.2016.05.014","oa_version":"Submitted Version","date_published":"2016-09-01T00:00:00Z","file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"ddc":["581"],"intvolume":"       250","citation":{"mla":"Ugalde, José, et al. “Phosphatidylinositol 4-Phosphate 5-Kinases 1 and 2 Are Involved in the Regulation of Vacuole Morphology during Arabidopsis Thaliana Pollen Development.” <i>Plant Science</i>, vol. 250, Elsevier, 2016, pp. 10–19, doi:<a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">10.1016/j.plantsci.2016.05.014</a>.","apa":"Ugalde, J., Rodríguez Furlán, C., De Rycke, R., Norambuena, L., Friml, J., León, G., &#38; Tejos, R. (2016). Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. <i>Plant Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">https://doi.org/10.1016/j.plantsci.2016.05.014</a>","ista":"Ugalde J, Rodríguez Furlán C, De Rycke R, Norambuena L, Friml J, León G, Tejos R. 2016. Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. Plant Science. 250, 10–19.","chicago":"Ugalde, José, Cecilia Rodríguez Furlán, Riet De Rycke, Lorena Norambuena, Jiří Friml, Gabriel León, and Ricardo Tejos. “Phosphatidylinositol 4-Phosphate 5-Kinases 1 and 2 Are Involved in the Regulation of Vacuole Morphology during Arabidopsis Thaliana Pollen Development.” <i>Plant Science</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">https://doi.org/10.1016/j.plantsci.2016.05.014</a>.","short":"J. Ugalde, C. Rodríguez Furlán, R. De Rycke, L. Norambuena, J. Friml, G. León, R. Tejos, Plant Science 250 (2016) 10–19.","ieee":"J. Ugalde <i>et al.</i>, “Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development,” <i>Plant Science</i>, vol. 250. Elsevier, pp. 10–19, 2016.","ama":"Ugalde J, Rodríguez Furlán C, De Rycke R, et al. Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. <i>Plant Science</i>. 2016;250:10-19. doi:<a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">10.1016/j.plantsci.2016.05.014</a>"},"date_updated":"2021-01-12T06:50:33Z","abstract":[{"lang":"eng","text":"The pollen grains arise after meiosis of pollen mother cells within the anthers. A series of complex structural changes follows, generating mature pollen grains capable of performing the double fertilization of the female megasporophyte. Several signaling molecules, including hormones and lipids, have been involved in the regulation and appropriate control of pollen development. Phosphatidylinositol 4-phophate 5-kinases (PIP5K), which catalyze the biosynthesis of the phosphoinositide PtdIns(4,5)P2, are important for tip polar growth of root hairs and pollen tubes, embryo development, vegetative plant growth, and responses to the environment. Here, we report a role of PIP5Ks during microgametogenesis. PIP5K1 and PIP5K2 are expressed during early stages of pollen development and their transcriptional activity respond to auxin in pollen grains. Early male gametophytic lethality to certain grade was observed in both pip5k1-/- and pip5k2-/- single mutants. The number of pip5k mutant alleles is directly related to the frequency of aborted pollen grains suggesting the two genes are involved in the same function. Indeed PIP5K1 and PIP5K2 are functionally redundant since homozygous double mutants did not render viable pollen grains. The loss of function of PIP5K1 and PIP5K2results in defects in vacuole morphology in pollen at the later stages and epidermal root cells. Our results show that PIP5K1, PIP5K2 and phosphoinositide signaling are important cues for early developmental stages and vacuole formation during microgametogenesis."}],"year":"2016","_id":"1410","status":"public","oa":1,"month":"09","has_accepted_license":"1","date_created":"2018-12-11T11:51:51Z","page":"10 - 19","publication":"Plant Science","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"publist_id":"5797","pubrep_id":"1005","external_id":{"pmid":["27457979"]},"quality_controlled":"1","volume":250,"acknowledgement":"the Odysseus Program of the Research Foundation-Flanders [G091608] to JF.","pmid":1,"day":"01","author":[{"last_name":"Ugalde","first_name":"José","full_name":"Ugalde, José"},{"full_name":"Rodríguez Furlán, Cecilia","first_name":"Cecilia","last_name":"Rodríguez Furlán"},{"full_name":"De Rycke, Riet","last_name":"De Rycke","first_name":"Riet"},{"full_name":"Norambuena, Lorena","first_name":"Lorena","last_name":"Norambuena"},{"full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Gabriel","last_name":"León","full_name":"León, Gabriel"},{"full_name":"Tejos, Ricardo","last_name":"Tejos","first_name":"Ricardo"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":4338545,"file_id":"6331","checksum":"ca08de036e6ddc81e6f760e0ccdebd3f","creator":"dernst","access_level":"open_access","file_name":"2016_PlantScience_Ugalde.pdf","date_updated":"2020-07-14T12:44:53Z","date_created":"2019-04-17T07:41:57Z"}],"publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","title":"Untangling two systems of noncrossing curves","author":[{"full_name":"Matoušek, Jiří","last_name":"Matoušek","first_name":"Jiří"},{"full_name":"Sedgwick, Eric","first_name":"Eric","last_name":"Sedgwick"},{"first_name":"Martin","orcid":"0000-0002-1191-6714","last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin"},{"first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948"}],"acknowledgement":"Supported by the ERC Adv anced Grant No. 267165. ","day":"01","quality_controlled":"1","volume":212,"related_material":{"record":[{"id":"2244","relation":"earlier_version","status":"public"}]},"publist_id":"5796","type":"journal_article","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"publication":"Israel Journal of Mathematics","page":"37 - 79","date_created":"2018-12-11T11:51:52Z","month":"05","status":"public","oa":1,"_id":"1411","issue":"1","abstract":[{"lang":"eng","text":"We consider two systems (α1, …, αm) and (β1, …,βn) of simple curves drawn on a compact two-dimensional surface M with boundary. Each αi and each βj is either an arc meeting the boundary of M at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to “untangle” the βj from the ai by a self-homeomorphism of M; more precisely, we seek a homeomorphism φ:M→M fixing the boundary of M pointwise such that the total number of crossings of the ai with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if M is planar, i.e., a sphere with h ≥ 0 boundary components (“holes”), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface M with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. The proofs rely, among other things, on a result concerning simultaneous planar drawings of graphs by Erten and Kobourov."}],"date_updated":"2023-02-23T10:34:31Z","year":"2016","citation":{"chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” <i>Israel Journal of Mathematics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11856-016-1294-9\">https://doi.org/10.1007/s11856-016-1294-9</a>.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2016). Untangling two systems of noncrossing curves. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-016-1294-9\">https://doi.org/10.1007/s11856-016-1294-9</a>","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2016. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1), 37–79.","mla":"Matoušek, Jiří, et al. “Untangling Two Systems of Noncrossing Curves.” <i>Israel Journal of Mathematics</i>, vol. 212, no. 1, Springer, 2016, pp. 37–79, doi:<a href=\"https://doi.org/10.1007/s11856-016-1294-9\">10.1007/s11856-016-1294-9</a>.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, Israel Journal of Mathematics 212 (2016) 37–79.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. <i>Israel Journal of Mathematics</i>. 2016;212(1):37-79. doi:<a href=\"https://doi.org/10.1007/s11856-016-1294-9\">10.1007/s11856-016-1294-9</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” <i>Israel Journal of Mathematics</i>, vol. 212, no. 1. Springer, pp. 37–79, 2016."},"intvolume":"       212","main_file_link":[{"url":"http://arxiv.org/abs/1302.6475","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","date_published":"2016-05-01T00:00:00Z","doi":"10.1007/s11856-016-1294-9","publication_status":"published"},{"month":"05","ec_funded":1,"status":"public","oa":1,"_id":"1412","date_updated":"2023-02-21T10:38:30Z","abstract":[{"text":"Combining high-resolution level set surface tracking with lower resolution physics is an inexpensive method for achieving highly detailed liquid animations. Unfortunately, the inherent resolution mismatch introduces several types of disturbing visual artifacts. We identify the primary sources of these artifacts and present simple, efficient, and practical solutions to address them. First, we propose an unconditionally stable filtering method that selectively removes sub-grid surface artifacts not seen by the fluid physics, while preserving fine detail in dynamic splashing regions. It provides comparable results to recent error-correction techniques at lower cost, without substepping, and with better scaling behavior. Second, we show how a modified narrow-band scheme can ensure accurate free surface boundary conditions in the presence of large resolution mismatches. Our scheme preserves the efficiency of the narrow-band methodology, while eliminating objectionable stairstep artifacts observed in prior work. Third, we demonstrate that the use of linear interpolation of velocity during advection of the high-resolution level set surface is responsible for visible grid-aligned kinks; we therefore advocate higher-order velocity interpolation, and show that it dramatically reduces this artifact. While these three contributions are orthogonal, our results demonstrate that taken together they efficiently address the dominant sources of visual artifacts arising with high-resolution embedded liquid surfaces; the proposed approach offers improved visual quality, a straightforward implementation, and substantially greater scalability than competing methods.","lang":"eng"}],"issue":"2","year":"2016","citation":{"mla":"Goldade, Ryan, et al. “A Practical Method for High-Resolution Embedded Liquid Surfaces.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 233–42, doi:<a href=\"https://doi.org/10.1111/cgf.12826\">10.1111/cgf.12826</a>.","ista":"Goldade R, Batty C, Wojtan C. 2016. A practical method for high-resolution embedded liquid surfaces. Computer Graphics Forum. 35(2), 233–242.","apa":"Goldade, R., Batty, C., &#38; Wojtan, C. (2016). A practical method for high-resolution embedded liquid surfaces. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12826\">https://doi.org/10.1111/cgf.12826</a>","chicago":"Goldade, Ryan, Christopher Batty, and Chris Wojtan. “A Practical Method for High-Resolution Embedded Liquid Surfaces.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12826\">https://doi.org/10.1111/cgf.12826</a>.","ama":"Goldade R, Batty C, Wojtan C. A practical method for high-resolution embedded liquid surfaces. <i>Computer Graphics Forum</i>. 2016;35(2):233-242. doi:<a href=\"https://doi.org/10.1111/cgf.12826\">10.1111/cgf.12826</a>","ieee":"R. Goldade, C. Batty, and C. Wojtan, “A practical method for high-resolution embedded liquid surfaces,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 233–242, 2016.","short":"R. Goldade, C. Batty, C. Wojtan, Computer Graphics Forum 35 (2016) 233–242."},"intvolume":"        35","scopus_import":1,"file_date_updated":"2020-07-14T12:44:53Z","ddc":["000"],"oa_version":"Submitted Version","date_published":"2016-05-27T00:00:00Z","publication_status":"published","doi":"10.1111/cgf.12826","publisher":"Wiley-Blackwell","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"A practical method for high-resolution embedded liquid surfaces","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Goldade, Ryan","first_name":"Ryan","last_name":"Goldade"},{"first_name":"Christopher","last_name":"Batty","full_name":"Batty, Christopher"},{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":15873858,"date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2016-612-v1+2_Wojtan_APracticalMethod_PostPrint_2016.pdf","date_created":"2018-12-12T10:13:18Z","file_id":"5000","checksum":"8e61387ee2e3bd0e776fbe301629bfd9","creator":"system","access_level":"open_access"}],"acknowledgement":"This research was supported by NSERC (RGPIN-04360-2014) and IST Austria. ","day":"27","volume":35,"quality_controlled":"1","publist_id":"5795","pubrep_id":"612","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"ChWo"}],"has_accepted_license":"1","date_created":"2018-12-11T11:51:52Z","page":"233 - 242","publication":"Computer Graphics Forum"},{"quality_controlled":"1","citation":{"mla":"Jeschke, Stefan. “Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 71–79, doi:<a href=\"https://doi.org/10.1111/cgf.12812\">10.1111/cgf.12812</a>.","apa":"Jeschke, S. (2016). Generalized diffusion curves: An improved vector representation for smooth-shaded images. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12812\">https://doi.org/10.1111/cgf.12812</a>","ista":"Jeschke S. 2016. Generalized diffusion curves: An improved vector representation for smooth-shaded images. Computer Graphics Forum. 35(2), 71–79.","chicago":"Jeschke, Stefan. “Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12812\">https://doi.org/10.1111/cgf.12812</a>.","short":"S. Jeschke, Computer Graphics Forum 35 (2016) 71–79.","ama":"Jeschke S. Generalized diffusion curves: An improved vector representation for smooth-shaded images. <i>Computer Graphics Forum</i>. 2016;35(2):71-79. doi:<a href=\"https://doi.org/10.1111/cgf.12812\">10.1111/cgf.12812</a>","ieee":"S. Jeschke, “Generalized diffusion curves: An improved vector representation for smooth-shaded images,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 71–79, 2016."},"intvolume":"        35","volume":35,"scopus_import":1,"publist_id":"5794","date_published":"2016-05-01T00:00:00Z","department":[{"_id":"ChWo"}],"language":[{"iso":"eng"}],"oa_version":"None","type":"journal_article","publication":"Computer Graphics Forum","page":"71 - 79","date_created":"2018-12-11T11:51:53Z","doi":"10.1111/cgf.12812","publication_status":"published","month":"05","title":"Generalized diffusion curves: An improved vector representation for smooth-shaded images","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Wiley-Blackwell","_id":"1413","author":[{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","full_name":"Jeschke, Stefan"}],"project":[{"grant_number":"P 24352-N23","_id":"25357BD2-B435-11E9-9278-68D0E5697425","name":"Deep Pictures: Creating Visual and Haptic Vector Images","call_identifier":"FWF"}],"year":"2016","day":"01","issue":"2","abstract":[{"text":"This paper generalizes the well-known Diffusion Curves Images (DCI), which are composed of a set of Bezier curves with colors specified on either side. These colors are diffused as Laplace functions over the image domain, which results in smooth color gradients interrupted by the Bezier curves. Our new formulation allows for more color control away from the boundary, providing a similar expressive power as recent Bilaplace image models without introducing associated issues and computational costs. The new model is based on a special Laplace function blending and a new edge blur formulation. We demonstrate that given some user-defined boundary curves over an input raster image, fitting colors and edge blur from the image to the new model and subsequent editing and animation is equally convenient as with DCIs. Numerous examples and comparisons to DCIs are presented.","lang":"eng"}],"date_updated":"2021-01-12T06:50:34Z"},{"year":"2016","day":"01","issue":"2","acknowledgement":"This work was funded in part by grants from the Spanish Ministry of Economy (TIN2012-35840), the European Research Council (ERC Starting Grant no. 280135 Animetrics), and the EU FP7 (project no. 601165 WEARHAP).","abstract":[{"text":"In this paper, we present a method to model hyperelasticity that is well suited for representing the nonlinearity of real-world objects, as well as for estimating it from deformation examples. Previous approaches suffer several limitations, such as lack of integrability of elastic forces, failure to enforce energy convexity, lack of robustness of parameter estimation, or difficulty to model cross-modal effects. Our method avoids these problems by relying on a general energy-based definition of elastic properties. The accuracy of the resulting elastic model is maximized by defining an additive model of separable energy terms, which allow progressive parameter estimation. In addition, our method supports efficient modeling of extreme nonlinearities thanks to energy-limiting constraints. We combine our energy-based model with an optimization method to estimate model parameters from force-deformation examples, and we show successful modeling of diverse deformable objects, including cloth, human finger skin, and internal human anatomy in a medical imaging application.","lang":"eng"}],"date_updated":"2021-01-12T06:50:35Z","_id":"1414","author":[{"first_name":"Eder","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","last_name":"Miguel Villalba","full_name":"Miguel Villalba, Eder"},{"full_name":"Miraut, David","last_name":"Miraut","first_name":"David"},{"last_name":"Otaduy","first_name":"Miguel","full_name":"Otaduy, Miguel"}],"title":"Modeling and estimation of energy-based hyperelastic objects","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Wiley-Blackwell","month":"05","publication":"Computer Graphics Forum","page":"385 - 396","date_created":"2018-12-11T11:51:53Z","doi":"10.1111/cgf.12840","publication_status":"published","department":[{"_id":"BeBi"}],"date_published":"2016-05-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","type":"journal_article","scopus_import":1,"publist_id":"5792","intvolume":"        35","volume":35,"quality_controlled":"1","citation":{"short":"E. Miguel Villalba, D. Miraut, M. Otaduy, Computer Graphics Forum 35 (2016) 385–396.","ama":"Miguel Villalba E, Miraut D, Otaduy M. Modeling and estimation of energy-based hyperelastic objects. <i>Computer Graphics Forum</i>. 2016;35(2):385-396. doi:<a href=\"https://doi.org/10.1111/cgf.12840\">10.1111/cgf.12840</a>","ieee":"E. Miguel Villalba, D. Miraut, and M. Otaduy, “Modeling and estimation of energy-based hyperelastic objects,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 385–396, 2016.","chicago":"Miguel Villalba, Eder, David Miraut, and Miguel Otaduy. “Modeling and Estimation of Energy-Based Hyperelastic Objects.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12840\">https://doi.org/10.1111/cgf.12840</a>.","apa":"Miguel Villalba, E., Miraut, D., &#38; Otaduy, M. (2016). Modeling and estimation of energy-based hyperelastic objects. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12840\">https://doi.org/10.1111/cgf.12840</a>","mla":"Miguel Villalba, Eder, et al. “Modeling and Estimation of Energy-Based Hyperelastic Objects.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 385–96, doi:<a href=\"https://doi.org/10.1111/cgf.12840\">10.1111/cgf.12840</a>.","ista":"Miguel Villalba E, Miraut D, Otaduy M. 2016. Modeling and estimation of energy-based hyperelastic objects. Computer Graphics Forum. 35(2), 385–396."}},{"citation":{"ieee":"F. Ferstl, R. Ando, C. Wojtan, R. Westermann, and N. Thuerey, “Narrow band FLIP for liquid simulations,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 225–232, 2016.","ama":"Ferstl F, Ando R, Wojtan C, Westermann R, Thuerey N. Narrow band FLIP for liquid simulations. <i>Computer Graphics Forum</i>. 2016;35(2):225-232. doi:<a href=\"https://doi.org/10.1111/cgf.12825\">10.1111/cgf.12825</a>","short":"F. Ferstl, R. Ando, C. Wojtan, R. Westermann, N. Thuerey, Computer Graphics Forum 35 (2016) 225–232.","apa":"Ferstl, F., Ando, R., Wojtan, C., Westermann, R., &#38; Thuerey, N. (2016). Narrow band FLIP for liquid simulations. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12825\">https://doi.org/10.1111/cgf.12825</a>","mla":"Ferstl, Florian, et al. “Narrow Band FLIP for Liquid Simulations.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 225–32, doi:<a href=\"https://doi.org/10.1111/cgf.12825\">10.1111/cgf.12825</a>.","ista":"Ferstl F, Ando R, Wojtan C, Westermann R, Thuerey N. 2016. Narrow band FLIP for liquid simulations. Computer Graphics Forum. 35(2), 225–232.","chicago":"Ferstl, Florian, Ryoichi Ando, Chris Wojtan, Rüdiger Westermann, and Nils Thuerey. “Narrow Band FLIP for Liquid Simulations.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12825\">https://doi.org/10.1111/cgf.12825</a>."},"intvolume":"        35","ddc":["000"],"file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"date_published":"2016-05-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.1111/cgf.12825","publication_status":"published","month":"05","oa":1,"status":"public","_id":"1415","year":"2016","abstract":[{"text":"The Fluid Implicit Particle method (FLIP) for liquid simulations uses particles to reduce numerical dissipation and provide important visual cues for events like complex splashes and small-scale features near the liquid surface. Unfortunately, FLIP simulations can be computationally expensive, because they require a dense sampling of particles to fill the entire liquid volume. Furthermore, the vast majority of these FLIP particles contribute nothing to the fluid's visual appearance, especially for larger volumes of liquid. We present a method that only uses FLIP particles within a narrow band of the liquid surface, while efficiently representing the remaining inner volume on a regular grid. We show that a naïve realization of this idea introduces unstable and uncontrollable energy fluctuations, and we propose a novel coupling scheme between FLIP particles and regular grid which overcomes this problem. Our method drastically reduces the particle count and simulation times while yielding results that are nearly indistinguishable from regular FLIP simulations. Our approach is easy to integrate into any existing FLIP implementation.","lang":"eng"}],"issue":"2","date_updated":"2023-02-21T10:38:38Z","volume":35,"quality_controlled":"1","pubrep_id":"611","publist_id":"5793","department":[{"_id":"ChWo"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Computer Graphics Forum","date_created":"2018-12-11T11:51:53Z","page":"225 - 232","has_accepted_license":"1","title":"Narrow band FLIP for liquid simulations","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley-Blackwell","file":[{"file_size":5938324,"relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:12:22Z","date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2016-611-v1+3_CW_nbflip_postprint_2016.pdf","access_level":"open_access","creator":"system","file_id":"4940","checksum":"984afbe510ed48019025dff1dcc7baad"}],"author":[{"full_name":"Ferstl, Florian","first_name":"Florian","last_name":"Ferstl"},{"full_name":"Ando, Ryoichi","first_name":"Ryoichi","last_name":"Ando"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J"},{"full_name":"Westermann, Rüdiger","last_name":"Westermann","first_name":"Rüdiger"},{"full_name":"Thuerey, Nils","last_name":"Thuerey","first_name":"Nils"}],"day":"01"},{"oa":1,"title":"Interaction-driven Lifshitz transition with dipolar fermions in optical lattices","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"American Physical Society","status":"public","month":"05","year":"2016","day":"15","abstract":[{"text":"Anisotropic dipole-dipole interactions between ultracold dipolar fermions break the symmetry of the Fermi surface and thereby deform it. Here we demonstrate that such a Fermi surface deformation induces a topological phase transition - the so-called Lifshitz transition - in the regime accessible to present-day experiments. We describe the impact of the Lifshitz transition on observable quantities such as the Fermi surface topology, the density-density correlation function, and the excitation spectrum of the system. The Lifshitz transition in ultracold atoms can be controlled by tuning the dipole orientation and, in contrast to the transition studied in crystalline solids, is completely interaction driven.","lang":"eng"}],"issue":"19","date_updated":"2021-01-12T06:50:36Z","_id":"1416","author":[{"full_name":"Van Loon, Erik","first_name":"Erik","last_name":"Van Loon"},{"full_name":"Katsnelson, Mikhail","first_name":"Mikhail","last_name":"Katsnelson"},{"last_name":"Chomaz","first_name":"Lauriane","full_name":"Chomaz, Lauriane"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail"}],"article_number":"195145","publist_id":"5791","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1603.09358"}],"scopus_import":1,"citation":{"mla":"Van Loon, Erik, et al. “Interaction-Driven Lifshitz Transition with Dipolar Fermions in Optical Lattices.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 93, no. 19, 195145, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">10.1103/PhysRevB.93.195145</a>.","apa":"Van Loon, E., Katsnelson, M., Chomaz, L., &#38; Lemeshko, M. (2016). Interaction-driven Lifshitz transition with dipolar fermions in optical lattices. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">https://doi.org/10.1103/PhysRevB.93.195145</a>","ista":"Van Loon E, Katsnelson M, Chomaz L, Lemeshko M. 2016. Interaction-driven Lifshitz transition with dipolar fermions in optical lattices. Physical Review B - Condensed Matter and Materials Physics. 93(19), 195145.","chicago":"Van Loon, Erik, Mikhail Katsnelson, Lauriane Chomaz, and Mikhail Lemeshko. “Interaction-Driven Lifshitz Transition with Dipolar Fermions in Optical Lattices.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">https://doi.org/10.1103/PhysRevB.93.195145</a>.","ama":"Van Loon E, Katsnelson M, Chomaz L, Lemeshko M. Interaction-driven Lifshitz transition with dipolar fermions in optical lattices. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2016;93(19). doi:<a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">10.1103/PhysRevB.93.195145</a>","ieee":"E. Van Loon, M. Katsnelson, L. Chomaz, and M. Lemeshko, “Interaction-driven Lifshitz transition with dipolar fermions in optical lattices,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 93, no. 19. American Physical Society, 2016.","short":"E. Van Loon, M. Katsnelson, L. Chomaz, M. Lemeshko, Physical Review B - Condensed Matter and Materials Physics 93 (2016)."},"quality_controlled":"1","intvolume":"        93","volume":93,"publication":"Physical Review B - Condensed Matter and Materials Physics","date_created":"2018-12-11T11:51:54Z","doi":"10.1103/PhysRevB.93.195145","publication_status":"published","department":[{"_id":"MiLe"}],"date_published":"2016-05-15T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Preprint","type":"journal_article"},{"_id":"1417","year":"2016","date_updated":"2021-01-12T06:50:36Z","abstract":[{"lang":"eng","text":"Plant development mediated by the phytohormone auxin depends on tightly controlled cellular auxin levels at its target tissue that are largely established by intercellular and intracellular auxin transport mediated by PIN auxin transporters. Among the eight members of the Arabidopsis PIN family, PIN6 is the least characterized candidate. In this study we generated functional, fluorescent protein-tagged PIN6 proteins and performed comprehensive analysis of their subcellular localization and also performed a detailed functional characterization of PIN6 and its developmental roles. The localization study of PIN6 revealed a dual localization at the plasma membrane (PM) and endoplasmic reticulum (ER). Transport and metabolic profiling assays in cultured cells and Arabidopsis strongly suggest that PIN6 mediates both auxin transport across the PM and intracellular auxin homeostasis, including the regulation of free auxin and auxin conjugates levels. As evidenced by the loss- and gain-of-function analysis, the complex function of PIN6 in auxin transport and homeostasis is required for auxin distribution during lateral and adventitious root organogenesis and for progression of these developmental processes. These results illustrate a unique position of PIN6 within the family of PIN auxin transporters and further add complexity to the developmentally crucial process of auxin transport."}],"issue":"1","month":"07","oa":1,"status":"public","date_published":"2016-07-01T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","doi":"10.1111/nph.14019","intvolume":"       211","citation":{"apa":"Simon, S., Skůpa, P., Viaene, T., Zwiewka, M., Tejos, R., Klíma, P., … Friml, J. (2016). PIN6 auxin transporter at endoplasmic reticulum and plasma membrane mediates auxin homeostasis and organogenesis in Arabidopsis. <i>New Phytologist</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/nph.14019\">https://doi.org/10.1111/nph.14019</a>","ista":"Simon S, Skůpa P, Viaene T, Zwiewka M, Tejos R, Klíma P, Čarná M, Rolčík J, De Rycke R, Moreno I, Dobrev P, Orellana A, Zažímalová E, Friml J. 2016. PIN6 auxin transporter at endoplasmic reticulum and plasma membrane mediates auxin homeostasis and organogenesis in Arabidopsis. New Phytologist. 211(1), 65–74.","mla":"Simon, Sibu, et al. “PIN6 Auxin Transporter at Endoplasmic Reticulum and Plasma Membrane Mediates Auxin Homeostasis and Organogenesis in Arabidopsis.” <i>New Phytologist</i>, vol. 211, no. 1, Wiley-Blackwell, 2016, pp. 65–74, doi:<a href=\"https://doi.org/10.1111/nph.14019\">10.1111/nph.14019</a>.","chicago":"Simon, Sibu, Petr Skůpa, Tom Viaene, Marta Zwiewka, Ricardo Tejos, Petr Klíma, Mária Čarná, et al. “PIN6 Auxin Transporter at Endoplasmic Reticulum and Plasma Membrane Mediates Auxin Homeostasis and Organogenesis in Arabidopsis.” <i>New Phytologist</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/nph.14019\">https://doi.org/10.1111/nph.14019</a>.","ieee":"S. Simon <i>et al.</i>, “PIN6 auxin transporter at endoplasmic reticulum and plasma membrane mediates auxin homeostasis and organogenesis in Arabidopsis,” <i>New Phytologist</i>, vol. 211, no. 1. Wiley-Blackwell, pp. 65–74, 2016.","ama":"Simon S, Skůpa P, Viaene T, et al. PIN6 auxin transporter at endoplasmic reticulum and plasma membrane mediates auxin homeostasis and organogenesis in Arabidopsis. <i>New Phytologist</i>. 2016;211(1):65-74. doi:<a href=\"https://doi.org/10.1111/nph.14019\">10.1111/nph.14019</a>","short":"S. Simon, P. Skůpa, T. Viaene, M. Zwiewka, R. Tejos, P. Klíma, M. Čarná, J. Rolčík, R. De Rycke, I. Moreno, P. Dobrev, A. Orellana, E. Zažímalová, J. Friml, New Phytologist 211 (2016) 65–74."},"ddc":["581"],"file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"file":[{"file_size":3828383,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5016","checksum":"23522ced3508ffe7a4f247c4230e6493","creator":"system","date_created":"2018-12-12T10:13:32Z","date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2018-1004-v1+1_Simon_NewPhytol_2016_proof.pdf"}],"author":[{"full_name":"Simon, Sibu","first_name":"Sibu","orcid":"0000-0002-1998-6741","last_name":"Simon","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Skůpa, Petr","first_name":"Petr","last_name":"Skůpa"},{"first_name":"Tom","last_name":"Viaene","full_name":"Viaene, Tom"},{"full_name":"Zwiewka, Marta","last_name":"Zwiewka","first_name":"Marta"},{"full_name":"Tejos, Ricardo","first_name":"Ricardo","last_name":"Tejos"},{"first_name":"Petr","last_name":"Klíma","full_name":"Klíma, Petr"},{"first_name":"Mária","last_name":"Čarná","full_name":"Čarná, Mária"},{"full_name":"Rolčík, Jakub","first_name":"Jakub","last_name":"Rolčík"},{"first_name":"Riet","last_name":"De Rycke","full_name":"De Rycke, Riet"},{"first_name":"Ignacio","last_name":"Moreno","full_name":"Moreno, Ignacio"},{"full_name":"Dobrev, Petre","last_name":"Dobrev","first_name":"Petre"},{"full_name":"Orellana, Ariel","first_name":"Ariel","last_name":"Orellana"},{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí"}],"day":"01","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP, project CEITEC (CZ.1.05/1.1.00/02.0068) and the Czech Science Foundation GACR (project no. 13-4063 7S to J.F.)","title":"PIN6 auxin transporter at endoplasmic reticulum and plasma membrane mediates auxin homeostasis and organogenesis in Arabidopsis","publisher":"Wiley-Blackwell","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"type":"journal_article","date_created":"2018-12-11T11:51:54Z","page":"65 - 74","publication":"New Phytologist","has_accepted_license":"1","volume":211,"quality_controlled":"1","publist_id":"5790","pubrep_id":"1004"},{"author":[{"full_name":"Tomski, Andrzej","last_name":"Tomski","first_name":"Andrzej"},{"full_name":"Kaczmarczyk, Jan","orcid":"0000-0002-1629-3675","first_name":"Jan","last_name":"Kaczmarczyk","id":"46C405DE-F248-11E8-B48F-1D18A9856A87"}],"article_number":"175701","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"_id":"1419","issue":"17","abstract":[{"text":"We study the superconducting phase of the Hubbard model using the Gutzwiller variational wave function (GWF) and the recently proposed diagrammatic expansion technique (DE-GWF). The DE-GWF method works on the level of the full GWF and in the thermodynamic limit. Here, we consider a finite-size system to study the accuracy of the results as a function of the system size (which is practically unrestricted). We show that the finite-size scaling used, e.g. in the variational Monte Carlo method can lead to significant, uncontrolled errors. The presented research is the first step towards applying the DE-GWF method in studies of inhomogeneous situations, including systems with impurities, defects, inhomogeneous phases, or disorder.","lang":"eng"}],"date_updated":"2021-01-12T06:50:36Z","year":"2016","day":"29","month":"03","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IOP Publishing Ltd.","status":"public","title":"Gutzwiller wave function for finite systems: Superconductivity in the Hubbard model","oa_version":"None","type":"journal_article","date_published":"2016-03-29T00:00:00Z","department":[{"_id":"MiLe"}],"language":[{"iso":"eng"}],"doi":"10.1088/0953-8984/28/17/175701","publication_status":"published","publication":"Journal of Physics: Condensed Matter","date_created":"2018-12-11T11:51:55Z","volume":28,"citation":{"short":"A. Tomski, J. Kaczmarczyk, Journal of Physics: Condensed Matter 28 (2016).","ama":"Tomski A, Kaczmarczyk J. Gutzwiller wave function for finite systems: Superconductivity in the Hubbard model. <i>Journal of Physics: Condensed Matter</i>. 2016;28(17). doi:<a href=\"https://doi.org/10.1088/0953-8984/28/17/175701\">10.1088/0953-8984/28/17/175701</a>","ieee":"A. Tomski and J. Kaczmarczyk, “Gutzwiller wave function for finite systems: Superconductivity in the Hubbard model,” <i>Journal of Physics: Condensed Matter</i>, vol. 28, no. 17. IOP Publishing Ltd., 2016.","apa":"Tomski, A., &#38; Kaczmarczyk, J. (2016). Gutzwiller wave function for finite systems: Superconductivity in the Hubbard model. <i>Journal of Physics: Condensed Matter</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/0953-8984/28/17/175701\">https://doi.org/10.1088/0953-8984/28/17/175701</a>","mla":"Tomski, Andrzej, and Jan Kaczmarczyk. “Gutzwiller Wave Function for Finite Systems: Superconductivity in the Hubbard Model.” <i>Journal of Physics: Condensed Matter</i>, vol. 28, no. 17, 175701, IOP Publishing Ltd., 2016, doi:<a href=\"https://doi.org/10.1088/0953-8984/28/17/175701\">10.1088/0953-8984/28/17/175701</a>.","ista":"Tomski A, Kaczmarczyk J. 2016. Gutzwiller wave function for finite systems: Superconductivity in the Hubbard model. Journal of Physics: Condensed Matter. 28(17), 175701.","chicago":"Tomski, Andrzej, and Jan Kaczmarczyk. “Gutzwiller Wave Function for Finite Systems: Superconductivity in the Hubbard Model.” <i>Journal of Physics: Condensed Matter</i>. IOP Publishing Ltd., 2016. <a href=\"https://doi.org/10.1088/0953-8984/28/17/175701\">https://doi.org/10.1088/0953-8984/28/17/175701</a>."},"quality_controlled":"1","intvolume":"        28","publist_id":"5788","scopus_import":1},{"day":"06","author":[{"full_name":"Bod'ová, Katarína","first_name":"Katarína","orcid":"0000-0002-7214-0171","last_name":"Bod'ová","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gasper","full_name":"Tkacik, Gasper"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"}],"project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"name":"Information processing and computation in fish groups","grant_number":"RGP0065/2012","_id":"255008E4-B435-11E9-9278-68D0E5697425"}],"title":"A general approximation for the dynamics of quantitative traits","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Genetics Society of America","publication":"Genetics","page":"1523 - 1548","date_created":"2018-12-11T11:51:55Z","department":[{"_id":"GaTk"},{"_id":"NiBa"}],"language":[{"iso":"eng"}],"type":"journal_article","article_processing_charge":"No","publist_id":"5787","volume":202,"quality_controlled":"1","external_id":{"arxiv":["1510.08344"]},"year":"2016","issue":"4","arxiv":1,"abstract":[{"text":"Selection, mutation, and random drift affect the dynamics of allele frequencies and consequently of quantitative traits. While the macroscopic dynamics of quantitative traits can be measured, the underlying allele frequencies are typically unobserved. Can we understand how the macroscopic observables evolve without following these microscopic processes? This problem has been studied previously by analogy with statistical mechanics: the allele frequency distribution at each time point is approximated by the stationary form, which maximizes entropy. We explore the limitations of this method when mutation is small (4Nμ &lt; 1) so that populations are typically close to fixation, and we extend the theory in this regime to account for changes in mutation strength. We consider a single diallelic locus either under directional selection or with overdominance and then generalize to multiple unlinked biallelic loci with unequal effects. We find that the maximum-entropy approximation is remarkably accurate, even when mutation and selection change rapidly. ","lang":"eng"}],"date_updated":"2025-05-28T11:42:47Z","_id":"1420","oa":1,"status":"public","ec_funded":1,"month":"04","doi":"10.1534/genetics.115.184127","publication_status":"published","date_published":"2016-04-06T00:00:00Z","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.08344"}],"scopus_import":"1","citation":{"ama":"Bodova K, Tkačik G, Barton NH. A general approximation for the dynamics of quantitative traits. <i>Genetics</i>. 2016;202(4):1523-1548. doi:<a href=\"https://doi.org/10.1534/genetics.115.184127\">10.1534/genetics.115.184127</a>","ieee":"K. Bodova, G. Tkačik, and N. H. Barton, “A general approximation for the dynamics of quantitative traits,” <i>Genetics</i>, vol. 202, no. 4. Genetics Society of America, pp. 1523–1548, 2016.","short":"K. Bodova, G. Tkačik, N.H. Barton, Genetics 202 (2016) 1523–1548.","chicago":"Bodova, Katarina, Gašper Tkačik, and Nicholas H Barton. “A General Approximation for the Dynamics of Quantitative Traits.” <i>Genetics</i>. Genetics Society of America, 2016. <a href=\"https://doi.org/10.1534/genetics.115.184127\">https://doi.org/10.1534/genetics.115.184127</a>.","apa":"Bodova, K., Tkačik, G., &#38; Barton, N. H. (2016). A general approximation for the dynamics of quantitative traits. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.115.184127\">https://doi.org/10.1534/genetics.115.184127</a>","mla":"Bodova, Katarina, et al. “A General Approximation for the Dynamics of Quantitative Traits.” <i>Genetics</i>, vol. 202, no. 4, Genetics Society of America, 2016, pp. 1523–48, doi:<a href=\"https://doi.org/10.1534/genetics.115.184127\">10.1534/genetics.115.184127</a>.","ista":"Bodova K, Tkačik G, Barton NH. 2016. A general approximation for the dynamics of quantitative traits. Genetics. 202(4), 1523–1548."},"intvolume":"       202"},{"title":"Scalable static hybridization methods for analysis of nonlinear systems","status":"public","publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"month":"04","day":"11","year":"2016","date_updated":"2021-01-12T06:50:37Z","abstract":[{"lang":"eng","text":"Hybridization methods enable the analysis of hybrid automata with complex, nonlinear dynamics through a sound abstraction process. Complex dynamics are converted to simpler ones with added noise, and then analysis is done using a reachability method for the simpler dynamics. Several such recent approaches advocate that only &quot;dynamic&quot; hybridization techniquesi.e., those where the dynamics are abstracted on-The-fly during a reachability computation are effective. In this paper, we demonstrate this is not the case, and create static hybridization methods that are more scalable than earlier approaches. The main insight in our approach is that quick, numeric simulations can be used to guide the process, eliminating the need for an exponential number of hybridization domains. Transitions between domains are generally timetriggered, avoiding accumulated error from geometric intersections. We enhance our static technique by combining time-Triggered transitions with occasional space-Triggered transitions, and demonstrate the benefits of the combined approach in what we call mixed-Triggered hybridization. Finally, error modes are inserted to confirm that the reachable states stay within the hybridized regions. The developed techniques can scale to higher dimensions than previous static approaches, while enabling the parallelization of the main performance bottleneck for many dynamic hybridization approaches: The nonlinear optimization required for sound dynamics abstraction. We implement our method as a model transformation pass in the HYST tool, and perform reachability analysis and evaluation using an unmodified version of SpaceEx on nonlinear models with up to six dimensions."}],"_id":"1421","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"author":[{"full_name":"Bak, Stanley","first_name":"Stanley","last_name":"Bak"},{"last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Taylor","last_name":"Johnson","full_name":"Johnson, Taylor"},{"first_name":"Pradyot","last_name":"Prakash","full_name":"Prakash, Pradyot"}],"publist_id":"5786","scopus_import":1,"quality_controlled":"1","citation":{"ama":"Bak S, Bogomolov S, Henzinger TA, Johnson T, Prakash P. Scalable static hybridization methods for analysis of nonlinear systems. In: Springer; 2016:155-164. doi:<a href=\"https://doi.org/10.1145/2883817.2883837\">10.1145/2883817.2883837</a>","ieee":"S. Bak, S. Bogomolov, T. A. Henzinger, T. Johnson, and P. Prakash, “Scalable static hybridization methods for analysis of nonlinear systems,” presented at the HSCC 2016: International Conference on Hybrid Systems: Computation and Control, Vienna, Austria, 2016, pp. 155–164.","short":"S. Bak, S. Bogomolov, T.A. Henzinger, T. Johnson, P. Prakash, in:, Springer, 2016, pp. 155–164.","chicago":"Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, Taylor Johnson, and Pradyot Prakash. “Scalable Static Hybridization Methods for Analysis of Nonlinear Systems,” 155–64. Springer, 2016. <a href=\"https://doi.org/10.1145/2883817.2883837\">https://doi.org/10.1145/2883817.2883837</a>.","mla":"Bak, Stanley, et al. <i>Scalable Static Hybridization Methods for Analysis of Nonlinear Systems</i>. Springer, 2016, pp. 155–64, doi:<a href=\"https://doi.org/10.1145/2883817.2883837\">10.1145/2883817.2883837</a>.","apa":"Bak, S., Bogomolov, S., Henzinger, T. A., Johnson, T., &#38; Prakash, P. (2016). Scalable static hybridization methods for analysis of nonlinear systems (pp. 155–164). Presented at the HSCC 2016: International Conference on Hybrid Systems: Computation and Control, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1145/2883817.2883837\">https://doi.org/10.1145/2883817.2883837</a>","ista":"Bak S, Bogomolov S, Henzinger TA, Johnson T, Prakash P. 2016. Scalable static hybridization methods for analysis of nonlinear systems. HSCC 2016: International Conference on Hybrid Systems: Computation and Control, 155–164."},"page":"155 - 164","date_created":"2018-12-11T11:51:55Z","publication_status":"published","conference":{"end_date":"2016-04-14","location":"Vienna, Austria","start_date":"2016-04-12","name":"HSCC 2016: International Conference on Hybrid Systems: Computation and Control"},"doi":"10.1145/2883817.2883837","language":[{"iso":"eng"}],"date_published":"2016-04-11T00:00:00Z","department":[{"_id":"ToHe"}],"type":"conference","oa_version":"None"},{"has_accepted_license":"1","publication":"Letters in Mathematical Physics","date_created":"2018-12-11T11:51:56Z","page":"913 - 923","type":"journal_article","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"pubrep_id":"591","article_processing_charge":"Yes (via OA deal)","publist_id":"5785","volume":106,"quality_controlled":"1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","author":[{"full_name":"Frank, Rupert","first_name":"Rupert","last_name":"Frank"},{"last_name":"Hainzl","first_name":"Christian","full_name":"Hainzl, Christian"},{"full_name":"Schlein, Benjamin","first_name":"Benjamin","last_name":"Schlein"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"project":[{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"file":[{"file_size":458968,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5181","creator":"system","checksum":"fb404923d8ca9a1faeb949561f26cbea","date_created":"2018-12-12T10:15:57Z","file_name":"IST-2016-591-v1+1_s11005-016-0847-5.pdf","date_updated":"2020-07-14T12:44:53Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","title":"Incompatibility of time-dependent Bogoliubov–de-Gennes and Ginzburg–Landau equations","doi":"10.1007/s11005-016-0847-5","publication_status":"published","oa_version":"Published Version","date_published":"2016-07-01T00:00:00Z","file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"ddc":["510","530"],"citation":{"ama":"Frank R, Hainzl C, Schlein B, Seiringer R. Incompatibility of time-dependent Bogoliubov–de-Gennes and Ginzburg–Landau equations. <i>Letters in Mathematical Physics</i>. 2016;106(7):913-923. doi:<a href=\"https://doi.org/10.1007/s11005-016-0847-5\">10.1007/s11005-016-0847-5</a>","ieee":"R. Frank, C. Hainzl, B. Schlein, and R. Seiringer, “Incompatibility of time-dependent Bogoliubov–de-Gennes and Ginzburg–Landau equations,” <i>Letters in Mathematical Physics</i>, vol. 106, no. 7. Springer, pp. 913–923, 2016.","short":"R. Frank, C. Hainzl, B. Schlein, R. Seiringer, Letters in Mathematical Physics 106 (2016) 913–923.","chicago":"Frank, Rupert, Christian Hainzl, Benjamin Schlein, and Robert Seiringer. “Incompatibility of Time-Dependent Bogoliubov–de-Gennes and Ginzburg–Landau Equations.” <i>Letters in Mathematical Physics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11005-016-0847-5\">https://doi.org/10.1007/s11005-016-0847-5</a>.","apa":"Frank, R., Hainzl, C., Schlein, B., &#38; Seiringer, R. (2016). Incompatibility of time-dependent Bogoliubov–de-Gennes and Ginzburg–Landau equations. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-016-0847-5\">https://doi.org/10.1007/s11005-016-0847-5</a>","mla":"Frank, Rupert, et al. “Incompatibility of Time-Dependent Bogoliubov–de-Gennes and Ginzburg–Landau Equations.” <i>Letters in Mathematical Physics</i>, vol. 106, no. 7, Springer, 2016, pp. 913–23, doi:<a href=\"https://doi.org/10.1007/s11005-016-0847-5\">10.1007/s11005-016-0847-5</a>.","ista":"Frank R, Hainzl C, Schlein B, Seiringer R. 2016. Incompatibility of time-dependent Bogoliubov–de-Gennes and Ginzburg–Landau equations. Letters in Mathematical Physics. 106(7), 913–923."},"intvolume":"       106","abstract":[{"lang":"eng","text":"We study the time-dependent Bogoliubov–de-Gennes equations for generic translation-invariant fermionic many-body systems. For initial states that are close to thermal equilibrium states at temperatures near the critical temperature, we show that the magnitude of the order parameter stays approximately constant in time and, in particular, does not follow a time-dependent Ginzburg–Landau equation, which is often employed as a phenomenological description and predicts a decay of the order parameter in time. The full non-linear structure of the equations is necessary to understand this behavior."}],"issue":"7","date_updated":"2021-01-12T06:50:38Z","year":"2016","_id":"1422","status":"public","oa":1,"month":"07"}]