[{"author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"full_name":"Gupta, Ashutosh","first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","last_name":"Kragl","full_name":"Kragl, Bernhard"}],"date_created":"2018-12-11T11:56:29Z","date_updated":"2020-08-11T10:09:42Z","volume":8312,"year":"2013","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:34Z","publist_id":"4724","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Stellenbosch, South Africa","start_date":"2013-12-14","end_date":"2013-12-19"},"doi":"10.1007/978-3-642-45221-5_13","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"month":"01","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"2013_LPAR_Blanc.pdf","creator":"dernst","content_type":"application/pdf","file_size":279206,"file_id":"7858","relation":"main_file","checksum":"9cebaafca032e6769d273f393305c705","date_updated":"2020-07-14T12:45:34Z","date_created":"2020-05-15T11:10:40Z"}],"_id":"2237","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Tree interpolation in Vampire","status":"public","ddc":["000"],"intvolume":" 8312","abstract":[{"lang":"eng","text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2013-01-14T00:00:00Z","citation":{"ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","apa":"Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:10.1007/978-3-642-45221-5_13","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13.","mla":"Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181."},"page":"173 - 181","day":"14","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"series_title":"Lecture Notes in Computer Science"},{"ec_funded":1,"publist_id":"4723","publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"year":"2013","date_updated":"2020-08-11T10:09:42Z","date_created":"2018-12-11T11:56:30Z","volume":8312,"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Forejt","first_name":"Vojtěch","full_name":"Forejt, Vojtěch"},{"full_name":"Wojtczak, Dominik","first_name":"Dominik","last_name":"Wojtczak"}],"month":"12","quality_controlled":"1","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2013-12-19","location":"Stellenbosch, South Africa","start_date":"2013-12-14"},"doi":"10.1007/978-3-642-45221-5_17","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n","lang":"eng"}],"title":"Multi-objective discounted reward verification in graphs and MDPs","status":"public","intvolume":" 8312","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2238","oa_version":"None","series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"01","page":"228 - 242","citation":{"ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17","apa":"Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","mla":"Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.","chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17."},"date_published":"2013-12-01T00:00:00Z"},{"ec_funded":1,"publist_id":"4708","file_date_updated":"2020-07-14T12:45:34Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2013","volume":23,"date_created":"2018-12-11T11:56:32Z","date_updated":"2020-08-11T10:09:42Z","author":[{"full_name":"Michaliszyn, Jakub","first_name":"Jakub","last_name":"Michaliszyn"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"month":"09","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CSL.2013.563","conference":{"name":"CSL: Computer Science Logic","end_date":"2013-09-05","location":"Torino, Italy","start_date":"2013-09-02"},"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.","lang":"eng"}],"intvolume":" 23","ddc":["000","004"],"title":"Elementary modal logics over transitive structures","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2243","file":[{"file_name":"IST-2016-136-v1+2_39.pdf","access_level":"open_access","file_size":454915,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4929","date_created":"2018-12-12T10:12:11Z","date_updated":"2020-07-14T12:45:34Z","checksum":"e0732e73a8b1e39483df7717d53e3e35"}],"oa_version":"Published Version","pubrep_id":"136","series_title":"Leibniz International Proceedings in Informatics","scopus_import":1,"has_accepted_license":"1","day":"01","page":"563 - 577","citation":{"ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","apa":"Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563.","mla":"Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577."},"date_published":"2013-09-01T00:00:00Z"},{"oa_version":"Preprint","status":"public","title":"Untangling two systems of noncrossing curves","intvolume":" 8242","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2244","abstract":[{"lang":"eng","text":"We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ 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 αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi 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 ℳ 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 ℳ 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. "}],"alternative_title":["LNCS"],"type":"conference","date_published":"2013-09-01T00:00:00Z","page":"472 - 483","citation":{"ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-03841-4_41.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.","mla":"Matoušek, Jiří, et al. Untangling Two Systems of Noncrossing Curves. Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41."},"day":"01","series_title":"Lecture Notes in Computer Science","scopus_import":1,"date_created":"2018-12-11T11:56:32Z","date_updated":"2023-02-21T17:03:07Z","volume":8242,"author":[{"last_name":"Matoušek","first_name":"Jiří","full_name":"Matoušek, Jiří"},{"first_name":"Eric","last_name":"Sedgwick","full_name":"Sedgwick, Eric"},{"full_name":"Tancer, Martin","last_name":"Tancer","first_name":"Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli"}],"related_material":{"record":[{"id":"1411","status":"public","relation":"later_version"}]},"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","year":"2013","acknowledgement":"We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.","publist_id":"4707","language":[{"iso":"eng"}],"conference":{"name":"GD: Graph Drawing and Network Visualization","location":"Bordeaux, France","start_date":"2013-09-23","end_date":"2013-09-25"},"doi":"10.1007/978-3-319-03841-4_41","quality_controlled":"1","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"external_id":{"arxiv":["1302.6475"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1302.6475","open_access":"1"}],"month":"09"},{"author":[{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"last_name":"Krenn","first_name":"Stephan","orcid":"0000-0003-2835-9093","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Krenn, Stephan"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"date_updated":"2021-01-12T06:56:21Z","date_created":"2018-12-11T11:56:37Z","volume":8042,"year":"2013","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:45:35Z","ec_funded":1,"publist_id":"4687","conference":{"end_date":"2013-08-22","location":"Santa Barbara, CA, United States","start_date":"2013-08-18","name":"CRYPTO: International Cryptology Conference"},"doi":"10.1007/978-3-642-40041-4_4","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"month":"01","pubrep_id":"684","oa_version":"Published Version","file":[{"checksum":"16d428408a806b8e49eecc607deab115","date_updated":"2020-07-14T12:45:35Z","date_created":"2018-12-12T10:11:55Z","file_id":"4912","relation":"main_file","creator":"system","file_size":587898,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-684-v1+1_098.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2259","status":"public","title":"Learning with rounding, revisited: New reduction properties and applications","ddc":["000","004"],"intvolume":" 8042","abstract":[{"lang":"eng","text":"The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.\r\n"}],"issue":"1","type":"conference","alternative_title":["LNCS"],"date_published":"2013-01-01T00:00:00Z","citation":{"mla":"Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.","short":"J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.","chicago":"Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.","ama":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4","ista":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.","ieee":"J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.","apa":"Alwen, J. F., Krenn, S., Pietrzak, K. Z., & Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_4"},"page":"57 - 74","day":"01","has_accepted_license":"1","scopus_import":1,"series_title":"Lecture Notes in Computer Science"},{"doi":"10.1007/978-3-642-40041-4_31","conference":{"end_date":"2013-08-22","location":"Santa Barbara, CA, United States","start_date":"2013-08-18","name":"CRYPTO: International Cryptology Conference"},"language":[{"iso":"eng"}],"oa":1,"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","month":"01","author":[{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"first_name":"Mario","last_name":"Szegedy","full_name":"Szegedy, Mario"}],"volume":8042,"date_updated":"2021-01-12T06:56:21Z","date_created":"2018-12-11T11:56:37Z","year":"2013","department":[{"_id":"KrPi"}],"publisher":"Springer","publication_status":"published","ec_funded":1,"publist_id":"4688","file_date_updated":"2020-07-14T12:45:35Z","date_published":"2013-01-01T00:00:00Z","citation":{"chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_31.","mla":"Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.","short":"E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.","ista":"Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.","apa":"Kiltz, E., Pietrzak, K. Z., & Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_31","ieee":"E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.","ama":"Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:10.1007/978-3-642-40041-4_31"},"page":"571 - 588","has_accepted_license":"1","day":"01","scopus_import":1,"series_title":"Lecture Notes in Computer Science","pubrep_id":"685","file":[{"file_id":"4744","relation":"main_file","checksum":"18a3f602cb41de184dc0e16a0e907633","date_created":"2018-12-12T10:09:20Z","date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","file_name":"IST-2016-685-v1+1_658.pdf","creator":"system","content_type":"application/pdf","file_size":493175}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2258","intvolume":" 8042","status":"public","title":"Digital signatures with minimal overhead from indifferentiable random invertible functions","ddc":["000","004"],"abstract":[{"text":"In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"month":"12","year":"2013","department":[{"_id":"E-Lib"}],"publisher":"Verein Österreichischer Bibliothekarinnen und Bibliothekare","publication_status":"published","author":[{"full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski"},{"full_name":"Goldfarb, Doron","first_name":"Doron","last_name":"Goldfarb"},{"first_name":"Verena","last_name":"Schaffner","full_name":"Schaffner, Verena"},{"last_name":"Seidler","first_name":"Wolfram","full_name":"Seidler, Wolfram"}],"volume":66,"date_updated":"2021-01-12T06:56:20Z","date_created":"2018-12-11T11:56:36Z","publist_id":"4690","file_date_updated":"2020-07-14T12:45:35Z","citation":{"short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no. 3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013.","ista":"Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587."},"publication":"VÖB Mitteilungen","page":"559 - 587","date_published":"2013-12-01T00:00:00Z","has_accepted_license":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2256","intvolume":" 66","ddc":["020"],"title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","status":"public","pubrep_id":"719","popular_science":"1","file":[{"file_size":881545,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","checksum":"ae57ffcee3720adcc27b0f2767a1e04b","date_created":"2018-12-12T10:08:09Z","date_updated":"2020-07-14T12:45:35Z","relation":"main_file","file_id":"4669"}],"oa_version":"Published Version","type":"journal_article","issue":"3/4","abstract":[{"text":"Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license.","lang":"eng"},{"text":"Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte.","lang":"ger"}]},{"year":"2013","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","author":[{"last_name":"Bernhard","first_name":"David","full_name":"Bernhard, David"},{"last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"full_name":"Ghadafi, Essam","first_name":"Essam","last_name":"Ghadafi"}],"date_created":"2018-12-11T11:56:37Z","date_updated":"2020-08-11T10:09:44Z","volume":7954,"publist_id":"4686","main_file_link":[{"url":"http://eprint.iacr.org/2012/475","open_access":"1"}],"oa":1,"quality_controlled":"1","conference":{"name":"ACNS: Applied Cryptography and Network Security","end_date":"2013-06-28","start_date":"2013-06-25","location":"Banff, AB, Canada"},"doi":"10.1007/978-3-642-38980-1_33","language":[{"iso":"eng"}],"month":"06","_id":"2260","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Efficient signatures of knowledge and DAA in the standard model","status":"public","intvolume":" 7954","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.\r\n\r\nThe security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.\r\n"}],"citation":{"short":"D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533.","mla":"Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33.","chicago":"Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures of Knowledge and DAA in the Standard Model.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-38980-1_33.","ama":"Bernhard D, Fuchsbauer G, Ghadafi E. Efficient signatures of knowledge and DAA in the standard model. 2013;7954:518-533. doi:10.1007/978-3-642-38980-1_33","apa":"Bernhard, D., Fuchsbauer, G., & Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-642-38980-1_33","ieee":"D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013.","ista":"Bernhard D, Fuchsbauer G, Ghadafi E. 2013. Efficient signatures of knowledge and DAA in the standard model. 7954, 518–533."},"page":"518 - 533","date_published":"2013-06-01T00:00:00Z","scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"01"},{"type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Faithful progression through the cell cycle is crucial to the maintenance and developmental potential of stem cells. Here, we demonstrate that neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in two temporally and spatially distinct progenitor domains. Differential conditional deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal olfactory bulb progenitors disrupted transitions through G1, G2 and M phases, whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified by deletion of Sp2 using mosaic analysis with double markers, which clearly established that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly, conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis in the embryonic and postnatal brain."}],"intvolume":" 140","title":"Neural development is dependent on the function of specificity protein 2 in cell cycle progression","status":"public","_id":"2264","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"article_processing_charge":"No","day":"01","page":"552 - 561","citation":{"chicago":"Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz, and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development. Company of Biologists, 2013. https://doi.org/10.1242/dev.085621.","mla":"Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development, vol. 140, no. 3, Company of Biologists, 2013, pp. 552–61, doi:10.1242/dev.085621.","short":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development 140 (2013) 552–561.","ista":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 140(3), 552–561.","apa":"Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., & Ghashghaei, T. (2013). Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. Company of Biologists. https://doi.org/10.1242/dev.085621","ieee":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei, “Neural development is dependent on the function of specificity protein 2 in cell cycle progression,” Development, vol. 140, no. 3. Company of Biologists, pp. 552–561, 2013.","ama":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 2013;140(3):552-561. doi:10.1242/dev.085621"},"publication":"Development","date_published":"2013-02-01T00:00:00Z","publist_id":"4681","department":[{"_id":"SiHi"}],"publisher":"Company of Biologists","publication_status":"published","pmid":1,"year":"2013","volume":140,"date_updated":"2021-01-12T06:56:23Z","date_created":"2018-12-11T11:56:39Z","author":[{"full_name":"Liang, Huixuan","first_name":"Huixuan","last_name":"Liang"},{"first_name":"Guanxi","last_name":"Xiao","full_name":"Xiao, Guanxi"},{"last_name":"Yin","first_name":"Haifeng","full_name":"Yin, Haifeng"},{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jonathan","last_name":"Horowitz","full_name":"Horowitz, Jonathan"},{"full_name":"Ghashghaei, Troy","last_name":"Ghashghaei","first_name":"Troy"}],"month":"02","quality_controlled":"1","external_id":{"pmid":["23293287"]},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1242/dev.085621"},{"_id":"2269","acknowledgement":"Funding was provided by the FWF grant P20768-N13.\nWe want to thank the reviewers for their insightful and helpful remarks and Gernot Ziegler for providing help with CUDA. ","year":"2013","publisher":"Wiley-Blackwell","intvolume":" 32","status":"public","title":"Analytic Visibility on the GPU","publication_status":"published","author":[{"full_name":"Thomas Auzinger","first_name":"Thomas","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1546-3265"},{"full_name":"Wimmer, Michael","first_name":"Michael","last_name":"Wimmer"},{"full_name":"Stefan Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Jeschke"}],"volume":32,"date_updated":"2021-01-12T06:56:25Z","date_created":"2018-12-11T11:56:40Z","type":"journal_article","publist_id":"4675","issue":124,"abstract":[{"text":"This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods.","lang":"eng"}],"extern":1,"citation":{"ama":"Auzinger T, Wimmer M, Jeschke S. Analytic Visibility on the GPU. Computer Graphics Forum. 2013;32(124):409-418. doi:DOI: 10.1111/cgf.12061","apa":"Auzinger, T., Wimmer, M., & Jeschke, S. (2013). Analytic Visibility on the GPU. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/DOI: 10.1111/cgf.12061","ieee":"T. Auzinger, M. Wimmer, and S. Jeschke, “Analytic Visibility on the GPU,” Computer Graphics Forum, vol. 32, no. 124. Wiley-Blackwell, pp. 409–418, 2013.","ista":"Auzinger T, Wimmer M, Jeschke S. 2013. Analytic Visibility on the GPU. Computer Graphics Forum. 32(124), 409–418.","short":"T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 32 (2013) 409–418.","mla":"Auzinger, Thomas, et al. “Analytic Visibility on the GPU.” Computer Graphics Forum, vol. 32, no. 124, Wiley-Blackwell, 2013, pp. 409–18, doi:DOI: 10.1111/cgf.12061.","chicago":"Auzinger, Thomas, Michael Wimmer, and Stefan Jeschke. “Analytic Visibility on the GPU.” Computer Graphics Forum. Wiley-Blackwell, 2013. https://doi.org/DOI: 10.1111/cgf.12061."},"publication":"Computer Graphics Forum","page":"409 - 418","quality_controlled":0,"doi":"DOI: 10.1111/cgf.12061","date_published":"2013-05-06T00:00:00Z","day":"06","month":"05"},{"language":[{"iso":"eng"}],"conference":{"end_date":"2013-07-18","start_date":"2013-07-14","location":"Bellevue, WA, United States","name":"AAAI: Conference on Artificial Intelligence"},"date_published":"2013-12-31T00:00:00Z","quality_controlled":"1","page":"81-87","external_id":{"arxiv":["1108.5248"]},"citation":{"ieee":"Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.","apa":"Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.","ista":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.","ama":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures in Cooperative Graph Games. In: AAAI Press; 2013:81-87.","chicago":"Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.","short":"Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.","mla":"Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87."},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1108.5248","open_access":"1"}],"day":"31","month":"12","date_updated":"2021-01-12T06:56:25Z","date_created":"2018-12-11T11:56:41Z","oa_version":"None","author":[{"first_name":"Yoram","last_name":"Bachrach","full_name":"Bachrach, Yoram"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Morteza","last_name":"Zadimoghaddam","full_name":"Zadimoghaddam, Morteza"}],"publication_status":"published","status":"public","title":"Optimal Coalition Structures in Cooperative Graph Games","department":[{"_id":"VlKo"}],"publisher":"AAAI Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2270","year":"2013","abstract":[{"lang":"eng","text":"Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inher-\r\nent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is computationally to optimize and solve such games. One prominent such language is the simple yet expressive\r\nWeighted Graph Games (WGGs) representation (Deng and Papadimitriou 1994), which maintains knowledge about synergies between agents in the form of an edge weighted graph. We consider the problem of finding the optimal coalition structure in WGGs. The agents in such games are vertices in a graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We show that finding the optimal coalition structure is not only hard for general graphs, but is also intractable for restricted families such as planar graphs which are amenable for many other combinatorial problems. We then provide algorithms with constant factor approximations for planar, minorfree and bounded degree graphs."}],"publist_id":"4674","type":"conference"},{"extern":0,"abstract":[{"text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results.","lang":"eng"}],"publist_id":"4671","type":"report","date_updated":"2019-01-24T13:07:32Z","date_created":"2018-12-11T11:56:42Z","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"}],"status":"public","publication_status":"published","title":"Reweighted message passing revisited","department":[{"_id":"VlKo"}],"publisher":"IST Austria","year":"2013","_id":"2273","day":"22","month":"09","date_published":"2013-09-22T00:00:00Z","quality_controlled":0,"main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"citation":{"chicago":"Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.","short":"V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.","mla":"Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.","apa":"Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.","ieee":"V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.","ista":"Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.","ama":"Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013."},"oa":1},{"date_updated":"2021-01-12T06:56:29Z","date_created":"2018-12-11T11:56:43Z","oa_version":"None","volume":126,"author":[{"first_name":"Raquel","last_name":"Pérez Gómez","full_name":"Pérez Gómez, Raquel"},{"full_name":"Slovakova, Jana","first_name":"Jana","last_name":"Slovakova","id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rives Quinto","first_name":"Noemí","full_name":"Rives Quinto, Noemí"},{"full_name":"Krejčí, Alena","last_name":"Krejčí","first_name":"Alena"},{"first_name":"Ana","last_name":"Carmena","full_name":"Carmena, Ana"}],"status":"public","title":"A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development","publication_status":"published","publisher":"Company of Biologists","intvolume":" 126","department":[{"_id":"CaHe"}],"_id":"2278","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","abstract":[{"text":"It is firmly established that interactions between neurons and glia are fundamental across species for the correct establishment of a functional brain. Here, we found that the glia of the Drosophila larval brain display an essential non-autonomous role during the development of the optic lobe. The optic lobe develops from neuroepithelial cells that proliferate by dividing symmetrically until they switch to asymmetric/differentiative divisions that generate neuroblasts. The proneural gene lethal of scute (l9sc) is transiently activated by the epidermal growth factor receptor (EGFR)-Ras signal transduction pathway at the leading edge of a proneural wave that sweeps from medial to lateral neuroepithelium, promoting this switch. This process is tightly regulated by the tissue-autonomous function within the neuroepithelium of multiple signaling pathways, including EGFR-Ras and Notch. This study shows that the Notch ligand Serrate (Ser) is expressed in the glia and it forms a complex in vivo with Notch and Canoe, which colocalize at the adherens junctions of neuroepithelial cells. This complex is crucial for interactions between glia and neuroepithelial cells during optic lobe development. Ser is tissue-autonomously required in the glia where it activates Notch to regulate its proliferation, and non-autonomously in the neuroepithelium where Ser induces Notch signaling to avoid the premature activation of the EGFR-Ras pathway and hence of L9sc. Interestingly, different Notch activity reporters showed very different expression patterns in the glia and in the neuroepithelium, suggesting the existence of tissue-specific factors that promote the expression of particular Notch target genes or/and a reporter response dependent on different thresholds of Notch signaling.","lang":"eng"}],"publist_id":"4658","issue":"21","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2013-11-01T00:00:00Z","doi":"10.1242/jcs.125617","quality_controlled":"1","page":"4873 - 4884","publication":"Journal of Cell Science","citation":{"short":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, A. Carmena, Journal of Cell Science 126 (2013) 4873–4884.","mla":"Pérez Gómez, Raquel, et al. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science, vol. 126, no. 21, Company of Biologists, 2013, pp. 4873–84, doi:10.1242/jcs.125617.","chicago":"Pérez Gómez, Raquel, Jana Slovakova, Noemí Rives Quinto, Alena Krejčí, and Ana Carmena. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science. Company of Biologists, 2013. https://doi.org/10.1242/jcs.125617.","ama":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 2013;126(21):4873-4884. doi:10.1242/jcs.125617","apa":"Pérez Gómez, R., Slovakova, J., Rives Quinto, N., Krejčí, A., & Carmena, A. (2013). A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.125617","ieee":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, and A. Carmena, “A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development,” Journal of Cell Science, vol. 126, no. 21. Company of Biologists, pp. 4873–4884, 2013.","ista":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. 2013. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 126(21), 4873–4884."},"day":"01","month":"11","scopus_import":1},{"publist_id":"4668","abstract":[{"text":"The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19, 20]. It identifies a part of an optimal solution by running k maxflow computations, where k is the number of labels. The number of “labeled” pixels can be significant in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce the runtime to O (log k) maxflow computations (or one parametric maxflow computation). Furthermore, the output of our algorithm allows to speed-up the subsequent alpha expansion for the unlabeled part, or can be used as it is for time-critical applications. To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7] for Tree Metrics . We also show a connection to k-submodular functions from combinatorial optimization, and discuss k-submodular relaxations for general energy functions.","lang":"eng"}],"type":"conference","oa_version":"Preprint","date_created":"2018-12-11T11:56:43Z","date_updated":"2021-01-12T06:56:28Z","author":[{"full_name":"Gridchyn, Igor","first_name":"Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"publisher":"IEEE","department":[{"_id":"JoCs"},{"_id":"VlKo"}],"status":"public","publication_status":"published","title":"Potts model, parametric maxflow and k-submodular functions","year":"2013","_id":"2276","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","month":"12","language":[{"iso":"eng"}],"date_published":"2013-12-01T00:00:00Z","doi":"10.1109/ICCV.2013.288","conference":{"end_date":"2013-12-08","start_date":"2013-12-01","location":"Sydney, Australia","name":"ICCV: International Conference on Computer Vision"},"page":"2320 - 2327","quality_controlled":"1","external_id":{"arxiv":["1310.1771"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1310.1771","open_access":"1"}],"citation":{"ista":"Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327.","ieee":"I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.","apa":"Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288","ama":"Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular functions. In: IEEE; 2013:2320-2327. doi:10.1109/ICCV.2013.288","chicago":"Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288.","mla":"Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.","short":"I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327."}},{"citation":{"ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706.","ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” SIAM Review, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013.","apa":"Uhler, C., & Wright, S. (2013). Packing ellipsoids with overlap. SIAM Review. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120872309","ama":"Uhler C, Wright S. Packing ellipsoids with overlap. SIAM Review. 2013;55(4):671-706. doi:10.1137/120872309","chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120872309.","mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:10.1137/120872309.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706."},"publication":"SIAM Review","page":"671 - 706","date_published":"2013-11-07T00:00:00Z","scopus_import":1,"day":"07","_id":"2280","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 55","status":"public","title":"Packing ellipsoids with overlap","oa_version":"Preprint","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented."}],"oa":1,"external_id":{"arxiv":["1204.0235"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.0235"}],"quality_controlled":"1","doi":"10.1137/120872309","language":[{"iso":"eng"}],"month":"11","year":"2013","publisher":"Society for Industrial and Applied Mathematics ","department":[{"_id":"CaUh"}],"publication_status":"published","author":[{"last_name":"Uhler","first_name":"Caroline","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline"},{"full_name":"Wright, Stephen","last_name":"Wright","first_name":"Stephen"}],"volume":55,"date_updated":"2021-01-12T06:56:30Z","date_created":"2018-12-11T11:56:44Z","publist_id":"4655"},{"publist_id":"4644","file_date_updated":"2020-07-14T12:45:37Z","year":"2013","publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"}],"publication_status":"published","author":[{"last_name":"Pickup","first_name":"Melinda","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","full_name":"Pickup, Melinda"},{"full_name":"Barrett, Spencer","first_name":"Spencer","last_name":"Barrett"}],"volume":3,"date_updated":"2021-01-12T06:56:32Z","date_created":"2018-12-11T11:56:47Z","month":"03","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1002/ece3.465","language":[{"iso":"eng"}],"type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Negative frequency-dependent selection should result in equal sex ratios in large populations of dioecious flowering plants, but deviations from equality are commonly reported. A variety of ecological and genetic factors can explain biased sex ratios, although the mechanisms involved are not well understood. Most dioecious species are long-lived and/or clonal complicating efforts to identify stages during the life cycle when biases develop. We investigated the demographic correlates of sex-ratio variation in two chromosome races of Rumex hastatulus, an annual, wind-pollinated colonizer of open habitats from the southern USA. We examined sex ratios in 46 populations and evaluated the hypothesis that the proximity of males in the local mating environment, through its influence on gametophytic selection, is the primary cause of female-biased sex ratios. Female-biased sex ratios characterized most populations of R. hastatulus (mean sex ratio = 0.62), with significant female bias in 89% of populations. Large, high-density populations had the highest proportion of females, whereas smaller, low-density populations had sex ratios closer to equality. Progeny sex ratios were more female biased when males were in closer proximity to females, a result consistent with the gametophytic selection hypothesis. Our results suggest that interactions between demographic and genetic factors are probably the main cause of female-biased sex ratios in R. hastatulus. The annual life cycle of this species may limit the scope for selection against males and may account for the weaker degree of bias in comparison with perennial Rumex species."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2287","intvolume":" 3","status":"public","ddc":["576"],"title":"The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant","pubrep_id":"416","file":[{"creator":"system","content_type":"application/pdf","file_size":626949,"access_level":"open_access","file_name":"IST-2016-416-v1+1_Pickup_et_al-2013-Ecology_and_Evolution.pdf","checksum":"b5531bab4c0dec396bf5c8497fe178bf","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:17:35Z","file_id":"5290","relation":"main_file"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"chicago":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution. Wiley-Blackwell, 2013. https://doi.org/10.1002/ece3.465.","short":"M. Pickup, S. Barrett, Ecology and Evolution 3 (2013) 629–639.","mla":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution, vol. 3, no. 3, Wiley-Blackwell, 2013, pp. 629–39, doi:10.1002/ece3.465.","ieee":"M. Pickup and S. Barrett, “The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant,” Ecology and Evolution, vol. 3, no. 3. Wiley-Blackwell, pp. 629–639, 2013.","apa":"Pickup, M., & Barrett, S. (2013). The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.465","ista":"Pickup M, Barrett S. 2013. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 3(3), 629–639.","ama":"Pickup M, Barrett S. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 2013;3(3):629-639. doi:10.1002/ece3.465"},"publication":"Ecology and Evolution","page":"629 - 639","date_published":"2013-03-01T00:00:00Z"},{"publist_id":"4652","publication_status":"published","department":[{"_id":"CaHe"}],"publisher":"Nature Publishing Group","acknowledgement":"This work was supported by the IST Austria and MPI-CBG ","year":"2013","date_created":"2018-12-11T11:56:45Z","date_updated":"2023-02-21T17:02:44Z","volume":15,"author":[{"first_name":"Pedro","last_name":"Campinho","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8526-5416","full_name":"Campinho, Pedro"},{"full_name":"Behrndt, Martin","last_name":"Behrndt","first_name":"Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ranft, Jonas","last_name":"Ranft","first_name":"Jonas"},{"full_name":"Risler, Thomas","last_name":"Risler","first_name":"Thomas"},{"full_name":"Minc, Nicolas","first_name":"Nicolas","last_name":"Minc"},{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"related_material":{"record":[{"id":"1403","status":"public","relation":"dissertation_contains"}]},"month":"11","quality_controlled":"1","project":[{"_id":"252ABD0A-B435-11E9-9278-68D0E5697425","grant_number":"I 930-B20","call_identifier":"FWF","name":"Control of Epithelial Cell Layer Spreading in Zebrafish"}],"oa":1,"main_file_link":[{"url":"http://hal.upmc.fr/hal-00983313/","open_access":"1"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"doi":"10.1038/ncb2869","type":"journal_article","abstract":[{"lang":"eng","text":"Epithelial spreading is a common and fundamental aspect of various developmental and disease-related processes such as epithelial closure and wound healing. A key challenge for epithelial tissues undergoing spreading is to increase their surface area without disrupting epithelial integrity. Here we show that orienting cell divisions by tension constitutes an efficient mechanism by which the enveloping cell layer (EVL) releases anisotropic tension while undergoing spreading during zebrafish epiboly. The control of EVL cell-division orientation by tension involves cell elongation and requires myosin II activity to align the mitotic spindle with the main tension axis. We also found that in the absence of tension-oriented cell divisions and in the presence of increased tissue tension, EVL cells undergo ectopic fusions, suggesting that the reduction of tension anisotropy by oriented cell divisions is required to prevent EVL cells from fusing. We conclude that cell-division orientation by tension constitutes a key mechanism for limiting tension anisotropy and thus promoting tissue spreading during EVL epiboly."}],"status":"public","title":"Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly","intvolume":" 15","_id":"2282","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"day":"10","page":"1405 - 1414","publication":"Nature Cell Biology","citation":{"ista":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 15, 1405–1414.","apa":"Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., & Heisenberg, C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb2869","ieee":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg, “Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly,” Nature Cell Biology, vol. 15. Nature Publishing Group, pp. 1405–1414, 2013.","ama":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 2013;15:1405-1414. doi:10.1038/ncb2869","chicago":"Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc, and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/ncb2869.","mla":"Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:10.1038/ncb2869.","short":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg, Nature Cell Biology 15 (2013) 1405–1414."},"date_published":"2013-11-10T00:00:00Z"},{"doi":"10.1007/s00114-013-1115-5","date_published":"2013-11-14T00:00:00Z","language":[{"iso":"eng"}],"publication":"Naturwissenschaften","citation":{"chicago":"Pull, Christopher, William Hughes, and Markus Brown. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften. Springer, 2013. https://doi.org/10.1007/s00114-013-1115-5.","short":"C. Pull, W. Hughes, M. Brown, Naturwissenschaften 100 (2013) 1125–1136.","mla":"Pull, Christopher, et al. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften, vol. 100, no. 12, Springer, 2013, pp. 1125–36, doi:10.1007/s00114-013-1115-5.","ieee":"C. Pull, W. Hughes, and M. Brown, “Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ,” Naturwissenschaften, vol. 100, no. 12. Springer, pp. 1125–1136, 2013.","apa":"Pull, C., Hughes, W., & Brown, M. (2013). Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-013-1115-5","ista":"Pull C, Hughes W, Brown M. 2013. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 100(12), 1125–1136.","ama":"Pull C, Hughes W, Brown M. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 2013;100(12):1125-1136. doi:10.1007/s00114-013-1115-5"},"quality_controlled":"1","page":"1125 - 1136","month":"11","day":"14","scopus_import":1,"author":[{"full_name":"Pull, Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1122-3982","first_name":"Christopher","last_name":"Pull"},{"last_name":"Hughes","first_name":"William","full_name":"Hughes, William"},{"last_name":"Brown","first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus"}],"date_created":"2018-12-11T11:56:45Z","date_updated":"2021-01-12T06:56:31Z","oa_version":"None","volume":100,"year":"2013","_id":"2283","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ","publication_status":"published","department":[{"_id":"SyCr"}],"intvolume":" 100","publisher":"Springer","abstract":[{"text":"Pathogens exert a strong selection pressure on organisms to evolve effective immune defences. In addition to individual immunity, social organisms can act cooperatively to produce collective defences. In many ant species, queens have the option to found a colony alone or in groups with other, often unrelated, conspecifics. These associations are transient, usually lasting only as long as each queen benefits from the presence of others. In fact, once the first workers emerge, queens fight to the death for dominance. One potential advantage of co-founding may be that queens benefit from collective disease defences, such as mutual grooming, that act against common soil pathogens. We test this hypothesis by exposing single and co-founding queens to a fungal parasite, in order to assess whether queens in co-founding associations have improved survival. Surprisingly, co-foundresses exposed to the entomopathogenic fungus Metarhizium did not engage in cooperative disease defences, and consequently, we find no direct benefit of multiple queens on survival. However, an indirect benefit was observed, with parasite-exposed queens producing more brood when they co-founded, than when they were alone. We suggest this is due to a trade-off between reproduction and immunity. Additionally, we report an extraordinary ability of the queens to tolerate an infection for long periods after parasite exposure. Our study suggests that there are no social immunity benefits for co-founding ant queens, but that in parasite-rich environments, the presence of additional queens may nevertheless improve the chances of colony founding success.","lang":"eng"}],"issue":"12","publist_id":"4649","type":"journal_article"},{"oa_version":"Submitted Version","_id":"2286","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 32","title":"The force and effect of cell proliferation","status":"public","issue":"21","abstract":[{"text":"The spatiotemporal control of cell divisions is a key factor in epithelial morphogenesis and patterning. Mao et al (2013) now describe how differential rates of proliferation within the Drosophila wing disc epithelium give rise to anisotropic tissue tension in peripheral/proximal regions of the disc. Such global tissue tension anisotropy in turn determines the orientation of cell divisions by controlling epithelial cell elongation.","lang":"eng"}],"type":"journal_article","date_published":"2013-10-04T00:00:00Z","citation":{"ama":"Campinho P, Heisenberg C-PJ. The force and effect of cell proliferation. EMBO Journal. 2013;32(21):2783-2784. doi:10.1038/emboj.2013.225","apa":"Campinho, P., & Heisenberg, C.-P. J. (2013). The force and effect of cell proliferation. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2013.225","ieee":"P. Campinho and C.-P. J. Heisenberg, “The force and effect of cell proliferation,” EMBO Journal, vol. 32, no. 21. Wiley-Blackwell, pp. 2783–2784, 2013.","ista":"Campinho P, Heisenberg C-PJ. 2013. The force and effect of cell proliferation. EMBO Journal. 32(21), 2783–2784.","short":"P. Campinho, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 2783–2784.","mla":"Campinho, Pedro, and Carl-Philipp J. Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal, vol. 32, no. 21, Wiley-Blackwell, 2013, pp. 2783–84, doi:10.1038/emboj.2013.225.","chicago":"Campinho, Pedro, and Carl-Philipp J Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal. Wiley-Blackwell, 2013. https://doi.org/10.1038/emboj.2013.225."},"publication":"EMBO Journal","page":"2783 - 2784","day":"04","scopus_import":1,"author":[{"first_name":"Pedro","last_name":"Campinho","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8526-5416","full_name":"Campinho, Pedro"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"volume":32,"date_updated":"2021-01-12T06:56:32Z","date_created":"2018-12-11T11:56:46Z","pmid":1,"year":"2013","publisher":"Wiley-Blackwell","department":[{"_id":"CaHe"}],"publication_status":"published","publist_id":"4645","doi":"10.1038/emboj.2013.225","language":[{"iso":"eng"}],"external_id":{"pmid":["24097062"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3817470/","open_access":"1"}],"oa":1,"quality_controlled":"1","month":"10"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s00450-013-0251-7","language":[{"iso":"eng"}],"month":"10","year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"date_created":"2018-12-11T11:56:47Z","date_updated":"2021-01-12T06:56:33Z","volume":28,"file_date_updated":"2020-07-14T12:45:37Z","publist_id":"4642","ec_funded":1,"publication":"Computer Science Research and Development","citation":{"ama":"Henzinger TA. Quantitative reactive modeling and verification. Computer Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013.","apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7","mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.","short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.","chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7."},"page":"331 - 344","date_published":"2013-10-05T00:00:00Z","scopus_import":1,"day":"05","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2289","status":"public","ddc":["000"],"title":"Quantitative reactive modeling and verification","intvolume":" 28","pubrep_id":"626","oa_version":"Published Version","file":[{"file_id":"5308","relation":"main_file","checksum":"f117a00f9f046165bfa95595681e08a0","date_created":"2018-12-12T10:17:51Z","date_updated":"2020-07-14T12:45:37Z","access_level":"open_access","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf","creator":"system","file_size":570361,"content_type":"application/pdf"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments."}],"issue":"4"},{"publist_id":"4639","date_created":"2018-12-11T11:56:48Z","date_updated":"2021-01-12T06:56:33Z","volume":110,"author":[{"last_name":"Boutté","first_name":"Yohann","full_name":"Boutté, Yohann"},{"full_name":"Jonsson, Kristoffer","first_name":"Kristoffer","last_name":"Jonsson"},{"full_name":"Mcfarlane, Heather","last_name":"Mcfarlane","first_name":"Heather"},{"first_name":"Errin","last_name":"Johnson","full_name":"Johnson, Errin"},{"full_name":"Gendre, Delphine","last_name":"Gendre","first_name":"Delphine"},{"last_name":"Swarup","first_name":"Ranjan","full_name":"Swarup, Ranjan"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"first_name":"Lacey","last_name":"Samuels","full_name":"Samuels, Lacey"},{"full_name":"Robert, Stéphanie","first_name":"Stéphanie","last_name":"Robert"},{"last_name":"Bhalerao","first_name":"Rishikesh","full_name":"Bhalerao, Rishikesh"}],"publication_status":"published","publisher":"National Academy of Sciences","department":[{"_id":"JiFr"}],"year":"2013","pmid":1,"month":"10","language":[{"iso":"eng"}],"doi":"10.1073/pnas.1309057110","quality_controlled":"1","external_id":{"pmid":["24043780"]},"oa":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/","open_access":"1"}],"abstract":[{"lang":"eng","text":"The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development."}],"issue":"40","type":"journal_article","oa_version":"Submitted Version","status":"public","title":"ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation","intvolume":" 110","_id":"2290","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2013-10-01T00:00:00Z","page":"16259 - 16264","publication":"PNAS","citation":{"mla":"Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:10.1073/pnas.1309057110.","short":"Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.","chicago":"Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1309057110.","ama":"Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 2013;110(40):16259-16264. doi:10.1073/pnas.1309057110","ista":"Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.","apa":"Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1309057110","ieee":"Y. Boutté et al., “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” PNAS, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013."}},{"type":"conference","abstract":[{"lang":"eng","text":"In this work we propose a system for automatic classification of Drosophila embryos into developmental stages.\r\nWhile the system is designed to solve an actual problem in biological research, we believe that the principle underly-\r\ning it is interesting not only for biologists, but also for researchers in computer vision. The main idea is to combine two orthogonal sources of information: one is a classifier trained on strongly invariant features, which makes it applicable to images of very different conditions, but also leads to rather noisy predictions. The other is a label propagation step based on a more powerful similarity measure that however is only consistent within specific subsets of the data at a time.\r\nIn our biological setup, the information sources are the shape and the staining patterns of embryo images. We show\r\nexperimentally that while neither of the methods can be used by itself to achieve satisfactory results, their combina-\r\ntion achieves prediction quality comparable to human performance."}],"publist_id":"4634","ec_funded":1,"_id":"2294","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Drosophila Embryo Stage Annotation using Label Propagation","publication_status":"published","status":"public","publisher":"IEEE","department":[{"_id":"ChLa"}],"author":[{"full_name":"Kazmar, Tomas","last_name":"Kazmar","first_name":"Tomas"},{"last_name":"Kvon","first_name":"Evgeny","full_name":"Kvon, Evgeny"},{"last_name":"Stark","first_name":"Alexander","full_name":"Stark, Alexander"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"date_updated":"2021-01-12T06:56:35Z","date_created":"2018-12-11T11:56:49Z","oa_version":"Submitted Version","scopus_import":1,"month":"12","day":"01","citation":{"mla":"Kazmar, Tomas, et al. Drosophila Embryo Stage Annotation Using Label Propagation. IEEE, 2013, doi:10.1109/ICCV.2013.139.","short":"T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.","chicago":"Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. https://doi.org/10.1109/ICCV.2013.139.","ama":"Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using Label Propagation. In: IEEE; 2013. doi:10.1109/ICCV.2013.139","ista":"Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.","apa":"Kazmar, T., Kvon, E., Stark, A., & Lampert, C. (2013). Drosophila Embryo Stage Annotation using Label Propagation. Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.139","ieee":"T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013."},"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/ICCV2013.py"}],"quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"conference":{"location":"Sydney, Australia","start_date":"2013-12-01","end_date":"2013-12-08","name":"ICCV: International Conference on Computer Vision"},"doi":"10.1109/ICCV.2013.139","date_published":"2013-12-01T00:00:00Z","language":[{"iso":"eng"}]},{"status":"public","title":"Mathematical Foundations of Computer Science 2013","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer","editor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Sgall, Jiri","last_name":"Sgall","first_name":"Jiri"}],"intvolume":" 8087","year":"2013","_id":"2292","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:48Z","date_updated":"2020-08-11T10:09:45Z","oa_version":"None","volume":8087,"alternative_title":["LNCS"],"type":"conference_editor","abstract":[{"text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.","lang":"eng"}],"publist_id":"4636","quality_controlled":"1","page":"VI - 854","citation":{"mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2.","ama":"Chatterjee K, Sgall J, eds. Mathematical Foundations of Computer Science 2013. Vol 8087. Springer; 2013:VI-854. doi:10.1007/978-3-642-40313-2","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","ieee":"K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.","apa":"Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2"},"language":[{"iso":"eng"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2013-08-30","location":"Klosterneuburg, Austria","start_date":"2013-08-26"},"doi":"10.1007/978-3-642-40313-2","date_published":"2013-08-08T00:00:00Z","series_title":"Lecture Notes in Computer Science","scopus_import":1,"month":"08","day":"08","publication_identifier":{"isbn":["978-3-642-40312-5"]}},{"language":[{"iso":"eng"}],"conference":{"location":"Sydney, Australia","start_date":"2013-12-01","end_date":"2013-12-08","name":"ICCV: International Conference on Computer Vision"},"date_published":"2013-12-01T00:00:00Z","doi":"10.1109/ICCV.2013.107","quality_controlled":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"page":"825 - 832","main_file_link":[{"url":"www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf","open_access":"1"}],"oa":1,"citation":{"short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.","mla":"Sharmanska, Viktoriia, et al. Learning to Rank Using Privileged Information. IEEE, 2013, pp. 825–32, doi:10.1109/ICCV.2013.107.","chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning to Rank Using Privileged Information,” 825–32. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.107.","ama":"Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information. In: IEEE; 2013:825-832. doi:10.1109/ICCV.2013.107","apa":"Sharmanska, V., Quadrianto, N., & Lampert, C. (2013). Learning to rank using privileged information (pp. 825–832). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.107","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged information,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 825–832.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832."},"day":"01","month":"12","scopus_import":1,"date_updated":"2023-02-23T10:36:41Z","date_created":"2018-12-11T11:56:49Z","oa_version":"Submitted Version","author":[{"orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska","first_name":"Viktoriia","full_name":"Sharmanska, Viktoriia"},{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"title":"Learning to rank using privileged information","publication_status":"published","status":"public","publisher":"IEEE","department":[{"_id":"ChLa"}],"_id":"2293","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","abstract":[{"lang":"eng","text":"Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results."}],"ec_funded":1,"publist_id":"4635","type":"conference"},{"publication_status":"published","title":"Cryptographically enforced RBAC","status":"public","department":[{"_id":"KrPi"}],"publisher":"IEEE","_id":"2291","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","date_created":"2018-12-11T11:56:48Z","date_updated":"2021-01-12T06:56:34Z","oa_version":"Submitted Version","author":[{"full_name":"Ferrara, Anna","last_name":"Ferrara","first_name":"Anna"},{"full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Warinschi, Bogdan","first_name":"Bogdan","last_name":"Warinschi"}],"type":"conference","abstract":[{"text":"Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n","lang":"eng"}],"publist_id":"4637","quality_controlled":"1","page":"115 - 129","oa":1,"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2013/492"}],"citation":{"ista":"Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.","ieee":"A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.","apa":"Ferrara, A., Fuchsbauer, G., & Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. https://doi.org/10.1109/CSF.2013.15","ama":"Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:10.1109/CSF.2013.15","chicago":"Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. https://doi.org/10.1109/CSF.2013.15.","mla":"Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp. 115–29, doi:10.1109/CSF.2013.15.","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129."},"language":[{"iso":"eng"}],"conference":{"end_date":"2013-09-28","location":"New Orleans, LA, United States","start_date":"2013-09-26","name":"CSF: Computer Security Foundations"},"date_published":"2013-09-01T00:00:00Z","doi":"10.1109/CSF.2013.15","scopus_import":1,"day":"01","month":"09"},{"conference":{"start_date":"2013-09-22","location":"Klosterneuburg, Austria","end_date":"2013-09-24","name":"CMSB: Computational Methods in Systems Biology"},"doi":"10.1007/978-3-642-40708-6","date_published":"2013-07-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6.","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013. https://doi.org/10.1007/978-3-642-40708-6.","ama":"Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6","ieee":"A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013.","apa":"Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p."},"quality_controlled":"1","day":"01","month":"07","publication_identifier":{"isbn":["978-3-642-40707-9"]},"date_created":"2018-12-11T11:56:47Z","date_updated":"2019-08-02T12:37:44Z","volume":8130,"oa_version":"None","_id":"2288","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","status":"public","title":"Computational Methods in Systems Biology","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"intvolume":" 8130","editor":[{"last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"abstract":[{"text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms.","lang":"eng"}],"publist_id":"4643","type":"conference_editor","alternative_title":["LNCS"]},{"scopus_import":1,"day":"01","has_accepted_license":"1","citation":{"ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.","apa":"Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.","mla":"Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.","short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. https://doi.org/10.1007/978-3-642-38856-9_10."},"page":"150 - 171","date_published":"2013-01-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n"}],"_id":"2298","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","004"],"title":"Local shape analysis for overlaid data structures","status":"public","intvolume":" 7935","pubrep_id":"196","oa_version":"Submitted Version","file":[{"checksum":"907edd33a5892e3af093365f1fd57ed7","date_created":"2018-12-12T10:10:36Z","date_updated":"2020-07-14T12:45:37Z","file_id":"4824","relation":"main_file","creator":"system","file_size":299004,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2014-196-v1+1_sas13.pdf"}],"month":"01","oa":1,"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"conference":{"start_date":"2013-06-20","location":"Seattle, WA, United States","end_date":"2013-06-22","name":"SAS: Static Analysis Symposium"},"doi":"10.1007/978-3-642-38856-9_10","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:37Z","publist_id":"4630","ec_funded":1,"year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","author":[{"full_name":"Dragoi, Cezara","first_name":"Cezara","last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Constantin","last_name":"Enea","full_name":"Enea, Constantin"},{"last_name":"Sighireanu","first_name":"Mihaela","full_name":"Sighireanu, Mihaela"}],"date_updated":"2021-01-12T06:56:36Z","date_created":"2018-12-11T11:56:50Z","volume":7935},{"publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","year":"2013","volume":15,"date_created":"2018-12-11T11:56:51Z","date_updated":"2021-01-12T06:56:37Z","author":[{"last_name":"Godhal","first_name":"Yashdeep","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","full_name":"Godhal, Yashdeep"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"publist_id":"4629","file_date_updated":"2020-07-14T12:45:37Z","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s10009-011-0207-9","month":"10","intvolume":" 15","status":"public","title":"Synthesis of AMBA AHB from formal specification: A case study","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2299","oa_version":"Submitted Version","file":[{"file_size":277372,"content_type":"application/pdf","creator":"system","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:11:53Z","checksum":"57b06a732dd8d6349190dba6b5b0d33b","relation":"main_file","file_id":"4910"}],"pubrep_id":"87","type":"journal_article","issue":"5-6","abstract":[{"lang":"eng","text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol."}],"page":"585 - 601","citation":{"chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.","mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","apa":"Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9"},"publication":"International Journal on Software Tools for Technology Transfer","date_published":"2013-10-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01"},{"day":"24","scopus_import":1,"date_published":"2013-09-24T00:00:00Z","publication":"Japanese Journal of Mathematics","citation":{"short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.","mla":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:10.1007/s11537-013-1264-5.","chicago":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.","ama":"Seiringer R. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5","ieee":"R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232, 2013.","apa":"Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5","ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232."},"page":"185 - 232","abstract":[{"text":"We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The presentation includes a discussion of Bose-Einstein condensation, the excitation spectrum for trapped gases and its relation to superfluidity, as well as the appearance of quantized vortices in rotating systems. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schrödinger equation.","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Preprint","_id":"2297","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Hot topics in cold gases: A mathematical physics perspective","status":"public","intvolume":" 8","month":"09","doi":"10.1007/s11537-013-1264-5","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0908.3686"}],"external_id":{"arxiv":["0908.3686"]},"oa":1,"quality_controlled":"1","publist_id":"4631","author":[{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"date_created":"2018-12-11T11:56:50Z","date_updated":"2021-01-12T06:56:36Z","volume":8,"year":"2013","publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"Springer"},{"publication_status":"published","publisher":"De Gruyter","department":[{"_id":"E-Lib"}],"year":"2013","date_updated":"2021-12-21T12:17:19Z","date_created":"2018-12-11T11:56:53Z","volume":50,"author":[{"last_name":"Danowski","first_name":"Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick"},{"full_name":"Pohl, Adrian","last_name":"Pohl","first_name":"Adrian"}],"file_date_updated":"2020-07-14T12:45:38Z","publist_id":"4621","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"ger"}],"doi":"10.1515/9783110278736","month":"09","publication_identifier":{"isbn":[" 978-3-11-027634-3"],"eisbn":["9-783-1102-7873-6"],"issn":["2191-3587"]},"title":"(Open) Linked Data in Bibliotheken","status":"public","ddc":["020"],"intvolume":" 50","_id":"2306","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_created":"2018-12-12T10:09:49Z","date_updated":"2020-07-14T12:45:38Z","checksum":"807a408bbee519d792702828a32c6e85","relation":"main_file","file_id":"4774","content_type":"application/pdf","file_size":67731,"creator":"system","file_name":"IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf","access_level":"open_access"},{"checksum":"587e95c2ba24307a5a5d5bd1579429d9","date_created":"2018-12-12T10:09:50Z","date_updated":"2020-07-14T12:45:38Z","file_id":"4775","relation":"main_file","creator":"system","file_size":43563,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf"},{"relation":"main_file","file_id":"4776","checksum":"dbcada36bb32d725d9838615706e700f","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:51Z","access_level":"open_access","file_name":"IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf","content_type":"application/pdf","file_size":11318599,"creator":"system"},{"checksum":"5235712bf0a49ccc8c2cb4f6c2560d43","date_created":"2018-12-12T10:09:52Z","date_updated":"2020-07-14T12:45:38Z","relation":"main_file","file_id":"4777","file_size":330210,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf"},{"access_level":"open_access","file_name":"IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf","creator":"system","file_size":10652088,"content_type":"application/pdf","file_id":"4778","relation":"main_file","checksum":"d851cc91f705da80617ac7df33c1c0e1","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:53Z"},{"creator":"system","content_type":"application/pdf","file_size":6125273,"access_level":"open_access","file_name":"IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf","checksum":"4e77b182692c58e50fc5251bf23cc584","date_created":"2018-12-12T10:09:54Z","date_updated":"2020-07-14T12:45:38Z","file_id":"4779","relation":"main_file"},{"file_id":"4780","relation":"main_file","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:55Z","checksum":"3debae38064d5099d22f855c353a57ec","file_name":"IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":1893872},{"relation":"main_file","file_id":"4781","checksum":"e630b330dc0b7522d2cf204587030252","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:56Z","access_level":"open_access","file_name":"IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf","file_size":1095929,"content_type":"application/pdf","creator":"system"},{"creator":"system","content_type":"application/pdf","file_size":149699,"file_name":"IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:57Z","checksum":"17edda91271bfcce8e1b6e77ca1c9d11","file_id":"4782","relation":"main_file"},{"checksum":"aacef6734b1de58aeb58024fc47c2373","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:58Z","file_id":"4783","relation":"main_file","creator":"system","file_size":8828405,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf"},{"date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:59Z","checksum":"0619451f7ff3ea641ce0b10c97831f47","file_id":"4784","relation":"main_file","creator":"system","file_size":3191208,"content_type":"application/pdf","file_name":"IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf","access_level":"open_access"},{"file_size":78315,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf","checksum":"44dc8a9fc003f0edd912968958715a23","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:00Z","relation":"main_file","file_id":"4785"},{"relation":"main_file","file_id":"4786","checksum":"48133cecebfd839b77f84f557d530c00","date_created":"2018-12-12T10:10:01Z","date_updated":"2020-07-14T12:45:38Z","access_level":"open_access","file_name":"IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf","file_size":90532,"content_type":"application/pdf","creator":"system"},{"date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:02Z","checksum":"a359224ddfdb178fed72b228dcfb699a","relation":"main_file","file_id":"4787","file_size":90771,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf","access_level":"open_access"},{"relation":"main_file","file_id":"4788","date_created":"2018-12-12T10:10:03Z","date_updated":"2020-07-14T12:45:38Z","checksum":"0d2dd31d537c7a495999149d00eaffbf","file_name":"IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1830232,"creator":"system"}],"oa_version":"Published Version","pubrep_id":"725","alternative_title":["Bibliotheks- und Informationspraxis"],"type":"book","abstract":[{"text":"Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind.","lang":"ger"}],"citation":{"short":"P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013.","mla":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50, De Gruyter, 2013, doi:10.1515/9783110278736.","chicago":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50. De Gruyter, 2013. https://doi.org/10.1515/9783110278736.","ama":"Danowski P, Pohl A. (Open) Linked Data in Bibliotheken. Vol 50. De Gruyter; 2013. doi:10.1515/9783110278736","apa":"Danowski, P., & Pohl, A. (2013). (Open) Linked Data in Bibliotheken (Vol. 50). De Gruyter. https://doi.org/10.1515/9783110278736","ieee":"P. Danowski and A. Pohl, (Open) Linked Data in Bibliotheken, vol. 50. De Gruyter, 2013.","ista":"Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p."},"date_published":"2013-09-13T00:00:00Z","day":"13","has_accepted_license":"1","article_processing_charge":"No"},{"doi":"10.1145/2491956.2462184","date_published":"2013-06-01T00:00:00Z","conference":{"name":"PLDI: Programming Languages Design and Implementation","end_date":"2013-06-19","start_date":"2013-06-16","location":"Seattle, WA, United States"},"language":[{"iso":"eng"}],"citation":{"ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, Seattle, WA, United States, 2013, pp. 321–331.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184","mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.","short":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331.","chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184."},"main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"page":"321 - 331","quality_controlled":"1","month":"06","day":"01","scopus_import":1,"author":[{"full_name":"Desai, Ankush","first_name":"Ankush","last_name":"Desai"},{"first_name":"Vivek","last_name":"Gupta","full_name":"Gupta, Vivek"},{"first_name":"Ethan","last_name":"Jackson","full_name":"Jackson, Ethan"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"},{"last_name":"Rajamani","first_name":"Sriram","full_name":"Rajamani, Sriram"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"}],"oa_version":"None","date_updated":"2021-01-12T06:56:38Z","date_created":"2018-12-11T11:56:52Z","_id":"2301","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","department":[{"_id":"ToHe"}],"publication_status":"published","title":"P: Safe asynchronous event-driven programming","status":"public","ec_funded":1,"publist_id":"4626","abstract":[{"lang":"eng","text":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P."}],"type":"conference"},{"publist_id":"4627","article_number":"064401","author":[{"full_name":"Giuliani, Alessandro","last_name":"Giuliani","first_name":"Alessandro"},{"full_name":"Lieb, Élliott","last_name":"Lieb","first_name":"Élliott"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"volume":88,"date_created":"2018-12-11T11:56:51Z","date_updated":"2021-01-12T06:56:38Z","year":"2013","publisher":"American Physical Society","department":[{"_id":"RoSe"}],"publication_status":"published","month":"08","doi":"10.1103/PhysRevB.88.064401","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1305.5323"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1305.5323"}],"quality_controlled":"1","issue":"6","abstract":[{"lang":"eng","text":"We consider Ising models in two and three dimensions with nearest neighbor ferromagnetic interactions and long-range, power law decaying, antiferromagnetic interactions. If the strength of the ferromagnetic coupling J is larger than a critical value Jc, then the ground state is homogeneous and ferromagnetic. As the critical value is approached from smaller values of J, it is believed that the ground state consists of a periodic array of stripes (d=2) or slabs (d=3), all of the same size and alternating magnetization. Here we prove rigorously that the ground state energy per site converges to that of the optimal periodic striped or slabbed state, in the limit that J tends to the ferromagnetic transition point. While this theorem does not prove rigorously that the ground state is precisely striped or slabbed, it does prove that in any suitably large box the ground state is striped or slabbed with high probability."}],"type":"journal_article","oa_version":"Preprint","_id":"2300","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 88","title":"Realization of stripes and slabs in two and three dimensions","status":"public","day":"01","scopus_import":1,"date_published":"2013-08-01T00:00:00Z","citation":{"short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","mla":"Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:10.1103/PhysRevB.88.064401.","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.064401.","ama":"Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. Physical Review B. 2013;88(6). doi:10.1103/PhysRevB.88.064401","apa":"Giuliani, A., Lieb, É., & Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.88.064401","ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” Physical Review B, vol. 88, no. 6. American Physical Society, 2013.","ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401."},"publication":"Physical Review B"},{"volume":8,"oa_version":"None","date_created":"2018-12-11T11:56:52Z","date_updated":"2021-01-12T06:56:39Z","author":[{"last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon"}],"publisher":"Springer","department":[{"_id":"SiHi"}],"intvolume":" 8","status":"public","title":"Dissection of gene function at clonal level using mosaic analysis with double markers","publication_status":"published","year":"2013","_id":"2303","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by IST Austria institutional funds.","issue":"6","publist_id":"4624","abstract":[{"lang":"eng","text":"MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s11515-013-1279-6","date_published":"2013-09-03T00:00:00Z","page":"557 - 568","quality_controlled":"1","article_type":"review","citation":{"chicago":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology. Springer, 2013. https://doi.org/10.1007/s11515-013-1279-6.","mla":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:10.1007/s11515-013-1279-6.","short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568.","ista":"Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568.","apa":"Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. Springer. https://doi.org/10.1007/s11515-013-1279-6","ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” Frontiers in Biology, vol. 8, no. 6. Springer, pp. 557–568, 2013.","ama":"Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 2013;8(6):557-568. doi:10.1007/s11515-013-1279-6"},"publication":"Frontiers in Biology","month":"09","day":"03","scopus_import":1},{"language":[{"iso":"eng"}],"doi":"10.1016/j.endm.2013.07.008","date_published":"2013-09-05T00:00:00Z","quality_controlled":"1","page":"43 - 50","publication":"Electronic Notes in Discrete Mathematics","citation":{"chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008.","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.","apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2013.07.008","ama":"Pausinger F. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008"},"day":"05","month":"09","scopus_import":1,"date_updated":"2021-01-12T06:56:39Z","date_created":"2018-12-11T11:56:53Z","volume":43,"oa_version":"None","author":[{"full_name":"Pausinger, Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8379-3768","first_name":"Florian","last_name":"Pausinger"}],"publication_status":"published","title":"Van der Corput sequences and linear permutations","status":"public","department":[{"_id":"HeEd"}],"intvolume":" 43","publisher":"Elsevier","year":"2013","_id":"2304","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","abstract":[{"text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.","lang":"eng"}],"publist_id":"4623","type":"journal_article"},{"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4046"}],"citation":{"mla":"Seiringer, Robert, et al. Disordered Bose-Einstein Condensates with Interaction. World Scientific Publishing, 2013, pp. 610–19, doi:10.1142/9789814449243_0063.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing, 2013, pp. 610–619.","chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing, 2013. https://doi.org/10.1142/9789814449243_0063.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates with interaction. In: World Scientific Publishing; 2013:610-619. doi:10.1142/9789814449243_0063","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates with interaction. ICMP: International Congress on Mathematical Physics, 610–619.","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Disordered Bose-Einstein condensates with interaction (pp. 610–619). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814449243_0063","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates with interaction,” presented at the ICMP: International Congress on Mathematical Physics, 2013, pp. 610–619."},"external_id":{"arxiv":["1209.4046"]},"oa":1,"page":"610-619","conference":{"name":"ICMP: International Congress on Mathematical Physics"},"doi":"10.1142/9789814449243_0063","date_published":"2013-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":" We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the interval. "}],"publist_id":"4612","extern":"1","_id":"2315","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","title":"Disordered Bose-Einstein condensates with interaction","publication_status":"published","status":"public","publisher":"World Scientific Publishing","author":[{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"},{"first_name":"Valentin","last_name":"Zagrebnov","full_name":"Zagrebnov, Valentin"}],"date_updated":"2021-01-12T06:56:43Z","date_created":"2018-12-11T11:56:57Z","oa_version":"None"},{"month":"01","day":"01","conference":{"name":"OTAMP: Operator Theory, Analysis and Mathematical Physics"},"doi":"10.1007/978-3-0348-0531-5_3","date_published":"2013-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1103.1866"}],"oa":1,"citation":{"ama":"Frank R, Hainzl C, Seiringer R, Solovej J. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. In: Springer; 2013:57-88. doi:10.1007/978-3-0348-0531-5_3","ista":"Frank R, Hainzl C, Seiringer R, Solovej J. 2013. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. OTAMP: Operator Theory, Analysis and Mathematical Physics, 57–88.","ieee":"R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.","apa":"Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2013). Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction (pp. 57–88). Presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, Springer. https://doi.org/10.1007/978-3-0348-0531-5_3","mla":"Frank, Rupert, et al. Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction. Springer, 2013, pp. 57–88, doi:10.1007/978-3-0348-0531-5_3.","short":"R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, Springer, 2013, pp. 57–88.","chicago":"Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “ Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction,” 57–88. Springer, 2013. https://doi.org/10.1007/978-3-0348-0531-5_3."},"quality_controlled":0,"page":"57 - 88","abstract":[{"text":"In a recent paper [7] we give the first rigorous derivation of the celebrated Ginzburg-Landau (GL)theory, starting from the microscopic Bardeen- Cooper-Schrieffer (BCS)model. Here we present our results in the simplified case of a one-dimensional system of particles interacting via a δ-potential.","lang":"eng"}],"publist_id":"4608","extern":1,"type":"conference","author":[{"full_name":"Frank, Rupert L","last_name":"Frank","first_name":"Rupert"},{"full_name":"Hainzl, Christian","first_name":"Christian","last_name":"Hainzl"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Robert Seiringer"},{"full_name":"Solovej, Jan P","last_name":"Solovej","first_name":"Jan"}],"date_created":"2018-12-11T11:56:58Z","date_updated":"2021-01-12T06:56:45Z","_id":"2319","year":"2013","publication_status":"published","status":"public","title":" Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction","publisher":"Springer"},{"department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2013","volume":8052,"date_updated":"2023-02-23T10:16:27Z","date_created":"2018-12-11T11:57:01Z","related_material":{"record":[{"id":"1832","status":"public","relation":"later_version"}]},"author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","last_name":"Sezgin"},{"full_name":"Vafeiadis, Viktor","first_name":"Viktor","last_name":"Vafeiadis"}],"ec_funded":1,"publist_id":"4598","file_date_updated":"2020-07-14T12:45:39Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-40184-8_18","conference":{"end_date":"2013-08-30","location":"Buenos Aires, Argentina","start_date":"2013-08-27","name":"CONCUR: Concurrency Theory"},"month":"08","intvolume":" 8052","title":"Aspect-oriented linearizability proofs","ddc":["000","004"],"status":"public","_id":"2328","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":337059,"creator":"system","access_level":"open_access","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","checksum":"bdbb520de91751fe0136309ad4ef67e4","date_updated":"2020-07-14T12:45:39Z","date_created":"2018-12-12T10:08:58Z","relation":"main_file","file_id":"4721"}],"pubrep_id":"197","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof."}],"page":"242 - 256","citation":{"ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","apa":"Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18","ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.1007/978-3-642-40184-8_18.","mla":"Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:10.1007/978-3-642-40184-8_18.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256."},"date_published":"2013-08-01T00:00:00Z","series_title":"Lecture Notes in Computer Science","scopus_import":1,"has_accepted_license":"1","day":"01"},{"_id":"2404","year":"2013","publication_status":"published","status":"public","title":"A positive density analogue of the Lieb-Thirring inequality","publisher":"Duke University Press","intvolume":" 162","author":[{"last_name":"Frank","first_name":"Rupert","full_name":"Frank, Rupert L"},{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"full_name":"Lieb, Élliott H","last_name":"Lieb","first_name":"Élliott"},{"full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"date_created":"2018-12-11T11:57:28Z","date_updated":"2021-01-12T06:57:17Z","volume":162,"type":"journal_article","abstract":[{"text":"The Lieb-Thirring inequalities give a bound on the negative eigenvalues of a Schrödinger operator in terms of an Lp-norm of the potential. These are dual to bounds on the H1-norms of a system of orthonormal functions. Here we extend these bounds to analogous inequalities for perturbations of the Fermi sea of noninteracting particles (i.e., for perturbations of the continuous spectrum of the Laplacian by local potentials).","lang":"eng"}],"publist_id":"4521","issue":"3","extern":1,"publication":"Duke Mathematical Journal","oa":1,"citation":{"ama":"Frank R, Lewin M, Lieb É, Seiringer R. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 2013;162(3):435-495. doi:10.1215/00127094-2019477","ista":"Frank R, Lewin M, Lieb É, Seiringer R. 2013. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 162(3), 435–495.","ieee":"R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “A positive density analogue of the Lieb-Thirring inequality,” Duke Mathematical Journal, vol. 162, no. 3. Duke University Press, pp. 435–495, 2013.","apa":"Frank, R., Lewin, M., Lieb, É., & Seiringer, R. (2013). A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2019477","mla":"Frank, Rupert, et al. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal, vol. 162, no. 3, Duke University Press, 2013, pp. 435–95, doi:10.1215/00127094-2019477.","short":"R. Frank, M. Lewin, É. Lieb, R. Seiringer, Duke Mathematical Journal 162 (2013) 435–495.","chicago":"Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal. Duke University Press, 2013. https://doi.org/10.1215/00127094-2019477."},"main_file_link":[{"url":"http://arxiv.org/abs/1108.4246","open_access":"1"}],"quality_controlled":0,"page":"435 - 495","doi":"10.1215/00127094-2019477","date_published":"2013-02-01T00:00:00Z","day":"01","month":"02"},{"issue":"1","publist_id":"4520","abstract":[{"lang":"eng","text":"We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval. We prove that, in the Gross-Pitaevskii limit, Bose Einstein condensation takes place in the whole parameter range considered. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the unit interval."}],"extern":1,"type":"journal_article","author":[{"full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"},{"full_name":"Yngvason, Jakob","first_name":"Jakob","last_name":"Yngvason"},{"full_name":"Zagrebnov, Valentin A","last_name":"Zagrebnov","first_name":"Valentin"}],"volume":217,"date_updated":"2021-01-12T06:57:17Z","date_created":"2018-12-11T11:57:29Z","year":"2013","_id":"2406","intvolume":" 217","publisher":"Springer","publication_status":"published","status":"public","title":"Condensation of interacting bosons in a random potential","day":"01","month":"02","date_published":"2013-02-01T00:00:00Z","doi":"10.1140/epjst/e2013-01759-5","citation":{"mla":"Seiringer, Robert, et al. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics, vol. 217, no. 1, Springer, 2013, pp. 103–07, doi:10.1140/epjst/e2013-01759-5.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, European Physical Journal: Special Topics 217 (2013) 103–107.","chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics. Springer, 2013. https://doi.org/10.1140/epjst/e2013-01759-5.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 2013;217(1):103-107. doi:10.1140/epjst/e2013-01759-5","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 217(1), 103–107.","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. Springer. https://doi.org/10.1140/epjst/e2013-01759-5","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Condensation of interacting bosons in a random potential,” European Physical Journal: Special Topics, vol. 217, no. 1. Springer, pp. 103–107, 2013."},"publication":"European Physical Journal: Special Topics","page":"103 - 107","quality_controlled":0},{"author":[{"first_name":"Rupert","last_name":"Frank","full_name":"Frank, Rupert L"},{"last_name":"Lieb","first_name":"Élliott","full_name":"Lieb, Élliott H"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Robert Seiringer"}],"date_created":"2018-12-11T11:57:28Z","date_updated":"2021-01-12T06:57:17Z","volume":319,"_id":"2405","year":"2013","title":"Symmetry of bipolaron bound states for small Coulomb repulsion","publication_status":"published","status":"public","publisher":"Springer","intvolume":" 319","abstract":[{"text":"We consider the bipolaron in the Pekar-Tomasevich approximation and address the question whether the ground state is spherically symmetric or not. Numerical analysis has, so far, not completely settled the question. Our contribution is to prove rigorously that the ground state remains spherical for small values of the electron-electron Coulomb repulsion.","lang":"eng"}],"publist_id":"4522","issue":"2","extern":1,"type":"journal_article","date_published":"2013-04-01T00:00:00Z","doi":"10.1007/s00220-012-1604-y","publication":"Communications in Mathematical Physics","main_file_link":[{"url":"http://arxiv.org/abs/1201.3954","open_access":"1"}],"citation":{"ama":"Frank R, Lieb É, Seiringer R. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 2013;319(2):557-573. doi:10.1007/s00220-012-1604-y","ista":"Frank R, Lieb É, Seiringer R. 2013. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 319(2), 557–573.","apa":"Frank, R., Lieb, É., & Seiringer, R. (2013). Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1604-y","ieee":"R. Frank, É. Lieb, and R. Seiringer, “Symmetry of bipolaron bound states for small Coulomb repulsion,” Communications in Mathematical Physics, vol. 319, no. 2. Springer, pp. 557–573, 2013.","mla":"Frank, Rupert, et al. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics, vol. 319, no. 2, Springer, 2013, pp. 557–73, doi:10.1007/s00220-012-1604-y.","short":"R. Frank, É. Lieb, R. Seiringer, Communications in Mathematical Physics 319 (2013) 557–573.","chicago":"Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-012-1604-y."},"oa":1,"quality_controlled":0,"page":"557 - 573","day":"01","month":"04"},{"abstract":[{"lang":"eng","text":"We investigate the low-energy excitation spectrum of a Bose gas confined in a trap, with weak long-range repulsive interactions. In particular, we prove that the spectrum can be described in terms of the eigenvalues of an effective one-particle operator, as predicted by the Bogoliubov approximation."}],"publist_id":"4518","issue":"2","extern":1,"type":"journal_article","author":[{"full_name":"Grech, Philip","last_name":"Grech","first_name":"Philip"},{"full_name":"Robert Seiringer","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:57:29Z","date_updated":"2021-01-12T06:57:18Z","volume":322,"_id":"2408","year":"2013","title":"The excitation spectrum for weakly interacting Bosons in a trap","publication_status":"published","status":"public","publisher":"Springer","intvolume":" 322","month":"09","day":"01","date_published":"2013-09-01T00:00:00Z","doi":"10.1007/s00220-013-1736-8","publication":"Communications in Mathematical Physics","oa":1,"citation":{"chicago":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1736-8.","short":"P. Grech, R. Seiringer, Communications in Mathematical Physics 322 (2013) 559–591.","mla":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics, vol. 322, no. 2, Springer, 2013, pp. 559–91, doi:10.1007/s00220-013-1736-8.","ieee":"P. Grech and R. Seiringer, “The excitation spectrum for weakly interacting Bosons in a trap,” Communications in Mathematical Physics, vol. 322, no. 2. Springer, pp. 559–591, 2013.","apa":"Grech, P., & Seiringer, R. (2013). The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-013-1736-8","ista":"Grech P, Seiringer R. 2013. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 322(2), 559–591.","ama":"Grech P, Seiringer R. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 2013;322(2):559-591. doi:10.1007/s00220-013-1736-8"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.5259"}],"quality_controlled":0,"page":"559 - 591"},{"month":"02","doi":"10.1186/1471-2148-13-54","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:45:40Z","publist_id":"4514","author":[{"full_name":"Kupczok, Anne","first_name":"Anne","last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bollback, Jonathan P","last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:57:31Z","date_updated":"2021-01-12T06:57:20Z","volume":13,"year":"2013","publication_status":"published","department":[{"_id":"JoBo"}],"publisher":"BioMed Central","day":"26","has_accepted_license":"1","scopus_import":1,"date_published":"2013-02-26T00:00:00Z","publication":"BMC Evolutionary Biology","citation":{"ama":"Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 2013;13(1):54-54. doi:10.1186/1471-2148-13-54","ieee":"A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” BMC Evolutionary Biology, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013.","apa":"Kupczok, A., & Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/1471-2148-13-54","ista":"Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54.","short":"A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54.","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:10.1186/1471-2148-13-54.","chicago":"Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2148-13-54."},"page":"54 - 54","abstract":[{"text":"Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates.","lang":"eng"}],"issue":"1","type":"journal_article","pubrep_id":"397","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":518729,"creator":"system","access_level":"open_access","file_name":"IST-2015-397-v1+1_1471-2148-13-54.pdf","checksum":"029c7e0b198c19312b66ecce3cabb22f","date_updated":"2020-07-14T12:45:40Z","date_created":"2018-12-12T10:17:15Z","relation":"main_file","file_id":"5268"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2412","ddc":["576"],"status":"public","title":"Probabilistic models for CRISPR spacer content evolution ","intvolume":" 13"},{"language":[{"iso":"eng"}],"doi":"10.1002/9783527671632.ch08","date_published":"2013-08-01T00:00:00Z","quality_controlled":"1","citation":{"apa":"Valderrama, M., Botella Soler, V., & Le Van Quyen, M. (2013). Neuronal oscillations scale up and scale down the brain dynamics . In M. Meyer & Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH. https://doi.org/10.1002/9783527671632.ch08","ieee":"M. Valderrama, V. Botella Soler, and M. Le Van Quyen, “Neuronal oscillations scale up and scale down the brain dynamics ,” in Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, M. Meyer and Z. Pesenson, Eds. Wiley-VCH, 2013.","ista":"Valderrama M, Botella Soler V, Le Van Quyen M. 2013.Neuronal oscillations scale up and scale down the brain dynamics . In: Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Reviews of Nonlinear Dynamics and Complexity, .","ama":"Valderrama M, Botella Soler V, Le Van Quyen M. Neuronal oscillations scale up and scale down the brain dynamics . In: Meyer M, Pesenson Z, eds. Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH; 2013. doi:10.1002/9783527671632.ch08","chicago":"Valderrama, Mario, Vicente Botella Soler, and Michel Le Van Quyen. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” In Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson. Wiley-VCH, 2013. https://doi.org/10.1002/9783527671632.ch08.","short":"M. Valderrama, V. Botella Soler, M. Le Van Quyen, in:, M. Meyer, Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, Wiley-VCH, 2013.","mla":"Valderrama, Mario, et al. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson, Wiley-VCH, 2013, doi:10.1002/9783527671632.ch08."},"publication":"Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain","publication_identifier":{"isbn":["9783527411986 "],"eisbn":["9783527671632"]},"day":"01","month":"08","scopus_import":1,"oa_version":"None","date_created":"2018-12-11T11:57:31Z","date_updated":"2021-01-12T06:57:20Z","author":[{"full_name":"Valderrama, Mario","first_name":"Mario","last_name":"Valderrama"},{"full_name":"Botella Soler, Vicente","orcid":"0000-0002-8790-1914","id":"421234E8-F248-11E8-B48F-1D18A9856A87","last_name":"Botella Soler","first_name":"Vicente"},{"first_name":"Michel","last_name":"Le Van Quyen","full_name":"Le Van Quyen, Michel"}],"department":[{"_id":"GaTk"}],"editor":[{"full_name":"Meyer, Misha","last_name":"Meyer","first_name":"Misha"},{"full_name":"Pesenson, Z.","last_name":"Pesenson","first_name":"Z."}],"publisher":"Wiley-VCH","status":"public","title":"Neuronal oscillations scale up and scale down the brain dynamics ","publication_status":"published","year":"2013","_id":"2413","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"4513","abstract":[{"text":"Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness.","lang":"eng"}],"alternative_title":["Reviews of Nonlinear Dynamics and Complexity"],"type":"book_chapter"},{"type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. "}],"intvolume":" 1","ddc":["576"],"title":"Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis","status":"public","_id":"2410","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"checksum":"0751ec74b695567e0cdf02aaf9c26829","date_updated":"2020-07-14T12:45:40Z","date_created":"2018-12-12T10:17:36Z","file_id":"5291","relation":"main_file","creator":"system","file_size":130026,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf"}],"pubrep_id":"398","scopus_import":1,"has_accepted_license":"1","day":"13","citation":{"chicago":"Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements. American Society for Microbiology, 2013. https://doi.org/10.1128/genomeA.00216-13.","short":"R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013).","mla":"Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements, vol. 1, no. 3, American Society for Microbiology, 2013, doi:10.1128/genomeA.00216-13.","ieee":"R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” Genome Announcements, vol. 1, no. 3. American Society for Microbiology, 2013.","apa":"Fernandes Redondo, R. A., Kupczok, A., Stift, G., & Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. American Society for Microbiology. https://doi.org/10.1128/genomeA.00216-13","ista":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3).","ama":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 2013;1(3). doi:10.1128/genomeA.00216-13"},"publication":"Genome Announcements","date_published":"2013-06-13T00:00:00Z","publist_id":"4516","file_date_updated":"2020-07-14T12:45:40Z","publisher":"American Society for Microbiology","department":[{"_id":"JoBo"},{"_id":"LifeSc"}],"publication_status":"published","year":"2013","volume":1,"date_created":"2018-12-11T11:57:30Z","date_updated":"2021-01-12T06:57:19Z","author":[{"full_name":"Fernandes Redondo, Rodrigo A","first_name":"Rodrigo A","last_name":"Fernandes Redondo","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5837-2793"},{"last_name":"Kupczok","first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne"},{"id":"2DB195CA-F248-11E8-B48F-1D18A9856A87","last_name":"Stift","first_name":"Gertraud","full_name":"Stift, Gertraud"},{"first_name":"Jonathan P","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P"}],"month":"06","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1128/genomeA.00216-13"},{"file_date_updated":"2020-07-14T12:45:41Z","publist_id":"4456","year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","author":[{"first_name":"Ruzica","last_name":"Piskac","full_name":"Piskac, Ruzica"},{"first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien"}],"date_updated":"2020-08-11T10:09:47Z","date_created":"2018-12-11T11:57:43Z","volume":8044,"month":"07","oa":1,"quality_controlled":"1","conference":{"start_date":"2013-07-13","location":"St. Petersburg, Russia","end_date":"2013-07-19","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-642-39799-8_54","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n"}],"_id":"2447","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Automating separation logic using SMT","status":"public","ddc":["000"],"intvolume":" 8044","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"7859","checksum":"2e866932ab688f47ecd504acb4d5c7d4","date_updated":"2020-07-14T12:45:41Z","date_created":"2020-05-15T11:13:01Z","access_level":"open_access","file_name":"2013_CAV_Piskac.pdf","content_type":"application/pdf","file_size":309182,"creator":"dernst"}],"scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"01","article_processing_charge":"No","has_accepted_license":"1","citation":{"mla":"Piskac, Ruzica, et al. Automating Separation Logic Using SMT. Vol. 8044, Springer, 2013, pp. 773–89, doi:10.1007/978-3-642-39799-8_54.","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","chicago":"Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_54.","ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:10.1007/978-3-642-39799-8_54","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","apa":"Piskac, R., Wies, T., & Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_54"},"page":"773 - 789","date_published":"2013-07-01T00:00:00Z"},{"oa_version":"Published Version","_id":"2443","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 200","status":"public","title":"Defining the selectivity of processes along the auxin response chain: A study using auxin analogues","issue":"4","abstract":[{"lang":"eng","text":"The mode of action of auxin is based on its non-uniform distribution within tissues and organs. Despite the wide use of several auxin analogues in research and agriculture, little is known about the specificity of different auxin-related transport and signalling processes towards these compounds. Using seedlings of Arabidopsis thaliana and suspension-cultured cells of Nicotiana tabacum (BY-2), the physiological activity of several auxin analogues was investigated, together with their capacity to induce auxin-dependent gene expression, to inhibit endocytosis and to be transported across the plasma membrane. This study shows that the specificity criteria for different auxin-related processes vary widely. Notably, the special behaviour of some synthetic auxin analogues suggests that they might be useful tools in investigations of the molecular mechanism of auxin action. Thus, due to their differential stimulatory effects on DR5 expression, indole-3-propionic (IPA) and 2,4,5-trichlorophenoxy acetic (2,4,5-T) acids can serve in studies of TRANSPORT INHIBITOR RESPONSE 1/AUXIN SIGNALLING F-BOX (TIR1/AFB)-mediated auxin signalling, and 5-fluoroindole-3-acetic acid (5-F-IAA) can help to discriminate between transcriptional and non-transcriptional pathways of auxin signalling. The results demonstrate that the major determinants for the auxin-like physiological potential of a particular compound are very complex and involve its chemical and metabolic stability, its ability to distribute in tissues in a polar manner and its activity towards auxin signalling machinery."}],"type":"journal_article","date_published":"2013-12-01T00:00:00Z","citation":{"ieee":"S. Simon et al., “Defining the selectivity of processes along the auxin response chain: A study using auxin analogues,” New Phytologist, vol. 200, no. 4. Wiley, pp. 1034–1048, 2013.","apa":"Simon, S., Kubeš, M., Baster, P., Robert, S., Dobrev, P., Friml, J., … Zažímalová, E. (2013). Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. Wiley. https://doi.org/10.1111/nph.12437","ista":"Simon S, Kubeš M, Baster P, Robert S, Dobrev P, Friml J, Petrášek J, Zažímalová E. 2013. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 200(4), 1034–1048.","ama":"Simon S, Kubeš M, Baster P, et al. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 2013;200(4):1034-1048. doi:10.1111/nph.12437","chicago":"Simon, Sibu, Martin Kubeš, Pawel Baster, Stéphanie Robert, Petre Dobrev, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist. Wiley, 2013. https://doi.org/10.1111/nph.12437.","short":"S. Simon, M. Kubeš, P. Baster, S. Robert, P. Dobrev, J. Friml, J. Petrášek, E. Zažímalová, New Phytologist 200 (2013) 1034–1048.","mla":"Simon, Sibu, et al. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist, vol. 200, no. 4, Wiley, 2013, pp. 1034–48, doi:10.1111/nph.12437."},"publication":"New Phytologist","page":"1034 - 1048","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","author":[{"full_name":"Simon, Sibu","orcid":"0000-0002-1998-6741","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","last_name":"Simon","first_name":"Sibu"},{"full_name":"Kubeš, Martin","last_name":"Kubeš","first_name":"Martin"},{"id":"3028BD74-F248-11E8-B48F-1D18A9856A87","first_name":"Pawel","last_name":"Baster","full_name":"Baster, Pawel"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"first_name":"Petre","last_name":"Dobrev","full_name":"Dobrev, Petre"},{"full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"last_name":"Petrášek","first_name":"Jan","full_name":"Petrášek, Jan"},{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"}],"volume":200,"date_updated":"2022-06-07T08:57:52Z","date_created":"2018-12-11T11:57:41Z","acknowledgement":"The authors thank Dr Christian Luschnig (University of Natural Resources and Life Sciences (BOKU), Vienna, Austria) for the anti-PIN2 antibody, Professor Mark Estelle (University of California, San Diego, CA, USA) for tir1-1 mutant seeds and, last but not least, to Dr David Morris for critical reading of the manuscript. We also thank Markéta Pařezová and Jana Stýblová for excellent technical assistance. This work was supported by the Grant Agency of the Czech Republic (P305/11/0797 to E.Z. and 13-40637S to J.F.), the Central European Institute of Technology project CZ.1.05/1.1.00/02.0068 from the European Regional Development Fund and by a European Research Council starting independent research grant ERC-2011-StG-20101109-PSDP (to J.F.).","year":"2013","publisher":"Wiley","department":[{"_id":"JiFr"}],"publication_status":"published","publist_id":"4460","ec_funded":1,"doi":"10.1111/nph.12437","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1111/nph.12437","open_access":"1"}],"oa":1,"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"quality_controlled":"1","month":"12"},{"doi":"10.1007/978-3-642-39799-8_37","conference":{"end_date":"2013-07-19","start_date":"2013-07-13","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.5281"}],"external_id":{"arxiv":["1304.5281"]},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","month":"07","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Andreas","last_name":"Gaiser","full_name":"Gaiser, Andreas"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"volume":8044,"date_updated":"2020-08-11T10:09:47Z","date_created":"2018-12-11T11:57:42Z","year":"2013","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","ec_funded":1,"publist_id":"4457","date_published":"2013-07-01T00:00:00Z","citation":{"ama":"Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:10.1007/978-3-642-39799-8_37","apa":"Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37","ieee":"K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.","ista":"Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.","short":"K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.","mla":"Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37.","chicago":"Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37."},"page":"559 - 575","day":"01","scopus_import":1,"series_title":"Lecture Notes in Computer Science","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2446","intvolume":" 8044","title":"Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis","status":"public","abstract":[{"text":"The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"publist_id":"4459","ec_funded":1,"year":"2013","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Ła̧Cki, Jakub","last_name":"Ła̧Cki","first_name":"Jakub"}],"volume":8044,"date_created":"2018-12-11T11:57:42Z","date_updated":"2020-08-11T10:09:47Z","month":"07","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.0084"}],"external_id":{"arxiv":["1304.0084"]},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","doi":"10.1007/978-3-642-39799-8_36","conference":{"name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia","start_date":"2013-07-13","end_date":"2013-07-19"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time."}],"_id":"2444","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 8044","title":"Faster algorithms for Markov decision processes with low treewidth","status":"public","oa_version":"Preprint","scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"01","citation":{"short":"K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558.","mla":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Vol. 8044, Springer, 2013, pp. 543–58, doi:10.1007/978-3-642-39799-8_36.","chicago":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36.","ama":"Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:10.1007/978-3-642-39799-8_36","apa":"Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_36","ieee":"K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.","ista":"Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558."},"page":"543 - 558","date_published":"2013-07-01T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.1093/mp/sst044","date_published":"2013-11-01T00:00:00Z","quality_controlled":"1","page":"1849 - 1862","publication":"Molecular Plant","citation":{"ista":"Nodzyński T, Feraru M, Hirsch S, De Rycke R, Nicuales C, Van Leene J, De Jaeger G, Vanneste S, Friml J. 2013. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 6(6), 1849–1862.","apa":"Nodzyński, T., Feraru, M., Hirsch, S., De Rycke, R., Nicuales, C., Van Leene, J., … Friml, J. (2013). Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. Cell Press. https://doi.org/10.1093/mp/sst044","ieee":"T. Nodzyński et al., “Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis,” Molecular Plant, vol. 6, no. 6. Cell Press, pp. 1849–1862, 2013.","ama":"Nodzyński T, Feraru M, Hirsch S, et al. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 2013;6(6):1849-1862. doi:10.1093/mp/sst044","chicago":"Nodzyński, Tomasz, Murguel Feraru, Sibylle Hirsch, Riet De Rycke, Claudiu Nicuales, Jelle Van Leene, Geert De Jaeger, Steffen Vanneste, and Jiří Friml. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant. Cell Press, 2013. https://doi.org/10.1093/mp/sst044.","mla":"Nodzyński, Tomasz, et al. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant, vol. 6, no. 6, Cell Press, 2013, pp. 1849–62, doi:10.1093/mp/sst044.","short":"T. Nodzyński, M. Feraru, S. Hirsch, R. De Rycke, C. Nicuales, J. Van Leene, G. De Jaeger, S. Vanneste, J. Friml, Molecular Plant 6 (2013) 1849–1862."},"month":"11","day":"01","scopus_import":1,"date_created":"2018-12-11T11:57:44Z","date_updated":"2021-01-12T06:57:33Z","oa_version":"None","volume":6,"author":[{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"full_name":"Feraru, Murguel","first_name":"Murguel","last_name":"Feraru"},{"last_name":"Hirsch","first_name":"Sibylle","full_name":"Hirsch, Sibylle"},{"full_name":"De Rycke, Riet","first_name":"Riet","last_name":"De Rycke"},{"first_name":"Claudiu","last_name":"Nicuales","full_name":"Nicuales, Claudiu"},{"full_name":"Van Leene, Jelle","last_name":"Van Leene","first_name":"Jelle"},{"last_name":"De Jaeger","first_name":"Geert","full_name":"De Jaeger, Geert"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"}],"publication_status":"published","title":"Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis","status":"public","intvolume":" 6","publisher":"Cell Press","department":[{"_id":"JiFr"}],"year":"2013","_id":"2449","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. "}],"publist_id":"4454","issue":"6","type":"journal_article"},{"date_created":"2018-12-11T11:57:45Z","date_updated":"2021-01-12T06:57:34Z","volume":13,"author":[{"last_name":"Barbez","first_name":"Elke","full_name":"Barbez, Elke"},{"full_name":"Laňková, Martina","last_name":"Laňková","first_name":"Martina"},{"full_name":"Pařezová, Markéta","first_name":"Markéta","last_name":"Pařezová"},{"full_name":"Maizel, Alexis","first_name":"Alexis","last_name":"Maizel"},{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"full_name":"Jirí Friml","last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kleine-Vehn, Jürgen","last_name":"Kleine Vehn","first_name":"Jürgen"}],"status":"public","publication_status":"published","title":"Single-cell-based system to monitor carrier driven cellular auxin homeostasis","publisher":"BioMed Central","intvolume":" 13","year":"2013","_id":"2452","extern":1,"abstract":[{"lang":"eng","text":"Background: Abundance and distribution of the plant hormone auxin play important roles in plant development. Besides other metabolic processes, various auxin carriers control the cellular level of active auxin and, hence, are major regulators of cellular auxin homeostasis. Despite the developmental importance of auxin transporters, a simple medium-to-high throughput approach to assess carrier activities is still missing. Here we show that carrier driven depletion of cellular auxin correlates with reduced nuclear auxin signaling in tobacco Bright Yellow-2 (BY-2) cell cultures.Results: We developed an easy to use transient single-cell-based system to detect carrier activity. We use the relative changes in signaling output of the auxin responsive promoter element DR5 to indirectly visualize auxin carrier activity. The feasibility of the transient approach was demonstrated by pharmacological and genetic interference with auxin signaling and transport. As a proof of concept, we provide visual evidence that the prominent auxin transport proteins PIN-FORMED (PIN)2 and PIN5 regulate cellular auxin homeostasis at the plasma membrane and endoplasmic reticulum (ER), respectively. Our data suggest that PIN2 and PIN5 have different sensitivities to the auxin transport inhibitor 1-naphthylphthalamic acid (NPA). Also the putative PIN-LIKES (PILS) auxin carrier activity at the ER is insensitive to NPA in our system, indicating that NPA blocks intercellular, but not intracellular auxin transport.Conclusions: This single-cell-based system is a useful tool by which the activity of putative auxin carriers, such as PINs, PILS and WALLS ARE THIN1 (WAT1), can be indirectly visualized in a medium-to-high throughput manner. Moreover, our single cell system might be useful to investigate also other hormonal signaling pathways, such as cytokinin."}],"issue":"1","publist_id":"4451","type":"journal_article","date_published":"2013-02-01T00:00:00Z","doi":"10.1186/1471-2229-13-20","quality_controlled":0,"publication":"BMC Plant Biology","citation":{"mla":"Barbez, Elke, et al. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology, vol. 13, no. 1, BioMed Central, 2013, doi:10.1186/1471-2229-13-20.","short":"E. Barbez, M. Laňková, M. Pařezová, A. Maizel, E. Zažímalová, J. Petrášek, J. Friml, J. Kleine Vehn, BMC Plant Biology 13 (2013).","chicago":"Barbez, Elke, Martina Laňková, Markéta Pařezová, Alexis Maizel, Eva Zažímalová, Jan Petrášek, Jiří Friml, and Jürgen Kleine Vehn. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2229-13-20.","ama":"Barbez E, Laňková M, Pařezová M, et al. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 2013;13(1). doi:10.1186/1471-2229-13-20","ista":"Barbez E, Laňková M, Pařezová M, Maizel A, Zažímalová E, Petrášek J, Friml J, Kleine Vehn J. 2013. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 13(1).","apa":"Barbez, E., Laňková, M., Pařezová, M., Maizel, A., Zažímalová, E., Petrášek, J., … Kleine Vehn, J. (2013). Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-13-20","ieee":"E. Barbez et al., “Single-cell-based system to monitor carrier driven cellular auxin homeostasis,” BMC Plant Biology, vol. 13, no. 1. BioMed Central, 2013."},"month":"02","day":"01"}]