[{"page":"51.1 - 51.12","intvolume":" 51","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH","month":"06","alternative_title":["LIPIcs"],"day":"01","publication_status":"published","status":"public","abstract":[{"text":"Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into double-struck Rd without higher-multiplicity intersections. We focus on conditions for the existence of almost r-embeddings, i.e., maps f : K → double-struck Rd such that f(σ1) ∩ ⋯ ∩ f(σr) = ∅ whenever σ1, ..., σr are pairwise disjoint simplices of K. Generalizing the classical Haefliger-Weber embeddability criterion, we show that a well-known necessary deleted product condition for the existence of almost r-embeddings is sufficient in a suitable r-metastable range of dimensions: If rd ≥ (r + 1) dim K + 3, then there exists an almost r-embedding K → double-struck Rd if and only if there exists an equivariant map (K)Δ r → Sr Sd(r-1)-1, where (K)Δ r is the deleted r-fold product of K, the target Sd(r-1)-1 is the sphere of dimension d(r - 1) - 1, and Sr is the symmetric group. This significantly extends one of the main results of our previous paper (which treated the special case where d = rk and dim K = (r - 1)k for some k ≥ 3), and settles an open question raised there.","lang":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2016.51","publist_id":"5830","ddc":["510"],"date_created":"2018-12-11T11:51:41Z","volume":51,"year":"2016","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"location":"Medford, MA, USA","start_date":"2016-06-14","end_date":"2016-06-17","name":"SoCG: Symposium on Computational Geometry"},"quality_controlled":"1","project":[{"grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"date_published":"2016-06-01T00:00:00Z","title":"Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range","type":"conference","pubrep_id":"621","has_accepted_license":"1","citation":{"short":"I. Mabillard, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016, p. 51.1-51.12.","ama":"Mabillard I, Wagner U. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. In: Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH; 2016:51.1-51.12. doi:10.4230/LIPIcs.SoCG.2016.51","chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range,” 51:51.1-51.12. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016. https://doi.org/10.4230/LIPIcs.SoCG.2016.51.","ieee":"I. Mabillard and U. Wagner, “Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 51.1-51.12.","ista":"Mabillard I, Wagner U. 2016. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 51.1-51.12.","apa":"Mabillard, I., & Wagner, U. (2016). Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2016.51","mla":"Mabillard, Isaac, and Uli Wagner. Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. Vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016, p. 51.1-51.12, doi:10.4230/LIPIcs.SoCG.2016.51."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","full_name":"Mabillard, Isaac","last_name":"Mabillard"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"oa_version":"Published Version","date_updated":"2021-01-12T06:50:17Z","file":[{"creator":"system","relation":"main_file","checksum":"92c0c3735fe908f8ded6e484005cb3b1","date_created":"2018-12-12T10:10:06Z","file_id":"4791","access_level":"open_access","file_size":622969,"content_type":"application/pdf","date_updated":"2020-07-14T12:44:47Z","file_name":"IST-2016-621-v1+1_LIPIcs-SoCG-2016-51.pdf"}],"department":[{"_id":"UlWa"}],"_id":"1381","file_date_updated":"2020-07-14T12:44:47Z","scopus_import":1},{"date_published":"2016-06-01T00:00:00Z","title":"Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae","quality_controlled":"1","publisher":"Oxford University Press","year":"2016","volume":117,"language":[{"iso":"eng"}],"publication":"Annals of Botany","intvolume":" 117","date_created":"2018-12-11T11:51:42Z","page":"1133 - 1140","issue":"7","scopus_import":1,"doi":"10.1093/aob/mcw043","publist_id":"5828","abstract":[{"lang":"eng","text":"Background and aims Angiosperms display remarkable diversity in flower colour, implying that transitions between pigmentation phenotypes must have been common. Despite progress in understanding transitions between anthocyanin (blue, purple, pink or red) and unpigmented (white) flowers, little is known about the evolutionary patterns of flower-colour transitions in lineages with both yellow and anthocyanin-pigmented flowers. This study investigates the relative rates of evolutionary transitions between different combinations of yellow- and anthocyanin-pigmentation phenotypes in the tribe Antirrhineae. Methods We surveyed taxonomic literature for data on anthocyanin and yellow floral pigmentation for 369 species across the tribe. We then reconstructed the phylogeny of 169 taxa and used phylogenetic comparative methods to estimate transition rates among pigmentation phenotypes across the phylogeny. Key Results In contrast to previous studies we found a bias towards transitions involving a gain in pigmentation, although transitions to phenotypes with both anthocyanin and yellow taxa are nevertheless extremely rare. Despite the dominance of yellow and anthocyanin-pigmented taxa, transitions between these phenotypes are constrained to move through a white intermediate stage, whereas transitions to double-pigmentation are very rare. The most abundant transitions are between anthocyanin-pigmented and unpigmented flowers, and similarly the most abundant polymorphic taxa were those with anthocyanin-pigmented and unpigmented flowers. Conclusions Our findings show that pigment evolution is limited by the presence of other floral pigments. This interaction between anthocyanin and yellow pigments constrains the breadth of potential floral diversity observed in nature. In particular, they suggest that selection has repeatedly acted to promote the spread of single-pigmented phenotypes across the Antirrhineae phylogeny. Furthermore, the correlation between transition rates and polymorphism suggests that the forces causing and maintaining variance in the short term reflect evolutionary processes on longer time scales."}],"_id":"1382","status":"public","department":[{"_id":"NiBa"}],"oa_version":"None","acknowledgement":"We thank Melinda Pickup, Spencer Barrett, Nick Barton and four anonymous reviewers for helpful discussions on previous versions of this manuscript. We also thank Jana Porsche for her efforts in tracking down the more obscure references.","publication_status":"published","date_updated":"2024-02-21T13:49:53Z","author":[{"orcid":"0000-0002-8511-0254","full_name":"Ellis, Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ellis"},{"last_name":"Field","full_name":"Field, David","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. Ellis and D. Field, “Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae,” Annals of Botany, vol. 117, no. 7. Oxford University Press, pp. 1133–1140, 2016.","short":"T. Ellis, D. Field, Annals of Botany 117 (2016) 1133–1140.","ama":"Ellis T, Field D. Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. Annals of Botany. 2016;117(7):1133-1140. doi:10.1093/aob/mcw043","chicago":"Ellis, Thomas, and David Field. “Repeated Gains in Yellow and Anthocyanin Pigmentation in Flower Colour Transitions in the Antirrhineae.” Annals of Botany. Oxford University Press, 2016. https://doi.org/10.1093/aob/mcw043.","ista":"Ellis T, Field D. 2016. Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. Annals of Botany. 117(7), 1133–1140.","mla":"Ellis, Thomas, and David Field. “Repeated Gains in Yellow and Anthocyanin Pigmentation in Flower Colour Transitions in the Antirrhineae.” Annals of Botany, vol. 117, no. 7, Oxford University Press, 2016, pp. 1133–40, doi:10.1093/aob/mcw043.","apa":"Ellis, T., & Field, D. (2016). Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. Annals of Botany. Oxford University Press. https://doi.org/10.1093/aob/mcw043"},"day":"1","related_material":{"record":[{"relation":"popular_science","id":"5550","status":"public"}]},"month":"06","type":"journal_article"},{"department":[{"_id":"KrCh"}],"oa_version":"Preprint","date_updated":"2024-03-25T23:30:18Z","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. Termination Analysis of Probabilistic Programs through Positivstellensatz’s. Vol. 9779, Springer, 2016, pp. 3–22, doi:10.1007/978-3-319-41528-4_1.","apa":"Chatterjee, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1","ista":"Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779, 3–22.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer, 2016. https://doi.org/10.1007/978-3-319-41528-4_1.","ama":"Chatterjee K, Fu H, Goharshady AK. Termination analysis of probabilistic programs through Positivstellensatz’s. In: Vol 9779. Springer; 2016:3-22. doi:10.1007/978-3-319-41528-4_1","short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22.","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22."},"type":"conference","scopus_import":1,"_id":"1386","main_file_link":[{"url":"http://arxiv.org/abs/1604.07169","open_access":"1"}],"year":"2016","volume":9779,"date_created":"2018-12-11T11:51:43Z","date_published":"2016-07-01T00:00:00Z","title":"Termination analysis of probabilistic programs through Positivstellensatz's","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","conference":{"name":"CAV: Computer Aided Verification","start_date":"2016-07-17","location":"Toronto, Canada","end_date":"2016-07-23"},"publication_status":"published","ec_funded":1,"day":"01","alternative_title":["LNCS"],"related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"month":"07","abstract":[{"lang":"eng","text":"We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and on the other hand is a counterpart of polynomial ranking-functions for proving termination of nonprobabilistic programs. The approach synthesizes polynomial ranking-supermartingales through Positivstellensatz's, yielding an efficient method which is not only sound, but also semi-complete over a large subclass of programs. We show experimental results to demonstrate that our approach can handle several classical programs with complex polynomial guards and assignments, and can synthesize efficient quadratic ranking-supermartingales when a linear one does not exist even for simple affine programs."}],"publist_id":"5824","doi":"10.1007/978-3-319-41528-4_1","status":"public","language":[{"iso":"eng"}],"intvolume":" 9779","page":"3 - 22","publisher":"Springer"},{"type":"conference","month":"07","date_updated":"2021-01-12T06:50:20Z","oa_version":"Preprint","publication_status":"published","department":[{"_id":"KrCh"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"05","citation":{"chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” In LICS ’16, 515–24. IEEE, 2016. https://doi.org/10.1145/2933575.2934548.","ama":"Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: LICS ’16. IEEE; 2016:515-524. doi:10.1145/2933575.2934548","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in LICS ’16, New York, NY, USA, 2016, pp. 515–524.","mla":"Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” LICS ’16, IEEE, 2016, pp. 515–24, doi:10.1145/2933575.2934548.","apa":"Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In LICS ’16 (pp. 515–524). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934548","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524."},"oa":1,"author":[{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Chonev, Ventsislav K","first_name":"Ventsislav K","last_name":"Chonev"},{"last_name":"Ouaknine","first_name":"Joël","full_name":"Ouaknine, Joël"},{"first_name":"James","full_name":"Worrell, James","last_name":"Worrell"}],"ec_funded":1,"status":"public","_id":"1389","doi":"10.1145/2933575.2934548","abstract":[{"text":"The continuous evolution of a wide variety of systems, including continous-time Markov chains and linear hybrid automata, can be\r\ndescribed in terms of linear differential equations. In this paper we study the decision problem of whether the solution x(t) of a system of linear differential equations dx/dt = Ax reaches a target halfspace infinitely often. This recurrent reachability problem can\r\nequivalently be formulated as the following Infinite Zeros Problem: does a real-valued function f:R≥0 --> R satisfying a given linear\r\ndifferential equation have infinitely many zeros? Our main decidability result is that if the differential equation has order at most 7, then the Infinite Zeros Problem is decidable. On the other hand, we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision.","lang":"eng"}],"publist_id":"5820","scopus_import":1,"date_created":"2018-12-11T11:51:44Z","page":"515 - 524","year":"2016","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.03632"}],"publication":"LICS '16","language":[{"iso":"eng"}],"conference":{"end_date":"2018-07-08","location":"New York, NY, USA","start_date":"2018-07-05","name":"LICS: Logic in Computer Science"},"publisher":"IEEE","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"title":"On recurrent reachability for continuous linear dynamical systems","date_published":"2016-07-05T00:00:00Z","quality_controlled":"1"},{"status":"public","_id":"1390","publist_id":"5819","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"}],"doi":"10.1007/978-3-319-41540-6_21","scopus_import":1,"type":"conference","month":"07","alternative_title":["LNCS"],"day":"13","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"D’Antoni, L., Samanta, R., & Singh, R. (2016). QLOSE: Program repair with quantitative objectives (Vol. 9780, pp. 383–401). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41540-6_21","mla":"D’Antoni, Loris, et al. QLOSE: Program Repair with Quantitative Objectives. Vol. 9780, Springer, 2016, pp. 383–401, doi:10.1007/978-3-319-41540-6_21.","ista":"D’Antoni L, Samanta R, Singh R. 2016. QLOSE: Program repair with quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 9780, 383–401.","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. https://doi.org/10.1007/978-3-319-41540-6_21.","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:10.1007/978-3-319-41540-6_21"},"ec_funded":1,"author":[{"last_name":"D'Antoni","first_name":"Loris","full_name":"D'Antoni, Loris"},{"first_name":"Roopsha","full_name":"Samanta, Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","last_name":"Samanta"},{"first_name":"Rishabh","full_name":"Singh, Rishabh","last_name":"Singh"}],"oa_version":"None","publication_status":"published","date_updated":"2021-01-12T06:50:21Z","department":[{"_id":"ToHe"}],"publisher":"Springer","conference":{"end_date":"2016-07-23","location":"Toronto, Canada","start_date":"2016-07-17","name":"CAV: Computer Aided Verification"},"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"QLOSE: Program repair with quantitative objectives","date_published":"2016-07-13T00:00:00Z","page":"383 - 401","intvolume":" 9780","date_created":"2018-12-11T11:51:45Z","volume":9780,"language":[{"iso":"eng"}],"year":"2016"},{"year":"2016","main_file_link":[{"url":"http://arxiv.org/abs/1603.06850","open_access":"1"}],"volume":9780,"date_created":"2018-12-11T11:51:45Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"Array folds logic","date_published":"2016-07-13T00:00:00Z","quality_controlled":"1","conference":{"location":"Toronto, Canada","start_date":"2016-07-17","end_date":"2016-07-23","name":"CAV: Computer Aided Verification"},"oa_version":"Preprint","date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"ToHe"}],"citation":{"ama":"Daca P, Henzinger TA, Kupriyanov A. Array folds logic. In: Vol 9780. Springer; 2016:230-248. doi:10.1007/978-3-319-41540-6_13","short":"P. Daca, T.A. Henzinger, A. Kupriyanov, in:, Springer, 2016, pp. 230–248.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, and Andrey Kupriyanov. “Array Folds Logic,” 9780:230–48. Springer, 2016. https://doi.org/10.1007/978-3-319-41540-6_13.","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.","ista":"Daca P, Henzinger TA, Kupriyanov A. 2016. Array folds logic. CAV: Computer Aided Verification, LNCS, vol. 9780, 230–248.","apa":"Daca, P., Henzinger, T. A., & Kupriyanov, A. (2016). Array folds logic (Vol. 9780, pp. 230–248). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41540-6_13","mla":"Daca, Przemyslaw, et al. Array Folds Logic. Vol. 9780, Springer, 2016, pp. 230–48, doi:10.1007/978-3-319-41540-6_13."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Kupriyanov","id":"2C311BF8-F248-11E8-B48F-1D18A9856A87","first_name":"Andrey","full_name":"Kupriyanov, Andrey"}],"oa":1,"type":"conference","scopus_import":1,"_id":"1391","language":[{"iso":"eng"}],"intvolume":" 9780","page":"230 - 248","publisher":"Springer","publication_status":"published","day":"13","ec_funded":1,"alternative_title":["LNCS"],"month":"07","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1155"}]},"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 "the first array cell contains the array length," and "the array contains equally many minimal and maximal elements." 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"}],"doi":"10.1007/978-3-319-41540-6_13","publist_id":"5818","status":"public"},{"doi":"10.1088/1478-3975/13/3/036005","publist_id":"5815","abstract":[{"lang":"eng","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."}],"issue":"3","status":"public","day":"27","ec_funded":1,"publication_status":"published","acknowledgement":"The research leading to these results has received funding from the from the Marie\r\nCurie Action ITN NETADIS, grant agreement no. 290038.","month":"05","publisher":"IOP Publishing Ltd.","language":[{"iso":"eng"}],"article_number":"036005","intvolume":" 13","scopus_import":1,"_id":"1394","citation":{"mla":"De Martino, Daniele, et al. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” Physical Biology, vol. 13, no. 3, 036005, IOP Publishing Ltd., 2016, doi:10.1088/1478-3975/13/3/036005.","apa":"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. IOP Publishing Ltd. https://doi.org/10.1088/1478-3975/13/3/036005","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.","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.” Physical Biology. IOP Publishing Ltd., 2016. https://doi.org/10.1088/1478-3975/13/3/036005.","short":"D. De Martino, F. Capuani, A. De Martino, Physical Biology 13 (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. Physical Biology. 2016;13(3). doi:10.1088/1478-3975/13/3/036005","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,” Physical Biology, vol. 13, no. 3. IOP Publishing Ltd., 2016."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5214-4706","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","full_name":"De Martino, Daniele","first_name":"Daniele","last_name":"De Martino"},{"first_name":"Fabrizio","full_name":"Capuani, Fabrizio","last_name":"Capuani"},{"full_name":"De Martino, Andrea","first_name":"Andrea","last_name":"De Martino"}],"oa":1,"oa_version":"Preprint","date_updated":"2021-01-12T06:50:23Z","department":[{"_id":"GaTk"}],"type":"journal_article","quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"date_published":"2016-05-27T00:00:00Z","title":"Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli","publication":"Physical Biology","volume":13,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1601.03243"}],"year":"2016","date_created":"2018-12-11T11:51:46Z"},{"supervisor":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"page":"83","abstract":[{"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.","lang":"eng"}],"publist_id":"5811","status":"public","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","day":"01","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"status":"public","id":"1432","relation":"part_of_dissertation"}]},"month":"03","date_published":"2016-03-01T00:00:00Z","title":"Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus","year":"2016","article_processing_charge":"No","ddc":["570"],"date_created":"2018-12-11T11:51:46Z","file_date_updated":"2021-02-22T11:48:44Z","_id":"1396","date_updated":"2023-09-07T11:55:26Z","oa_version":"Published Version","department":[{"_id":"PeJo"}],"file":[{"file_size":2407572,"date_updated":"2020-07-14T12:44:48Z","content_type":"application/pdf","file_name":"Thesis_Mishra_Rajiv (Final).pdf","date_created":"2019-08-09T12:14:46Z","file_id":"6782","access_level":"closed","creator":"dernst","relation":"main_file","checksum":"5a010a838faf040f7064f3cfb802f743"},{"success":1,"date_created":"2021-02-22T11:48:44Z","file_id":"9183","access_level":"open_access","file_size":2407572,"date_updated":"2021-02-22T11:48:44Z","content_type":"application/pdf","file_name":"2016_RajivMishra_Thesis.pdf","creator":"dernst","relation":"main_file","checksum":"81b26d9ede92c99f1d8cc6fa1d04cbbb"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"ieee":"R. K. Mishra, “Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus,” Institute of Science and Technology Austria, 2016.","chicago":"Mishra, Rajiv Kumar. “Synaptic Plasticity Rules at CA3-CA3 Recurrent Synapses in Hippocampus.” Institute of Science and Technology Austria, 2016.","short":"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.","apa":"Mishra, R. K. (2016). Synaptic plasticity rules at CA3-CA3 recurrent synapses in hippocampus. Institute of Science and Technology Austria.","mla":"Mishra, Rajiv Kumar. Synaptic Plasticity Rules at CA3-CA3 Recurrent Synapses in Hippocampus. 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."},"author":[{"first_name":"Rajiv Kumar","full_name":"Mishra, Rajiv Kumar","id":"46CB58F2-F248-11E8-B48F-1D18A9856A87","last_name":"Mishra"}],"oa":1,"type":"dissertation"},{"publication_status":"published","oa_version":"None","date_updated":"2023-09-07T11:54:58Z","department":[{"_id":"KrCh"}],"day":"01","citation":{"ista":"Chmelik M. 2016. Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.","mla":"Chmelik, Martin. Algorithms for Partially Observable Markov Decision Processes. Institute of Science and Technology Austria, 2016.","apa":"Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.","short":"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.","chicago":"Chmelik, Martin. “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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","month":"02","publist_id":"5810","abstract":[{"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.","lang":"eng"}],"degree_awarded":"PhD","status":"public","_id":"1397","publication_identifier":{"issn":["2663-337X"]},"year":"2016","article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:51:47Z","page":"232","title":"Algorithms for partially observable markov decision processes","date_published":"2016-02-01T00:00:00Z","supervisor":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"publisher":"Institute of Science and Technology Austria"},{"date_created":"2018-12-11T11:51:47Z","ddc":["576"],"year":"2016","article_processing_charge":"No","title":"The role of pollinator-mediated selection in the maintenance of a flower color polymorphism in an Antirrhinum majus hybrid zone","date_published":"2016-02-18T00:00:00Z","pubrep_id":"526","type":"dissertation","department":[{"_id":"NiBa"}],"file":[{"access_level":"open_access","file_id":"5106","date_created":"2018-12-12T10:14:51Z","file_name":"IST-2016-526-v1+1_Ellis_signed_thesis.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:48Z","file_size":11928241,"checksum":"a89b17ff27cf92c9a15f6b3d46bd7e53","relation":"main_file","creator":"system"}],"date_updated":"2024-02-21T13:51:39Z","oa_version":"Published Version","author":[{"orcid":"0000-0002-8511-0254","first_name":"Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","full_name":"Ellis, Thomas","last_name":"Ellis"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"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, doi:10.15479/AT:ISTA:TH_526 .","apa":"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. https://doi.org/10.15479/AT:ISTA:TH_526 ","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.","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.","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. https://doi.org/10.15479/AT:ISTA:TH_526 .","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:10.15479/AT:ISTA:TH_526 "},"has_accepted_license":"1","_id":"1398","file_date_updated":"2020-07-14T12:44:48Z","page":"130","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["ISTA Thesis"],"month":"02","related_material":{"record":[{"status":"public","relation":"popular_science","id":"5553"},{"status":"public","relation":"popular_science","id":"5551"},{"status":"public","id":"5552","relation":"popular_science"}]},"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. ","publication_status":"published","day":"18","status":"public","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:TH_526 ","abstract":[{"lang":"eng","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."}],"publist_id":"5809"},{"publisher":"American Physical Society","article_type":"original","intvolume":" 117","article_number":"093001","arxiv":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"status":"public","pmid":1,"abstract":[{"lang":"eng","text":"We report measurements of energy-dependent attosecond photoionization delays between the two outer-most valence shells of N2O and H2O. The combination of single-shot signal referencing with the use of different metal foils to filter the attosecond pulse train enables us to extract delays from congested spectra. Remarkably large delays up to 160 as are observed in N2O, whereas the delays in H2O are all smaller than 50 as in the photon-energy range of 20-40 eV. These results are interpreted by developing a theory of molecular photoionization delays. The long delays measured in N2O are shown to reflect the population of molecular shape resonances that trap the photoelectron for a duration of up to ∼110 as. The unstructured continua of H2O result in much smaller delays at the same photon energies. Our experimental and theoretical methods make the study of molecular attosecond photoionization dynamics accessible."}],"doi":"10.1103/physrevlett.117.093001","issue":"9","month":"08","extern":"1","day":"26","publication_status":"published","quality_controlled":"1","title":"Attosecond delays in molecular photoionization","keyword":["General Physics and Astronomy"],"date_published":"2016-08-26T00:00:00Z","date_created":"2023-08-10T06:37:07Z","volume":117,"article_processing_charge":"No","publication":"Physical Review Letters","year":"2016","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.07435"}],"_id":"14010","scopus_import":"1","external_id":{"arxiv":["1607.07435"],"pmid":["27610849"]},"type":"journal_article","oa":1,"author":[{"first_name":"Martin","full_name":"Huppert, Martin","last_name":"Huppert"},{"last_name":"Jordan","full_name":"Jordan, Inga","first_name":"Inga"},{"last_name":"Baykusheva","full_name":"Baykusheva, Denitsa Rangelova","first_name":"Denitsa Rangelova","id":"71b4d059-2a03-11ee-914d-dfa3beed6530"},{"last_name":"von Conta","full_name":"von Conta, Aaron","first_name":"Aaron"},{"last_name":"Wörner","full_name":"Wörner, Hans Jakob","first_name":"Hans Jakob"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. Huppert, I. Jordan, D. R. Baykusheva, A. von Conta, and H. J. Wörner, “Attosecond delays in molecular photoionization,” Physical Review Letters, vol. 117, no. 9. American Physical Society, 2016.","ama":"Huppert M, Jordan I, Baykusheva DR, von Conta A, Wörner HJ. Attosecond delays in molecular photoionization. Physical Review Letters. 2016;117(9). doi:10.1103/physrevlett.117.093001","short":"M. Huppert, I. Jordan, D.R. Baykusheva, A. von Conta, H.J. Wörner, Physical Review Letters 117 (2016).","chicago":"Huppert, Martin, Inga Jordan, Denitsa Rangelova Baykusheva, Aaron von Conta, and Hans Jakob Wörner. “Attosecond Delays in Molecular Photoionization.” Physical Review Letters. American Physical Society, 2016. https://doi.org/10.1103/physrevlett.117.093001.","ista":"Huppert M, Jordan I, Baykusheva DR, von Conta A, Wörner HJ. 2016. Attosecond delays in molecular photoionization. Physical Review Letters. 117(9), 093001.","mla":"Huppert, Martin, et al. “Attosecond Delays in Molecular Photoionization.” Physical Review Letters, vol. 117, no. 9, 093001, American Physical Society, 2016, doi:10.1103/physrevlett.117.093001.","apa":"Huppert, M., Jordan, I., Baykusheva, D. R., von Conta, A., & Wörner, H. J. (2016). Attosecond delays in molecular photoionization. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.117.093001"},"oa_version":"Preprint","date_updated":"2023-08-22T08:42:50Z"},{"publisher":"American Physical Society","language":[{"iso":"eng"}],"intvolume":" 116","article_number":"123001","article_type":"original","issue":"12","abstract":[{"lang":"eng","text":"We introduce bicircular high-harmonic spectroscopy as a new method to probe dynamical symmetries of atoms and molecules and their evolution in time. Our approach is based on combining a circularly polarized femtosecond fundamental field of frequency ω with its counterrotating second harmonic 2ω. We demonstrate the ability of bicircular high-harmonic spectroscopy to characterize the orbital angular momentum symmetry of atomic orbitals. We further show that breaking the threefold rotational symmetry of the generating medium-at the level of either the ensemble or that of a single molecule-results in the emission of the otherwise parity-forbidden frequencies 3qω (q∈N), which provide a background-free probe of dynamical molecular symmetries."}],"doi":"10.1103/physrevlett.116.123001","status":"public","pmid":1,"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"publication_status":"published","extern":"1","day":"25","month":"03","title":"Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules","keyword":["General Physics and Astronomy"],"date_published":"2016-03-25T00:00:00Z","quality_controlled":"1","year":"2016","volume":116,"article_processing_charge":"No","publication":"Physical Review Letters","date_created":"2023-08-10T06:37:16Z","external_id":{"pmid":["27058077"]},"scopus_import":"1","_id":"14011","oa_version":"None","date_updated":"2023-08-22T08:44:10Z","author":[{"id":"71b4d059-2a03-11ee-914d-dfa3beed6530","first_name":"Denitsa Rangelova","full_name":"Baykusheva, Denitsa Rangelova","last_name":"Baykusheva"},{"last_name":"Ahsan","full_name":"Ahsan, Md Sabbir","first_name":"Md Sabbir"},{"first_name":"Nan","full_name":"Lin, Nan","last_name":"Lin"},{"last_name":"Wörner","first_name":"Hans Jakob","full_name":"Wörner, Hans Jakob"}],"citation":{"short":"D.R. Baykusheva, M.S. Ahsan, N. Lin, H.J. Wörner, Physical Review Letters 116 (2016).","ama":"Baykusheva DR, Ahsan MS, Lin N, Wörner HJ. Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules. Physical Review Letters. 2016;116(12). doi:10.1103/physrevlett.116.123001","chicago":"Baykusheva, Denitsa Rangelova, Md Sabbir Ahsan, Nan Lin, and Hans Jakob Wörner. “Bicircular High-Harmonic Spectroscopy Reveals Dynamical Symmetries of Atoms and Molecules.” Physical Review Letters. American Physical Society, 2016. https://doi.org/10.1103/physrevlett.116.123001.","ieee":"D. R. Baykusheva, M. S. Ahsan, N. Lin, and H. J. Wörner, “Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules,” Physical Review Letters, vol. 116, no. 12. American Physical Society, 2016.","ista":"Baykusheva DR, Ahsan MS, Lin N, Wörner HJ. 2016. Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules. Physical Review Letters. 116(12), 123001.","apa":"Baykusheva, D. R., Ahsan, M. S., Lin, N., & Wörner, H. J. (2016). Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.116.123001","mla":"Baykusheva, Denitsa Rangelova, et al. “Bicircular High-Harmonic Spectroscopy Reveals Dynamical Symmetries of Atoms and Molecules.” Physical Review Letters, vol. 116, no. 12, 123001, American Physical Society, 2016, doi:10.1103/physrevlett.116.123001."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article"},{"publisher":"Springer Nature","language":[{"iso":"eng"}],"page":"e16170-e16170","article_type":"original","intvolume":" 5","doi":"10.1038/lsa.2016.170","abstract":[{"text":"Monochromatization of high-harmonic sources has opened fascinating perspectives regarding time-resolved photoemission from all phases of matter. Such studies have invariably involved the use of spectral filters or spectrally dispersive optical components that are inherently lossy and technically complex. Here we present a new technique for the spectral selection of near-threshold harmonics and their spatial separation from the driving beams without any optical elements. We discover the existence of a narrow phase-matching gate resulting from the combination of the non-collinear generation geometry in an extended medium, atomic resonances and absorption. Our technique offers a filter contrast of up to 104 for the selected harmonics against the adjacent ones and offers multiple temporally synchronized beamlets in a single unified scheme. We demonstrate the selective generation of 133, 80 or 56 nm femtosecond pulses from a 400-nm driver, which is specific to the target gas. These results open new pathways towards phase-sensitive multi-pulse spectroscopy in the vacuum- and extreme-ultraviolet, and frequency-selective output coupling from enhancement cavities.","lang":"eng"}],"issue":"11","publication_identifier":{"eissn":["2047-7538"]},"status":"public","pmid":1,"day":"01","extern":"1","publication_status":"published","month":"11","quality_controlled":"1","date_published":"2016-11-01T00:00:00Z","title":"In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses","keyword":["Atomic and Molecular Physics","and Optics","Electronic","Optical and Magnetic Materials"],"publication":"Light: Science & Applications","volume":5,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/lsa.2016.170"}],"year":"2016","date_created":"2023-08-10T06:37:25Z","scopus_import":"1","external_id":{"pmid":["30167130"]},"_id":"14012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Rajeev R, Hellwagner J, Schumacher A, et al. In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses. Light: Science & Applications. 2016;5(11):e16170-e16170. doi:10.1038/lsa.2016.170","short":"R. Rajeev, J. Hellwagner, A. Schumacher, I. Jordan, M. Huppert, A. Tehlar, B.R. Niraghatam, D.R. Baykusheva, N. Lin, A. von Conta, H.J. Wörner, Light: Science & Applications 5 (2016) e16170–e16170.","chicago":"Rajeev, Rajendran, Johannes Hellwagner, Anne Schumacher, Inga Jordan, Martin Huppert, Andres Tehlar, Bhargava Ram Niraghatam, et al. “In Situ Frequency Gating and Beam Splitting of Vacuum- and Extreme-Ultraviolet Pulses.” Light: Science & Applications. Springer Nature, 2016. https://doi.org/10.1038/lsa.2016.170.","ieee":"R. Rajeev et al., “In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses,” Light: Science & Applications, vol. 5, no. 11. Springer Nature, pp. e16170–e16170, 2016.","ista":"Rajeev R, Hellwagner J, Schumacher A, Jordan I, Huppert M, Tehlar A, Niraghatam BR, Baykusheva DR, Lin N, von Conta A, Wörner HJ. 2016. In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses. Light: Science & Applications. 5(11), e16170–e16170.","apa":"Rajeev, R., Hellwagner, J., Schumacher, A., Jordan, I., Huppert, M., Tehlar, A., … Wörner, H. J. (2016). In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses. Light: Science & Applications. Springer Nature. https://doi.org/10.1038/lsa.2016.170","mla":"Rajeev, Rajendran, et al. “In Situ Frequency Gating and Beam Splitting of Vacuum- and Extreme-Ultraviolet Pulses.” Light: Science & Applications, vol. 5, no. 11, Springer Nature, 2016, pp. e16170–e16170, doi:10.1038/lsa.2016.170."},"author":[{"first_name":"Rajendran","full_name":"Rajeev, Rajendran","last_name":"Rajeev"},{"last_name":"Hellwagner","first_name":"Johannes","full_name":"Hellwagner, Johannes"},{"last_name":"Schumacher","full_name":"Schumacher, Anne","first_name":"Anne"},{"last_name":"Jordan","first_name":"Inga","full_name":"Jordan, Inga"},{"last_name":"Huppert","full_name":"Huppert, Martin","first_name":"Martin"},{"full_name":"Tehlar, Andres","first_name":"Andres","last_name":"Tehlar"},{"first_name":"Bhargava Ram","full_name":"Niraghatam, Bhargava Ram","last_name":"Niraghatam"},{"last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","full_name":"Baykusheva, Denitsa Rangelova","first_name":"Denitsa Rangelova"},{"last_name":"Lin","first_name":"Nan","full_name":"Lin, Nan"},{"last_name":"von Conta","first_name":"Aaron","full_name":"von Conta, Aaron"},{"last_name":"Wörner","full_name":"Wörner, Hans Jakob","first_name":"Hans Jakob"}],"oa":1,"oa_version":"Published Version","date_updated":"2023-08-22T08:46:05Z","type":"journal_article"},{"status":"public","issue":"1","doi":"10.1007/s00454-016-9794-2","publist_id":"5799","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."}],"month":"07","related_material":{"record":[{"relation":"earlier_version","id":"1510","status":"public"}]},"publication_status":"published","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","ec_funded":1,"day":"01","publisher":"Springer","intvolume":" 56","page":"126 - 164","language":[{"iso":"eng"}],"_id":"1408","scopus_import":1,"file_date_updated":"2020-07-14T12:44:53Z","pubrep_id":"614","type":"journal_article","file":[{"file_size":905303,"content_type":"application/pdf","date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2016-614-v1+1_s00454-016-9794-2.pdf","date_created":"2018-12-12T10:10:55Z","file_id":"4846","access_level":"open_access","creator":"system","relation":"main_file","checksum":"e0da023abf6b72abd8c6a8c76740d53c"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2023-02-23T10:02:11Z","oa_version":"Published Version","oa":1,"author":[{"full_name":"Franek, Peter","first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek"},{"last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Krcál, Marek"}],"citation":{"ieee":"P. Franek and M. Krcál, “On computability and triviality of well groups,” Discrete & Computational Geometry, vol. 56, no. 1. Springer, pp. 126–164, 2016.","ama":"Franek P, Krcál M. On computability and triviality of well groups. Discrete & Computational Geometry. 2016;56(1):126-164. doi:10.1007/s00454-016-9794-2","short":"P. Franek, M. Krcál, Discrete & Computational Geometry 56 (2016) 126–164.","chicago":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” Discrete & Computational Geometry. Springer, 2016. https://doi.org/10.1007/s00454-016-9794-2.","ista":"Franek P, Krcál M. 2016. On computability and triviality of well groups. Discrete & Computational Geometry. 56(1), 126–164.","mla":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” Discrete & Computational Geometry, vol. 56, no. 1, Springer, 2016, pp. 126–64, doi:10.1007/s00454-016-9794-2.","apa":"Franek, P., & Krcál, M. (2016). On computability and triviality of well groups. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-016-9794-2"},"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2016-07-01T00:00:00Z","title":"On computability and triviality of well groups","project":[{"_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Robust invariants of Nonlinear Systems","grant_number":"M01980"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","date_created":"2018-12-11T11:51:51Z","ddc":["510"],"year":"2016","article_processing_charge":"Yes (via OA deal)","volume":56,"publication":"Discrete & Computational Geometry"},{"month":"06","publication_status":"published","day":"08","status":"public","issue":"11","publist_id":"5798","doi":"10.1111/mec.13685","intvolume":" 25","page":"2325 - 2332","language":[{"iso":"eng"}],"publisher":"Wiley-Blackwell","pubrep_id":"772","type":"journal_article","file":[{"creator":"system","checksum":"ede7d0b8a471754f71f17e2b20f3135b","relation":"main_file","file_id":"4797","date_created":"2018-12-12T10:10:12Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:44:53Z","file_size":226137,"file_name":"IST-2017-772-v1+1_AbbotEtAl2016-3.pdf"}],"department":[{"_id":"NiBa"}],"date_updated":"2021-01-12T06:50:33Z","oa_version":"Submitted Version","author":[{"last_name":"Abbott","first_name":"Richard","full_name":"Abbott, Richard"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Good","full_name":"Good, Jeffrey","first_name":"Jeffrey"}],"oa":1,"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. Abbott, N. H. Barton, and J. Good, “Genomics of hybridization and its evolutionary consequences,” Molecular Ecology, vol. 25, no. 11. Wiley-Blackwell, pp. 2325–2332, 2016.","ama":"Abbott R, Barton NH, Good J. Genomics of hybridization and its evolutionary consequences. Molecular Ecology. 2016;25(11):2325-2332. doi:10.1111/mec.13685","short":"R. Abbott, N.H. Barton, J. Good, Molecular Ecology 25 (2016) 2325–2332.","chicago":"Abbott, Richard, Nicholas H Barton, and Jeffrey Good. “Genomics of Hybridization and Its Evolutionary Consequences.” Molecular Ecology. Wiley-Blackwell, 2016. https://doi.org/10.1111/mec.13685.","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.” Molecular Ecology, vol. 25, no. 11, Wiley-Blackwell, 2016, pp. 2325–32, doi:10.1111/mec.13685.","apa":"Abbott, R., Barton, N. H., & Good, J. (2016). Genomics of hybridization and its evolutionary consequences. Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1111/mec.13685"},"_id":"1409","scopus_import":1,"file_date_updated":"2020-07-14T12:44:53Z","date_created":"2018-12-11T11:51:51Z","ddc":["576"],"year":"2016","volume":25,"publication":"Molecular Ecology","date_published":"2016-06-08T00:00:00Z","title":"Genomics of hybridization and its evolutionary consequences","quality_controlled":"1"},{"publisher":"Elsevier","page":"10 - 19","intvolume":" 250","language":[{"iso":"eng"}],"pmid":1,"status":"public","abstract":[{"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.","lang":"eng"}],"doi":"10.1016/j.plantsci.2016.05.014","publist_id":"5797","month":"09","day":"01","publication_status":"published","acknowledgement":"the Odysseus Program of the Research Foundation-Flanders [G091608] to JF.","quality_controlled":"1","date_published":"2016-09-01T00:00:00Z","title":"Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development","ddc":["581"],"date_created":"2018-12-11T11:51:51Z","publication":"Plant Science","volume":250,"year":"2016","_id":"1410","file_date_updated":"2020-07-14T12:44:53Z","scopus_import":1,"external_id":{"pmid":["27457979"]},"type":"journal_article","pubrep_id":"1005","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. Ugalde et al., “Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development,” Plant Science, vol. 250. Elsevier, pp. 10–19, 2016.","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.” Plant Science. Elsevier, 2016. https://doi.org/10.1016/j.plantsci.2016.05.014.","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. Plant Science. 2016;250:10-19. doi:10.1016/j.plantsci.2016.05.014","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.","apa":"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. Elsevier. https://doi.org/10.1016/j.plantsci.2016.05.014","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.” Plant Science, vol. 250, Elsevier, 2016, pp. 10–19, doi:10.1016/j.plantsci.2016.05.014.","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."},"oa":1,"author":[{"last_name":"Ugalde","first_name":"José","full_name":"Ugalde, José"},{"last_name":"Rodríguez Furlán","first_name":"Cecilia","full_name":"Rodríguez Furlán, Cecilia"},{"last_name":"De Rycke","first_name":"Riet","full_name":"De Rycke, Riet"},{"full_name":"Norambuena, Lorena","first_name":"Lorena","last_name":"Norambuena"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"full_name":"León, Gabriel","first_name":"Gabriel","last_name":"León"},{"last_name":"Tejos","first_name":"Ricardo","full_name":"Tejos, Ricardo"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T06:50:33Z","department":[{"_id":"JiFr"}],"file":[{"file_name":"2016_PlantScience_Ugalde.pdf","date_updated":"2020-07-14T12:44:53Z","content_type":"application/pdf","file_size":4338545,"access_level":"open_access","file_id":"6331","date_created":"2019-04-17T07:41:57Z","checksum":"ca08de036e6ddc81e6f760e0ccdebd3f","relation":"main_file","creator":"dernst"}]},{"date_created":"2018-12-11T11:51:52Z","main_file_link":[{"url":"http://arxiv.org/abs/1302.6475","open_access":"1"}],"year":"2016","volume":212,"publication":"Israel Journal of Mathematics","title":"Untangling two systems of noncrossing curves","date_published":"2016-05-01T00:00:00Z","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948"}],"quality_controlled":"1","type":"journal_article","department":[{"_id":"UlWa"}],"oa_version":"Preprint","date_updated":"2023-02-23T10:34:31Z","author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"full_name":"Sedgwick, Eric","first_name":"Eric","last_name":"Sedgwick"},{"full_name":"Tancer, Martin","first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","last_name":"Tancer"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner"}],"oa":1,"citation":{"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.” Israel Journal of Mathematics, vol. 212, no. 1, Springer, 2016, pp. 37–79, doi:10.1007/s11856-016-1294-9.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2016). Untangling two systems of noncrossing curves. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-016-1294-9","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” Israel Journal of Mathematics, vol. 212, no. 1. Springer, pp. 37–79, 2016.","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. Israel Journal of Mathematics. 2016;212(1):37-79. doi:10.1007/s11856-016-1294-9","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Israel Journal of Mathematics. Springer, 2016. https://doi.org/10.1007/s11856-016-1294-9."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1411","scopus_import":1,"intvolume":" 212","page":"37 - 79","language":[{"iso":"eng"}],"publisher":"Springer","month":"05","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2244"}]},"publication_status":"published","acknowledgement":"Supported by the ERC Adv anced Grant No. 267165. ","day":"01","status":"public","issue":"1","doi":"10.1007/s11856-016-1294-9","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."}],"publist_id":"5796"},{"publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"intvolume":" 35","page":"233 - 242","issue":"2","abstract":[{"lang":"eng","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."}],"doi":"10.1111/cgf.12826","publist_id":"5795","status":"public","acknowledgement":"This research was supported by NSERC (RGPIN-04360-2014) and IST Austria. ","publication_status":"published","ec_funded":1,"day":"27","month":"05","date_published":"2016-05-27T00:00:00Z","title":"A practical method for high-resolution embedded liquid surfaces","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"quality_controlled":"1","year":"2016","volume":35,"publication":"Computer Graphics Forum","date_created":"2018-12-11T11:51:52Z","ddc":["000"],"scopus_import":1,"file_date_updated":"2020-07-14T12:44:53Z","_id":"1412","file":[{"file_size":15873858,"content_type":"application/pdf","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","access_level":"open_access","creator":"system","relation":"main_file","checksum":"8e61387ee2e3bd0e776fbe301629bfd9"}],"department":[{"_id":"ChWo"}],"date_updated":"2023-02-21T10:38:30Z","oa_version":"Submitted Version","oa":1,"author":[{"last_name":"Goldade","full_name":"Goldade, Ryan","first_name":"Ryan"},{"first_name":"Christopher","full_name":"Batty, Christopher","last_name":"Batty"},{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","last_name":"Wojtan"}],"has_accepted_license":"1","citation":{"apa":"Goldade, R., Batty, C., & Wojtan, C. (2016). A practical method for high-resolution embedded liquid surfaces. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12826","mla":"Goldade, Ryan, et al. “A Practical Method for High-Resolution Embedded Liquid Surfaces.” Computer Graphics Forum, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 233–42, doi:10.1111/cgf.12826.","ista":"Goldade R, Batty C, Wojtan C. 2016. A practical method for high-resolution embedded liquid surfaces. Computer Graphics Forum. 35(2), 233–242.","ieee":"R. Goldade, C. Batty, and C. Wojtan, “A practical method for high-resolution embedded liquid surfaces,” Computer Graphics Forum, vol. 35, no. 2. Wiley-Blackwell, pp. 233–242, 2016.","chicago":"Goldade, Ryan, Christopher Batty, and Chris Wojtan. “A Practical Method for High-Resolution Embedded Liquid Surfaces.” Computer Graphics Forum. Wiley-Blackwell, 2016. https://doi.org/10.1111/cgf.12826.","short":"R. Goldade, C. Batty, C. Wojtan, Computer Graphics Forum 35 (2016) 233–242.","ama":"Goldade R, Batty C, Wojtan C. A practical method for high-resolution embedded liquid surfaces. Computer Graphics Forum. 2016;35(2):233-242. doi:10.1111/cgf.12826"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","pubrep_id":"612","type":"journal_article"},{"quality_controlled":"1","project":[{"_id":"25357BD2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 24352-N23","name":"Deep Pictures: Creating Visual and Haptic Vector Images"}],"title":"Generalized diffusion curves: An improved vector representation for smooth-shaded images","date_published":"2016-05-01T00:00:00Z","publisher":"Wiley-Blackwell","publication":"Computer Graphics Forum","language":[{"iso":"eng"}],"volume":35,"year":"2016","page":"71 - 79","intvolume":" 35","date_created":"2018-12-11T11:51:53Z","doi":"10.1111/cgf.12812","publist_id":"5794","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"}],"scopus_import":1,"issue":"2","status":"public","_id":"1413","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Jeschke S. 2016. Generalized diffusion curves: An improved vector representation for smooth-shaded images. Computer Graphics Forum. 35(2), 71–79.","apa":"Jeschke, S. (2016). Generalized diffusion curves: An improved vector representation for smooth-shaded images. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12812","mla":"Jeschke, Stefan. “Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images.” Computer Graphics Forum, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 71–79, doi:10.1111/cgf.12812.","ieee":"S. Jeschke, “Generalized diffusion curves: An improved vector representation for smooth-shaded images,” Computer Graphics Forum, vol. 35, no. 2. Wiley-Blackwell, pp. 71–79, 2016.","ama":"Jeschke S. Generalized diffusion curves: An improved vector representation for smooth-shaded images. Computer Graphics Forum. 2016;35(2):71-79. doi:10.1111/cgf.12812","short":"S. Jeschke, Computer Graphics Forum 35 (2016) 71–79.","chicago":"Jeschke, Stefan. “Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images.” Computer Graphics Forum. Wiley-Blackwell, 2016. https://doi.org/10.1111/cgf.12812."},"day":"01","author":[{"last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Jeschke, Stefan"}],"date_updated":"2021-01-12T06:50:34Z","oa_version":"None","publication_status":"published","department":[{"_id":"ChWo"}],"type":"journal_article","month":"05"},{"publisher":"Wiley-Blackwell","title":"Modeling and estimation of energy-based hyperelastic objects","date_published":"2016-05-01T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T11:51:53Z","intvolume":" 35","page":"385 - 396","year":"2016","publication":"Computer Graphics Forum","language":[{"iso":"eng"}],"volume":35,"status":"public","_id":"1414","issue":"2","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"}],"doi":"10.1111/cgf.12840","publist_id":"5792","scopus_import":1,"type":"journal_article","month":"05","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).","oa_version":"None","date_updated":"2021-01-12T06:50:35Z","publication_status":"published","department":[{"_id":"BeBi"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Miguel Villalba, Eder, David Miraut, and Miguel Otaduy. “Modeling and Estimation of Energy-Based Hyperelastic Objects.” Computer Graphics Forum. Wiley-Blackwell, 2016. https://doi.org/10.1111/cgf.12840.","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. Computer Graphics Forum. 2016;35(2):385-396. doi:10.1111/cgf.12840","ieee":"E. Miguel Villalba, D. Miraut, and M. Otaduy, “Modeling and estimation of energy-based hyperelastic objects,” Computer Graphics Forum, vol. 35, no. 2. Wiley-Blackwell, pp. 385–396, 2016.","apa":"Miguel Villalba, E., Miraut, D., & Otaduy, M. (2016). Modeling and estimation of energy-based hyperelastic objects. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12840","mla":"Miguel Villalba, Eder, et al. “Modeling and Estimation of Energy-Based Hyperelastic Objects.” Computer Graphics Forum, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 385–96, doi:10.1111/cgf.12840.","ista":"Miguel Villalba E, Miraut D, Otaduy M. 2016. Modeling and estimation of energy-based hyperelastic objects. Computer Graphics Forum. 35(2), 385–396."},"day":"01","author":[{"last_name":"Miguel Villalba","first_name":"Eder","full_name":"Miguel Villalba, Eder","id":"3FB91342-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Miraut, David","first_name":"David","last_name":"Miraut"},{"first_name":"Miguel","full_name":"Otaduy, Miguel","last_name":"Otaduy"}]}]