[{"year":"2015","publisher":"Springer Nature","department":[{"_id":"VlKo"}],"publication_status":"published","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"},{"first_name":"Rustem","last_name":"Takhanov","full_name":"Takhanov, Rustem"}],"volume":9472,"date_created":"2018-12-11T11:53:10Z","date_updated":"2022-02-01T15:12:35Z","ec_funded":1,"publist_id":"5519","external_id":{"arxiv":["1504.07067"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1504.07067","open_access":"1"}],"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-662-48971-0_48","conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","location":"Nagoya, Japan","start_date":"2015-12-09","end_date":"2015-12-11"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-662-48970-3"]},"month":"12","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"1636","intvolume":" 9472","status":"public","title":"Effectiveness of structural restrictions for hybrid CSPs","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism R→ΓΓ between two relational structures, e.g. between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for the fixed template CSPs where the right side ΓΓ is fixed and the left side R is unconstrained.\r\n\r\nFar fewer results are known for the hybrid setting that restricts both sides simultaneously. It assumes that R belongs to a certain class of relational structures (called a structural restriction in this paper). We study which structural restrictions are effective, i.e. there exists a fixed template ΓΓ (from a certain class of languages) for which the problem is tractable when R is restricted, and NP-hard otherwise. We provide a characterization for structural restrictions that are closed under inverse homomorphisms. The criterion is based on the chromatic number of a relational structure defined in this paper; it generalizes the standard chromatic number of a graph.\r\n\r\nAs our main tool, we use the algebraic machinery developed for fixed template CSPs. To apply it to our case, we introduce a new construction called a “lifted language”. We also give a characterization for structural restrictions corresponding to minor-closed families of graphs, extend results to certain Valued CSPs (namely conservative valued languages), and state implications for (valued) CSPs with ordered variables and for the maximum weight independent set problem on some restricted families of graphs."}],"citation":{"ista":"Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.","apa":"Kolmogorov, V., Rolinek, M., & Takhanov, R. (2015). Effectiveness of structural restrictions for hybrid CSPs. In 26th International Symposium (Vol. 9472, pp. 566–577). Nagoya, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-48971-0_48","ieee":"V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” in 26th International Symposium, Nagoya, Japan, 2015, vol. 9472, pp. 566–577.","ama":"Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. In: 26th International Symposium. Vol 9472. Springer Nature; 2015:566-577. doi:10.1007/978-3-662-48971-0_48","chicago":"Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” In 26th International Symposium, 9472:566–77. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48971-0_48.","mla":"Kolmogorov, Vladimir, et al. “Effectiveness of Structural Restrictions for Hybrid CSPs.” 26th International Symposium, vol. 9472, Springer Nature, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.","short":"V. Kolmogorov, M. Rolinek, R. Takhanov, in:, 26th International Symposium, Springer Nature, 2015, pp. 566–577."},"publication":"26th International Symposium","page":"566 - 577","date_published":"2015-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"month":"07","oa":1,"quality_controlled":"1","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, USA","start_date":"2015-08-09","end_date":"2015-08-13"},"doi":"10.1145/2766935","language":[{"iso":"eng"}],"article_number":"53","file_date_updated":"2020-07-14T12:45:07Z","publist_id":"5523","acknowledgement":"The first author was supported by a JSPS Postdoctoral Fellowship for Research Abroad. This work was also supported by the ERC projects ERC-2014-StG-637014 realFlow and ERC-2014- StG-638176 BigSplash.","year":"2015","publication_status":"published","publisher":"ACM","department":[{"_id":"ChWo"}],"author":[{"full_name":"Ando, Ryoichi","last_name":"Ando","first_name":"Ryoichi"},{"first_name":"Nils","last_name":"Thuerey","full_name":"Thuerey, Nils"},{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-02-23T10:07:37Z","date_created":"2018-12-11T11:53:09Z","volume":34,"scopus_import":1,"day":"27","has_accepted_license":"1","citation":{"mla":"Ando, Ryoichi, et al. A Stream Function Solver for Liquid Simulations. Vol. 34, no. 4, 53, ACM, 2015, doi:10.1145/2766935.","short":"R. Ando, N. Thuerey, C. Wojtan, in:, ACM, 2015.","chicago":"Ando, Ryoichi, Nils Thuerey, and Chris Wojtan. “A Stream Function Solver for Liquid Simulations,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766935.","ama":"Ando R, Thuerey N, Wojtan C. A stream function solver for liquid simulations. In: Vol 34. ACM; 2015. doi:10.1145/2766935","ista":"Ando R, Thuerey N, Wojtan C. 2015. A stream function solver for liquid simulations. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 34, 53.","apa":"Ando, R., Thuerey, N., & Wojtan, C. (2015). A stream function solver for liquid simulations (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/2766935","ieee":"R. Ando, N. Thuerey, and C. Wojtan, “A stream function solver for liquid simulations,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA, 2015, vol. 34, no. 4."},"date_published":"2015-07-27T00:00:00Z","type":"conference","alternative_title":["ACM Transactions on Graphics"],"abstract":[{"text":"This paper presents a liquid simulation technique that enforces the incompressibility condition using a stream function solve instead of a pressure projection. Previous methods have used stream function techniques for the simulation of detailed single-phase flows, but a formulation for liquid simulation has proved elusive in part due to the free surface boundary conditions. In this paper, we introduce a stream function approach to liquid simulations with novel boundary conditions for free surfaces, solid obstacles, and solid-fluid coupling.\r\n\r\nAlthough our approach increases the dimension of the linear system necessary to enforce incompressibility, it provides interesting and surprising benefits. First, the resulting flow is guaranteed to be divergence-free regardless of the accuracy of the solve. Second, our free-surface boundary conditions guarantee divergence-free motion even in the un-simulated air phase, which enables two-phase flow simulation by only computing a single phase. We implemented this method using a variant of FLIP simulation which only samples particles within a narrow band of the liquid surface, and we illustrate the effectiveness of our method for detailed two-phase flow simulations with complex boundaries, detailed bubble interactions, and two-way solid-fluid coupling.","lang":"eng"}],"issue":"4","_id":"1632","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"A stream function solver for liquid simulations","status":"public","intvolume":" 34","pubrep_id":"610","file":[{"relation":"main_file","file_id":"4909","date_updated":"2020-07-14T12:45:07Z","date_created":"2018-12-12T10:11:52Z","checksum":"7a9afdfaba9209157ce19376e15bc90b","file_name":"IST-2016-610-v1+1_vecpotential.pdf","access_level":"open_access","file_size":21831121,"content_type":"application/pdf","creator":"system"}],"oa_version":"Submitted Version"},{"publist_id":"5525","file_date_updated":"2020-07-14T12:45:07Z","article_number":"108","author":[{"full_name":"Guerrero, Paul","first_name":"Paul","last_name":"Guerrero"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","first_name":"Stefan","full_name":"Jeschke, Stefan"},{"full_name":"Wimmer, Michael","last_name":"Wimmer","first_name":"Michael"},{"full_name":"Wonka, Peter","first_name":"Peter","last_name":"Wonka"}],"volume":34,"date_created":"2018-12-11T11:53:08Z","date_updated":"2021-01-12T06:52:07Z","acknowledgement":"This publication is based upon work supported by the KAUST Office of Competitive Research Funds (OCRF) under Award No. 62140401, the KAUST Visual Computing Center and the Austrian Science Fund (FWF) projects DEEP PICTURES (no. P24352-N23) and Data-Driven Procedural Modeling of Interiors (no. P24600-N23).","year":"2015","publisher":"ACM","department":[{"_id":"ChWo"}],"publication_status":"published","month":"07","doi":"10.1145/2766933","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, United States","start_date":"2015-08-09","end_date":"2015-08-13"},"language":[{"iso":"eng"}],"oa":1,"project":[{"_id":"25357BD2-B435-11E9-9278-68D0E5697425","grant_number":"P 24352-N23","call_identifier":"FWF","name":"Deep Pictures: Creating Visual and Haptic Vector Images"}],"quality_controlled":"1","issue":"4","abstract":[{"text":"We present a method to learn and propagate shape placements in 2D polygonal scenes from a few examples provided by a user. The placement of a shape is modeled as an oriented bounding box. Simple geometric relationships between this bounding box and nearby scene polygons define a feature set for the placement. The feature sets of all example placements are then used to learn a probabilistic model over all possible placements and scenes. With this model, we can generate a new set of placements with similar geometric relationships in any given scene. We introduce extensions that enable propagation and generation of shapes in 3D scenes, as well as the application of a learned modeling session to large scenes without additional user interaction. These concepts allow us to generate complex scenes with thousands of objects with relatively little user interaction.","lang":"eng"}],"type":"conference","pubrep_id":"576","file":[{"file_size":11902290,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-576-v1+1_guerrero-2015-lsp-paper.pdf","checksum":"8b05a51e372c9b0b5af9a00098a9538b","date_updated":"2020-07-14T12:45:07Z","date_created":"2018-12-12T10:07:49Z","relation":"main_file","file_id":"4647"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1630","intvolume":" 34","title":"Learning shape placements by example","status":"public","ddc":["000"],"has_accepted_license":"1","day":"27","scopus_import":1,"date_published":"2015-07-27T00:00:00Z","citation":{"ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Learning shape placements by example. In: Vol 34. ACM; 2015. doi:10.1145/2766933","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Learning shape placements by example,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2015). Learning shape placements by example (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2766933","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2015. Learning shape placements by example. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 108.","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, in:, ACM, 2015.","mla":"Guerrero, Paul, et al. Learning Shape Placements by Example. Vol. 34, no. 4, 108, ACM, 2015, doi:10.1145/2766933.","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Learning Shape Placements by Example,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766933."}},{"date_published":"2015-01-01T00:00:00Z","publication":"Nature Communications","citation":{"ista":"Šimášková M, O’Brien J, Khan-Djamei M, Van Noorden G, Ötvös K, Vieten A, De Clercq I, Van Haperen J, Cuesta C, Hoyerová K, Vanneste S, Marhavý P, Wabnik KT, Van Breusegem F, Nowack M, Murphy A, Friml J, Weijers D, Beeckman T, Benková E. 2015. Cytokinin response factors regulate PIN-FORMED auxin transporters. Nature Communications. 6, 8717.","apa":"Šimášková, M., O’Brien, J., Khan-Djamei, M., Van Noorden, G., Ötvös, K., Vieten, A., … Benková, E. (2015). Cytokinin response factors regulate PIN-FORMED auxin transporters. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms9717","ieee":"M. Šimášková et al., “Cytokinin response factors regulate PIN-FORMED auxin transporters,” Nature Communications, vol. 6. Nature Publishing Group, 2015.","ama":"Šimášková M, O’Brien J, Khan-Djamei M, et al. Cytokinin response factors regulate PIN-FORMED auxin transporters. Nature Communications. 2015;6. doi:10.1038/ncomms9717","chicago":"Šimášková, Mária, José O’Brien, Mamoona Khan-Djamei, Giel Van Noorden, Krisztina Ötvös, Anne Vieten, Inge De Clercq, et al. “Cytokinin Response Factors Regulate PIN-FORMED Auxin Transporters.” Nature Communications. Nature Publishing Group, 2015. https://doi.org/10.1038/ncomms9717.","mla":"Šimášková, Mária, et al. “Cytokinin Response Factors Regulate PIN-FORMED Auxin Transporters.” Nature Communications, vol. 6, 8717, Nature Publishing Group, 2015, doi:10.1038/ncomms9717.","short":"M. Šimášková, J. O’Brien, M. Khan-Djamei, G. Van Noorden, K. Ötvös, A. Vieten, I. De Clercq, J. Van Haperen, C. Cuesta, K. Hoyerová, S. Vanneste, P. Marhavý, K.T. Wabnik, F. Van Breusegem, M. Nowack, A. Murphy, J. Friml, D. Weijers, T. Beeckman, E. Benková, Nature Communications 6 (2015)."},"day":"01","has_accepted_license":"1","scopus_import":1,"pubrep_id":"1020","file":[{"relation":"main_file","file_id":"5358","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:18:36Z","checksum":"c2c84bca37401435fedf76bad0ba0579","file_name":"IST-2018-1020-v1+1_Simaskova_et_al_NatCom_2015.pdf","access_level":"open_access","file_size":1471217,"content_type":"application/pdf","creator":"system"}],"oa_version":"Submitted Version","_id":"1640","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["580"],"title":"Cytokinin response factors regulate PIN-FORMED auxin transporters","status":"public","intvolume":" 6","abstract":[{"text":"Auxin and cytokinin are key endogenous regulators of plant development. Although cytokinin-mediated modulation of auxin distribution is a developmentally crucial hormonal interaction, its molecular basis is largely unknown. Here we show a direct regulatory link between cytokinin signalling and the auxin transport machinery uncovering a mechanistic framework for cytokinin-auxin cross-talk. We show that the CYTOKININ RESPONSE FACTORS (CRFs), transcription factors downstream of cytokinin perception, transcriptionally control genes encoding PIN-FORMED (PIN) auxin transporters at a specific PIN CYTOKININ RESPONSE ELEMENT (PCRE) domain. Removal of this cis-regulatory element effectively uncouples PIN transcription from the CRF-mediated cytokinin regulation and attenuates plant cytokinin sensitivity. We propose that CRFs represent a missing cross-talk component that fine-tunes auxin transport capacity downstream of cytokinin signalling to control plant development.","lang":"eng"}],"type":"journal_article","doi":"10.1038/ncomms9717","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"207362","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","name":"Hormonal cross-talk in plant organogenesis","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Hormone cross-talk drives nutrient dependent plant development","grant_number":"I 1774-B16","_id":"2542D156-B435-11E9-9278-68D0E5697425"}],"month":"01","author":[{"full_name":"Šimášková, Mária","first_name":"Mária","last_name":"Šimášková"},{"full_name":"O'Brien, José","first_name":"José","last_name":"O'Brien"},{"id":"391B5BBC-F248-11E8-B48F-1D18A9856A87","first_name":"Mamoona","last_name":"Khan-Djamei","full_name":"Khan-Djamei, Mamoona"},{"full_name":"Van Noorden, Giel","last_name":"Van Noorden","first_name":"Giel"},{"full_name":"Ötvös, Krisztina","first_name":"Krisztina","last_name":"Ötvös","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5503-4983"},{"full_name":"Vieten, Anne","first_name":"Anne","last_name":"Vieten"},{"full_name":"De Clercq, Inge","last_name":"De Clercq","first_name":"Inge"},{"full_name":"Van Haperen, Johanna","first_name":"Johanna","last_name":"Van Haperen"},{"id":"33A3C818-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1923-2410","first_name":"Candela","last_name":"Cuesta","full_name":"Cuesta, Candela"},{"first_name":"Klára","last_name":"Hoyerová","full_name":"Hoyerová, Klára"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"orcid":"0000-0001-5227-5741","id":"3F45B078-F248-11E8-B48F-1D18A9856A87","last_name":"Marhavy","first_name":"Peter","full_name":"Marhavy, Peter"},{"orcid":"0000-0001-7263-0560","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","last_name":"Wabnik","first_name":"Krzysztof T","full_name":"Wabnik, Krzysztof T"},{"full_name":"Van Breusegem, Frank","first_name":"Frank","last_name":"Van Breusegem"},{"first_name":"Moritz","last_name":"Nowack","full_name":"Nowack, Moritz"},{"full_name":"Murphy, Angus","first_name":"Angus","last_name":"Murphy"},{"full_name":"Friml, Jiřĺ","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiřĺ"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"full_name":"Beeckman, Tom","last_name":"Beeckman","first_name":"Tom"},{"first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva"}],"date_updated":"2021-01-12T06:52:11Z","date_created":"2018-12-11T11:53:12Z","volume":6,"year":"2015","acknowledgement":"This work was supported by the European Research Council Starting Independent Research grant (ERC-2007-Stg-207362-HCPO to E.B., M.S., C.C.), by the Ghent University Multidisciplinary Research Partnership ‘Biotechnology for a Sustainable Economy’ no.01MRB510W, by the Research Foundation—Flanders (grant 3G033711 to J.-A.O.), by the Austrian Science Fund (FWF01_I1774S) to K.Ö.,E.B., and by the Interuniversity Attraction Poles Programme (IUAP P7/29 ‘MARS’) initiated by the Belgian Science Policy Office. I.D.C. and S.V. are post-doctoral fellows of the Research Foundation—Flanders (FWO). This research was supported by the Scientific Service Units (SSU) of IST-Austria through resources provided by the Bioimaging Facility (BIF), the Life Science Facility (LSF).","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:45:08Z","publist_id":"5513","ec_funded":1,"article_number":"8717"},{"external_id":{"arxiv":["1305.4519"]},"oa":1,"quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"doi":"10.37236/5002","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"eissn":["1077-8926"]},"year":"2015","acknowledgement":"e research leading to these results has received funding fromthe People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme(FP7/2007-2013) under REA grant agreement no [291734], and ESF Eurogiga project GraDR as GAˇCRGIG/11/E023.","publication_status":"published","publisher":"Electronic Journal of Combinatorics","department":[{"_id":"UlWa"}],"author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav"},{"full_name":"Kynčl, Jan","last_name":"Kynčl","first_name":"Jan"},{"first_name":"Igor","last_name":"Malinovič","full_name":"Malinovič, Igor"},{"full_name":"Pálvölgyi, Dömötör","first_name":"Dömötör","last_name":"Pálvölgyi"}],"related_material":{"record":[{"id":"10793","relation":"earlier_version","status":"public"}]},"date_created":"2018-12-11T11:53:12Z","date_updated":"2023-02-21T16:03:02Z","volume":22,"article_number":"P4.24 ","file_date_updated":"2020-07-14T12:45:08Z","publist_id":"5511","ec_funded":1,"publication":"Electronic Journal of Combinatorics","citation":{"ista":"Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), P4.24.","apa":"Fulek, R., Kynčl, J., Malinovič, I., & Pálvölgyi, D. (2015). Clustered planarity testing revisited. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/5002","ieee":"R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.","ama":"Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 2015;22(4). doi:10.37236/5002","chicago":"Fulek, Radoslav, Jan Kynčl, Igor Malinovič, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2015. https://doi.org/10.37236/5002.","mla":"Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” Electronic Journal of Combinatorics, vol. 22, no. 4, P4.24, Electronic Journal of Combinatorics, 2015, doi:10.37236/5002.","short":"R. Fulek, J. Kynčl, I. Malinovič, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015)."},"article_type":"original","date_published":"2015-11-13T00:00:00Z","scopus_import":"1","day":"13","has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1642","ddc":["514","516"],"status":"public","title":"Clustered planarity testing revisited","intvolume":" 22","pubrep_id":"714","file":[{"file_id":"5120","relation":"main_file","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:15:03Z","checksum":"40b5920b49ee736694f59f39588ee206","file_name":"IST-2016-714-v1+1_5002-15499-3-PB.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":443655}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"The Hanani-Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani-Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati proved that clustered planarity of embedded clustered graphs whose every face is incident to at most five vertices can be tested in polynomial time. We give a new and short proof of this result, using the matroid intersection algorithm."}],"issue":"4"},{"publication":"ESAIM: Mathematical Modelling and Numerical Analysis","citation":{"ama":"Maas J, Rumpf M, Schönlieb C, Simon S. A generalized model for optimal transport of images including dissipation and density modulation. ESAIM: Mathematical Modelling and Numerical Analysis. 2015;49(6):1745-1769. doi:10.1051/m2an/2015043","ista":"Maas J, Rumpf M, Schönlieb C, Simon S. 2015. A generalized model for optimal transport of images including dissipation and density modulation. ESAIM: Mathematical Modelling and Numerical Analysis. 49(6), 1745–1769.","apa":"Maas, J., Rumpf, M., Schönlieb, C., & Simon, S. (2015). A generalized model for optimal transport of images including dissipation and density modulation. ESAIM: Mathematical Modelling and Numerical Analysis. EDP Sciences. https://doi.org/10.1051/m2an/2015043","ieee":"J. Maas, M. Rumpf, C. Schönlieb, and S. Simon, “A generalized model for optimal transport of images including dissipation and density modulation,” ESAIM: Mathematical Modelling and Numerical Analysis, vol. 49, no. 6. EDP Sciences, pp. 1745–1769, 2015.","mla":"Maas, Jan, et al. “A Generalized Model for Optimal Transport of Images Including Dissipation and Density Modulation.” ESAIM: Mathematical Modelling and Numerical Analysis, vol. 49, no. 6, EDP Sciences, 2015, pp. 1745–69, doi:10.1051/m2an/2015043.","short":"J. Maas, M. Rumpf, C. Schönlieb, S. Simon, ESAIM: Mathematical Modelling and Numerical Analysis 49 (2015) 1745–1769.","chicago":"Maas, Jan, Martin Rumpf, Carola Schönlieb, and Stefan Simon. “A Generalized Model for Optimal Transport of Images Including Dissipation and Density Modulation.” ESAIM: Mathematical Modelling and Numerical Analysis. EDP Sciences, 2015. https://doi.org/10.1051/m2an/2015043."},"page":"1745 - 1769","date_published":"2015-11-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1639","status":"public","title":"A generalized model for optimal transport of images including dissipation and density modulation","intvolume":" 49","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"In this paper the optimal transport and the metamorphosis perspectives are combined. For a pair of given input images geodesic paths in the space of images are defined as minimizers of a resulting path energy. To this end, the underlying Riemannian metric measures the rate of transport cost and the rate of viscous dissipation. Furthermore, the model is capable to deal with strongly varying image contrast and explicitly allows for sources and sinks in the transport equations which are incorporated in the metric related to the metamorphosis approach by Trouvé and Younes. In the non-viscous case with source term existence of geodesic paths is proven in the space of measures. The proposed model is explored on the range from merely optimal transport to strongly dissipative dynamics. For this model a robust and effective variational time discretization of geodesic paths is proposed. This requires to minimize a discrete path energy consisting of a sum of consecutive image matching functionals. These functionals are defined on corresponding pairs of intensity functions and on associated pairwise matching deformations. Existence of time discrete geodesics is demonstrated. Furthermore, a finite element implementation is proposed and applied to instructive test cases and to real images. In the non-viscous case this is compared to the algorithm proposed by Benamou and Brenier including a discretization of the source term. Finally, the model is generalized to define discrete weighted barycentres with applications to textures and objects.","lang":"eng"}],"issue":"6","main_file_link":[{"url":"http://arxiv.org/abs/1504.01988","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1504.01988"]},"quality_controlled":"1","doi":"10.1051/m2an/2015043","language":[{"iso":"eng"}],"month":"11","year":"2015","acknowledgement":"The authors acknowledge support of the Collaborative Research Centre 1060 funded by the German Science foundation. This work is further supported by the King Abdullah University for Science and Technology (KAUST) Award No. KUK-I1-007-43 and the EPSRC grant Nr. EP/M00483X/1.","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"EDP Sciences","author":[{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas","full_name":"Maas, Jan"},{"full_name":"Rumpf, Martin","last_name":"Rumpf","first_name":"Martin"},{"full_name":"Schönlieb, Carola","first_name":"Carola","last_name":"Schönlieb"},{"full_name":"Simon, Stefan","last_name":"Simon","first_name":"Stefan"}],"date_updated":"2021-01-12T06:52:10Z","date_created":"2018-12-11T11:53:11Z","volume":49,"publist_id":"5514"},{"month":"05","day":"22","scopus_import":1,"date_published":"2015-05-22T00:00:00Z","doi":"10.1038/nrm3997","language":[{"iso":"eng"}],"citation":{"chicago":"Sazanov, Leonid A. “A Giant Molecular Proton Pump: Structure and Mechanism of Respiratory Complex I.” Nature Reviews Molecular Cell Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nrm3997.","mla":"Sazanov, Leonid A. “A Giant Molecular Proton Pump: Structure and Mechanism of Respiratory Complex I.” Nature Reviews Molecular Cell Biology, vol. 16, no. 6, Nature Publishing Group, 2015, pp. 375–88, doi:10.1038/nrm3997.","short":"L.A. Sazanov, Nature Reviews Molecular Cell Biology 16 (2015) 375–388.","ista":"Sazanov LA. 2015. A giant molecular proton pump: structure and mechanism of respiratory complex I. Nature Reviews Molecular Cell Biology. 16(6), 375–388.","ieee":"L. A. Sazanov, “A giant molecular proton pump: structure and mechanism of respiratory complex I,” Nature Reviews Molecular Cell Biology, vol. 16, no. 6. Nature Publishing Group, pp. 375–388, 2015.","apa":"Sazanov, L. A. (2015). A giant molecular proton pump: structure and mechanism of respiratory complex I. Nature Reviews Molecular Cell Biology. Nature Publishing Group. https://doi.org/10.1038/nrm3997","ama":"Sazanov LA. A giant molecular proton pump: structure and mechanism of respiratory complex I. Nature Reviews Molecular Cell Biology. 2015;16(6):375-388. doi:10.1038/nrm3997"},"publication":"Nature Reviews Molecular Cell Biology","page":"375 - 388","quality_controlled":"1","publist_id":"5517","issue":"6","abstract":[{"lang":"eng","text":"The mitochondrial respiratory chain, also known as the electron transport chain (ETC), is crucial to life, and energy production in the form of ATP is the main mitochondrial function. Three proton-translocating enzymes of the ETC, namely complexes I, III and IV, generate proton motive force, which in turn drives ATP synthase (complex V). The atomic structures and basic mechanisms of most respiratory complexes have previously been established, with the exception of complex I, the largest complex in the ETC. Recently, the crystal structure of the entire complex I was solved using a bacterial enzyme. The structure provided novel insights into the core architecture of the complex, the electron transfer and proton translocation pathways, as well as the mechanism that couples these two processes."}],"type":"journal_article","author":[{"full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov"}],"oa_version":"None","volume":16,"date_created":"2018-12-11T11:53:11Z","date_updated":"2021-01-12T06:52:10Z","year":"2015","_id":"1638","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Nature Publishing Group","department":[{"_id":"LeSa"}],"intvolume":" 16","publication_status":"published","title":"A giant molecular proton pump: structure and mechanism of respiratory complex I","status":"public"},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/180"}],"project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"quality_controlled":"1","doi":"10.1007/978-3-662-46497-7_2","conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2015-03-23","location":"Warsaw, Poland","end_date":"2015-03-25"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-662-46496-0"]},"month":"03","year":"2015","publisher":"Springer Nature","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"last_name":"Banerjee","first_name":"Abishek","full_name":"Banerjee, Abishek"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg","full_name":"Fuchsbauer, Georg"},{"last_name":"Peikert","first_name":"Chris","full_name":"Peikert, Chris"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Sophie","last_name":"Stevens","full_name":"Stevens, Sophie"}],"volume":9015,"date_created":"2018-12-11T11:53:14Z","date_updated":"2022-02-03T08:41:46Z","ec_funded":1,"publist_id":"5505","file_date_updated":"2020-07-14T12:45:08Z","citation":{"ista":"Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. 2015. Key-homomorphic constrained pseudorandom functions. 12th Theory of Cryptography Conference. TCC: Theory of Cryptography Conference, LNCS, vol. 9015, 31–60.","ieee":"A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic constrained pseudorandom functions,” in 12th Theory of Cryptography Conference, Warsaw, Poland, 2015, vol. 9015, pp. 31–60.","apa":"Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K. Z., & Stevens, S. (2015). Key-homomorphic constrained pseudorandom functions. In 12th Theory of Cryptography Conference (Vol. 9015, pp. 31–60). Warsaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-46497-7_2","ama":"Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. Key-homomorphic constrained pseudorandom functions. In: 12th Theory of Cryptography Conference. Vol 9015. Springer Nature; 2015:31-60. doi:10.1007/978-3-662-46497-7_2","chicago":"Banerjee, Abishek, Georg Fuchsbauer, Chris Peikert, Krzysztof Z Pietrzak, and Sophie Stevens. “Key-Homomorphic Constrained Pseudorandom Functions.” In 12th Theory of Cryptography Conference, 9015:31–60. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-46497-7_2.","mla":"Banerjee, Abishek, et al. “Key-Homomorphic Constrained Pseudorandom Functions.” 12th Theory of Cryptography Conference, vol. 9015, Springer Nature, 2015, pp. 31–60, doi:10.1007/978-3-662-46497-7_2.","short":"A. Banerjee, G. Fuchsbauer, C. Peikert, K.Z. Pietrzak, S. Stevens, in:, 12th Theory of Cryptography Conference, Springer Nature, 2015, pp. 31–60."},"publication":"12th Theory of Cryptography Conference","page":"31 - 60","date_published":"2015-03-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"1646","intvolume":" 9015","status":"public","title":"Key-homomorphic constrained pseudorandom functions","ddc":["000","004"],"pubrep_id":"679","file":[{"file_id":"5136","relation":"main_file","checksum":"3c5093bda5783c89beaacabf1aa0e60e","date_created":"2018-12-12T10:15:17Z","date_updated":"2020-07-14T12:45:08Z","access_level":"open_access","file_name":"IST-2016-679-v1+1_180.pdf","creator":"system","content_type":"application/pdf","file_size":450665}],"oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"A pseudorandom function (PRF) is a keyed function F : K × X → Y where, for a random key k ∈ K, the function F(k, ·) is indistinguishable from a uniformly random function, given black-box access. A key-homomorphic PRF has the additional feature that for any keys k, k' and any input x, we have F(k+k', x) = F(k, x)⊕F(k', x) for some group operations +,⊕ on K and Y, respectively. A constrained PRF for a family of setsS ⊆ P(X) has the property that, given any key k and set S ∈ S, one can efficiently compute a “constrained” key kS that enables evaluation of F(k, x) on all inputs x ∈ S, while the values F(k, x) for x /∈ S remain pseudorandom even given kS. In this paper we construct PRFs that are simultaneously constrained and key homomorphic, where the homomorphic property holds even for constrained keys. We first show that the multilinear map-based bit-fixing and circuit-constrained PRFs of Boneh and Waters (Asiacrypt 2013) can be modified to also be keyhomomorphic. We then show that the LWE-based key-homomorphic PRFs of Banerjee and Peikert (Crypto 2014) are essentially already prefix-constrained PRFs, using a (non-obvious) definition of constrained keys and associated group operation. Moreover, the constrained keys themselves are pseudorandom, and the constraining and evaluation functions can all be computed in low depth. As an application of key-homomorphic constrained PRFs,we construct a proxy re-encryption schemewith fine-grained access control. This scheme allows storing encrypted data on an untrusted server, where each file can be encrypted relative to some attributes, so that only parties whose constrained keys match the attributes can decrypt. Moreover, the server can re-key (arbitrary subsets of) the ciphertexts without learning anything about the plaintexts, thus permitting efficient and finegrained revocation."}]},{"abstract":[{"lang":"eng","text":"Generalized Selective Decryption (GSD), introduced by Panjwani [TCC’07], is a game for a symmetric encryption scheme Enc that captures the difficulty of proving adaptive security of certain protocols, most notably the Logical Key Hierarchy (LKH) multicast encryption protocol. In the GSD game there are n keys k1,..., kn, which the adversary may adaptively corrupt (learn); moreover, it can ask for encryptions Encki (kj) of keys under other keys. The adversary’s task is to distinguish keys (which it cannot trivially compute) from random. Proving the hardness of GSD assuming only IND-CPA security of Enc is surprisingly hard. Using “complexity leveraging” loses a factor exponential in n, which makes the proof practically meaningless. We can think of the GSD game as building a graph on n vertices, where we add an edge i → j when the adversary asks for an encryption of kj under ki. If restricted to graphs of depth ℓ, Panjwani gave a reduction that loses only a factor exponential in ℓ (not n). To date, this is the only non-trivial result known for GSD. In this paper we give almost-polynomial reductions for large classes of graphs. Most importantly, we prove the security of the GSD game restricted to trees losing only a quasi-polynomial factor n3 log n+5. Trees are an important special case capturing real-world protocols like the LKH protocol. Our new bound improves upon Panjwani’s on some LKH variants proposed in the literature where the underlying tree is not balanced. Our proof builds on ideas from the “nested hybrids” technique recently introduced by Fuchsbauer et al. [Asiacrypt’14] for proving the adaptive security of constrained PRFs."}],"type":"conference","alternative_title":["LNCS"],"pubrep_id":"674","oa_version":"Submitted Version","file":[{"creator":"system","content_type":"application/pdf","file_size":505618,"file_name":"IST-2016-674-v1+1_389.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:13:31Z","checksum":"99b76b3263d5082554d0a9cbdeca3a22","file_id":"5015","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1648","intvolume":" 9215","title":"A quasipolynomial reduction for generalized selective decryption on trees","ddc":["004"],"status":"public","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2015-08-01T00:00:00Z","citation":{"short":"G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.","mla":"Fuchsbauer, Georg, et al. A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. Vol. 9215, Springer, 2015, pp. 601–20, doi:10.1007/978-3-662-47989-6_29.","chicago":"Fuchsbauer, Georg, Zahra Jafargholi, and Krzysztof Z Pietrzak. “A Quasipolynomial Reduction for Generalized Selective Decryption on Trees,” 9215:601–20. Springer, 2015. https://doi.org/10.1007/978-3-662-47989-6_29.","ama":"Fuchsbauer G, Jafargholi Z, Pietrzak KZ. A quasipolynomial reduction for generalized selective decryption on trees. In: Vol 9215. Springer; 2015:601-620. doi:10.1007/978-3-662-47989-6_29","apa":"Fuchsbauer, G., Jafargholi, Z., & Pietrzak, K. Z. (2015). A quasipolynomial reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer. https://doi.org/10.1007/978-3-662-47989-6_29","ieee":"G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction for generalized selective decryption on trees,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.","ista":"Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction for generalized selective decryption on trees. CRYPTO: International Cryptology Conference, LNCS, vol. 9215, 601–620."},"page":"601 - 620","publist_id":"5502","ec_funded":1,"file_date_updated":"2020-07-14T12:45:08Z","author":[{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"},{"last_name":"Jafargholi","first_name":"Zahra","full_name":"Jafargholi, Zahra"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"}],"volume":9215,"date_created":"2018-12-11T11:53:14Z","date_updated":"2021-01-12T06:52:14Z","year":"2015","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","month":"08","doi":"10.1007/978-3-662-47989-6_29","conference":{"name":"CRYPTO: International Cryptology Conference","end_date":"2015-08-20","location":"Santa Barbara, CA, USA","start_date":"2015-08-16"},"language":[{"iso":"eng"}],"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"},"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1"},{"month":"01","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-319-24174-6_16","conference":{"location":"Vienna, Austria","start_date":"2015-09-21","end_date":"2015-09-25","name":"ESORICS: European Symposium on Research in Computer Security"},"language":[{"iso":"eng"}],"publist_id":"5501","ec_funded":1,"file_date_updated":"2020-07-14T12:45:08Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","year":"2015","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"full_name":"Benhamouda, Fabrice","last_name":"Benhamouda","first_name":"Fabrice"},{"full_name":"Krenn, Stephan","last_name":"Krenn","first_name":"Stephan"},{"full_name":"Lyubashevsky, Vadim","last_name":"Lyubashevsky","first_name":"Vadim"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"volume":9326,"date_updated":"2021-01-12T06:52:14Z","date_created":"2018-12-11T11:53:15Z","scopus_import":1,"series_title":"Lecture Notes in Computer Science","has_accepted_license":"1","day":"01","citation":{"ista":"Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 9326, 305–325.","apa":"Benhamouda, F., Krenn, S., Lyubashevsky, V., & Pietrzak, K. Z. (2015). Efficient zero-knowledge proofs for commitments from learning with errors over rings. Presented at the ESORICS: European Symposium on Research in Computer Security, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-24174-6_16","ieee":"F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.","ama":"Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 2015;9326:305-325. doi:10.1007/978-3-319-24174-6_16","chicago":"Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-24174-6_16.","mla":"Benhamouda, Fabrice, et al. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. Vol. 9326, Springer, 2015, pp. 305–25, doi:10.1007/978-3-319-24174-6_16.","short":"F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325."},"page":"305 - 325","date_published":"2015-01-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge. Our scheme maps elements from the ring (or equivalently, n elements from ","lang":"eng"}],"_id":"1649","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9326","status":"public","title":"Efficient zero-knowledge proofs for commitments from learning with errors over rings","ddc":["000","004"],"pubrep_id":"678","file":[{"creator":"system","file_size":494239,"content_type":"application/pdf","file_name":"IST-2016-678-v1+1_889.pdf","access_level":"open_access","date_created":"2018-12-12T10:11:28Z","date_updated":"2020-07-14T12:45:08Z","checksum":"6eac4a485b2aa644b2d3f753ed0b280b","file_id":"4883","relation":"main_file"}],"oa_version":"Published Version"},{"doi":"10.1007/978-3-319-17470-9_10","conference":{"start_date":"2015-05-02","location":"Lugano, Switzerland","end_date":"2015-05-05","name":"ICITS: International Conference on Information Theoretic Security"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2015/315"}],"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":[{"full_name":"Demay, Grégory","last_name":"Demay","first_name":"Grégory"},{"first_name":"Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"full_name":"Maurer, Ueli","last_name":"Maurer","first_name":"Ueli"},{"last_name":"Tackmann","first_name":"Björn","full_name":"Tackmann, Björn"}],"volume":9063,"date_updated":"2021-01-12T06:52:13Z","date_created":"2018-12-11T11:53:13Z","year":"2015","department":[{"_id":"KrPi"}],"publisher":"Springer","publication_status":"published","publist_id":"5507","ec_funded":1,"date_published":"2015-01-01T00:00:00Z","citation":{"chicago":"Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Query-Complexity Amplification for Random Oracles,” 9063:159–80. Springer, 2015. https://doi.org/10.1007/978-3-319-17470-9_10.","mla":"Demay, Grégory, et al. Query-Complexity Amplification for Random Oracles. Vol. 9063, Springer, 2015, pp. 159–80, doi:10.1007/978-3-319-17470-9_10.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, Springer, 2015, pp. 159–180.","ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2015. Query-complexity amplification for random oracles. ICITS: International Conference on Information Theoretic Security, LNCS, vol. 9063, 159–180.","apa":"Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2015). Query-complexity amplification for random oracles (Vol. 9063, pp. 159–180). Presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland: Springer. https://doi.org/10.1007/978-3-319-17470-9_10","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Query-complexity amplification for random oracles,” presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland, 2015, vol. 9063, pp. 159–180.","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Query-complexity amplification for random oracles. In: Vol 9063. Springer; 2015:159-180. doi:10.1007/978-3-319-17470-9_10"},"page":"159 - 180","day":"01","scopus_import":1,"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1644","intvolume":" 9063","status":"public","title":"Query-complexity amplification for random oracles","abstract":[{"lang":"eng","text":"Increasing the computational complexity of evaluating a hash function, both for the honest users as well as for an adversary, is a useful technique employed for example in password-based cryptographic schemes to impede brute-force attacks, and also in so-called proofs of work (used in protocols like Bitcoin) to show that a certain amount of computation was performed by a legitimate user. A natural approach to adjust the complexity of a hash function is to iterate it c times, for some parameter c, in the hope that any query to the scheme requires c evaluations of the underlying hash function. However, results by Dodis et al. (Crypto 2012) imply that plain iteration falls short of achieving this goal, and designing schemes which provably have such a desirable property remained an open problem. This paper formalizes explicitly what it means for a given scheme to amplify the query complexity of a hash function. In the random oracle model, the goal of a secure query-complexity amplifier (QCA) scheme is captured as transforming, in the sense of indifferentiability, a random oracle allowing R queries (for the adversary) into one provably allowing only r < R queries. Turned around, this means that making r queries to the scheme requires at least R queries to the actual random oracle. Second, a new scheme, called collision-free iteration, is proposed and proven to achieve c-fold QCA for both the honest parties and the adversary, for any fixed parameter c."}],"type":"conference","alternative_title":["LNCS"]},{"abstract":[{"lang":"eng","text":"Round-optimal blind signatures are notoriously hard to construct in the standard model, especially in the malicious-signer model, where blindness must hold under adversarially chosen keys. This is substantiated by several impossibility results. The only construction that can be termed theoretically efficient, by Garg and Gupta (Eurocrypt’14), requires complexity leveraging, inducing an exponential security loss. We present a construction of practically efficient round-optimal blind signatures in the standard model. It is conceptually simple and builds on the recent structure-preserving signatures on equivalence classes (SPSEQ) from Asiacrypt’14. While the traditional notion of blindness follows from standard assumptions, we prove blindness under adversarially chosen keys under an interactive variant of DDH. However, we neither require non-uniform assumptions nor complexity leveraging. We then show how to extend our construction to partially blind signatures and to blind signatures on message vectors, which yield a construction of one-show anonymous credentials à la “anonymous credentials light” (CCS’13) in the standard model. Furthermore, we give the first SPS-EQ construction under noninteractive assumptions and show how SPS-EQ schemes imply conventional structure-preserving signatures, which allows us to apply optimality results for the latter to SPS-EQ."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1647","intvolume":" 9216","status":"public","title":"Practical round-optimal blind signatures in the standard model","article_processing_charge":"No","day":"01","scopus_import":1,"date_published":"2015-08-01T00:00:00Z","citation":{"ieee":"G. Fuchsbauer, C. Hanser, and D. Slamanig, “Practical round-optimal blind signatures in the standard model,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 233–253.","apa":"Fuchsbauer, G., Hanser, C., & Slamanig, D. (2015). Practical round-optimal blind signatures in the standard model (Vol. 9216, pp. 233–253). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_12","ista":"Fuchsbauer G, Hanser C, Slamanig D. 2015. Practical round-optimal blind signatures in the standard model. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 233–253.","ama":"Fuchsbauer G, Hanser C, Slamanig D. Practical round-optimal blind signatures in the standard model. In: Vol 9216. Springer; 2015:233-253. doi:10.1007/978-3-662-48000-7_12","chicago":"Fuchsbauer, Georg, Christian Hanser, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model,” 9216:233–53. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_12.","short":"G. Fuchsbauer, C. Hanser, D. Slamanig, in:, Springer, 2015, pp. 233–253.","mla":"Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the Standard Model. Vol. 9216, Springer, 2015, pp. 233–53, doi:10.1007/978-3-662-48000-7_12."},"page":"233 - 253","ec_funded":1,"publist_id":"5503","related_material":{"record":[{"status":"public","relation":"later_version","id":"1225"}]},"author":[{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg","full_name":"Fuchsbauer, Georg"},{"full_name":"Hanser, Christian","last_name":"Hanser","first_name":"Christian"},{"full_name":"Slamanig, Daniel","first_name":"Daniel","last_name":"Slamanig"}],"volume":9216,"date_updated":"2023-02-21T16:44:51Z","date_created":"2018-12-11T11:53:14Z","year":"2015","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","month":"08","doi":"10.1007/978-3-662-48000-7_12","conference":{"location":"Santa Barbara, CA, United States","start_date":"2015-08-16","end_date":"2015-08-20","name":"CRYPTO: International Cryptology Conference"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/626.pdf"}],"oa":1,"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"Secret-key constructions are often proved secure in a model where one or more underlying components are replaced by an idealized oracle accessible to the attacker. This model gives rise to information-theoretic security analyses, and several advances have been made in this area over the last few years. This paper provides a systematic overview of what is achievable in this model, and how existing works fit into this view."}],"ec_funded":1,"publist_id":"5506","article_number":"7133163","type":"conference","author":[{"full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter"},{"last_name":"Tessaro","first_name":"Stefano","full_name":"Tessaro, Stefano"}],"date_created":"2018-12-11T11:53:13Z","date_updated":"2021-01-12T06:52:13Z","oa_version":"None","_id":"1645","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publication_status":"published","status":"public","title":"Secret-key cryptography from ideal primitives: A systematic verview","department":[{"_id":"KrPi"}],"publisher":"IEEE","month":"06","day":"24","scopus_import":1,"conference":{"name":"ITW 2015: IEEE Information Theory Workshop","end_date":"2015-05-01","start_date":"2015-04-26","location":"Jerusalem, Israel"},"date_published":"2015-06-24T00:00:00Z","doi":"10.1109/ITW.2015.7133163","language":[{"iso":"eng"}],"publication":"2015 IEEE Information Theory Workshop","citation":{"ama":"Gazi P, Tessaro S. Secret-key cryptography from ideal primitives: A systematic verview. In: 2015 IEEE Information Theory Workshop. IEEE; 2015. doi:10.1109/ITW.2015.7133163","ista":"Gazi P, Tessaro S. 2015. Secret-key cryptography from ideal primitives: A systematic verview. 2015 IEEE Information Theory Workshop. ITW 2015: IEEE Information Theory Workshop, 7133163.","ieee":"P. Gazi and S. Tessaro, “Secret-key cryptography from ideal primitives: A systematic verview,” in 2015 IEEE Information Theory Workshop, Jerusalem, Israel, 2015.","apa":"Gazi, P., & Tessaro, S. (2015). Secret-key cryptography from ideal primitives: A systematic verview. In 2015 IEEE Information Theory Workshop. Jerusalem, Israel: IEEE. https://doi.org/10.1109/ITW.2015.7133163","mla":"Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.” 2015 IEEE Information Theory Workshop, 7133163, IEEE, 2015, doi:10.1109/ITW.2015.7133163.","short":"P. Gazi, S. Tessaro, in:, 2015 IEEE Information Theory Workshop, IEEE, 2015.","chicago":"Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.” In 2015 IEEE Information Theory Workshop. IEEE, 2015. https://doi.org/10.1109/ITW.2015.7133163."},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}]},{"series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"30","has_accepted_license":"1","page":"85 - 109","citation":{"chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security of NMAC and HMAC with Input Whitening.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48800-3_4.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.","mla":"Gazi, Peter, et al. Generic Security of NMAC and HMAC with Input Whitening. Vol. 9453, Springer, 2015, pp. 85–109, doi:10.1007/978-3-662-48800-3_4.","apa":"Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). Generic security of NMAC and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48800-3_4","ieee":"P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.","ista":"Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with input whitening. 9453, 85–109.","ama":"Gazi P, Pietrzak KZ, Tessaro S. Generic security of NMAC and HMAC with input whitening. 2015;9453:85-109. doi:10.1007/978-3-662-48800-3_4"},"date_published":"2015-12-30T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"HMAC and its variant NMAC are the most popular approaches to deriving a MAC (and more generally, a PRF) from a cryptographic hash function. Despite nearly two decades of research, their exact security still remains far from understood in many different contexts. Indeed, recent works have re-surfaced interest for {\\em generic} attacks, i.e., attacks that treat the compression function of the underlying hash function as a black box.\r\n\r\nGeneric security can be proved in a model where the underlying compression function is modeled as a random function -- yet, to date, the question of proving tight, non-trivial bounds on the generic security of HMAC/NMAC even as a PRF remains a challenging open question.\r\n\r\nIn this paper, we ask the question of whether a small modification to HMAC and NMAC can allow us to exactly characterize the security of the resulting constructions, while only incurring little penalty with respect to efficiency. To this end, we present simple variants of NMAC and HMAC, for which we prove tight bounds on the generic PRF security, expressed in terms of numbers of construction and compression function queries necessary to break the construction. All of our constructions are obtained via a (near) {\\em black-box} modification of NMAC and HMAC, which can be interpreted as an initial step of key-dependent message pre-processing.\r\n\r\nWhile our focus is on PRF security, a further attractive feature of our new constructions is that they clearly defeat all recent generic attacks against properties such as state recovery and universal forgery. These exploit properties of the so-called ``functional graph'' which are not directly accessible in our new constructions. ","lang":"eng"}],"title":"Generic security of NMAC and HMAC with input whitening","status":"public","ddc":["004","005"],"intvolume":" 9453","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1654","file":[{"relation":"main_file","file_id":"4732","checksum":"d1e53203db2d8573a560995ccdffac62","date_created":"2018-12-12T10:09:09Z","date_updated":"2020-07-14T12:45:08Z","access_level":"open_access","file_name":"IST-2016-676-v1+1_881.pdf","content_type":"application/pdf","file_size":512071,"creator":"system"}],"oa_version":"Submitted Version","pubrep_id":"676","month":"12","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Auckland, New Zealand","start_date":"2015-11-29","end_date":"2015-12-03","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"doi":"10.1007/978-3-662-48800-3_4","file_date_updated":"2020-07-14T12:45:08Z","publist_id":"5496","ec_funded":1,"publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2015","date_created":"2018-12-11T11:53:17Z","date_updated":"2021-01-12T06:52:16Z","volume":9453,"author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter","full_name":"Gazi, Peter"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}]},{"file_date_updated":"2020-07-14T12:45:08Z","ec_funded":1,"publist_id":"5500","author":[{"last_name":"Skórski","first_name":"Maciej","full_name":"Skórski, Maciej"},{"first_name":"Alexander","last_name":"Golovnev","full_name":"Golovnev, Alexander"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"date_updated":"2021-01-12T06:52:15Z","date_created":"2018-12-11T11:53:15Z","volume":9134,"year":"2015","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"month":"06","conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan"},"doi":"10.1007/978-3-662-47672-7_85","language":[{"iso":"eng"}],"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"},"quality_controlled":"1","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"abstract":[{"lang":"eng","text":"We consider the task of deriving a key with high HILL entropy (i.e., being computationally indistinguishable from a key with high min-entropy) from an unpredictable source.\r\n\r\nPrevious to this work, the only known way to transform unpredictability into a key that was ϵ indistinguishable from having min-entropy was via pseudorandomness, for example by Goldreich-Levin (GL) hardcore bits. This approach has the inherent limitation that from a source with k bits of unpredictability entropy one can derive a key of length (and thus HILL entropy) at most k−2log(1/ϵ) bits. In many settings, e.g. when dealing with biometric data, such a 2log(1/ϵ) bit entropy loss in not an option. Our main technical contribution is a theorem that states that in the high entropy regime, unpredictability implies HILL entropy. Concretely, any variable K with |K|−d bits of unpredictability entropy has the same amount of so called metric entropy (against real-valued, deterministic distinguishers), which is known to imply the same amount of HILL entropy. The loss in circuit size in this argument is exponential in the entropy gap d, and thus this result only applies for small d (i.e., where the size of distinguishers considered is exponential in d).\r\n\r\nTo overcome the above restriction, we investigate if it’s possible to first “condense” unpredictability entropy and make the entropy gap small. We show that any source with k bits of unpredictability can be condensed into a source of length k with k−3 bits of unpredictability entropy. Our condenser simply “abuses" the GL construction and derives a k bit key from a source with k bits of unpredicatibily. The original GL theorem implies nothing when extracting that many bits, but we show that in this regime, GL still behaves like a “condenser" for unpredictability. This result comes with two caveats (1) the loss in circuit size is exponential in k and (2) we require that the source we start with has no HILL entropy (equivalently, one can efficiently check if a guess is correct). We leave it as an intriguing open problem to overcome these restrictions or to prove they’re inherent."}],"type":"conference","alternative_title":["LNCS"],"pubrep_id":"675","oa_version":"Published Version","file":[{"checksum":"e808c7eecb631336fc9f9bf2e8d4ecae","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:08:32Z","relation":"main_file","file_id":"4693","content_type":"application/pdf","file_size":525503,"creator":"system","access_level":"open_access","file_name":"IST-2016-675-v1+1_384.pdf"}],"_id":"1650","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"title":"Condensed unpredictability ","status":"public","intvolume":" 9134","day":"20","has_accepted_license":"1","scopus_import":1,"date_published":"2015-06-20T00:00:00Z","citation":{"ama":"Skórski M, Golovnev A, Pietrzak KZ. Condensed unpredictability . In: Vol 9134. Springer; 2015:1046-1057. doi:10.1007/978-3-662-47672-7_85","ista":"Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP: Automata, Languages and Programming, LNCS, vol. 9134, 1046–1057.","apa":"Skórski, M., Golovnev, A., & Pietrzak, K. Z. (2015). Condensed unpredictability (Vol. 9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47672-7_85","ieee":"M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability ,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 1046–1057.","mla":"Skórski, Maciej, et al. Condensed Unpredictability . Vol. 9134, Springer, 2015, pp. 1046–57, doi:10.1007/978-3-662-47672-7_85.","short":"M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.","chicago":"Skórski, Maciej, Alexander Golovnev, and Krzysztof Z Pietrzak. “Condensed Unpredictability ,” 9134:1046–57. Springer, 2015. https://doi.org/10.1007/978-3-662-47672-7_85."},"page":"1046 - 1057"},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Cryptographic e-cash allows off-line electronic transactions between a bank, users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions has been proposed in the literature; however, these traditional e-cash schemes only allow coins to be transferred once between users and merchants. Ideally, we would like users to be able to transfer coins between each other multiple times before deposit, as happens with physical cash. “Transferable” e-cash schemes are the solution to this problem. Unfortunately, the currently proposed schemes are either completely impractical or do not achieve the desirable anonymity properties without compromises, such as assuming the existence of a trusted “judge” who can trace all coins and users in the system. This paper presents the first efficient and fully anonymous transferable e-cash scheme without any trusted third parties. We start by revising the security and anonymity properties of transferable e-cash to capture issues that were previously overlooked. For our construction we use the recently proposed malleable signatures by Chase et al. to allow the secure and anonymous transfer of coins, combined with a new efficient double-spending detection mechanism. Finally, we discuss an instantiation of our construction."}],"title":"Anonymous transferable e-cash","status":"public","intvolume":" 9020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1651","oa_version":"Published Version","scopus_import":"1","day":"17","article_processing_charge":"No","page":"101 - 124","publication":"Public-Key Cryptography - PKC 2015","citation":{"ama":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. Anonymous transferable e-cash. In: Public-Key Cryptography - PKC 2015. Vol 9020. Springer; 2015:101-124. doi:10.1007/978-3-662-46447-2_5","ista":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable e-cash. Public-Key Cryptography - PKC 2015. PKC: Public Key Crypography, LNCS, vol. 9020, 101–124.","apa":"Baldimtsi, F., Chase, M., Fuchsbauer, G., & Kohlweiss, M. (2015). Anonymous transferable e-cash. In Public-Key Cryptography - PKC 2015 (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer. https://doi.org/10.1007/978-3-662-46447-2_5","ieee":"F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable e-cash,” in Public-Key Cryptography - PKC 2015, Gaithersburg, MD, United States, 2015, vol. 9020, pp. 101–124.","mla":"Baldimtsi, Foteini, et al. “Anonymous Transferable E-Cash.” Public-Key Cryptography - PKC 2015, vol. 9020, Springer, 2015, pp. 101–24, doi:10.1007/978-3-662-46447-2_5.","short":"F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography - PKC 2015, Springer, 2015, pp. 101–124.","chicago":"Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss. “Anonymous Transferable E-Cash.” In Public-Key Cryptography - PKC 2015, 9020:101–24. Springer, 2015. https://doi.org/10.1007/978-3-662-46447-2_5."},"date_published":"2015-03-17T00:00:00Z","ec_funded":1,"publist_id":"5499","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2015","acknowledgement":"Work done as an intern in Microsoft Research Redmond and as a student at Brown University, where supported by NSF grant 0964379. Supported by the European Research Council, ERC Starting Grant (259668-PSPC).","date_created":"2018-12-11T11:53:15Z","date_updated":"2022-05-23T10:08:37Z","volume":9020,"author":[{"first_name":"Foteini","last_name":"Baldimtsi","full_name":"Baldimtsi, Foteini"},{"first_name":"Melissa","last_name":"Chase","full_name":"Chase, Melissa"},{"full_name":"Fuchsbauer, Georg","first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kohlweiss, Markulf","last_name":"Kohlweiss","first_name":"Markulf"}],"month":"03","publication_identifier":{"isbn":["978-3-662-46446-5"]},"quality_controlled":"1","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"main_file_link":[{"url":"https://doi.org/10.1007/978-3-662-46447-2_5","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2015-04-01","location":"Gaithersburg, MD, United States","start_date":"2015-03-30","name":"PKC: Public Key Crypography"},"doi":"10.1007/978-3-662-46447-2_5"},{"scopus_import":1,"month":"06","day":"01","main_file_link":[{"url":"http://eprint.iacr.org/2014/238","open_access":"1"}],"citation":{"chicago":"Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, 595–603. ACM, 2015. https://doi.org/10.1145/2746539.2746622.","short":"J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.","mla":"Alwen, Joel F., and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603, doi:10.1145/2746539.2746622.","apa":"Alwen, J. F., & Serbinenko, V. (2015). High parallel complexity graphs and memory-hard functions. In Proceedings of the 47th annual ACM symposium on Theory of computing (pp. 595–603). Portland, OR, United States: ACM. https://doi.org/10.1145/2746539.2746622","ieee":"J. F. Alwen and V. Serbinenko, “High parallel complexity graphs and memory-hard functions,” in Proceedings of the 47th annual ACM symposium on Theory of computing, Portland, OR, United States, 2015, pp. 595–603.","ista":"Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard functions. Proceedings of the 47th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 595–603.","ama":"Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing. ACM; 2015:595-603. doi:10.1145/2746539.2746622"},"oa":1,"publication":"Proceedings of the 47th annual ACM symposium on Theory of computing","page":"595 - 603","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"quality_controlled":"1","doi":"10.1145/2746539.2746622","date_published":"2015-06-01T00:00:00Z","conference":{"name":"STOC: Symposium on the Theory of Computing","end_date":"2015-06-17","location":"Portland, OR, United States","start_date":"2015-06-14"},"language":[{"iso":"eng"}],"type":"conference","ec_funded":1,"publist_id":"5498","abstract":[{"text":"We develop new theoretical tools for proving lower-bounds on the (amortized) complexity of certain functions in models of parallel computation. We apply the tools to construct a class of functions with high amortized memory complexity in the parallel Random Oracle Model (pROM); a variant of the standard ROM allowing for batches of simultaneous queries. In particular we obtain a new, more robust, type of Memory-Hard Functions (MHF); a security primitive which has recently been gaining acceptance in practice as an effective means of countering brute-force attacks on security relevant functions. Along the way we also demonstrate an important shortcoming of previous definitions of MHFs and give a new definition addressing the problem. The tools we develop represent an adaptation of the powerful pebbling paradigm (initially introduced by Hewitt and Paterson [HP70] and Cook [Coo73]) to a simple and intuitive parallel setting. We define a simple pebbling game Gp over graphs which aims to abstract parallel computation in an intuitive way. As a conceptual contribution we define a measure of pebbling complexity for graphs called cumulative complexity (CC) and show how it overcomes a crucial shortcoming (in the parallel setting) exhibited by more traditional complexity measures used in the past. As a main technical contribution we give an explicit construction of a constant in-degree family of graphs whose CC in Gp approaches maximality to within a polylogarithmic factor for any graph of equal size (analogous to the graphs of Tarjan et. al. [PTC76, LT82] for sequential pebbling games). Finally, for a given graph G and related function fG, we derive a lower-bound on the amortized memory complexity of fG in the pROM in terms of the CC of G in the game Gp.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1652","year":"2015","publisher":"ACM","department":[{"_id":"KrPi"}],"title":"High parallel complexity graphs and memory-hard functions","status":"public","publication_status":"published","author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen"},{"full_name":"Serbinenko, Vladimir","last_name":"Serbinenko","first_name":"Vladimir"}],"oa_version":"Submitted Version","date_created":"2018-12-11T11:53:16Z","date_updated":"2021-01-12T06:52:16Z"},{"day":"01","scopus_import":1,"series_title":"Lecture Notes in Computer Science","date_published":"2015-09-01T00:00:00Z","citation":{"chicago":"Bogomolov, Sergiy, Thomas A Henzinger, Andreas Podelski, Jakob Ruess, and Christian Schilling. “Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-23401-4_8.","mla":"Bogomolov, Sergiy, et al. Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks. Vol. 9308, Springer, 2015, pp. 77–89, doi:10.1007/978-3-319-23401-4_8.","short":"S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, C. Schilling, 9308 (2015) 77–89.","ista":"Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. 2015. Adaptive moment closure for parameter inference of biochemical reaction networks. 9308, 77–89.","ieee":"S. Bogomolov, T. A. Henzinger, A. Podelski, J. Ruess, and C. Schilling, “Adaptive moment closure for parameter inference of biochemical reaction networks,” vol. 9308. Springer, pp. 77–89, 2015.","apa":"Bogomolov, S., Henzinger, T. A., Podelski, A., Ruess, J., & Schilling, C. (2015). Adaptive moment closure for parameter inference of biochemical reaction networks. Presented at the CMSB: Computational Methods in Systems Biology, Nantes, France: Springer. https://doi.org/10.1007/978-3-319-23401-4_8","ama":"Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. Adaptive moment closure for parameter inference of biochemical reaction networks. 2015;9308:77-89. doi:10.1007/978-3-319-23401-4_8"},"page":"77 - 89","abstract":[{"lang":"eng","text":"Continuous-time Markov chain (CTMC) models have become a central tool for understanding the dynamics of complex reaction networks and the importance of stochasticity in the underlying biochemical processes. When such models are employed to answer questions in applications, in order to ensure that the model provides a sufficiently accurate representation of the real system, it is of vital importance that the model parameters are inferred from real measured data. This, however, is often a formidable task and all of the existing methods fail in one case or the other, usually because the underlying CTMC model is high-dimensional and computationally difficult to analyze. The parameter inference methods that tend to scale best in the dimension of the CTMC are based on so-called moment closure approximations. However, there exists a large number of different moment closure approximations and it is typically hard to say a priori which of the approximations is the most suitable for the inference procedure. Here, we propose a moment-based parameter inference method that automatically chooses the most appropriate moment closure method. Accordingly, contrary to existing methods, the user is not required to be experienced in moment closure techniques. In addition to that, our method adaptively changes the approximation during the parameter inference to ensure that always the best approximation is used, even in cases where different approximations are best in different regions of the parameter space."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"None","_id":"1658","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Adaptive moment closure for parameter inference of biochemical reaction networks","status":"public","intvolume":" 9308","month":"09","conference":{"location":"Nantes, France","start_date":"2015-09-16","end_date":"2015-09-18","name":"CMSB: Computational Methods in Systems Biology"},"doi":"10.1007/978-3-319-23401-4_8","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publist_id":"5492","ec_funded":1,"author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"},{"full_name":"Ruess, Jakob","last_name":"Ruess","first_name":"Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian"}],"related_material":{"record":[{"id":"1148","status":"public","relation":"later_version"}]},"date_updated":"2023-02-21T16:17:24Z","date_created":"2018-12-11T11:53:18Z","volume":9308,"year":"2015","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"publisher":"Springer"},{"scopus_import":1,"month":"07","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1505.02655","open_access":"1"}],"citation":{"mla":"Brázdil, Tomáš, et al. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.","short":"T. Brázdil, S. Kiefer, A. Kučera, P. Novotný, in:, IEEE, 2015, pp. 44–55.","chicago":"Brázdil, Tomáš, Stefan Kiefer, Antonín Kučera, and Petr Novotný. “Long-Run Average Behaviour of Probabilistic Vector Addition Systems,” 44–55. IEEE, 2015. https://doi.org/10.1109/LICS.2015.15.","ama":"Brázdil T, Kiefer S, Kučera A, Novotný P. Long-run average behaviour of probabilistic vector addition systems. In: IEEE; 2015:44-55. doi:10.1109/LICS.2015.15","ista":"Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS, , 44–55.","ieee":"T. Brázdil, S. Kiefer, A. Kučera, and P. Novotný, “Long-run average behaviour of probabilistic vector addition systems,” presented at the LICS: Logic in Computer Science, Kyoto, Japan, 2015, pp. 44–55.","apa":"Brázdil, T., Kiefer, S., Kučera, A., & Novotný, P. (2015). Long-run average behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.15"},"oa":1,"quality_controlled":"1","page":"44 - 55","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"conference":{"end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"date_published":"2015-07-01T00:00:00Z","doi":"10.1109/LICS.2015.15","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LICS"],"abstract":[{"lang":"eng","text":"We study the pattern frequency vector for runs in probabilistic Vector Addition Systems with States (pVASS). Intuitively, each configuration of a given pVASS is assigned one of finitely many patterns, and every run can thus be seen as an infinite sequence of these patterns. The pattern frequency vector assigns to each run the limit of pattern frequencies computed for longer and longer prefixes of the run. If the limit does not exist, then the vector is undefined. We show that for one-counter pVASS, the pattern frequency vector is defined and takes one of finitely many values for almost all runs. Further, these values and their associated probabilities can be approximated up to an arbitrarily small relative error in polynomial time. For stable two-counter pVASS, we show the same result, but we do not provide any upper complexity bound. As a byproduct of our study, we discover counterexamples falsifying some classical results about stochastic Petri nets published in the 80s."}],"publist_id":"5490","ec_funded":1,"_id":"1660","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Long-run average behaviour of probabilistic vector addition systems","status":"public","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"IEEE","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"last_name":"Kiefer","first_name":"Stefan","full_name":"Kiefer, Stefan"},{"full_name":"Kučera, Antonín","first_name":"Antonín","last_name":"Kučera"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"}],"date_updated":"2021-01-12T06:52:20Z","date_created":"2018-12-11T11:53:19Z","oa_version":"Preprint"},{"issue":"7574","abstract":[{"lang":"eng","text":"Which genetic alterations drive tumorigenesis and how they evolve over the course of disease and therapy are central questions in cancer biology. Here we identify 44 recurrently mutated genes and 11 recurrent somatic copy number variations through whole-exome sequencing of 538 chronic lymphocytic leukaemia (CLL) and matched germline DNA samples, 278 of which were collected in a prospective clinical trial. These include previously unrecognized putative cancer drivers (RPS15, IKZF3), and collectively identify RNA processing and export, MYC activity, and MAPK signalling as central pathways involved in CLL. Clonality analysis of this large data set further enabled reconstruction of temporal relationships between driver events. Direct comparison between matched pre-treatment and relapse samples from 59 patients demonstrated highly frequent clonal evolution. Thus, large sequencing data sets of clinically informative samples enable the discovery of novel genes associated with cancer, the network of relationships between the driver events, and their impact on disease relapse and clinical outcome."}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 526","status":"public","title":"Mutations driving CLL and their evolution in progression and relapse","_id":"1665","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"22","scopus_import":1,"date_published":"2015-10-22T00:00:00Z","page":"525 - 530","article_type":"original","citation":{"apa":"Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo, J., … Wu, C. (2015). Mutations driving CLL and their evolution in progression and relapse. Nature. Nature Publishing Group. https://doi.org/10.1038/nature15395","ieee":"D. Landau et al., “Mutations driving CLL and their evolution in progression and relapse,” Nature, vol. 526, no. 7574. Nature Publishing Group, pp. 525–530, 2015.","ista":"Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S, Božić I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C, Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K, Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse. Nature. 526(7574), 525–530.","ama":"Landau D, Tausch E, Taylor Weiner A, et al. Mutations driving CLL and their evolution in progression and relapse. Nature. 2015;526(7574):525-530. doi:10.1038/nature15395","chicago":"Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature15395.","short":"D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo, S. Kluth, I. Božić, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens, C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen, A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D. Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.","mla":"Landau, Dan, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.” Nature, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 525–30, doi:10.1038/nature15395."},"publication":"Nature","ec_funded":1,"publist_id":"5484","volume":526,"date_created":"2018-12-11T11:53:21Z","date_updated":"2021-01-12T06:52:23Z","author":[{"first_name":"Dan","last_name":"Landau","full_name":"Landau, Dan"},{"full_name":"Tausch, Eugen","last_name":"Tausch","first_name":"Eugen"},{"full_name":"Taylor Weiner, Amaro","last_name":"Taylor Weiner","first_name":"Amaro"},{"first_name":"Chip","last_name":"Stewart","full_name":"Stewart, Chip"},{"last_name":"Reiter","first_name":"Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes"},{"first_name":"Jasmin","last_name":"Bahlo","full_name":"Bahlo, Jasmin"},{"last_name":"Kluth","first_name":"Sandra","full_name":"Kluth, Sandra"},{"last_name":"Božić","first_name":"Ivana","full_name":"Božić, Ivana"},{"first_name":"Michael","last_name":"Lawrence","full_name":"Lawrence, Michael"},{"full_name":"Böttcher, Sebastian","last_name":"Böttcher","first_name":"Sebastian"},{"first_name":"Scott","last_name":"Carter","full_name":"Carter, Scott"},{"first_name":"Kristian","last_name":"Cibulskis","full_name":"Cibulskis, Kristian"},{"full_name":"Mertens, Daniel","first_name":"Daniel","last_name":"Mertens"},{"last_name":"Sougnez","first_name":"Carrie","full_name":"Sougnez, Carrie"},{"last_name":"Rosenberg","first_name":"Mara","full_name":"Rosenberg, Mara"},{"last_name":"Hess","first_name":"Julian","full_name":"Hess, Julian"},{"full_name":"Edelmann, Jennifer","first_name":"Jennifer","last_name":"Edelmann"},{"first_name":"Sabrina","last_name":"Kless","full_name":"Kless, Sabrina"},{"full_name":"Kneba, Michael","first_name":"Michael","last_name":"Kneba"},{"full_name":"Ritgen, Matthias","first_name":"Matthias","last_name":"Ritgen"},{"full_name":"Fink, Anna","first_name":"Anna","last_name":"Fink"},{"full_name":"Fischer, Kirsten","first_name":"Kirsten","last_name":"Fischer"},{"first_name":"Stacey","last_name":"Gabriel","full_name":"Gabriel, Stacey"},{"first_name":"Eric","last_name":"Lander","full_name":"Lander, Eric"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"},{"last_name":"Döhner","first_name":"Hartmut","full_name":"Döhner, Hartmut"},{"last_name":"Hallek","first_name":"Michael","full_name":"Hallek, Michael"},{"full_name":"Neuberg, Donna","first_name":"Donna","last_name":"Neuberg"},{"first_name":"Gad","last_name":"Getz","full_name":"Getz, Gad"},{"last_name":"Stilgenbauer","first_name":"Stephan","full_name":"Stilgenbauer, Stephan"},{"full_name":"Wu, Catherine","last_name":"Wu","first_name":"Catherine"}],"department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","publication_status":"published","pmid":1,"year":"2015","month":"10","language":[{"iso":"eng"}],"doi":"10.1038/nature15395","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","oa":1,"external_id":{"pmid":["26466571"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815041/"}]},{"title":"Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2","status":"public","ddc":["570"],"intvolume":" 27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1663","file":[{"checksum":"4ee690b6444b7a43523237f0941457d1","date_created":"2018-12-12T10:18:03Z","date_updated":"2020-07-14T12:45:10Z","file_id":"5321","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":1735337,"access_level":"local","file_name":"IST-2016-578-v1+1_CLS-D-15-00072R1_.pdf"}],"oa_version":"Published Version","pubrep_id":"578","type":"journal_article","abstract":[{"lang":"eng","text":"CREB-binding protein (CBP) and p300 are transcriptional coactivators involved in numerous biological processes that affect cell growth, transformation, differentiation, and development. In this study, we provide evidence of the involvement of homeodomain-interacting protein kinase 2 (HIPK2) in the regulation of CBP activity. We show that HIPK2 interacts with and phosphorylates several regions of CBP. We demonstrate that serines 2361, 2363, 2371, 2376, and 2381 are responsible for the HIPK2-induced mobility shift of CBP C-terminal activation domain. Moreover, we show that HIPK2 strongly potentiates the transcriptional activity of CBP. However, our data suggest that HIPK2 activates CBP mainly by counteracting the repressive action of cell cycle regulatory domain 1 (CRD1), located between amino acids 977 and 1076, independently of CBP phosphorylation. Our findings thus highlight a complex regulation of CBP activity by HIPK2, which might be relevant for the control of specific sets of target genes involved in cellular proliferation, differentiation and apoptosis."}],"issue":"11","page":"2252 - 2260","publication":"Cellular Signalling","citation":{"short":"K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, J. Cardinaux, Cellular Signalling 27 (2015) 2252–2260.","mla":"Kovács, Krisztián, et al. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting Protein Kinase 2.” Cellular Signalling, vol. 27, no. 11, Elsevier, 2015, pp. 2252–60, doi:10.1016/j.cellsig.2015.08.001.","chicago":"Kovács, Krisztián, Myriam Steinmann, Olivier Halfon, Pierre Magistretti, and Jean Cardinaux. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting Protein Kinase 2.” Cellular Signalling. Elsevier, 2015. https://doi.org/10.1016/j.cellsig.2015.08.001.","ama":"Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2. Cellular Signalling. 2015;27(11):2252-2260. doi:10.1016/j.cellsig.2015.08.001","apa":"Kovács, K., Steinmann, M., Halfon, O., Magistretti, P., & Cardinaux, J. (2015). Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2. Cellular Signalling. Elsevier. https://doi.org/10.1016/j.cellsig.2015.08.001","ieee":"K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, and J. Cardinaux, “Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2,” Cellular Signalling, vol. 27, no. 11. Elsevier, pp. 2252–2260, 2015.","ista":"Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. 2015. Complex regulation of CREB-binding protein by homeodomain-interacting protein kinase 2. Cellular Signalling. 27(11), 2252–2260."},"date_published":"2015-11-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","publication_status":"published","publisher":"Elsevier","department":[{"_id":"JoCs"}],"year":"2015","date_updated":"2021-01-12T06:52:22Z","date_created":"2018-12-11T11:53:20Z","volume":27,"author":[{"last_name":"Kovács","first_name":"Krisztián","id":"2AB5821E-F248-11E8-B48F-1D18A9856A87","full_name":"Kovács, Krisztián"},{"full_name":"Steinmann, Myriam","first_name":"Myriam","last_name":"Steinmann"},{"full_name":"Halfon, Olivier","first_name":"Olivier","last_name":"Halfon"},{"first_name":"Pierre","last_name":"Magistretti","full_name":"Magistretti, Pierre"},{"first_name":"Jean","last_name":"Cardinaux","full_name":"Cardinaux, Jean"}],"file_date_updated":"2020-07-14T12:45:10Z","publist_id":"5487","ec_funded":1,"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"language":[{"iso":"eng"}],"doi":"10.1016/j.cellsig.2015.08.001","month":"11"},{"page":"141 - 159","citation":{"apa":"Brázdil, T., Korenčiak, L., Krčál, J., Novotný, P., & Řehák, V. (2015). Optimizing performance of continuous-time stochastic systems using timeout synthesis. Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-319-22264-6_10","ieee":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.","ista":"Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.","ama":"Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 2015;9259:141-159. doi:10.1007/978-3-319-22264-6_10","chicago":"Brázdil, Tomáš, L’Uboš Korenčiak, Jan Krčál, Petr Novotný, and Vojtěch Řehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22264-6_10.","short":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, V. Řehák, 9259 (2015) 141–159.","mla":"Brázdil, Tomáš, et al. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10."},"date_published":"2015-08-22T00:00:00Z","series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"22","intvolume":" 9259","title":"Optimizing performance of continuous-time stochastic systems using timeout synthesis","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1667","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We consider parametric version of fixed-delay continuoustime Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay transitions are specified by parameters, rather than concrete values. Our goal is to synthesize values of these parameters that, for a given cost function, minimise expected total cost incurred before reaching a given set of target states. We show that under mild assumptions, optimal values of parameters can be effectively approximated using translation to a Markov decision process (MDP) whose actions correspond to discretized values of these parameters. To this end we identify and overcome several interesting phenomena arising in systems with fixed delays."}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1407.4777","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-22264-6_10","conference":{"location":"Madrid, Spain","start_date":"2015-09-01","end_date":"2015-09-03","name":"QEST: Quantitative Evaluation of Systems"},"month":"08","department":[{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","year":"2015","acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n∘ [291734]. This work is partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by the EU 7th Framework Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the Czech Science Foundation, grant No. 15-17564S, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","volume":9259,"date_updated":"2021-01-12T06:52:24Z","date_created":"2018-12-11T11:53:22Z","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"first_name":"L'Uboš","last_name":"Korenčiak","full_name":"Korenčiak, L'Uboš"},{"full_name":"Krčál, Jan","last_name":"Krčál","first_name":"Jan"},{"full_name":"Novotny, Petr","first_name":"Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Řehák, Vojtěch","last_name":"Řehák","first_name":"Vojtěch"}],"publist_id":"5482","ec_funded":1},{"volume":526,"date_created":"2018-12-11T11:53:20Z","date_updated":"2021-01-12T06:52:22Z","author":[{"last_name":"Barkley","first_name":"Dwight","full_name":"Barkley, Dwight"},{"first_name":"Baofang","last_name":"Song","full_name":"Song, Baofang"},{"id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","first_name":"Mukund","last_name":"Vasudevan","full_name":"Vasudevan, Mukund"},{"full_name":"Lemoult, Grégoire M","first_name":"Grégoire M","last_name":"Lemoult","id":"4787FE80-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"},{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn"}],"department":[{"_id":"BjHo"}],"publisher":"Nature Publishing Group","publication_status":"published","acknowledgement":"We acknowledge the Deutsche Forschungsgemeinschaft (Project No. FOR 1182), and the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589 for financial support. B.S. acknowledges financial support from the Chinese State Scholarship Fund under grant number 2010629145. B.S. acknowledges support from the International Max Planck Research School for the Physics of Biological and Complex Systems and the Göttingen Graduate School for Neurosciences and Molecular Biosciences. We acknowledge computing resources from GWDG (Gesellschaft für wissenschaftliche Datenverarbeitung Göttingen) and the Jülich Supercomputing Centre (grant HGU16) where the simulations were performed.","year":"2015","publist_id":"5485","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1038/nature15701","project":[{"call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.09143"}],"oa":1,"month":"10","oa_version":"Preprint","intvolume":" 526","status":"public","title":"The rise of fully turbulent flow","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1664","issue":"7574","abstract":[{"text":"Over a century of research into the origin of turbulence in wall-bounded shear flows has resulted in a puzzling picture in which turbulence appears in a variety of different states competing with laminar background flow. At moderate flow speeds, turbulence is confined to localized patches; it is only at higher speeds that the entire flow becomes turbulent. The origin of the different states encountered during this transition, the front dynamics of the turbulent regions and the transformation to full turbulence have yet to be explained. By combining experiments, theory and computer simulations, here we uncover a bifurcation scenario that explains the transformation to fully turbulent pipe flow and describe the front dynamics of the different states encountered in the process. Key to resolving this problem is the interpretation of the flow as a bistable system with nonlinear propagation (advection) of turbulent fronts. These findings bridge the gap between our understanding of the onset of turbulence and fully turbulent flows.","lang":"eng"}],"type":"journal_article","date_published":"2015-10-21T00:00:00Z","page":"550 - 553","citation":{"chicago":"Barkley, Dwight, Baofang Song, Mukund Vasudevan, Grégoire M Lemoult, Marc Avila, and Björn Hof. “The Rise of Fully Turbulent Flow.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature15701.","mla":"Barkley, Dwight, et al. “The Rise of Fully Turbulent Flow.” Nature, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 550–53, doi:10.1038/nature15701.","short":"D. Barkley, B. Song, M. Vasudevan, G.M. Lemoult, M. Avila, B. Hof, Nature 526 (2015) 550–553.","ista":"Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. 2015. The rise of fully turbulent flow. Nature. 526(7574), 550–553.","apa":"Barkley, D., Song, B., Vasudevan, M., Lemoult, G. M., Avila, M., & Hof, B. (2015). The rise of fully turbulent flow. Nature. Nature Publishing Group. https://doi.org/10.1038/nature15701","ieee":"D. Barkley, B. Song, M. Vasudevan, G. M. Lemoult, M. Avila, and B. Hof, “The rise of fully turbulent flow,” Nature, vol. 526, no. 7574. Nature Publishing Group, pp. 550–553, 2015.","ama":"Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. The rise of fully turbulent flow. Nature. 2015;526(7574):550-553. doi:10.1038/nature15701"},"publication":"Nature","day":"21","scopus_import":1},{"oa_version":"Submitted Version","file":[{"file_name":"2015_CRYPTO_Alwen.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":397363,"file_id":"7853","relation":"main_file","date_created":"2020-05-15T08:55:29Z","date_updated":"2020-07-14T12:45:11Z","checksum":"5b6649e80d1f781a8910f7cce6427f78"}],"ddc":["000"],"title":"Incoercible multi-party computation and universally composable receipt-free voting","status":"public","intvolume":" 9216","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1672","abstract":[{"text":"Composable notions of incoercibility aim to forbid a coercer from using anything beyond the coerced parties’ inputs and outputs to catch them when they try to deceive him. Existing definitions are restricted to weak coercion types, and/or are not universally composable. Furthermore, they often make too strong assumptions on the knowledge of coerced parties—e.g., they assume they known the identities and/or the strategies of other coerced parties, or those of corrupted parties— which makes them unsuitable for applications of incoercibility such as e-voting, where colluding adversarial parties may attempt to coerce honest voters, e.g., by offering them money for a promised vote, and use their own view to check that the voter keeps his end of the bargain. In this work we put forward the first universally composable notion of incoercible multi-party computation, which satisfies the above intuition and does not assume collusions among coerced parties or knowledge of the corrupted set. We define natural notions of UC incoercibility corresponding to standard coercion-types, i.e., receipt-freeness and resistance to full-active coercion. Importantly, our suggested notion has the unique property that it builds on top of the well studied UC framework by Canetti instead of modifying it. This guarantees backwards compatibility, and allows us to inherit results from the rich UC literature. We then present MPC protocols which realize our notions of UC incoercibility given access to an arguably minimal setup—namely honestly generate tamper-proof hardware performing a very simple cryptographic operation—e.g., a smart card. This is, to our knowledge, the first proposed construction of an MPC protocol (for more than two parties) that is incoercibly secure and universally composable, and therefore the first construction of a universally composable receipt-free e-voting protocol.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2015-08-01T00:00:00Z","page":"763 - 780","publication":"Advances in Cryptology - CRYPTO 2015","citation":{"chicago":"Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” In Advances in Cryptology - CRYPTO 2015, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_37.","mla":"Alwen, Joel F., et al. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” Advances in Cryptology - CRYPTO 2015, vol. 9216, Springer, 2015, pp. 763–80, doi:10.1007/978-3-662-48000-7_37.","short":"J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.","ista":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation and universally composable receipt-free voting. Advances in Cryptology - CRYPTO 2015. CRYPTO: International Cryptology ConferenceLecture Notes in Computer Science, LNCS, vol. 9216, 763–780.","apa":"Alwen, J. F., Ostrovsky, R., Zhou, H., & Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In Advances in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_37","ieee":"J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party computation and universally composable receipt-free voting,” in Advances in Cryptology - CRYPTO 2015, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 763–780.","ama":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. In: Advances in Cryptology - CRYPTO 2015. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780. doi:10.1007/978-3-662-48000-7_37"},"day":"01","has_accepted_license":"1","article_processing_charge":"No","series_title":"Lecture Notes in Computer Science","scopus_import":"1","date_created":"2018-12-11T11:53:23Z","date_updated":"2022-06-07T09:51:55Z","volume":9216,"author":[{"full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ostrovsky, Rafail","first_name":"Rafail","last_name":"Ostrovsky"},{"full_name":"Zhou, Hongsheng","first_name":"Hongsheng","last_name":"Zhou"},{"last_name":"Zikas","first_name":"Vassilis","full_name":"Zikas, Vassilis"}],"publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","year":"2015","acknowledgement":"Joël Alwen was supported by the ERC starting grant (259668-PSPC). Rafail Ostrovsky was supported in part by NSF grants 09165174, 1065276, 1118126 and 1136174, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award, Teradata Research Award, Lockheed-Martin Corporation Research Award, and the Defense Advanced Research Projects Agency through the U.S. Office of Naval Research under Contract N00014 -11 -1-0392. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government. Vassilis Zikas was supported in part by the Swiss National Science Foundation (SNF) via the Ambizione grant PZ00P-2142549.","file_date_updated":"2020-07-14T12:45:11Z","publist_id":"5476","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16","location":"Santa Barbara, CA, United States","end_date":"2015-08-20"},"doi":"10.1007/978-3-662-48000-7_37","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"oa":1,"month":"08","publication_identifier":{"eisbn":["978-3-662-48000-7"],"isbn":["978-3-662-47999-5"]}},{"month":"08","oa":1,"quality_controlled":"1","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"conference":{"end_date":"2015-08-26","location":"Guadalajara, Mexico","start_date":"2015-08-23","name":"LATINCRYPT: Cryptology and Information Security in Latin America"},"doi":"10.1007/978-3-319-22174-8_5","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:11Z","publist_id":"5480","ec_funded":1,"year":"2015","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"author":[{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Skórski, Maciej","first_name":"Maciej","last_name":"Skórski"}],"date_created":"2018-12-11T11:53:22Z","date_updated":"2021-01-12T06:52:24Z","volume":9230,"scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"15","has_accepted_license":"1","citation":{"mla":"Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy, Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.","short":"K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.","chicago":"Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy, Revisited.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22174-8_5.","ama":"Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98. doi:10.1007/978-3-319-22174-8_5","ista":"Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.","ieee":"K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.","apa":"Pietrzak, K. Z., & Skórski, M. (2015). The chain rule for HILL pseudoentropy, revisited. Presented at the LATINCRYPT: Cryptology and Information Security in Latin America, Guadalajara, Mexico: Springer. https://doi.org/10.1007/978-3-319-22174-8_5"},"page":"81 - 98","date_published":"2015-08-15T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Computational notions of entropy (a.k.a. pseudoentropy) have found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The most important tools to argue about pseudoentropy are chain rules, which quantify by how much (in terms of quantity and quality) the pseudoentropy of a given random variable X decreases when conditioned on some other variable Z (think for example of X as a secret key and Z as information leaked by a side-channel). In this paper we give a very simple and modular proof of the chain rule for HILL pseudoentropy, improving best known parameters. Our version allows for increasing the acceptable length of leakage in applications up to a constant factor compared to the best previous bounds. As a contribution of independent interest, we provide a comprehensive study of all known versions of the chain rule, comparing their worst-case strength and limitations."}],"_id":"1669","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The chain rule for HILL pseudoentropy, revisited","status":"public","ddc":["005"],"intvolume":" 9230","pubrep_id":"669","file":[{"content_type":"application/pdf","file_size":443340,"creator":"system","access_level":"open_access","file_name":"IST-2016-669-v1+1_599.pdf","checksum":"8cd4215b83efba720e8cf27c23ff4781","date_updated":"2020-07-14T12:45:11Z","date_created":"2018-12-12T10:18:29Z","relation":"main_file","file_id":"5351"}],"oa_version":"Submitted Version"},{"date_published":"2015-08-01T00:00:00Z","page":"368 - 387","citation":{"chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC,” 9215:368–87. Springer, 2015. https://doi.org/10.1007/978-3-662-47989-6_18.","mla":"Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87, doi:10.1007/978-3-662-47989-6_18.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.","ista":"Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology Conference, LNCS, vol. 9215, 368–387.","apa":"Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp. 368–387). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-47989-6_18","ieee":"P. Gazi, K. Z. Pietrzak, and S. Tessaro, “The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9215, pp. 368–387.","ama":"Gazi P, Pietrzak KZ, Tessaro S. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. In: Vol 9215. Springer; 2015:368-387. doi:10.1007/978-3-662-47989-6_18"},"day":"01","has_accepted_license":"1","scopus_import":1,"oa_version":"Submitted Version","file":[{"file_name":"IST-2016-673-v1+1_053.pdf","access_level":"open_access","content_type":"application/pdf","file_size":592296,"creator":"system","relation":"main_file","file_id":"4827","date_updated":"2020-07-14T12:45:11Z","date_created":"2018-12-12T10:10:38Z","checksum":"17d854227b3b753fd34f5d29e5b5a32e"}],"pubrep_id":"673","title":"The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC","ddc":["004","005"],"status":"public","intvolume":" 9215","_id":"1671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"This paper studies the concrete security of PRFs and MACs obtained by keying hash functions based on the sponge paradigm. One such hash function is KECCAK, selected as NIST’s new SHA-3 standard. In contrast to other approaches like HMAC, the exact security of keyed sponges is not well understood. Indeed, recent security analyses delivered concrete security bounds which are far from existing attacks. This paper aims to close this gap. We prove (nearly) exact bounds on the concrete PRF security of keyed sponges using a random permutation. These bounds are tight for the most relevant ranges of parameters, i.e., for messages of length (roughly) l ≤ min{2n/4, 2r} blocks, where n is the state size and r is the desired output length; and for l ≤ q queries (to the construction or the underlying permutation). Moreover, we also improve standard-model bounds. As an intermediate step of independent interest, we prove tight bounds on the PRF security of the truncated CBC-MAC construction, which operates as plain CBC-MAC, but only returns a prefix of the output."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2015-08-20","location":"Santa Barbara, CA, United States","start_date":"2015-08-16","name":"CRYPTO: International Cryptology Conference"},"doi":"10.1007/978-3-662-47989-6_18","quality_controlled":"1","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"oa":1,"month":"08","date_created":"2018-12-11T11:53:23Z","date_updated":"2021-01-12T06:52:25Z","volume":9215,"author":[{"full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter"},{"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":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2015","file_date_updated":"2020-07-14T12:45:11Z","publist_id":"5478","ec_funded":1},{"doi":"10.1098/rspa.2015.0114","language":[{"iso":"eng"}],"oa":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","month":"09","author":[{"first_name":"Ben","last_name":"Adlam","full_name":"Adlam, Ben"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"volume":471,"date_updated":"2021-01-12T06:52:26Z","date_created":"2018-12-11T11:53:24Z","year":"2015","acknowledgement":"K.C. gratefully acknowledges support from ERC Start grant no. (279307: Graph Games), Austrian Science Fund (FWF) grant no. P23499-N23, and FWF NFN grant no. S11407-N23 (RiSE). ","department":[{"_id":"KrCh"}],"publisher":"Royal Society of London","publication_status":"published","ec_funded":1,"publist_id":"5477","file_date_updated":"2020-07-14T12:45:11Z","article_number":"20150114","date_published":"2015-09-08T00:00:00Z","citation":{"mla":"Adlam, Ben, et al. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:10.1098/rspa.2015.0114.","short":"B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).","chicago":"Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.","ama":"Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2015;471(2181). doi:10.1098/rspa.2015.0114","ista":"Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114.","ieee":"B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181. Royal Society of London, 2015.","apa":"Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2015.0114"},"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","has_accepted_license":"1","day":"08","scopus_import":1,"file":[{"file_size":391466,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2015_rspa_Adlam.pdf","checksum":"e613d94d283c776322403a28aad11bdd","date_created":"2019-04-18T12:39:56Z","date_updated":"2020-07-14T12:45:11Z","relation":"main_file","file_id":"6342"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1673","intvolume":" 471","ddc":["000"],"status":"public","title":"Amplifiers of selection","issue":"2181","abstract":[{"text":"When a new mutant arises in a population, there is a probability it outcompetes the residents and fixes. The structure of the population can affect this fixation probability. Suppressing population structures reduce the difference between two competing variants, while amplifying population structures enhance the difference. Suppressors are ubiquitous and easy to construct, but amplifiers for the large population limit are more elusive and only a few examples have been discovered. Whether or not a population structure is an amplifier of selection depends on the probability distribution for the placement of the invading mutant. First, we prove that there exist only bounded amplifiers for adversarial placement-that is, for arbitrary initial conditions. Next, we show that the Star population structure, which is known to amplify for mutants placed uniformly at random, does not amplify for mutants that arise through reproduction and are therefore placed proportional to the temperatures of the vertices. Finally, we construct population structures that amplify for all mutational events that arise through reproduction, uniformly at random, or through some combination of the two. ","lang":"eng"}],"type":"journal_article"},{"publist_id":"5481","ec_funded":1,"year":"2015","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","author":[{"last_name":"Gazi","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"last_name":"Lee","first_name":"Jooyoung","full_name":"Lee, Jooyoung"},{"first_name":"Yannick","last_name":"Seurin","full_name":"Seurin, Yannick"},{"last_name":"Steinberger","first_name":"John","full_name":"Steinberger, John"},{"first_name":"Stefano","last_name":"Tessaro","full_name":"Tessaro, Stefano"}],"volume":9054,"date_updated":"2020-08-11T10:09:26Z","date_created":"2018-12-11T11:53:22Z","month":"08","oa":1,"main_file_link":[{"url":"http://eprint.iacr.org/2015/397","open_access":"1"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","doi":"10.1007/978-3-662-48116-5_16","conference":{"name":"FSE: Fast Software Encryption","end_date":"2015-03-11","location":"Istanbul, Turkey","start_date":"2015-03-08"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We revisit the security (as a pseudorandom permutation) of cascading-based constructions for block-cipher key-length extension. Previous works typically considered the extreme case where the adversary is given the entire codebook of the construction, the only complexity measure being the number qe of queries to the underlying ideal block cipher, representing adversary’s secret-key-independent computation. Here, we initiate a systematic study of the more natural case of an adversary restricted to adaptively learning a number qc of plaintext/ciphertext pairs that is less than the entire codebook. For any such qc, we aim to determine the highest number of block-cipher queries qe the adversary can issue without being able to successfully distinguish the construction (under a secret key) from a random permutation.\r\nMore concretely, we show the following results for key-length extension schemes using a block cipher with n-bit blocks and κ-bit keys:\r\nPlain cascades of length ℓ=2r+1 are secure whenever qcqre≪2r(κ+n), qc≪2κ and qe≪22κ. The bound for r=1 also applies to two-key triple encryption (as used within Triple DES).\r\nThe r-round XOR-cascade is secure as long as qcqre≪2r(κ+n), matching an attack by Gaži (CRYPTO 2013).\r\nWe fully characterize the security of Gaži and Tessaro’s two-call ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1668","intvolume":" 9054","title":"Relaxing full-codebook security: A refined analysis of key-length extension schemes","status":"public","oa_version":"Submitted Version","scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"12","citation":{"mla":"Gazi, Peter, et al. Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. Vol. 9054, Springer, 2015, pp. 319–41, doi:10.1007/978-3-662-48116-5_16.","short":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 319–341.","chicago":"Gazi, Peter, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano Tessaro. “Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48116-5_16.","ama":"Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 2015;9054:319-341. doi:10.1007/978-3-662-48116-5_16","ista":"Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. 2015. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 9054, 319–341.","ieee":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, and S. Tessaro, “Relaxing full-codebook security: A refined analysis of key-length extension schemes,” vol. 9054. Springer, pp. 319–341, 2015.","apa":"Gazi, P., Lee, J., Seurin, Y., Steinberger, J., & Tessaro, S. (2015). Relaxing full-codebook security: A refined analysis of key-length extension schemes. Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer. https://doi.org/10.1007/978-3-662-48116-5_16"},"page":"319 - 341","date_published":"2015-08-12T00:00:00Z"},{"year":"2015","_id":"1670","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was partly supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS, http://www.avacs.org/), by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the Swiss National Science Foundation (SNSF) as part of the project “Automated Reformulation and Pruning in Factored State Spaces (ARAP)”.","publisher":"AAAI Press","department":[{"_id":"ToHe"}],"publication_status":"published","title":"PDDL+ planning with hybrid automata: Foundations of translating must behavior","status":"public","author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy"},{"last_name":"Magazzeni","first_name":"Daniele","full_name":"Magazzeni, Daniele"},{"last_name":"Minopoli","first_name":"Stefano","full_name":"Minopoli, Stefano"},{"full_name":"Wehrle, Martin","first_name":"Martin","last_name":"Wehrle"}],"oa_version":"None","date_created":"2018-12-11T11:53:23Z","date_updated":"2021-01-12T06:52:25Z","type":"conference","publist_id":"5479","ec_funded":1,"abstract":[{"text":"Planning in hybrid domains poses a special challenge due to the involved mixed discrete-continuous dynamics. A recent solving approach for such domains is based on applying model checking techniques on a translation of PDDL+ planning problems to hybrid automata. However, the proposed translation is limited because must behavior is only overapproximated, and hence, processes and events are not reflected exactly. In this paper, we present the theoretical foundation of an exact PDDL+ translation. We propose a schema to convert a hybrid automaton with must transitions into an equivalent hybrid automaton featuring only may transitions.","lang":"eng"}],"citation":{"ieee":"S. Bogomolov, D. Magazzeni, S. Minopoli, and M. Wehrle, “PDDL+ planning with hybrid automata: Foundations of translating must behavior,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel, 2015, pp. 42–46.","apa":"Bogomolov, S., Magazzeni, D., Minopoli, S., & Wehrle, M. (2015). PDDL+ planning with hybrid automata: Foundations of translating must behavior (pp. 42–46). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel: AAAI Press.","ista":"Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. 2015. PDDL+ planning with hybrid automata: Foundations of translating must behavior. ICAPS: International Conference on Automated Planning and Scheduling, 42–46.","ama":"Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. PDDL+ planning with hybrid automata: Foundations of translating must behavior. In: AAAI Press; 2015:42-46.","chicago":"Bogomolov, Sergiy, Daniele Magazzeni, Stefano Minopoli, and Martin Wehrle. “PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior,” 42–46. AAAI Press, 2015.","short":"S. Bogomolov, D. Magazzeni, S. Minopoli, M. Wehrle, in:, AAAI Press, 2015, pp. 42–46.","mla":"Bogomolov, Sergiy, et al. PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. AAAI Press, 2015, pp. 42–46."},"main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10606/10394"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"page":"42 - 46","quality_controlled":"1","date_published":"2015-06-01T00:00:00Z","conference":{"location":"Jerusalem, Israel","start_date":"2015-06-07","end_date":"2015-06-11","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"language":[{"iso":"eng"}],"scopus_import":1,"day":"01","month":"06"},{"language":[{"iso":"eng"}],"doi":"10.1142/S0129055X1550018X","date_published":"2015-09-01T00:00:00Z","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.8015"}],"citation":{"mla":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” Reviews in Mathematical Physics, vol. 27, no. 8, 1550018, World Scientific Publishing, 2015, doi:10.1142/S0129055X1550018X.","short":"J. Lee, K. Schnelli, Reviews in Mathematical Physics 27 (2015).","chicago":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” Reviews in Mathematical Physics. World Scientific Publishing, 2015. https://doi.org/10.1142/S0129055X1550018X.","ama":"Lee J, Schnelli K. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 2015;27(8). doi:10.1142/S0129055X1550018X","ista":"Lee J, Schnelli K. 2015. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 27(8), 1550018.","apa":"Lee, J., & Schnelli, K. (2015). Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X1550018X","ieee":"J. Lee and K. Schnelli, “Edge universality for deformed Wigner matrices,” Reviews in Mathematical Physics, vol. 27, no. 8. World Scientific Publishing, 2015."},"oa":1,"publication":"Reviews in Mathematical Physics","day":"01","month":"09","scopus_import":1,"volume":27,"oa_version":"Preprint","date_created":"2018-12-11T11:53:24Z","date_updated":"2021-01-12T06:52:26Z","author":[{"full_name":"Lee, Jioon","first_name":"Jioon","last_name":"Lee"},{"full_name":"Schnelli, Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","first_name":"Kevin","last_name":"Schnelli"}],"intvolume":" 27","publisher":"World Scientific Publishing","department":[{"_id":"LaEr"}],"publication_status":"published","title":"Edge universality for deformed Wigner matrices","status":"public","year":"2015","_id":"1674","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"8","publist_id":"5475","abstract":[{"text":"We consider N × N random matrices of the form H = W + V where W is a real symmetric Wigner matrix and V a random or deterministic, real, diagonal matrix whose entries are independent of W. We assume subexponential decay for the matrix entries of W and we choose V so that the eigenvalues of W and V are typically of the same order. For a large class of diagonal matrices V, we show that the rescaled distribution of the extremal eigenvalues is given by the Tracy-Widom distribution F1 in the limit of large N. Our proofs also apply to the complex Hermitian setting, i.e. when W is a complex Hermitian Wigner matrix.","lang":"eng"}],"type":"journal_article","article_number":"1550018"},{"type":"journal_article","issue":"9","intvolume":" 27","ddc":["532"],"title":"Taylor's Forest","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1679","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5019","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:13:35Z","checksum":"604bba3c2496aadb3efcff77de01ce6c","file_name":"IST-2017-748-v1+1_1.4930850.pdf","access_level":"open_access","content_type":"application/pdf","file_size":872366,"creator":"system"}],"pubrep_id":"748","scopus_import":1,"has_accepted_license":"1","day":"24","citation":{"chicago":"Lemoult, Grégoire M, Philipp Maier, and Björn Hof. “Taylor’s Forest.” Physics of Fluids. American Institute of Physics, 2015. https://doi.org/10.1063/1.4930850.","mla":"Lemoult, Grégoire M., et al. “Taylor’s Forest.” Physics of Fluids, vol. 27, no. 9, 091102, American Institute of Physics, 2015, doi:10.1063/1.4930850.","short":"G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015).","ista":"Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9), 091102.","ieee":"G. M. Lemoult, P. Maier, and B. Hof, “Taylor’s Forest,” Physics of Fluids, vol. 27, no. 9. American Institute of Physics, 2015.","apa":"Lemoult, G. M., Maier, P., & Hof, B. (2015). Taylor’s Forest. Physics of Fluids. American Institute of Physics. https://doi.org/10.1063/1.4930850","ama":"Lemoult GM, Maier P, Hof B. Taylor’s Forest. Physics of Fluids. 2015;27(9). doi:10.1063/1.4930850"},"publication":"Physics of Fluids","date_published":"2015-09-24T00:00:00Z","article_number":"091102","publist_id":"5469","file_date_updated":"2020-07-14T12:45:12Z","publisher":"American Institute of Physics","department":[{"_id":"BjHo"}],"publication_status":"published","year":"2015","volume":27,"date_created":"2018-12-11T11:53:26Z","date_updated":"2021-01-12T06:52:28Z","author":[{"full_name":"Lemoult, Grégoire M","last_name":"Lemoult","first_name":"Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maier, Philipp","first_name":"Philipp","last_name":"Maier","id":"384F7C04-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"month":"09","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.1063/1.4930850"},{"day":"01","month":"10","scopus_import":1,"doi":"10.1016/j.ceb.2015.09.004","date_published":"2015-10-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"mla":"Sixt, Michael K., and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” Current Opinion in Cell Biology, vol. 36, no. 10, Elsevier, 2015, pp. 4–6, doi:10.1016/j.ceb.2015.09.004.","short":"M.K. Sixt, E. Raz, Current Opinion in Cell Biology 36 (2015) 4–6.","chicago":"Sixt, Michael K, and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.09.004.","ama":"Sixt MK, Raz E. Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. 2015;36(10):4-6. doi:10.1016/j.ceb.2015.09.004","ista":"Sixt MK, Raz E. 2015. Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. 36(10), 4–6.","apa":"Sixt, M. K., & Raz, E. (2015). Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.09.004","ieee":"M. K. Sixt and E. Raz, “Editorial overview: Cell adhesion and migration,” Current Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 4–6, 2015."},"publication":"Current Opinion in Cell Biology","page":"4 - 6","publist_id":"5473","issue":"10","type":"journal_article","author":[{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"full_name":"Raz, Erez","last_name":"Raz","first_name":"Erez"}],"volume":36,"oa_version":"None","date_created":"2018-12-11T11:53:25Z","date_updated":"2021-01-12T06:52:27Z","_id":"1676","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","department":[{"_id":"MiSi"}],"publisher":"Elsevier","intvolume":" 36","status":"public","publication_status":"published","title":"Editorial overview: Cell adhesion and migration"},{"day":"16","has_accepted_license":"1","publication":"PLoS Biology","citation":{"chicago":"Vicoso, Beatriz, and Doris Bachtrog. “Numerous Transitions of Sex Chromosomes in Diptera.” PLoS Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002078.","short":"B. Vicoso, D. Bachtrog, PLoS Biology 13 (2015).","mla":"Vicoso, Beatriz, and Doris Bachtrog. “Numerous Transitions of Sex Chromosomes in Diptera.” PLoS Biology, vol. 13, no. 4, e1002078, Public Library of Science, 2015, doi:10.1371/journal.pbio.1002078.","apa":"Vicoso, B., & Bachtrog, D. (2015). Numerous transitions of sex chromosomes in Diptera. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002078","ieee":"B. Vicoso and D. Bachtrog, “Numerous transitions of sex chromosomes in Diptera,” PLoS Biology, vol. 13, no. 4. Public Library of Science, 2015.","ista":"Vicoso B, Bachtrog D. 2015. Numerous transitions of sex chromosomes in Diptera. PLoS Biology. 13(4), e1002078.","ama":"Vicoso B, Bachtrog D. Numerous transitions of sex chromosomes in Diptera. PLoS Biology. 2015;13(4). doi:10.1371/journal.pbio.1002078"},"date_published":"2015-04-16T00:00:00Z","type":"journal_article","abstract":[{"text":"Many species groups, including mammals and many insects, determine sex using heteromorphic sex chromosomes. Diptera flies, which include the model Drosophila melanogaster, generally have XY sex chromosomes and a conserved karyotype consisting of six chromosomal arms (five large rods and a small dot), but superficially similar karyotypes may conceal the true extent of sex chromosome variation. Here, we use whole-genome analysis in 37 fly species belonging to 22 different families of Diptera and uncover tremendous hidden diversity in sex chromosome karyotypes among flies. We identify over a dozen different sex chromosome configurations, and the small dot chromosome is repeatedly used as the sex chromosome, which presumably reflects the ancestral karyotype of higher Diptera. However, we identify species with undifferentiated sex chromosomes, others in which a different chromosome replaced the dot as a sex chromosome or in which up to three chromosomal elements became incorporated into the sex chromosomes, and others yet with female heterogamety (ZW sex chromosomes). Transcriptome analysis shows that dosage compensation has evolved multiple times in flies, consistently through up-regulation of the single X in males. However, X chromosomes generally show a deficiency of genes with male-biased expression, possibly reflecting sex-specific selective pressures. These species thus provide a rich resource to study sex chromosome biology in a comparative manner and show that similar selective forces have shaped the unique evolution of sex chromosomes in diverse fly taxa.","lang":"eng"}],"issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1684","ddc":["570"],"status":"public","title":"Numerous transitions of sex chromosomes in Diptera","intvolume":" 13","pubrep_id":"492","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"4858","checksum":"92a300d7b97eafb477885303f7632fe1","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:11:05Z","access_level":"open_access","file_name":"IST-2016-492-v1+1_journal.pbio.1002078.pdf","content_type":"application/pdf","file_size":1104701,"creator":"system"}],"month":"04","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.1371/journal.pbio.1002078","language":[{"iso":"eng"}],"article_number":"e1002078","file_date_updated":"2020-07-14T12:45:12Z","publist_id":"5463","extern":"1","year":"2015","acknowledgement":"This research was funded by NIH grants (R01GM076007 and R01GM093182) to DB. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.\r\nWe thank the people listed in S2 Table for samples, Jere Schweikert for identifying Tephritid species, and Zaak Walton for technical assistance.","publication_status":"published","publisher":"Public Library of Science","author":[{"full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","first_name":"Beatriz"},{"last_name":"Bachtrog","first_name":"Doris","full_name":"Bachtrog, Doris"}],"date_created":"2018-12-11T11:53:27Z","date_updated":"2021-01-12T06:52:30Z","volume":13},{"doi":"10.1016/j.ceb.2015.08.001","language":[{"iso":"eng"}],"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"},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556"}],"month":"10","author":[{"first_name":"Milka","last_name":"Sarris","full_name":"Sarris, Milka"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"}],"date_updated":"2021-01-12T06:52:31Z","date_created":"2018-12-11T11:53:28Z","volume":36,"year":"2015","publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Elsevier","file_date_updated":"2020-07-14T12:45:12Z","ec_funded":1,"publist_id":"5458","date_published":"2015-10-01T00:00:00Z","publication":"Current Opinion in Cell Biology","citation":{"ama":"Sarris M, Sixt MK. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 2015;36(10):93-102. doi:10.1016/j.ceb.2015.08.001","ista":"Sarris M, Sixt MK. 2015. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 36(10), 93–102.","ieee":"M. Sarris and M. K. Sixt, “Navigating in tissue mazes: Chemoattractant interpretation in complex environments,” Current Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 93–102, 2015.","apa":"Sarris, M., & Sixt, M. K. (2015). Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.08.001","mla":"Sarris, Milka, and Michael K. Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” Current Opinion in Cell Biology, vol. 36, no. 10, Elsevier, 2015, pp. 93–102, doi:10.1016/j.ceb.2015.08.001.","short":"M. Sarris, M.K. Sixt, Current Opinion in Cell Biology 36 (2015) 93–102.","chicago":"Sarris, Milka, and Michael K Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.08.001."},"page":"93 - 102","day":"01","has_accepted_license":"1","scopus_import":1,"pubrep_id":"445","file":[{"file_name":"IST-2016-445-v1+1_1-s2.0-S0955067415001064-main.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":797964,"file_id":"4875","relation":"main_file","date_created":"2018-12-12T10:11:21Z","date_updated":"2020-07-14T12:45:12Z","checksum":"c29973924b790aab02fdd91857759cfb"}],"oa_version":"Published Version","_id":"1687","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"title":"Navigating in tissue mazes: Chemoattractant interpretation in complex environments","status":"public","intvolume":" 36","abstract":[{"text":"Guided cell movement is essential for development and integrity of animals and crucially involved in cellular immune responses. Leukocytes are professional migratory cells that can navigate through most types of tissues and sense a wide range of directional cues. The responses of these cells to attractants have been mainly explored in tissue culture settings. How leukocytes make directional decisions in situ, within the challenging environment of a tissue maze, is less understood. Here we review recent advances in how leukocytes sense chemical cues in complex tissue settings and make links with paradigms of directed migration in development and Dictyostelium discoideum amoebae.","lang":"eng"}],"issue":"10","type":"journal_article"},{"publist_id":"5462","ec_funded":1,"publisher":"Springer","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2015","volume":9294,"date_updated":"2021-01-12T06:52:31Z","date_created":"2018-12-11T11:53:27Z","author":[{"first_name":"Vincent","last_name":"Cohen Addad","full_name":"Cohen Addad, Vincent"},{"full_name":"De Mesmay, Arnaud N","first_name":"Arnaud N","last_name":"De Mesmay","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87"}],"month":"09","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1507.01688"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48350-3_33","conference":{"location":"Patras, Greece","start_date":"2015-09-14","end_date":"2015-09-16","name":"ESA: European Symposium on Algorithms"},"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph is a subgraph of G such that cutting Σ along G yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any ε > 0, we show how to compute a (1 + ε) approximation of the shortest cut graph in time f(ε, g)n3.\r\nOur techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded tree-width. Then, to solve the bounded tree-width case, we introduce a variant of the surface-cut decomposition of Rué, Sau and Thilikos, which may be of independent interest.","lang":"eng"}],"intvolume":" 9294","title":"A fixed parameter tractable approximation scheme for the optimal cut graph of a surface","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1685","oa_version":"Preprint","scopus_import":1,"day":"01","page":"386 - 398","citation":{"short":"V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.","mla":"Cohen Addad, Vincent, and Arnaud N. de Mesmay. A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. Vol. 9294, Springer, 2015, pp. 386–98, doi:10.1007/978-3-662-48350-3_33.","chicago":"Cohen Addad, Vincent, and Arnaud N de Mesmay. “A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface,” 9294:386–98. Springer, 2015. https://doi.org/10.1007/978-3-662-48350-3_33.","ama":"Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398. doi:10.1007/978-3-662-48350-3_33","ieee":"V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation scheme for the optimal cut graph of a surface,” presented at the ESA: European Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.","apa":"Cohen Addad, V., & de Mesmay, A. N. (2015). A fixed parameter tractable approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398). Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer. https://doi.org/10.1007/978-3-662-48350-3_33","ista":"Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms, LNCS, vol. 9294, 386–398."},"date_published":"2015-09-01T00:00:00Z"},{"intvolume":" 54","status":"public","title":"Bounds for Pach's selection theorem and for the minimum solid angle in a simplex","_id":"1688","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"3","abstract":[{"text":"We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant (Formula presented.) such that whenever (Formula presented.) are n-element subsets of (Formula presented.), we can find a point (Formula presented.) and subsets (Formula presented.) for every i∈[d+1], each of size at least cdn, such that p belongs to all rainbowd-simplices determined by (Formula presented.) simplices with one vertex in each Yi. We show a super-exponentially decreasing upper bound (Formula presented.). The ideas used in the proof of the upper bound also help us to prove Pach’s theorem with (Formula presented.), which is a lower bound doubly exponentially decreasing in d (up to some polynomial in the exponent). For comparison, Pach’s original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach’s theorem with (Formula presented.). In our construction for the upper bound, we use the fact that the minimum solid angle of every d-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the ‘separation’ part of the argument by showing that in one of the key steps only d+1 separations are necessary, compared to 2d separations in the original proof. We also provide a measure version of Pach’s theorem.","lang":"eng"}],"page":"610 - 636","citation":{"mla":"Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” Discrete & Computational Geometry, vol. 54, no. 3, Springer, 2015, pp. 610–36, doi:10.1007/s00454-015-9720-z.","short":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, M. Tancer, Discrete & Computational Geometry 54 (2015) 610–636.","chicago":"Karasev, Roman, Jan Kynčl, Pavel Paták, Zuzana Patakova, and Martin Tancer. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” Discrete & Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9720-z.","ama":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete & Computational Geometry. 2015;54(3):610-636. doi:10.1007/s00454-015-9720-z","ista":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. 2015. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete & Computational Geometry. 54(3), 610–636.","ieee":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex,” Discrete & Computational Geometry, vol. 54, no. 3. Springer, pp. 610–636, 2015.","apa":"Karasev, R., Kynčl, J., Paták, P., Patakova, Z., & Tancer, M. (2015). Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9720-z"},"publication":"Discrete & Computational Geometry","date_published":"2015-10-01T00:00:00Z","scopus_import":1,"day":"01","publisher":"Springer","department":[{"_id":"UlWa"}],"publication_status":"published","acknowledgement":"R. K. was supported by the Russian Foundation for Basic Research Grant 15-31-20403 (mol_a_ved) and grant 15-01-99563. J. K., Z. P., and M. T. were partially supported by ERC Advanced Research Grant No. 267165 (DISCONV) and by the project CE-ITI (GAČR P202/12/G061) of the Czech Science Foundation. J. K. was also partially supported by Swiss National Science Foundation Grants 200021-137574 and 200020-14453. P. P., Z. P., and M. T. were partially supported by the Charles University Grant GAUK 421511. P. P. was also partially supported by the Charles University Grant SVV-2014-260107. Z. P. was also partially supported by the Charles University Grant SVV-2014-260103.","year":"2015","volume":54,"date_created":"2018-12-11T11:53:28Z","date_updated":"2021-01-12T06:52:32Z","author":[{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"},{"full_name":"Kynčl, Jan","first_name":"Jan","last_name":"Kynčl"},{"full_name":"Paták, Pavel","first_name":"Pavel","last_name":"Paták"},{"first_name":"Zuzana","last_name":"Patakova","orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana"},{"full_name":"Tancer, Martin","first_name":"Martin","last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714"}],"publist_id":"5457","quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1403.8147","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00454-015-9720-z","month":"10"},{"oa_version":"None","volume":17,"date_created":"2018-12-11T11:53:26Z","date_updated":"2021-01-12T06:52:29Z","author":[{"first_name":"Jakub","last_name":"Michaliszyn","full_name":"Michaliszyn, Jakub"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"},{"full_name":"Kieroňski, Emanuel","last_name":"Kieroňski","first_name":"Emanuel"}],"intvolume":" 17","department":[{"_id":"ToHe"}],"publisher":"ACM","status":"public","title":"On the decidability of elementary modal logics","publication_status":"published","_id":"1680","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","publist_id":"5468","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider the satisfiability problem for modal logic over first-order definable classes of frames.We confirm the conjecture from Hemaspaandra and Schnoor [2008] that modal logic is decidable over classes definable by universal Horn formulae. We provide a full classification of Horn formulae with respect to the complexity of the corresponding satisfiability problem. It turns out, that except for the trivial case of inconsistent formulae, local satisfiability is eitherNP-complete or PSPACE-complete, and global satisfiability is NP-complete, PSPACE-complete, or ExpTime-complete. We also show that the finite satisfiability problem for modal logic over Horn definable classes of frames is decidable. On the negative side, we show undecidability of two related problems. First, we exhibit a simple universal three-variable formula defining the class of frames over which modal logic is undecidable. Second, we consider the satisfiability problem of bimodal logic over Horn definable classes of frames, and also present a formula leading to undecidability."}],"type":"journal_article","article_number":"2","language":[{"iso":"eng"}],"doi":"10.1145/2817825","date_published":"2015-09-01T00:00:00Z","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","citation":{"ama":"Michaliszyn J, Otop J, Kieroňski E. On the decidability of elementary modal logics. ACM Transactions on Computational Logic. 2015;17(1). doi:10.1145/2817825","ista":"Michaliszyn J, Otop J, Kieroňski E. 2015. On the decidability of elementary modal logics. ACM Transactions on Computational Logic. 17(1), 2.","apa":"Michaliszyn, J., Otop, J., & Kieroňski, E. (2015). On the decidability of elementary modal logics. ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/2817825","ieee":"J. Michaliszyn, J. Otop, and E. Kieroňski, “On the decidability of elementary modal logics,” ACM Transactions on Computational Logic, vol. 17, no. 1. ACM, 2015.","mla":"Michaliszyn, Jakub, et al. “On the Decidability of Elementary Modal Logics.” ACM Transactions on Computational Logic, vol. 17, no. 1, 2, ACM, 2015, doi:10.1145/2817825.","short":"J. Michaliszyn, J. Otop, E. Kieroňski, ACM Transactions on Computational Logic 17 (2015).","chicago":"Michaliszyn, Jakub, Jan Otop, and Emanuel Kieroňski. “On the Decidability of Elementary Modal Logics.” ACM Transactions on Computational Logic. ACM, 2015. https://doi.org/10.1145/2817825."},"publication":"ACM Transactions on Computational Logic","day":"01","month":"09"},{"author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"first_name":"Marek","last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"volume":62,"oa_version":"Preprint","date_created":"2018-12-11T11:53:27Z","date_updated":"2021-01-12T06:52:30Z","_id":"1682","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publisher":"ACM","intvolume":" 62","status":"public","title":"Robust satisfiability of systems of equations","publication_status":"published","issue":"4","publist_id":"5466","abstract":[{"lang":"eng","text":"We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α > 0, it holds that each function g: K → ℝn such that ||g - f || ∞ < α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K > 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings."}],"type":"journal_article","article_number":"26","doi":"10.1145/2751524","date_published":"2015-08-01T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0858"}],"citation":{"ista":"Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.","ieee":"P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal of the ACM, vol. 62, no. 4. ACM, 2015.","apa":"Franek, P., & Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM. https://doi.org/10.1145/2751524","ama":"Franek P, Krcál M. Robust satisfiability of systems of equations. Journal of the ACM. 2015;62(4). doi:10.1145/2751524","chicago":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2751524.","mla":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” Journal of the ACM, vol. 62, no. 4, 26, ACM, 2015, doi:10.1145/2751524.","short":"P. Franek, M. Krcál, Journal of the ACM 62 (2015)."},"publication":"Journal of the ACM","quality_controlled":"1","month":"08","day":"01","scopus_import":1},{"abstract":[{"lang":"eng","text":"The 1 MDa, 45-subunit proton-pumping NADH-ubiquinone oxidoreductase (complex I) is the largest complex of the mitochondrial electron transport chain. The molecular mechanism of complex I is central to the metabolism of cells, but has yet to be fully characterized. The last two years have seen steady progress towards this goal with the first atomic-resolution structure of the entire bacterial complex I, a 5 Å cryo-electron microscopy map of bovine mitochondrial complex I and a ∼3.8 Å resolution X-ray crystallographic study of mitochondrial complex I from yeast Yarrowia lipotytica. In this review we will discuss what we have learned from these studies and what remains to be elucidated."}],"publist_id":"5465","issue":"8","type":"journal_article","author":[{"full_name":"Letts, Jame A","last_name":"Letts","first_name":"Jame A","orcid":"0000-0002-9864-3586","id":"322DA418-F248-11E8-B48F-1D18A9856A87"},{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov","full_name":"Sazanov, Leonid A"}],"date_created":"2018-12-11T11:53:27Z","date_updated":"2021-01-12T06:52:30Z","volume":33,"oa_version":"None","_id":"1683","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","status":"public","publication_status":"published","title":"Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions","department":[{"_id":"LeSa"}],"publisher":"Elsevier","intvolume":" 33","month":"08","day":"01","scopus_import":1,"doi":"10.1016/j.sbi.2015.08.008","date_published":"2015-08-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Current Opinion in Structural Biology","citation":{"mla":"Letts, James A., and Leonid A. Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” Current Opinion in Structural Biology, vol. 33, no. 8, Elsevier, 2015, pp. 135–45, doi:10.1016/j.sbi.2015.08.008.","short":"J.A. Letts, L.A. Sazanov, Current Opinion in Structural Biology 33 (2015) 135–145.","chicago":"Letts, James A, and Leonid A Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” Current Opinion in Structural Biology. Elsevier, 2015. https://doi.org/10.1016/j.sbi.2015.08.008.","ama":"Letts JA, Sazanov LA. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. 2015;33(8):135-145. doi:10.1016/j.sbi.2015.08.008","ista":"Letts JA, Sazanov LA. 2015. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. 33(8), 135–145.","apa":"Letts, J. A., & Sazanov, L. A. (2015). Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. Elsevier. https://doi.org/10.1016/j.sbi.2015.08.008","ieee":"J. A. Letts and L. A. Sazanov, “Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions,” Current Opinion in Structural Biology, vol. 33, no. 8. Elsevier, pp. 135–145, 2015."},"quality_controlled":"1","page":"135 - 145"},{"scopus_import":1,"day":"04","month":"09","quality_controlled":"1","page":"1055 - 1056","publication":"Science","citation":{"short":"E. Kiermaier, M.K. Sixt, Science 349 (2015) 1055–1056.","mla":"Kiermaier, Eva, and Michael K. Sixt. “Fragmented Communication between Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to Sites of Infection.” Science, vol. 349, no. 6252, American Association for the Advancement of Science, 2015, pp. 1055–56, doi:10.1126/science.aad0867.","chicago":"Kiermaier, Eva, and Michael K Sixt. “Fragmented Communication between Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to Sites of Infection.” Science. American Association for the Advancement of Science, 2015. https://doi.org/10.1126/science.aad0867.","ama":"Kiermaier E, Sixt MK. Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. Science. 2015;349(6252):1055-1056. doi:10.1126/science.aad0867","ieee":"E. Kiermaier and M. K. Sixt, “Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection,” Science, vol. 349, no. 6252. American Association for the Advancement of Science, pp. 1055–1056, 2015.","apa":"Kiermaier, E., & Sixt, M. K. (2015). Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aad0867","ista":"Kiermaier E, Sixt MK. 2015. Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. Science. 349(6252), 1055–1056."},"language":[{"iso":"eng"}],"doi":"10.1126/science.aad0867","date_published":"2015-09-04T00:00:00Z","type":"journal_article","publist_id":"5459","issue":"6252","publication_status":"published","status":"public","title":"Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection","publisher":"American Association for the Advancement of Science","department":[{"_id":"MiSi"}],"intvolume":" 349","_id":"1686","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:52:31Z","date_created":"2018-12-11T11:53:28Z","volume":349,"oa_version":"None","author":[{"orcid":"0000-0001-6165-5738","id":"3EB04B78-F248-11E8-B48F-1D18A9856A87","last_name":"Kiermaier","first_name":"Eva","full_name":"Kiermaier, Eva"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"}]},{"type":"conference","abstract":[{"lang":"eng","text":"Computing an approximation of the reachable states of a hybrid system is a challenge, mainly because overapproximating the solutions of ODEs with a finite number of sets does not scale well. Using template polyhedra can greatly reduce the computational complexity, since it replaces complex operations on sets with a small number of optimization problems. However, the use of templates may make the over-approximation too conservative. Spurious transitions, which are falsely considered reachable, are particularly detrimental to performance and accuracy, and may exacerbate the state explosion problem. In this paper, we examine how spurious transitions can be avoided with minimal computational effort. To this end, detecting spurious transitions is reduced to the well-known problem of showing that two convex sets are disjoint by finding a hyperplane that separates them. We generalize this to owpipes by considering hyperplanes that evolve with time in correspondence to the dynamics of the system. The approach is implemented in the model checker SpaceEx and demonstrated on examples."}],"publist_id":"5452","ec_funded":1,"status":"public","title":"Eliminating spurious transitions in reachability with support functions","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"ACM","year":"2015","_id":"1692","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:30Z","date_updated":"2021-01-12T06:52:33Z","oa_version":"None","author":[{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy"},{"last_name":"Greitschus","first_name":"Marius","full_name":"Greitschus, Marius"},{"last_name":"Strump","first_name":"Thomas","full_name":"Strump, Thomas"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"}],"scopus_import":1,"month":"04","day":"14","publication_identifier":{"isbn":["978-1-4503-3433-4"]},"quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"page":"149 - 158","publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","citation":{"apa":"Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., & Podelski, A. (2015). Eliminating spurious transitions in reachability with support functions. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 149–158). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728622","ieee":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, and A. Podelski, “Eliminating spurious transitions in reachability with support functions,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 149–158.","ista":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. 2015. Eliminating spurious transitions in reachability with support functions. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 149–158.","ama":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. Eliminating spurious transitions in reachability with support functions. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:149-158. doi:10.1145/2728606.2728622","chicago":"Frehse, Goran, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, and Andreas Podelski. “Eliminating Spurious Transitions in Reachability with Support Functions.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 149–58. ACM, 2015. https://doi.org/10.1145/2728606.2728622.","short":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, A. Podelski, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–158.","mla":"Frehse, Goran, et al. “Eliminating Spurious Transitions in Reachability with Support Functions.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–58, doi:10.1145/2728606.2728622."},"language":[{"iso":"eng"}],"conference":{"end_date":"2015-04-16","start_date":"2015-04-14","location":"Seattle, WA, United States","name":"HSCC: Hybrid Systems - Computation and Control"},"date_published":"2015-04-14T00:00:00Z","doi":"10.1145/2728606.2728622"},{"type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"Quantum interference between energetically close states is theoretically investigated, with the state structure being observed via laser spectroscopy. In this work, we focus on hyperfine states of selected hydrogenic muonic isotopes, and on how quantum interference affects the measured Lamb shift. The process of photon excitation and subsequent photon decay is implemented within the framework of nonrelativistic second-order perturbation theory. Due to its experimental interest, calculations are performed for muonic hydrogen, deuterium, and helium-3. We restrict our analysis to the case of photon scattering by incident linear polarized photons and the polarization of the scattered photons not being observed. We conclude that while quantum interference effects can be safely neglected in muonic hydrogen and helium-3, in the case of muonic deuterium there are resonances with close proximity, where quantum interference effects can induce shifts up to a few percent of the linewidth, assuming a pointlike detector. However, by taking into account the geometry of the setup used by the CREMA collaboration, this effect is reduced to less than 0.2% of the linewidth in all possible cases, which makes it irrelevant at the present level of accuracy. © 2015 American Physical Society."}],"intvolume":" 92","status":"public","title":"Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1693","oa_version":"Preprint","scopus_import":1,"day":"28","citation":{"chicago":"Amaro, Pedro, Beatrice Franke, Julian Krauth, Marc Diepold, Filippo Fratini, Laleh Safari, Jorge Machado, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” Physical Review A. American Physical Society, 2015. https://doi.org/10.1103/PhysRevA.92.022514.","mla":"Amaro, Pedro, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” Physical Review A, vol. 92, no. 2, 022514, American Physical Society, 2015, doi:10.1103/PhysRevA.92.022514.","short":"P. Amaro, B. Franke, J. Krauth, M. Diepold, F. Fratini, L. Safari, J. Machado, A. Antognini, F. Kottmann, P. Indelicato, R. Pohl, J. Santos, Physical Review A 92 (2015).","ista":"Amaro P, Franke B, Krauth J, Diepold M, Fratini F, Safari L, Machado J, Antognini A, Kottmann F, Indelicato P, Pohl R, Santos J. 2015. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. 92(2), 022514.","ieee":"P. Amaro et al., “Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3,” Physical Review A, vol. 92, no. 2. American Physical Society, 2015.","apa":"Amaro, P., Franke, B., Krauth, J., Diepold, M., Fratini, F., Safari, L., … Santos, J. (2015). Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.92.022514","ama":"Amaro P, Franke B, Krauth J, et al. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. 2015;92(2). doi:10.1103/PhysRevA.92.022514"},"publication":"Physical Review A","date_published":"2015-08-28T00:00:00Z","article_number":"022514","ec_funded":1,"publist_id":"5451","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","year":"2015","volume":92,"date_created":"2018-12-11T11:53:30Z","date_updated":"2021-01-12T06:52:34Z","author":[{"last_name":"Amaro","first_name":"Pedro","full_name":"Amaro, Pedro"},{"full_name":"Franke, Beatrice","last_name":"Franke","first_name":"Beatrice"},{"full_name":"Krauth, Julian","last_name":"Krauth","first_name":"Julian"},{"last_name":"Diepold","first_name":"Marc","full_name":"Diepold, Marc"},{"last_name":"Fratini","first_name":"Filippo","full_name":"Fratini, Filippo"},{"first_name":"Laleh","last_name":"Safari","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","full_name":"Safari, Laleh"},{"full_name":"Machado, Jorge","first_name":"Jorge","last_name":"Machado"},{"last_name":"Antognini","first_name":"Aldo","full_name":"Antognini, Aldo"},{"last_name":"Kottmann","first_name":"Franz","full_name":"Kottmann, Franz"},{"full_name":"Indelicato, Paul","last_name":"Indelicato","first_name":"Paul"},{"last_name":"Pohl","first_name":"Randolf","full_name":"Pohl, Randolf"},{"full_name":"Santos, José","last_name":"Santos","first_name":"José"}],"month":"08","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.02734"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevA.92.022514"},{"month":"04","day":"14","citation":{"ama":"Bak S, Bogomolov S, Johnson T. HYST: A source transformation and translation tool for hybrid automaton models. In: Springer; 2015:128-133. doi:10.1145/2728606.2728630","ista":"Bak S, Bogomolov S, Johnson T. 2015. HYST: A source transformation and translation tool for hybrid automaton models. HSCC: Hybrid Systems - Computation and Control, 128–133.","apa":"Bak, S., Bogomolov, S., & Johnson, T. (2015). HYST: A source transformation and translation tool for hybrid automaton models (pp. 128–133). Presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States: Springer. https://doi.org/10.1145/2728606.2728630","ieee":"S. Bak, S. Bogomolov, and T. Johnson, “HYST: A source transformation and translation tool for hybrid automaton models,” presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States, 2015, pp. 128–133.","mla":"Bak, Stanley, et al. HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models. Springer, 2015, pp. 128–33, doi:10.1145/2728606.2728630.","short":"S. Bak, S. Bogomolov, T. Johnson, in:, Springer, 2015, pp. 128–133.","chicago":"Bak, Stanley, Sergiy Bogomolov, and Taylor Johnson. “HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models,” 128–33. Springer, 2015. https://doi.org/10.1145/2728606.2728630."},"quality_controlled":"1","page":"128 - 133","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2015-04-14","location":"Seattle, WA, United States","end_date":"2015-04-16"},"date_published":"2015-04-14T00:00:00Z","doi":"10.1145/2728606.2728630","language":[{"iso":"eng"}],"type":"conference","abstract":[{"text":"A number of powerful and scalable hybrid systems model checkers have recently emerged. Although all of them honor roughly the same hybrid systems semantics, they have drastically different model description languages. This situation (a) makes it difficult to quickly evaluate a specific hybrid automaton model using the different tools, (b) obstructs comparisons of reachability approaches, and (c) impedes the widespread application of research results that perform model modification and could benefit many of the tools. In this paper, we present Hyst, a Hybrid Source Transformer. Hyst is a source-to-source translation tool, currently taking input in the SpaceEx model format, and translating to the formats of HyCreate, Flow∗, or dReach. Internally, the tool supports generic model-to-model transformation passes that serve to both ease the translation and potentially improve reachability results for the supported tools. Although these model transformation passes could be implemented within each tool, the Hyst approach provides a single place for model modification, generating modified input sources for the unmodified target tools. Our evaluation demonstrates Hyst is capable of automatically translating benchmarks in several classes (including affine and nonlinear hybrid automata) to the input formats of several tools. Additionally, we illustrate a general model transformation pass based on pseudo-invariants implemented in Hyst that illustrates the reachability improvement.","lang":"eng"}],"publist_id":"5454","ec_funded":1,"_id":"1690","acknowledgement":"The material presented in this paper is based upon work sup-ported by the Air Force Research Laboratory’s Information Directorate (AFRL/RI) through the Visiting Faculty Research Program (VFRP) under contract number FA8750-13-2-0115 and the Air Force Office of Scientific Research (AFOSR). Any opinions,findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the AFRL/RI or AFOSR. This work was also partly supported in part by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR14 AVACS, http://www.avacs.org/), by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"HYST: A source transformation and translation tool for hybrid automaton models","status":"public","publisher":"Springer","department":[{"_id":"ToHe"}],"author":[{"full_name":"Bak, Stanley","last_name":"Bak","first_name":"Stanley"},{"full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy"},{"full_name":"Johnson, Taylor","last_name":"Johnson","first_name":"Taylor"}],"date_created":"2018-12-11T11:53:29Z","date_updated":"2021-01-12T06:52:33Z","oa_version":"None"},{"month":"04","day":"14","scopus_import":1,"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2015-04-14","location":"Seattle, WA, United States","end_date":"2015-04-16"},"date_published":"2015-04-14T00:00:00Z","doi":"10.1145/2728606.2728617","language":[{"iso":"eng"}],"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","citation":{"chicago":"Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015. https://doi.org/10.1145/2728606.2728617.","short":"M. Svoreňová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–238.","mla":"Svoreňová, Mária, et al. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–38, doi:10.1145/2728606.2728617.","ieee":"M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.","apa":"Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617","ista":"Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238.","ama":"Svoreňová M, Chmelik M, Leahy K, et al. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:233-238. doi:10.1145/2728606.2728617"},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"page":"233 - 238","abstract":[{"lang":"eng","text":"We consider a case study of the problem of deploying an autonomous air vehicle in a partially observable, dynamic, indoor environment from a specification given as a linear temporal logic (LTL) formula over regions of interest. We model the motion and sensing capabilities of the vehicle as a partially observable Markov decision process (POMDP). We adapt recent results for solving POMDPs with parity objectives to generate a control policy. We also extend the existing framework with a policy minimization technique to obtain a better implementable policy, while preserving its correctness. The proposed techniques are illustrated in an experimental setup involving an autonomous quadrotor performing surveillance in a dynamic environment."}],"ec_funded":1,"publist_id":"5453","type":"conference","author":[{"last_name":"Svoreňová","first_name":"Mária","full_name":"Svoreňová, Mária"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"last_name":"Leahy","first_name":"Kevin","full_name":"Leahy, Kevin"},{"first_name":"Hasan","last_name":"Eniser","full_name":"Eniser, Hasan"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Cěrná, Ivana","first_name":"Ivana","last_name":"Cěrná"},{"full_name":"Belta, Cǎlin","last_name":"Belta","first_name":"Cǎlin"}],"date_updated":"2021-01-12T06:52:33Z","date_created":"2018-12-11T11:53:29Z","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1691","year":"2015","title":"Temporal logic motion planning using POMDPs with parity objectives: Case study paper","status":"public","publication_status":"published","publisher":"ACM","department":[{"_id":"KrCh"}]},{"date_updated":"2021-01-12T06:52:34Z","date_created":"2018-12-11T11:53:30Z","volume":60,"oa_version":"None","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"publication_status":"published","title":"Quantitative temporal simulation and refinement distances for timed systems","status":"public","department":[{"_id":"KrCh"}],"publisher":"IEEE","intvolume":" 60","year":"2015","_id":"1694","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"\r\nWe introduce quantitative timed refinement and timed simulation (directed) metrics, incorporating zenoness checks, for timed systems. These metrics assign positive real numbers which quantify the timing mismatches between two timed systems, amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximal timing mismatch that can arise, (2) the “steady-state” maximal timing mismatches, where initial transient timing mismatches are ignored; and (3) the (long-run) average timing mismatches amongst two systems. These three kinds of mismatches constitute three important types of timing differences. Our event times are the global times, measured from the start of the system execution, not just the time durations of individual steps. We present algorithms over timed automata for computing the three quantitative simulation distances to within any desired degree of accuracy. In order to compute the values of the quantitative simulation distances, we use a game theoretic formulation. We introduce two new kinds of objectives for two player games on finite-state game graphs: (1) eventual debit-sum level objectives, and (2) average debit-sum level objectives. We present algorithms for computing the optimal values for these objectives in graph games, and then use these algorithms to compute the values of the timed simulation distances over timed automata.\r\n","lang":"eng"}],"ec_funded":1,"publist_id":"5450","issue":"9","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1109/TAC.2015.2404612","date_published":"2015-02-24T00:00:00Z","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"2291 - 2306","publication":"IEEE Transactions on Automatic Control","citation":{"ama":"Chatterjee K, Prabhu V. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 2015;60(9):2291-2306. doi:10.1109/TAC.2015.2404612","ista":"Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.","apa":"Chatterjee, K., & Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/TAC.2015.2404612","ieee":"K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement distances for timed systems,” IEEE Transactions on Automatic Control, vol. 60, no. 9. IEEE, pp. 2291–2306, 2015.","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic Control, vol. 60, no. 9, IEEE, 2015, pp. 2291–306, doi:10.1109/TAC.2015.2404612.","short":"K. Chatterjee, V. Prabhu, IEEE Transactions on Automatic Control 60 (2015) 2291–2306.","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2015.2404612."},"month":"02","day":"24","scopus_import":1},{"month":"09","language":[{"iso":"eng"}],"doi":"10.1002/pssb.201552082","quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1503.03738","open_access":"1"}],"publist_id":"5449","ec_funded":1,"date_created":"2018-12-11T11:53:31Z","date_updated":"2021-01-12T06:52:34Z","volume":252,"author":[{"last_name":"Kaczmarczyk","first_name":"Jan","orcid":"0000-0002-1629-3675","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarczyk, Jan"},{"first_name":"Tobias","last_name":"Schickling","full_name":"Schickling, Tobias"},{"last_name":"Bünemann","first_name":"Jörg","full_name":"Bünemann, Jörg"}],"publication_status":"published","publisher":"Wiley","department":[{"_id":"MiLe"}],"year":"2015","day":"01","scopus_import":1,"date_published":"2015-09-01T00:00:00Z","page":"2059 - 2071","publication":"Physica Status Solidi (B): Basic Solid State Physics","citation":{"ieee":"J. Kaczmarczyk, T. Schickling, and J. Bünemann, “Evaluation techniques for Gutzwiller wave functions in finite dimensions,” Physica Status Solidi (B): Basic Solid State Physics, vol. 252, no. 9. Wiley, pp. 2059–2071, 2015.","apa":"Kaczmarczyk, J., Schickling, T., & Bünemann, J. (2015). Evaluation techniques for Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B): Basic Solid State Physics. Wiley. https://doi.org/10.1002/pssb.201552082","ista":"Kaczmarczyk J, Schickling T, Bünemann J. 2015. Evaluation techniques for Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B): Basic Solid State Physics. 252(9), 2059–2071.","ama":"Kaczmarczyk J, Schickling T, Bünemann J. Evaluation techniques for Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B): Basic Solid State Physics. 2015;252(9):2059-2071. doi:10.1002/pssb.201552082","chicago":"Kaczmarczyk, Jan, Tobias Schickling, and Jörg Bünemann. “Evaluation Techniques for Gutzwiller Wave Functions in Finite Dimensions.” Physica Status Solidi (B): Basic Solid State Physics. Wiley, 2015. https://doi.org/10.1002/pssb.201552082.","short":"J. Kaczmarczyk, T. Schickling, J. Bünemann, Physica Status Solidi (B): Basic Solid State Physics 252 (2015) 2059–2071.","mla":"Kaczmarczyk, Jan, et al. “Evaluation Techniques for Gutzwiller Wave Functions in Finite Dimensions.” Physica Status Solidi (B): Basic Solid State Physics, vol. 252, no. 9, Wiley, 2015, pp. 2059–71, doi:10.1002/pssb.201552082."},"abstract":[{"text":"We give a comprehensive introduction into a diagrammatic method that allows for the evaluation of Gutzwiller wave functions in finite spatial dimensions. We discuss in detail some numerical schemes that turned out to be useful in the real-space evaluation of the diagrams. The method is applied to the problem of d-wave superconductivity in a two-dimensional single-band Hubbard model. Here, we discuss in particular the role of long-range contributions in our diagrammatic expansion. We further reconsider our previous analysis on the kinetic energy gain in the superconducting state.","lang":"eng"}],"issue":"9","type":"journal_article","oa_version":"Preprint","title":"Evaluation techniques for Gutzwiller wave functions in finite dimensions","status":"public","intvolume":" 252","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1695"},{"has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2015-07-01T00:00:00Z","citation":{"ama":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. High accuracy decoding of dynamical motion from a large retinal population. PLoS Computational Biology. 2015;11(7). doi:10.1371/journal.pcbi.1004304","ieee":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, and M. Berry, “High accuracy decoding of dynamical motion from a large retinal population,” PLoS Computational Biology, vol. 11, no. 7. Public Library of Science, 2015.","apa":"Marre, O., Botella Soler, V., Simmons, K., Mora, T., Tkačik, G., & Berry, M. (2015). High accuracy decoding of dynamical motion from a large retinal population. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004304","ista":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. 2015. High accuracy decoding of dynamical motion from a large retinal population. PLoS Computational Biology. 11(7), e1004304.","short":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, M. Berry, PLoS Computational Biology 11 (2015).","mla":"Marre, Olivier, et al. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” PLoS Computational Biology, vol. 11, no. 7, e1004304, Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004304.","chicago":"Marre, Olivier, Vicente Botella Soler, Kristina Simmons, Thierry Mora, Gašper Tkačik, and Michael Berry. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” PLoS Computational Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004304."},"publication":"PLoS Computational Biology","issue":"7","abstract":[{"lang":"eng","text":"Motion tracking is a challenge the visual system has to solve by reading out the retinal population. It is still unclear how the information from different neurons can be combined together to estimate the position of an object. Here we recorded a large population of ganglion cells in a dense patch of salamander and guinea pig retinas while displaying a bar moving diffusively. We show that the bar’s position can be reconstructed from retinal activity with a precision in the hyperacuity regime using a linear decoder acting on 100+ cells. We then took advantage of this unprecedented precision to explore the spatial structure of the retina’s population code. The classical view would have suggested that the firing rates of the cells form a moving hill of activity tracking the bar’s position. Instead, we found that most ganglion cells in the salamander fired sparsely and idiosyncratically, so that their neural image did not track the bar. Furthermore, ganglion cell activity spanned an area much larger than predicted by their receptive fields, with cells coding for motion far in their surround. As a result, population redundancy was high, and we could find multiple, disjoint subsets of neurons that encoded the trajectory with high precision. This organization allows for diverse collections of ganglion cells to represent high-accuracy motion information in a form easily read out by downstream neural circuits."}],"type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5212","date_created":"2018-12-12T10:16:25Z","date_updated":"2020-07-14T12:45:12Z","checksum":"472b979f3f1cffb37b3e503f085115ca","file_name":"IST-2016-455-v1+1_journal.pcbi.1004304.pdf","access_level":"open_access","content_type":"application/pdf","file_size":4673930,"creator":"system"}],"pubrep_id":"455","intvolume":" 11","title":"High accuracy decoding of dynamical motion from a large retinal population","ddc":["570"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1697","month":"07","language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1004304","project":[{"name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425","grant_number":"P 25651-N26"}],"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,"publist_id":"5447","file_date_updated":"2020-07-14T12:45:12Z","article_number":"e1004304","volume":11,"date_updated":"2021-01-12T06:52:35Z","date_created":"2018-12-11T11:53:31Z","author":[{"first_name":"Olivier","last_name":"Marre","full_name":"Marre, Olivier"},{"orcid":"0000-0002-8790-1914","id":"421234E8-F248-11E8-B48F-1D18A9856A87","last_name":"Botella Soler","first_name":"Vicente","full_name":"Botella Soler, Vicente"},{"last_name":"Simmons","first_name":"Kristina","full_name":"Simmons, Kristina"},{"first_name":"Thierry","last_name":"Mora","full_name":"Mora, Thierry"},{"full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"},{"full_name":"Berry, Michael","last_name":"Berry","first_name":"Michael"}],"publisher":"Public Library of Science","department":[{"_id":"GaTk"}],"publication_status":"published","year":"2015","acknowledgement":"This work was supported by grants EY 014196 and EY 017934 to MJB, ANR OPTIMA, the French State program Investissements d’Avenir managed by the Agence Nationale de la Recherche [LIFESENSES: ANR-10-LABX-65], and by a EC grant from the Human Brain Project (CLAP) to OM, the Austrian Research Foundation FWF P25651 to VBS and GT. VBS is partially supported by contracts MEC, Spain (Grant No. AYA2010- 22111-C03-02, Grant No. AYA2013-48623-C2-2 and FEDER Funds)."},{"file_date_updated":"2020-07-14T12:45:12Z","publist_id":"5442","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Springer","acknowledgement":"This work was made possible with financial support by the Vienna Science and Technology Fund (WWTF), by the Deutsche Forschungsgemeinschaft (DFG), Research Unit 1078 Natural selection in structured populations, by the Austrian Science Fund (FWF) via funding for the Vienna Graduate School for Population Genetics, and by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with the Austrian Commission for UNESCO and the Austrian Academy of Sciences with financial support from the Federal Ministry for Science and Research Austria).","year":"2015","date_updated":"2023-02-23T10:10:36Z","date_created":"2018-12-11T11:53:32Z","volume":70,"author":[{"full_name":"Uecker, Hildegard","first_name":"Hildegard","last_name":"Uecker","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9435-2813"},{"first_name":"Derek","last_name":"Setter","full_name":"Setter, Derek"},{"first_name":"Joachim","last_name":"Hermisson","full_name":"Hermisson, Joachim"}],"month":"06","quality_controlled":"1","project":[{"_id":"25B67606-B435-11E9-9278-68D0E5697425","name":"L'OREAL Fellowship"}],"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"}],"doi":"10.1007/s00285-014-0802-y","type":"journal_article","abstract":[{"text":"By hybridization and backcrossing, alleles can surmount species boundaries and be incorporated into the genome of a related species. This introgression of genes is of particular evolutionary relevance if it involves the transfer of adaptations between populations. However, any beneficial allele will typically be associated with other alien alleles that are often deleterious and hamper the introgression process. In order to describe the introgression of an adaptive allele, we set up a stochastic model with an explicit genetic makeup of linked and unlinked deleterious alleles. Based on the theory of reducible multitype branching processes, we derive a recursive expression for the establishment probability of the beneficial allele after a single hybridization event. We furthermore study the probability that slightly deleterious alleles hitchhike to fixation. The key to the analysis is a split of the process into a stochastic phase in which the advantageous alleles establishes and a deterministic phase in which it sweeps to fixation. We thereafter apply the theory to a set of biologically relevant scenarios such as introgression in the presence of many unlinked or few closely linked deleterious alleles. A comparison to computer simulations shows that the approximations work well over a large parameter range.","lang":"eng"}],"issue":"7","ddc":["576"],"status":"public","title":"Adaptive gene introgression after secondary contact","intvolume":" 70","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1699","oa_version":"Published Version","file":[{"checksum":"00e3a67bda05d4cc165b3a48b41ef9ad","date_created":"2018-12-12T10:14:27Z","date_updated":"2020-07-14T12:45:12Z","file_id":"5079","relation":"main_file","creator":"system","file_size":1321527,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-458-v1+1_s00285-014-0802-y.pdf"}],"pubrep_id":"458","scopus_import":1,"day":"01","has_accepted_license":"1","page":"1523 - 1580","publication":"Journal of Mathematical Biology","citation":{"ieee":"H. Uecker, D. Setter, and J. Hermisson, “Adaptive gene introgression after secondary contact,” Journal of Mathematical Biology, vol. 70, no. 7. Springer, pp. 1523–1580, 2015.","apa":"Uecker, H., Setter, D., & Hermisson, J. (2015). Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. Springer. https://doi.org/10.1007/s00285-014-0802-y","ista":"Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. 70(7), 1523–1580.","ama":"Uecker H, Setter D, Hermisson J. Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. 2015;70(7):1523-1580. doi:10.1007/s00285-014-0802-y","chicago":"Uecker, Hildegard, Derek Setter, and Joachim Hermisson. “Adaptive Gene Introgression after Secondary Contact.” Journal of Mathematical Biology. Springer, 2015. https://doi.org/10.1007/s00285-014-0802-y.","short":"H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015) 1523–1580.","mla":"Uecker, Hildegard, et al. “Adaptive Gene Introgression after Secondary Contact.” Journal of Mathematical Biology, vol. 70, no. 7, Springer, 2015, pp. 1523–80, doi:10.1007/s00285-014-0802-y."},"date_published":"2015-06-01T00:00:00Z"},{"intvolume":" 92","title":"Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states","status":"public","_id":"1696","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"The recently proposed diagrammatic expansion (DE) technique for the full Gutzwiller wave function (GWF) is applied to the Anderson lattice model. This approach allows for a systematic evaluation of the expectation values with full Gutzwiller wave function in finite-dimensional systems. It introduces results extending in an essential manner those obtained by means of the standard Gutzwiller approximation (GA), which is variationally exact only in infinite dimensions. Within the DE-GWF approach we discuss the principal paramagnetic properties and their relevance to heavy-fermion systems. We demonstrate the formation of an effective, narrow f band originating from atomic f-electron states and subsequently interpret this behavior as a direct itineracy of f electrons; it represents a combined effect of both the hybridization and the correlations induced by the Coulomb repulsive interaction. Such a feature is absent on the level of GA, which is equivalent to the zeroth order of our expansion. Formation of the hybridization- and electron-concentration-dependent narrow f band rationalizes the common assumption of such dispersion of f levels in the phenomenological modeling of the band structure of CeCoIn5. Moreover, it is shown that the emerging f-electron direct itineracy leads in a natural manner to three physically distinct regimes within a single model that are frequently discussed for 4f- or 5f-electron compounds as separate model situations. We identify these regimes as (i) the mixed-valence regime, (ii) Kondo/almost-Kondo insulating regime, and (iii) the Kondo-lattice limit when the f-electron occupancy is very close to the f-state half filling, ⟨nˆf⟩→1. The nonstandard features of the emerging correlated quantum liquid state are stressed."}],"citation":{"short":"M. Wysokiński, J. Kaczmarczyk, J. Spałek, Physical Review B 92 (2015).","mla":"Wysokiński, Marcin, et al. “Gutzwiller Wave Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” Physical Review B, vol. 92, no. 12, 125135, American Physical Society, 2015, doi:10.1103/PhysRevB.92.125135.","chicago":"Wysokiński, Marcin, Jan Kaczmarczyk, and Jozef Spałek. “Gutzwiller Wave Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” Physical Review B. American Physical Society, 2015. https://doi.org/10.1103/PhysRevB.92.125135.","ama":"Wysokiński M, Kaczmarczyk J, Spałek J. Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. Physical Review B. 2015;92(12). doi:10.1103/PhysRevB.92.125135","apa":"Wysokiński, M., Kaczmarczyk, J., & Spałek, J. (2015). Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.92.125135","ieee":"M. Wysokiński, J. Kaczmarczyk, and J. Spałek, “Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states,” Physical Review B, vol. 92, no. 12. American Physical Society, 2015.","ista":"Wysokiński M, Kaczmarczyk J, Spałek J. 2015. Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. Physical Review B. 92(12), 125135."},"publication":"Physical Review B","date_published":"2015-09-18T00:00:00Z","scopus_import":1,"day":"18","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"publication_status":"published","year":"2015","acknowledgement":"The work was partly supported by the National Science Centre (NCN) under MAESTRO, Grant No. DEC-2012/04/A/ST3/00342. M.W. acknowledges the hospitality of the Institute of Science and Technology Austria during the final stage of development of the present work, as well as partial financial support from the Society-Environment-Technology project of the Jagiellonian University for that stay. J.K. acknowledges support from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant Agreement No. [291734 ].","volume":92,"date_created":"2018-12-11T11:53:31Z","date_updated":"2021-01-12T06:52:35Z","author":[{"last_name":"Wysokiński","first_name":"Marcin","full_name":"Wysokiński, Marcin"},{"last_name":"Kaczmarczyk","first_name":"Jan","orcid":"0000-0002-1629-3675","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarczyk, Jan"},{"first_name":"Jozef","last_name":"Spałek","full_name":"Spałek, Jozef"}],"article_number":"125135","publist_id":"5448","ec_funded":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1505.07003","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevB.92.125135","month":"09"},{"month":"09","quality_controlled":"1","project":[{"name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"external_id":{"pmid":["26330611"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/"}],"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1514188112","publist_id":"5440","publication_status":"published","publisher":"National Academy of Sciences","department":[{"_id":"GaTk"}],"acknowledgement":"Research was supported in part by National Science Foundation Grants PHY-1305525, PHY-1451171, and CCF-0939370, by National Institutes of Health Grant R01 EY14196, and by Austrian Science Foundation Grant FWF P25651. Additional support was provided by the\r\nFannie and John Hertz Foundation, by the Swartz Foundation, by the W. M. Keck Foundation, and by the Simons Foundation.","year":"2015","pmid":1,"date_updated":"2021-01-12T06:52:37Z","date_created":"2018-12-11T11:53:33Z","volume":112,"author":[{"first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"full_name":"Mora, Thierry","last_name":"Mora","first_name":"Thierry"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"full_name":"Amodei, Dario","last_name":"Amodei","first_name":"Dario"},{"full_name":"Palmer, Stephanie","first_name":"Stephanie","last_name":"Palmer"},{"last_name":"Berry Ii","first_name":"Michael","full_name":"Berry Ii, Michael"},{"last_name":"Bialek","first_name":"William","full_name":"Bialek, William"}],"scopus_import":1,"day":"15","page":"11508 - 11513","publication":"PNAS","citation":{"chicago":"Tkačik, Gašper, Thierry Mora, Olivier Marre, Dario Amodei, Stephanie Palmer, Michael Berry Ii, and William Bialek. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1514188112.","mla":"Tkačik, Gašper, et al. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” PNAS, vol. 112, no. 37, National Academy of Sciences, 2015, pp. 11508–13, doi:10.1073/pnas.1514188112.","short":"G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek, PNAS 112 (2015) 11508–11513.","ista":"Tkačik G, Mora T, Marre O, Amodei D, Palmer S, Berry Ii M, Bialek W. 2015. Thermodynamics and signatures of criticality in a network of neurons. PNAS. 112(37), 11508–11513.","apa":"Tkačik, G., Mora, T., Marre, O., Amodei, D., Palmer, S., Berry Ii, M., & Bialek, W. (2015). Thermodynamics and signatures of criticality in a network of neurons. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1514188112","ieee":"G. Tkačik et al., “Thermodynamics and signatures of criticality in a network of neurons,” PNAS, vol. 112, no. 37. National Academy of Sciences, pp. 11508–11513, 2015.","ama":"Tkačik G, Mora T, Marre O, et al. Thermodynamics and signatures of criticality in a network of neurons. PNAS. 2015;112(37):11508-11513. doi:10.1073/pnas.1514188112"},"date_published":"2015-09-15T00:00:00Z","type":"journal_article","abstract":[{"text":"The activity of a neural network is defined by patterns of spiking and silence from the individual neurons. Because spikes are (relatively) sparse, patterns of activity with increasing numbers of spikes are less probable, but, with more spikes, the number of possible patterns increases. This tradeoff between probability and numerosity is mathematically equivalent to the relationship between entropy and energy in statistical physics. We construct this relationship for populations of up to N = 160 neurons in a small patch of the vertebrate retina, using a combination of direct and model-based analyses of experiments on the response of this network to naturalistic movies. We see signs of a thermodynamic limit, where the entropy per neuron approaches a smooth function of the energy per neuron as N increases. The form of this function corresponds to the distribution of activity being poised near an unusual kind of critical point. We suggest further tests of criticality, and give a brief discussion of its functional significance. ","lang":"eng"}],"issue":"37","status":"public","title":"Thermodynamics and signatures of criticality in a network of neurons","intvolume":" 112","_id":"1701","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version"},{"author":[{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Rabinovich, Alexander","last_name":"Rabinovich","first_name":"Alexander"},{"full_name":"Raskin, Jean","first_name":"Jean","last_name":"Raskin"}],"volume":241,"date_updated":"2021-01-12T06:52:36Z","date_created":"2018-12-11T11:53:32Z","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148), ERC Start grant (279499: inVEST).","year":"2015","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Elsevier","publication_status":"published","ec_funded":1,"publist_id":"5443","doi":"10.1016/j.ic.2015.03.001","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1209.3234","open_access":"1"}],"oa":1,"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","month":"04","oa_version":"Preprint","_id":"1698","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 241","status":"public","title":"The complexity of multi-mean-payoff and multi-energy games","issue":"4","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy games and show inter-reducibility of multi-mean-payoff and multi-energy games for finite-memory strategies. We improve the computational complexity for solving both classes with finite-memory strategies: we prove coNP-completeness improving the previous known EXPSPACE bound. For memoryless strategies, we show that deciding the existence of a winning strategy for the protagonist is NP-complete. We present the first solution of multi-mean-payoff games with infinite-memory strategies: we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf objectives are coNP-complete.","lang":"eng"}],"type":"journal_article","date_published":"2015-04-01T00:00:00Z","citation":{"chicago":"Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.001.","mla":"Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” Information and Computation, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:10.1016/j.ic.2015.03.001.","short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","ista":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.","ieee":"Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.","apa":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.001","ama":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 2015;241(4):177-196. doi:10.1016/j.ic.2015.03.001"},"publication":"Information and Computation","page":"177 - 196","day":"01","scopus_import":1},{"citation":{"ieee":"E. Van Loon, M. Katsnelson, and M. Lemeshko, “Ultralong-range order in the Fermi-Hubbard model with long-range interactions,” Physical Review B, vol. 92, no. 8. American Physical Society, 2015.","apa":"Van Loon, E., Katsnelson, M., & Lemeshko, M. (2015). Ultralong-range order in the Fermi-Hubbard model with long-range interactions. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.92.081106","ista":"Van Loon E, Katsnelson M, Lemeshko M. 2015. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. Physical Review B. 92(8), 081106.","ama":"Van Loon E, Katsnelson M, Lemeshko M. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. Physical Review B. 2015;92(8). doi:10.1103/PhysRevB.92.081106","chicago":"Van Loon, Erik, Mikhail Katsnelson, and Mikhail Lemeshko. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” Physical Review B. American Physical Society, 2015. https://doi.org/10.1103/PhysRevB.92.081106.","short":"E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015).","mla":"Van Loon, Erik, et al. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” Physical Review B, vol. 92, no. 8, 081106, American Physical Society, 2015, doi:10.1103/PhysRevB.92.081106."},"main_file_link":[{"url":"http://arxiv.org/abs/1506.06007","open_access":"1"}],"oa":1,"publication":"Physical Review B","date_published":"2015-08-10T00:00:00Z","doi":"10.1103/PhysRevB.92.081106","language":[{"iso":"eng"}],"scopus_import":1,"month":"08","day":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1700","acknowledgement":"The work is supported by European Research Council (ERC) Advanced Grant No. 338957 FEMTO/NANO.","year":"2015","intvolume":" 92","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","title":"Ultralong-range order in the Fermi-Hubbard model with long-range interactions","status":"public","author":[{"full_name":"Van Loon, Erik","last_name":"Van Loon","first_name":"Erik"},{"first_name":"Mikhail","last_name":"Katsnelson","full_name":"Katsnelson, Mikhail"},{"orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail"}],"oa_version":"Preprint","volume":92,"date_created":"2018-12-11T11:53:32Z","date_updated":"2021-01-12T06:52:37Z","type":"journal_article","article_number":"081106","publist_id":"5441","issue":"8","abstract":[{"text":"We use the dual boson approach to reveal the phase diagram of the Fermi-Hubbard model with long-range dipole-dipole interactions. By using a large-scale finite-temperature calculation on a 64×64 square lattice we demonstrate the existence of a novel phase, possessing an "ultralong-range" order. The fingerprint of this phase - the density correlation function - features a nontrivial behavior on a scale of tens of lattice sites. We study the properties and the stability of the ultralong-range-ordered phase, and show that it is accessible in modern experiments with ultracold polar molecules and magnetic atoms.","lang":"eng"}]},{"author":[{"full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746","first_name":"Andreas","last_name":"Deuchert"},{"full_name":"Hainzl, Christian","first_name":"Christian","last_name":"Hainzl"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"volume":105,"date_created":"2018-12-11T11:53:34Z","date_updated":"2021-01-12T06:52:38Z","year":"2015","publisher":"Springer","department":[{"_id":"RoSe"}],"publication_status":"published","publist_id":"5432","file_date_updated":"2020-07-14T12:45:13Z","doi":"10.1007/s11005-015-0787-5","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1502.07205","open_access":"1"}],"quality_controlled":"1","month":"08","file":[{"file_name":"2015_LettersMathPhys_Deuchert.pdf","access_level":"open_access","file_size":484967,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5836","date_created":"2019-01-15T14:42:07Z","date_updated":"2020-07-14T12:45:13Z","checksum":"fd7307282a314cc1fbbaef77b187516b"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1704","intvolume":" 105","title":"Note on a family of monotone quantum relative entropies","ddc":["510"],"status":"public","issue":"10","abstract":[{"lang":"eng","text":"Given a convex function (Formula presented.) and two hermitian matrices A and B, Lewin and Sabin study in (Lett Math Phys 104:691–705, 2014) the relative entropy defined by (Formula presented.). Among other things, they prove that the so-defined quantity is monotone if and only if (Formula presented.) is operator monotone. The monotonicity is then used to properly define (Formula presented.) for bounded self-adjoint operators acting on an infinite-dimensional Hilbert space by a limiting procedure. More precisely, for an increasing sequence of finite-dimensional projections (Formula presented.) with (Formula presented.) strongly, the limit (Formula presented.) is shown to exist and to be independent of the sequence of projections (Formula presented.). The question whether this sequence converges to its "obvious" limit, namely (Formula presented.), has been left open. We answer this question in principle affirmatively and show that (Formula presented.). If the operators A and B are regular enough, that is (A − B), (Formula presented.) and (Formula presented.) are trace-class, the identity (Formula presented.) holds."}],"type":"journal_article","date_published":"2015-08-05T00:00:00Z","citation":{"ama":"Deuchert A, Hainzl C, Seiringer R. Note on a family of monotone quantum relative entropies. Letters in Mathematical Physics. 2015;105(10):1449-1466. doi:10.1007/s11005-015-0787-5","apa":"Deuchert, A., Hainzl, C., & Seiringer, R. (2015). Note on a family of monotone quantum relative entropies. Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-015-0787-5","ieee":"A. Deuchert, C. Hainzl, and R. Seiringer, “Note on a family of monotone quantum relative entropies,” Letters in Mathematical Physics, vol. 105, no. 10. Springer, pp. 1449–1466, 2015.","ista":"Deuchert A, Hainzl C, Seiringer R. 2015. Note on a family of monotone quantum relative entropies. Letters in Mathematical Physics. 105(10), 1449–1466.","short":"A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105 (2015) 1449–1466.","mla":"Deuchert, Andreas, et al. “Note on a Family of Monotone Quantum Relative Entropies.” Letters in Mathematical Physics, vol. 105, no. 10, Springer, 2015, pp. 1449–66, doi:10.1007/s11005-015-0787-5.","chicago":"Deuchert, Andreas, Christian Hainzl, and Robert Seiringer. “Note on a Family of Monotone Quantum Relative Entropies.” Letters in Mathematical Physics. Springer, 2015. https://doi.org/10.1007/s11005-015-0787-5."},"publication":"Letters in Mathematical Physics","page":"1449 - 1466","has_accepted_license":"1","day":"05","scopus_import":1},{"abstract":[{"text":"Vegetation clearing and land-use change have depleted many natural plant communities to the point where restoration is required. A major impediment to the success of rebuilding complex vegetation communities is having regular access to sufficient quantities of high-quality seed. Seed-production areas (SPAs) can help generate this seed, but these must be underpinned by a broad genetic base to maximise the evolutionary potential of restored populations. However, genetic bottlenecks can occur at the collection, establishment and production stages in SPAs, requiring genetic evaluation. This is especially relevant for species that may take many years before a return on SPA investment is realised. Two recently established yellow box (Eucalyptus melliodora A.Cunn. ex Schauer, Myrtaceae) SPAs were evaluated to determine whether genetic bottlenecks had occurred between seed collection and SPA establishment. No evidence was found to suggest that a significant loss of genetic diversity had occurred at this stage, although there was a significant difference in diversity between the two SPAs. Complex population genetic structure was also observed in the seed used to source the SPAs, with up to eight groups identified. Plant survival in the SPAs was influenced by seed collection location but not by SPA location and was not associated with genetic diversity. There were also no associations between genetic diversity and plant growth. These data highlighted the importance of chance events when establishing SPAs and indicated that the two yellow box SPAs are likely to provide genetically diverse seed sources for future restoration projects, especially by pooling seed from both SPAs.","lang":"eng"}],"issue":"5","publist_id":"5434","type":"journal_article","author":[{"last_name":"Broadhurst","first_name":"Linda","full_name":"Broadhurst, Linda"},{"full_name":"Fifield, Graham","first_name":"Graham","last_name":"Fifield"},{"first_name":"Bindi","last_name":"Vanzella","full_name":"Vanzella, Bindi"},{"id":"2C78037E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6118-0541","first_name":"Melinda","last_name":"Pickup","full_name":"Pickup, Melinda"}],"date_updated":"2021-01-12T06:52:38Z","date_created":"2018-12-11T11:53:34Z","oa_version":"None","volume":63,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1703","year":"2015","status":"public","publication_status":"published","title":"An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas","intvolume":" 63","department":[{"_id":"NiBa"}],"publisher":"CSIRO","day":"26","month":"05","scopus_import":1,"doi":"10.1071/BT15023","date_published":"2015-05-26T00:00:00Z","language":[{"iso":"eng"}],"publication":"Australian Journal of Botany","citation":{"ama":"Broadhurst L, Fifield G, Vanzella B, Pickup M. An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. Australian Journal of Botany. 2015;63(5):455-466. doi:10.1071/BT15023","ista":"Broadhurst L, Fifield G, Vanzella B, Pickup M. 2015. An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. Australian Journal of Botany. 63(5), 455–466.","ieee":"L. Broadhurst, G. Fifield, B. Vanzella, and M. Pickup, “An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas,” Australian Journal of Botany, vol. 63, no. 5. CSIRO, pp. 455–466, 2015.","apa":"Broadhurst, L., Fifield, G., Vanzella, B., & Pickup, M. (2015). An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. Australian Journal of Botany. CSIRO. https://doi.org/10.1071/BT15023","mla":"Broadhurst, Linda, et al. “An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora) Seed-Production Areas.” Australian Journal of Botany, vol. 63, no. 5, CSIRO, 2015, pp. 455–66, doi:10.1071/BT15023.","short":"L. Broadhurst, G. Fifield, B. Vanzella, M. Pickup, Australian Journal of Botany 63 (2015) 455–466.","chicago":"Broadhurst, Linda, Graham Fifield, Bindi Vanzella, and Melinda Pickup. “An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora) Seed-Production Areas.” Australian Journal of Botany. CSIRO, 2015. https://doi.org/10.1071/BT15023."},"quality_controlled":"1","page":"455 - 466"},{"abstract":[{"lang":"eng","text":"We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin classifier. Our results show that, under mild conditions on the family of kernels used for learning, solving several related tasks simultaneously is beneficial over single task learning. In particular, as the number of observed tasks grows, assuming that in the considered family of kernels there exists one that yields low approximation error on all tasks, the overhead associated with learning such a kernel vanishes and the complexity converges to that of learning when this good kernel is given to the learner."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","title":"Multi-task and lifelong learning of kernels","status":"public","intvolume":" 9355","_id":"1706","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2015-01-01T00:00:00Z","page":"194 - 208","citation":{"apa":"Pentina, A., & Ben David, S. (2015). Multi-task and lifelong learning of kernels (Vol. 9355, pp. 194–208). Presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-319-24486-0_13","ieee":"A. Pentina and S. Ben David, “Multi-task and lifelong learning of kernels,” presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada, 2015, vol. 9355, pp. 194–208.","ista":"Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels. ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 194–208.","ama":"Pentina A, Ben David S. Multi-task and lifelong learning of kernels. In: Vol 9355. Springer; 2015:194-208. doi:10.1007/978-3-319-24486-0_13","chicago":"Pentina, Anastasia, and Shai Ben David. “Multi-Task and Lifelong Learning of Kernels,” 9355:194–208. Springer, 2015. https://doi.org/10.1007/978-3-319-24486-0_13.","short":"A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.","mla":"Pentina, Anastasia, and Shai Ben David. Multi-Task and Lifelong Learning of Kernels. Vol. 9355, Springer, 2015, pp. 194–208, doi:10.1007/978-3-319-24486-0_13."},"publist_id":"5430","ec_funded":1,"date_created":"2018-12-11T11:53:35Z","date_updated":"2021-01-12T06:52:39Z","volume":9355,"author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina","first_name":"Anastasia","full_name":"Pentina, Anastasia"},{"last_name":"Ben David","first_name":"Shai","full_name":"Ben David, Shai"}],"publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"Springer","year":"2015","month":"01","language":[{"iso":"eng"}],"conference":{"end_date":"2015-10-06","location":"Banff, AB, Canada","start_date":"2015-10-04","name":"ALT: Algorithmic Learning Theory"},"doi":"10.1007/978-3-319-24486-0_13","quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"main_file_link":[{"url":"http://arxiv.org/abs/1602.06531","open_access":"1"}],"oa":1},{"month":"10","project":[{"call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077","_id":"2536F660-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"language":[{"iso":"eng"}],"doi":"10.1016/j.ceb.2015.07.003","ec_funded":1,"publist_id":"5421","file_date_updated":"2020-07-14T12:45:13Z","department":[{"_id":"DaSi"}],"publisher":"Elsevier","publication_status":"published","year":"2015","volume":36,"date_created":"2018-12-11T11:53:36Z","date_updated":"2021-01-12T06:52:41Z","author":[{"full_name":"Ratheesh, Aparna","first_name":"Aparna","last_name":"Ratheesh","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Belyaeva, Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","first_name":"Vera","last_name":"Belyaeva"},{"full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","first_name":"Daria E","last_name":"Siekhaus"}],"scopus_import":1,"has_accepted_license":"1","day":"01","page":"71 - 79","citation":{"chicago":"Ratheesh, Aparna, Vera Belyaeva, and Daria E Siekhaus. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.07.003.","mla":"Ratheesh, Aparna, et al. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” Current Opinion in Cell Biology, vol. 36, no. 10, Elsevier, 2015, pp. 71–79, doi:10.1016/j.ceb.2015.07.003.","short":"A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology 36 (2015) 71–79.","ista":"Ratheesh A, Belyaeva V, Siekhaus DE. 2015. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. Current Opinion in Cell Biology. 36(10), 71–79.","ieee":"A. Ratheesh, V. Belyaeva, and D. E. Siekhaus, “Drosophila immune cell migration and adhesion during embryonic development and larval immune responses,” Current Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 71–79, 2015.","apa":"Ratheesh, A., Belyaeva, V., & Siekhaus, D. E. (2015). Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.07.003","ama":"Ratheesh A, Belyaeva V, Siekhaus DE. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. Current Opinion in Cell Biology. 2015;36(10):71-79. doi:10.1016/j.ceb.2015.07.003"},"publication":"Current Opinion in Cell Biology","date_published":"2015-10-01T00:00:00Z","type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"The majority of immune cells in Drosophila melanogaster are plasmatocytes; they carry out similar functions to vertebrate macrophages, influencing development as well as protecting against infection and cancer. Plasmatocytes, sometimes referred to with the broader term of hemocytes, migrate widely during embryonic development and cycle in the larvae between sessile and circulating positions. Here we discuss the similarities of plasmatocyte developmental migration and its functions to that of vertebrate macrophages, considering the recent controversy regarding the functions of Drosophila PDGF/VEGF related ligands. We also examine recent findings on the significance of adhesion for plasmatocyte migration in the embryo, as well as proliferation, trans-differentiation, and tumor responses in the larva. We spotlight parallels throughout to vertebrate immune responses."}],"intvolume":" 36","ddc":["573"],"status":"public","title":"Drosophila immune cell migration and adhesion during embryonic development and larval immune responses","_id":"1712","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_id":"5098","relation":"main_file","date_created":"2018-12-12T10:14:44Z","date_updated":"2020-07-14T12:45:13Z","checksum":"bbb1ee39ca52929aefe4f48752b166ee","file_name":"IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf","access_level":"open_access","creator":"system","file_size":1023680,"content_type":"application/pdf"}],"pubrep_id":"346"},{"issue":"4","abstract":[{"text":"We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by a function u : (-1, 1) → ℝ, u(x) < 0, and a vertical flow of point particles incident on the hollow. It is assumed that u satisfies the so-called single impact condition (SIC): each incident particle is elastically reflected by graph(u) and goes away without hitting the graph of u anymore. We solve the problem: find the function u minimizing the force of resistance created by the flow. We show that the graph of the minimizer is formed by two arcs of parabolas symmetric to each other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals 1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014), pp. 2730-2742] stating in particular that the minimal resistance of a hollow in higher dimensions equals 0.5. We additionally consider a similar problem of minimal resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1 is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x = (x1,...,xd), u(ξ) < 0 for 0 ≤ ξ < 1, and u(ξ) = 0 for ξ ≥ 1, and the flow is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides with 0.6435 when d = 1) and converges to 0.5 as d → ∞.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1710","intvolume":" 47","title":"Minimal resistance of curves under the single impact assumption","status":"public","day":"14","scopus_import":1,"date_published":"2015-07-14T00:00:00Z","citation":{"chicago":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” Society for Industrial and Applied Mathematics. SIAM, 2015. https://doi.org/10.1137/140993843.","mla":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” Society for Industrial and Applied Mathematics, vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:10.1137/140993843.","short":"A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47 (2015) 2754–2769.","ista":"Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.","apa":"Akopyan, A., & Plakhov, A. (2015). Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. SIAM. https://doi.org/10.1137/140993843","ieee":"A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single impact assumption,” Society for Industrial and Applied Mathematics, vol. 47, no. 4. SIAM, pp. 2754–2769, 2015.","ama":"Akopyan A, Plakhov A. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 2015;47(4):2754-2769. doi:10.1137/140993843"},"publication":"Society for Industrial and Applied Mathematics","page":"2754 - 2769","publist_id":"5423","ec_funded":1,"author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"first_name":"Alexander","last_name":"Plakhov","full_name":"Plakhov, Alexander"}],"volume":47,"date_updated":"2021-01-12T06:52:41Z","date_created":"2018-12-11T11:53:36Z","year":"2015","department":[{"_id":"HeEd"}],"publisher":"SIAM","publication_status":"published","month":"07","doi":"10.1137/140993843","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.3736"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1"},{"scopus_import":1,"month":"04","day":"02","main_file_link":[{"url":"http://arxiv.org/abs/1408.4036","open_access":"1"}],"citation":{"ama":"Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete & Computational Geometry. 2015;53(3):587-620. doi:10.1007/s00454-015-9679-9","ieee":"É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities and decompositions of triangulated surfaces,” Discrete & Computational Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.","apa":"Colin De Verdière, É., Hubard, A., & de Mesmay, A. N. (2015). Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9679-9","ista":"Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete & Computational Geometry. 53(3), 587–620.","short":"É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete & Computational Geometry 53 (2015) 587–620.","mla":"Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” Discrete & Computational Geometry, vol. 53, no. 3, Springer, 2015, pp. 587–620, doi:10.1007/s00454-015-9679-9.","chicago":"Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” Discrete & Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9679-9."},"oa":1,"publication":"Discrete & Computational Geometry","page":"587 - 620","quality_controlled":"1","doi":"10.1007/s00454-015-9679-9","date_published":"2015-04-02T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"3","publist_id":"5397","abstract":[{"lang":"eng","text":"How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart). Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discrete setting, and vice-versa. This implies a conjecture by Przytycka and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993), a number of new systolic inequalities in the discrete setting, and the fact that a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s systolic inequality for surfaces are essentially equivalent. We also discuss how these proofs generalize to higher dimensions. Then we focus on topological decompositions of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition. Finally, we consider the problem of embedding a cut graph (or more generally a cellular graph) with a given combinatorial map on a given surface. Using random triangulations, we prove (essentially) that, for any choice of a combinatorial map, there are some surfaces on which any cellular embedding with that combinatorial map has length superlinear in the number of triangles of the triangulated combinatorial surface. There is also a similar result for graphs embedded on polyhedral triangulations."}],"_id":"1730","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","department":[{"_id":"UlWa"}],"intvolume":" 53","publisher":"Springer","publication_status":"published","status":"public","title":"Discrete systolic inequalities and decompositions of triangulated surfaces","author":[{"last_name":"Colin De Verdière","first_name":"Éric","full_name":"Colin De Verdière, Éric"},{"full_name":"Hubard, Alfredo","last_name":"Hubard","first_name":"Alfredo"},{"full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay","first_name":"Arnaud N"}],"volume":53,"oa_version":"Preprint","date_created":"2018-12-11T11:53:42Z","date_updated":"2021-01-12T06:52:49Z"},{"quality_controlled":0,"publication":"Nature Communications","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"},"citation":{"ama":"Cohen M, Kicheva A, Ribeiro A, et al. Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. Nature Communications. 2015;6. doi:10.1038/ncomms7709","ieee":"M. Cohen et al., “Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms,” Nature Communications, vol. 6. Nature Publishing Group, 2015.","apa":"Cohen, M., Kicheva, A., Ribeiro, A., Blassberg, R., Page, K., Barnes, C., & Briscoe, J. (2015). Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms7709","ista":"Cohen M, Kicheva A, Ribeiro A, Blassberg R, Page K, Barnes C, Briscoe J. 2015. Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. Nature Communications. 6.","short":"M. Cohen, A. Kicheva, A. Ribeiro, R. Blassberg, K. Page, C. Barnes, J. Briscoe, Nature Communications 6 (2015).","mla":"Cohen, Michael, et al. “Ptch1 and Gli Regulate Shh Signalling Dynamics via Multiple Mechanisms.” Nature Communications, vol. 6, Nature Publishing Group, 2015, doi:10.1038/ncomms7709.","chicago":"Cohen, Michael, Anna Kicheva, Ana Ribeiro, Robert Blassberg, Karen Page, Chris Barnes, and James Briscoe. “Ptch1 and Gli Regulate Shh Signalling Dynamics via Multiple Mechanisms.” Nature Communications. Nature Publishing Group, 2015. https://doi.org/10.1038/ncomms7709."},"doi":"10.1038/ncomms7709","date_published":"2015-04-02T00:00:00Z","day":"02","month":"04","status":"public","title":"Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms","publication_status":"published","intvolume":" 6","publisher":"Nature Publishing Group","_id":"1728","acknowledgement":"C.P.B. gratefully acknowledges funding from the Wellcome Trust through a Research Career Development Fellowship (097319/Z/11/Z). This work was supported by the Medical Research Council (U117560541) and Wellcome Trust (WT098326MA, WT098325MA).","year":"2015","date_updated":"2021-01-12T06:52:48Z","date_created":"2018-12-11T11:53:42Z","volume":6,"author":[{"first_name":"Michael","last_name":"Cohen","full_name":"Cohen, Michael H"},{"full_name":"Anna Kicheva","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna"},{"last_name":"Ribeiro","first_name":"Ana","full_name":"Ribeiro, Ana C"},{"last_name":"Blassberg","first_name":"Robert","full_name":"Blassberg, Robert A"},{"full_name":"Page, Karen M","last_name":"Page","first_name":"Karen"},{"full_name":"Barnes, Chris P","first_name":"Chris","last_name":"Barnes"},{"first_name":"James","last_name":"Briscoe","full_name":"Briscoe, James"}],"type":"journal_article","extern":1,"abstract":[{"text":"In the vertebrate neural tube, the morphogen Sonic Hedgehog (Shh) establishes a characteristic pattern of gene expression. Here we quantify the Shh gradient in the developing mouse neural tube and show that while the amplitude of the gradient increases over time, the activity of the pathway transcriptional effectors, Gli proteins, initially increases but later decreases. Computational analysis of the pathway suggests three mechanisms that could contribute to this adaptation: transcriptional upregulation of the inhibitory receptor Ptch1, transcriptional downregulation of Gli and the differential stability of active and inactive Gli isoforms. Consistent with this, Gli2 protein expression is downregulated during neural tube patterning and adaptation continues when the pathway is stimulated downstream of Ptch1. Moreover, the Shh-induced upregulation of Gli2 transcription prevents Gli activity levels from adapting in a different cell type, NIH3T3 fibroblasts, despite the upregulation of Ptch1. Multiple mechanisms therefore contribute to the intracellular dynamics of Shh signalling, resulting in different signalling dynamics in different cell types.","lang":"eng"}],"publist_id":"5399"},{"month":"05","doi":"10.1111/cgf.12576","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","publist_id":"5389","file_date_updated":"2020-07-14T12:45:15Z","author":[{"first_name":"Ryoichi","last_name":"Ando","full_name":"Ando, Ryoichi"},{"last_name":"Thürey","first_name":"Nils","full_name":"Thürey, Nils"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546"}],"volume":34,"date_created":"2018-12-11T11:53:44Z","date_updated":"2023-02-23T10:12:11Z","year":"2015","acknowledgement":"The first author was supported by a JSPS Postdoctoral Fellowship for Research Abroad","publisher":"Wiley","department":[{"_id":"ChWo"}],"publication_status":"published","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2015-05-01T00:00:00Z","citation":{"chicago":"Ando, Ryoichi, Nils Thürey, and Chris Wojtan. “A Dimension-Reduced Pressure Solver for Liquid Simulations.” Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12576.","short":"R. Ando, N. Thürey, C. Wojtan, Computer Graphics Forum 34 (2015) 473–480.","mla":"Ando, Ryoichi, et al. “A Dimension-Reduced Pressure Solver for Liquid Simulations.” Computer Graphics Forum, vol. 34, no. 2, Wiley, 2015, pp. 473–80, doi:10.1111/cgf.12576.","ieee":"R. Ando, N. Thürey, and C. Wojtan, “A dimension-reduced pressure solver for liquid simulations,” Computer Graphics Forum, vol. 34, no. 2. Wiley, pp. 473–480, 2015.","apa":"Ando, R., Thürey, N., & Wojtan, C. (2015). A dimension-reduced pressure solver for liquid simulations. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12576","ista":"Ando R, Thürey N, Wojtan C. 2015. A dimension-reduced pressure solver for liquid simulations. Computer Graphics Forum. 34(2), 473–480.","ama":"Ando R, Thürey N, Wojtan C. A dimension-reduced pressure solver for liquid simulations. Computer Graphics Forum. 2015;34(2):473-480. doi:10.1111/cgf.12576"},"publication":"Computer Graphics Forum","page":"473 - 480","issue":"2","abstract":[{"lang":"eng","text":"This work presents a method for efficiently simplifying the pressure projection step in a liquid simulation. We first devise a straightforward dimension reduction technique that dramatically reduces the cost of solving the pressure projection. Next, we introduce a novel change of basis that satisfies free-surface boundary conditions exactly, regardless of the accuracy of the pressure solve. When combined, these ideas greatly reduce the computational complexity of the pressure solve without compromising free surface boundary conditions at the highest level of detail. Our techniques are easy to parallelize, and they effectively eliminate the computational bottleneck for large liquid simulations."}],"type":"journal_article","pubrep_id":"607","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:16:30Z","date_updated":"2020-07-14T12:45:15Z","checksum":"590752bf977855b337a80f78a9bc2404","file_id":"5218","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":6312352,"file_name":"IST-2016-607-v1+1_coarsegrid.pdf","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1735","intvolume":" 34","ddc":["000"],"status":"public","title":"A dimension-reduced pressure solver for liquid simulations"},{"scopus_import":1,"month":"05","day":"01","publication":"Computer Graphics Forum","citation":{"chicago":"Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial Appearance Capture.” Computer Graphics Forum. Wiley-Blackwell, 2015. https://doi.org/10.1111/cgf.12594.","short":"O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz, T. Beeler, Computer Graphics Forum 34 (2015) 709–733.","mla":"Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” Computer Graphics Forum, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:10.1111/cgf.12594.","apa":"Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler, T. (2015). Recent advances in facial appearance capture. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12594","ieee":"O. Klehm et al., “Recent advances in facial appearance capture,” Computer Graphics Forum, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.","ista":"Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum. 34(2), 709–733.","ama":"Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance capture. Computer Graphics Forum. 2015;34(2):709-733. doi:10.1111/cgf.12594"},"main_file_link":[{"url":"https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf"}],"quality_controlled":"1","page":"709 - 733","date_published":"2015-05-01T00:00:00Z","doi":"10.1111/cgf.12594","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Facial appearance capture is now firmly established within academic research and used extensively across various application domains, perhaps most prominently in the entertainment industry through the design of virtual characters in video games and films. While significant progress has occurred over the last two decades, no single survey currently exists that discusses the similarities, differences, and practical considerations of the available appearance capture techniques as applied to human faces. A central difficulty of facial appearance capture is the way light interacts with skin-which has a complex multi-layered structure-and the interactions that occur below the skin surface can, by definition, only be observed indirectly. In this report, we distinguish between two broad strategies for dealing with this complexity. "Image-based methods" try to exhaustively capture the exact face appearance under different lighting and viewing conditions, and then render the face through weighted image combinations. "Parametric methods" instead fit the captured reflectance data to some parametric appearance model used during rendering, allowing for a more lightweight and flexible representation but at the cost of potentially increased rendering complexity or inexact reproduction. The goal of this report is to provide an overview that can guide practitioners and researchers in assessing the tradeoffs between current approaches and identifying directions for future advances in facial appearance capture."}],"issue":"2","publist_id":"5391","_id":"1734","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","publication_status":"published","title":"Recent advances in facial appearance capture","status":"public","department":[{"_id":"BeBi"}],"intvolume":" 34","publisher":"Wiley-Blackwell","author":[{"last_name":"Klehm","first_name":"Oliver","full_name":"Klehm, Oliver"},{"full_name":"Rousselle, Fabrice","first_name":"Fabrice","last_name":"Rousselle"},{"full_name":"Papas, Marios","first_name":"Marios","last_name":"Papas"},{"first_name":"Derek","last_name":"Bradley","full_name":"Bradley, Derek"},{"last_name":"Hery","first_name":"Christophe","full_name":"Hery, Christophe"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd"},{"full_name":"Jarosz, Wojciech","first_name":"Wojciech","last_name":"Jarosz"},{"full_name":"Beeler, Thabo","first_name":"Thabo","last_name":"Beeler"}],"date_created":"2018-12-11T11:53:43Z","date_updated":"2021-01-12T06:52:52Z","volume":34,"oa_version":"None"},{"quality_controlled":"1","external_id":{"pmid":["25138099"]},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4795044/"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/ejhg.2014.165","month":"06","publisher":"Nature Publishing Group","department":[{"_id":"GaNo"}],"publication_status":"published","pmid":1,"year":"2015","volume":23,"date_created":"2018-12-11T11:54:01Z","date_updated":"2021-01-12T06:53:12Z","author":[{"full_name":"Kuechler, Alma","first_name":"Alma","last_name":"Kuechler"},{"first_name":"Alexander","last_name":"Zink","full_name":"Zink, Alexander"},{"first_name":"Thomas","last_name":"Wieland","full_name":"Wieland, Thomas"},{"full_name":"Lüdecke, Hermann","last_name":"Lüdecke","first_name":"Hermann"},{"full_name":"Cremer, Kirsten","last_name":"Cremer","first_name":"Kirsten"},{"full_name":"Salviati, Leonardo","first_name":"Leonardo","last_name":"Salviati"},{"first_name":"Pamela","last_name":"Magini","full_name":"Magini, Pamela"},{"full_name":"Najafi, Kimia","last_name":"Najafi","first_name":"Kimia"},{"full_name":"Zweier, Christiane","last_name":"Zweier","first_name":"Christiane"},{"last_name":"Czeschik","first_name":"Johanna","full_name":"Czeschik, Johanna"},{"first_name":"Stefan","last_name":"Aretz","full_name":"Aretz, Stefan"},{"full_name":"Endele, Sabine","last_name":"Endele","first_name":"Sabine"},{"last_name":"Tamburrino","first_name":"Federica","full_name":"Tamburrino, Federica"},{"first_name":"Claudia","last_name":"Pinato","full_name":"Pinato, Claudia"},{"last_name":"Clementi","first_name":"Maurizio","full_name":"Clementi, Maurizio"},{"full_name":"Gundlach, Jasmin","last_name":"Gundlach","first_name":"Jasmin"},{"full_name":"Maylahn, Carina","first_name":"Carina","last_name":"Maylahn"},{"last_name":"Mazzanti","first_name":"Laura","full_name":"Mazzanti, Laura"},{"full_name":"Wohlleber, Eva","first_name":"Eva","last_name":"Wohlleber"},{"last_name":"Schwarzmayr","first_name":"Thomas","full_name":"Schwarzmayr, Thomas"},{"full_name":"Kariminejad, Roxana","last_name":"Kariminejad","first_name":"Roxana"},{"full_name":"Schlessinger, Avner","last_name":"Schlessinger","first_name":"Avner"},{"first_name":"Dagmar","last_name":"Wieczorek","full_name":"Wieczorek, Dagmar"},{"full_name":"Strom, Tim","first_name":"Tim","last_name":"Strom"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino","full_name":"Novarino, Gaia"},{"first_name":"Hartmut","last_name":"Engels","full_name":"Engels, Hartmut"}],"publist_id":"5324","page":"753 - 760","citation":{"ama":"Kuechler A, Zink A, Wieland T, et al. Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of Human Genetics. 2015;23(6):753-760. doi:10.1038/ejhg.2014.165","ieee":"A. Kuechler et al., “Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome,” European Journal of Human Genetics, vol. 23, no. 6. Nature Publishing Group, pp. 753–760, 2015.","apa":"Kuechler, A., Zink, A., Wieland, T., Lüdecke, H., Cremer, K., Salviati, L., … Engels, H. (2015). Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of Human Genetics. Nature Publishing Group. https://doi.org/10.1038/ejhg.2014.165","ista":"Kuechler A, Zink A, Wieland T, Lüdecke H, Cremer K, Salviati L, Magini P, Najafi K, Zweier C, Czeschik J, Aretz S, Endele S, Tamburrino F, Pinato C, Clementi M, Gundlach J, Maylahn C, Mazzanti L, Wohlleber E, Schwarzmayr T, Kariminejad R, Schlessinger A, Wieczorek D, Strom T, Novarino G, Engels H. 2015. Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of Human Genetics. 23(6), 753–760.","short":"A. Kuechler, A. Zink, T. Wieland, H. Lüdecke, K. Cremer, L. Salviati, P. Magini, K. Najafi, C. Zweier, J. Czeschik, S. Aretz, S. Endele, F. Tamburrino, C. Pinato, M. Clementi, J. Gundlach, C. Maylahn, L. Mazzanti, E. Wohlleber, T. Schwarzmayr, R. Kariminejad, A. Schlessinger, D. Wieczorek, T. Strom, G. Novarino, H. Engels, European Journal of Human Genetics 23 (2015) 753–760.","mla":"Kuechler, Alma, et al. “Loss-of-Function Variants of SETD5 Cause Intellectual Disability and the Core Phenotype of Microdeletion 3p25.3 Syndrome.” European Journal of Human Genetics, vol. 23, no. 6, Nature Publishing Group, 2015, pp. 753–60, doi:10.1038/ejhg.2014.165.","chicago":"Kuechler, Alma, Alexander Zink, Thomas Wieland, Hermann Lüdecke, Kirsten Cremer, Leonardo Salviati, Pamela Magini, et al. “Loss-of-Function Variants of SETD5 Cause Intellectual Disability and the Core Phenotype of Microdeletion 3p25.3 Syndrome.” European Journal of Human Genetics. Nature Publishing Group, 2015. https://doi.org/10.1038/ejhg.2014.165."},"publication":"European Journal of Human Genetics","date_published":"2015-06-15T00:00:00Z","day":"15","intvolume":" 23","status":"public","title":"Loss-of-function variants of SETD5 cause intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome","_id":"1789","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","issue":"6","abstract":[{"text":"Intellectual disability (ID) has an estimated prevalence of 2-3%. Due to its extreme heterogeneity, the genetic basis of ID remains elusive in many cases. Recently, whole exome sequencing (WES) studies revealed that a large proportion of sporadic cases are caused by de novo gene variants. To identify further genes involved in ID, we performed WES in 250 patients with unexplained ID and their unaffected parents and included exomes of 51 previously sequenced child-parents trios in the analysis. Exome analysis revealed de novo intragenic variants in SET domain-containing 5 (SETD5) in two patients. One patient carried a nonsense variant, and the other an 81 bp deletion located across a splice-donor site. Chromosomal microarray diagnostics further identified four de novo non-recurrent microdeletions encompassing SETD5. CRISPR/Cas9 mutation modelling of the two intragenic variants demonstrated nonsense-mediated decay of the resulting transcripts, pointing to a loss-of-function (LoF) and haploinsufficiency as the common disease-causing mechanism of intragenic SETD5 sequence variants and SETD5-containing microdeletions. In silico domain prediction of SETD5, a predicted SET domain-containing histone methyltransferase (HMT), substantiated the presence of a SET domain and identified a novel putative PHD domain, strengthening a functional link to well-known histone-modifying ID genes. All six patients presented with ID and certain facial dysmorphisms, suggesting that SETD5 sequence variants contribute substantially to the microdeletion 3p25.3 phenotype. The present report of two SETD5 LoF variants in 301 patients demonstrates a prevalence of 0.7% and thus SETD5 variants as a relatively frequent cause of ID.","lang":"eng"}]},{"day":"09","month":"02","citation":{"chicago":"Pitanti, Alessandro, Johannes M Fink, Amir Safavi Naeini, Jeff Hill, Chan Lei, Alessandro Tredicucci, and Oskar Painter. “Strong Opto-Electro-Mechanical Coupling in a Silicon Photonic Crystal Cavity.” Optics Express. Optical Society of America, 2015. https://doi.org/10.1364/OE.23.003196.","short":"A. Pitanti, J.M. Fink, A. Safavi Naeini, J. Hill, C. Lei, A. Tredicucci, O. Painter, Optics Express 23 (2015) 3196–3208.","mla":"Pitanti, Alessandro, et al. “Strong Opto-Electro-Mechanical Coupling in a Silicon Photonic Crystal Cavity.” Optics Express, vol. 23, no. 3, Optical Society of America, 2015, pp. 3196–208, doi:10.1364/OE.23.003196.","ieee":"A. Pitanti et al., “Strong opto-electro-mechanical coupling in a silicon photonic crystal cavity,” Optics Express, vol. 23, no. 3. Optical Society of America, pp. 3196–3208, 2015.","apa":"Pitanti, A., Fink, J. M., Safavi Naeini, A., Hill, J., Lei, C., Tredicucci, A., & Painter, O. (2015). Strong opto-electro-mechanical coupling in a silicon photonic crystal cavity. Optics Express. Optical Society of America. https://doi.org/10.1364/OE.23.003196","ista":"Pitanti A, Fink JM, Safavi Naeini A, Hill J, Lei C, Tredicucci A, Painter O. 2015. Strong opto-electro-mechanical coupling in a silicon photonic crystal cavity. Optics Express. 23(3), 3196–3208.","ama":"Pitanti A, Fink JM, Safavi Naeini A, et al. Strong opto-electro-mechanical coupling in a silicon photonic crystal cavity. Optics Express. 2015;23(3):3196-3208. doi:10.1364/OE.23.003196"},"publication":"Optics Express","page":"3196 - 3208","quality_controlled":0,"doi":"10.1364/OE.23.003196","date_published":"2015-02-09T00:00:00Z","type":"journal_article","issue":"3","publist_id":"5325","abstract":[{"text":"We fabricate and characterize a microscale silicon opto-electromechanical system whose mechanical motion is coupled capacitively to an electrical circuit and optically via radiation pressure to a photonic crystal cavity. To achieve large electromechanical interaction strength, we implement an inverse shadow mask fabrication scheme which obtains capacitor gaps as small as 30 nm while maintaining a silicon surface quality necessary for minimizing optical loss. Using the sensitive optical read-out of the photonic crystal cavity, we characterize the linear and nonlinear capacitive coupling to the fundamental ωm=2π = 63 MHz in-plane flexural motion of the structure, showing that the large electromechanical coupling in such devices may be suitable for realizing efficient microwave-to-optical signal conversion.","lang":"eng"}],"extern":1,"_id":"1788","year":"2015","acknowledgement":"This work was supported by the DARPA MESO program, the AFOSR Hybrid Nanophotonics MURI, the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center with support of the Gordon and Betty Moore Foundation, and the Kavli Nanoscience Institute at Caltech. AP gratefully acknowledge funding from EU through Marie Curie Actions, project NEMO (GA 298861). AT acknowledges partial financial support from the ERC through the advanced grant SoulMan","intvolume":" 23","publisher":"Optical Society of America","title":"Strong opto-electro-mechanical coupling in a silicon photonic crystal cavity","status":"public","publication_status":"published","author":[{"full_name":"Pitanti, Alessandro","first_name":"Alessandro","last_name":"Pitanti"},{"full_name":"Johannes Fink","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"},{"full_name":"Safavi-Naeini, Amir H","last_name":"Safavi Naeini","first_name":"Amir"},{"first_name":"Jeff","last_name":"Hill","full_name":"Hill, Jeff T"},{"full_name":"Lei, Chan U","last_name":"Lei","first_name":"Chan"},{"last_name":"Tredicucci","first_name":"Alessandro","full_name":"Tredicucci, Alessandro"},{"full_name":"Painter, Oskar J","last_name":"Painter","first_name":"Oskar"}],"volume":23,"date_created":"2018-12-11T11:54:01Z","date_updated":"2021-01-12T06:53:12Z"},{"publist_id":"5306","file_date_updated":"2020-07-14T12:45:16Z","article_number":"10781","volume":5,"date_updated":"2021-01-12T06:53:18Z","date_created":"2018-12-11T11:54:06Z","author":[{"id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5964-0203","first_name":"Sebastian","last_name":"Altmeyer","full_name":"Altmeyer, Sebastian"},{"full_name":"Do, Younghae","first_name":"Younghae","last_name":"Do"},{"full_name":"Lai, Ying","last_name":"Lai","first_name":"Ying"}],"publisher":"Nature Publishing Group","department":[{"_id":"BjHo"}],"publication_status":"published","year":"2015","month":"06","language":[{"iso":"eng"}],"doi":"10.1038/srep10781","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,"abstract":[{"lang":"eng","text":"It is known that in classical fluids turbulence typically occurs at high Reynolds numbers. But can turbulence occur at low Reynolds numbers? Here we investigate the transition to turbulence in the classic Taylor-Couette system in which the rotating fluids are manufactured ferrofluids with magnetized nanoparticles embedded in liquid carriers. We find that, in the presence of a magnetic field transverse to the symmetry axis of the system, turbulence can occur at Reynolds numbers that are at least one order of magnitude smaller than those in conventional fluids. This is established by extensive computational ferrohydrodynamics through a detailed investigation of transitions in the flow structure, and characterization of behaviors of physical quantities such as the energy, the wave number, and the angular momentum through the bifurcations. A finding is that, as the magnetic field is increased, onset of turbulence can be determined accurately and reliably. Our results imply that experimental investigation of turbulence may be feasible by using ferrofluids. Our study of transition to and evolution of turbulence in the Taylor-Couette ferrofluidic flow system provides insights into the challenging problem of turbulence control."}],"type":"journal_article","oa_version":"Published Version","file":[{"checksum":"7716f582f8c9d82d8f2bf80bf896b440","date_created":"2018-12-12T10:17:26Z","date_updated":"2020-07-14T12:45:16Z","relation":"main_file","file_id":"5280","file_size":2449723,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-450-v1+1_srep10781.pdf"}],"pubrep_id":"450","intvolume":" 5","ddc":["530"],"title":"Transition to turbulence in Taylor-Couette ferrofluidic flow","status":"public","_id":"1804","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","day":"12","scopus_import":1,"date_published":"2015-06-12T00:00:00Z","citation":{"chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Transition to Turbulence in Taylor-Couette Ferrofluidic Flow.” Scientific Reports. Nature Publishing Group, 2015. https://doi.org/10.1038/srep10781.","mla":"Altmeyer, Sebastian, et al. “Transition to Turbulence in Taylor-Couette Ferrofluidic Flow.” Scientific Reports, vol. 5, 10781, Nature Publishing Group, 2015, doi:10.1038/srep10781.","short":"S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 5 (2015).","ista":"Altmeyer S, Do Y, Lai Y. 2015. Transition to turbulence in Taylor-Couette ferrofluidic flow. Scientific Reports. 5, 10781.","apa":"Altmeyer, S., Do, Y., & Lai, Y. (2015). Transition to turbulence in Taylor-Couette ferrofluidic flow. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep10781","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Transition to turbulence in Taylor-Couette ferrofluidic flow,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.","ama":"Altmeyer S, Do Y, Lai Y. Transition to turbulence in Taylor-Couette ferrofluidic flow. Scientific Reports. 2015;5. doi:10.1038/srep10781"},"publication":"Scientific Reports"},{"author":[{"last_name":"Rei","first_name":"Damien","full_name":"Rei, Damien"},{"full_name":"Mason, Xenos","last_name":"Mason","first_name":"Xenos"},{"first_name":"Jinsoo","last_name":"Seo","full_name":"Seo, Jinsoo"},{"full_name":"Gräff, Johannes","last_name":"Gräff","first_name":"Johannes"},{"last_name":"Rudenko","first_name":"Andrii","full_name":"Rudenko, Andrii"},{"first_name":"Jùn","last_name":"Wang","full_name":"Wang, Jùn"},{"first_name":"Richard","last_name":"Rueda","full_name":"Rueda, Richard"},{"first_name":"Sandra","last_name":"Siegert","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8635-0877","full_name":"Sandra Siegert"},{"full_name":"Cho, Sukhee","first_name":"Sukhee","last_name":"Cho"},{"last_name":"Canter","first_name":"Rebecca","full_name":"Canter, Rebecca G"},{"full_name":"Mungenast, Alison E","first_name":"Alison","last_name":"Mungenast"},{"first_name":"Karl","last_name":"Deisseroth","full_name":"Deisseroth, Karl A"},{"last_name":"Tsai","first_name":"Lihuei","full_name":"Tsai, Lihuei"}],"date_created":"2018-12-11T11:54:06Z","date_updated":"2021-01-12T06:53:18Z","volume":112,"year":"2015","_id":"1803","acknowledgement":"AG047661; NIH; Schweizerische Nationalfonds zur Förderung der Wissenschaftlichen Forschung\nNS051874; NIH; Schweizerische Nationalfonds zur Förderung der Wissenschaftlichen Forschung\nSNSF; Schweizerische Nationalfonds zur Förderung der Wissenschaftlichen Forschung","status":"public","publication_status":"published","title":"Basolateral amygdala bidirectionally modulates stress induced hippocampal learning and memory deficits through a p25/Cdk5-dependent pathway","intvolume":" 112","publisher":"National Academy of Sciences","abstract":[{"lang":"eng","text":"Repeated stress has been suggested to underlie learning and memory deficits via the basolateral amygdala (BLA) and the hippocampus; however, the functional contribution of BLA inputs to the hippocampus and their molecular repercussions are not well understood. Here we show that repeated stress is accompanied by generation of the Cdk5 (cyclin-dependent kinase 5)-activator p25, up-regulation and phosphorylation of glucocorticoid receptors, increased HDAC2 expression, and reduced expression of memoryrelated genes in the hippocampus. A combination of optogenetic and pharmacosynthetic approaches shows that BLA activation is both necessary and sufficient for stress-associated molecular changes and memory impairments. Furthermore, we show that this effect relies on direct glutamatergic projections from the BLA to the dorsal hippocampus. Finally, we show that p25 generation is necessary for the stress-induced memory dysfunction. Taken together, our data provide a neural circuit model for stress-induced hippocampal memory deficits through BLA activity-dependent p25 generation."}],"issue":"23","publist_id":"5307","extern":1,"type":"journal_article","doi":"10.1073/pnas.1415845112","date_published":"2015-06-09T00:00:00Z","publication":"PNAS","citation":{"chicago":"Rei, Damien, Xenos Mason, Jinsoo Seo, Johannes Gräff, Andrii Rudenko, Jùn Wang, Richard Rueda, et al. “Basolateral Amygdala Bidirectionally Modulates Stress Induced Hippocampal Learning and Memory Deficits through a P25/Cdk5-Dependent Pathway.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1415845112.","short":"D. Rei, X. Mason, J. Seo, J. Gräff, A. Rudenko, J. Wang, R. Rueda, S. Siegert, S. Cho, R. Canter, A. Mungenast, K. Deisseroth, L. Tsai, PNAS 112 (2015) 7291–7296.","mla":"Rei, Damien, et al. “Basolateral Amygdala Bidirectionally Modulates Stress Induced Hippocampal Learning and Memory Deficits through a P25/Cdk5-Dependent Pathway.” PNAS, vol. 112, no. 23, National Academy of Sciences, 2015, pp. 7291–96, doi:10.1073/pnas.1415845112.","apa":"Rei, D., Mason, X., Seo, J., Gräff, J., Rudenko, A., Wang, J., … Tsai, L. (2015). Basolateral amygdala bidirectionally modulates stress induced hippocampal learning and memory deficits through a p25/Cdk5-dependent pathway. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1415845112","ieee":"D. Rei et al., “Basolateral amygdala bidirectionally modulates stress induced hippocampal learning and memory deficits through a p25/Cdk5-dependent pathway,” PNAS, vol. 112, no. 23. National Academy of Sciences, pp. 7291–7296, 2015.","ista":"Rei D, Mason X, Seo J, Gräff J, Rudenko A, Wang J, Rueda R, Siegert S, Cho S, Canter R, Mungenast A, Deisseroth K, Tsai L. 2015. Basolateral amygdala bidirectionally modulates stress induced hippocampal learning and memory deficits through a p25/Cdk5-dependent pathway. PNAS. 112(23), 7291–7296.","ama":"Rei D, Mason X, Seo J, et al. Basolateral amygdala bidirectionally modulates stress induced hippocampal learning and memory deficits through a p25/Cdk5-dependent pathway. PNAS. 2015;112(23):7291-7296. doi:10.1073/pnas.1415845112"},"quality_controlled":0,"page":"7291 - 7296","day":"09","month":"06"},{"date_created":"2018-12-11T11:54:07Z","date_updated":"2021-01-12T06:53:20Z","oa_version":"Preprint","volume":21,"author":[{"full_name":"Goldman, Michael","first_name":"Michael","last_name":"Goldman"},{"full_name":"Royo-Letelier, Jimena","id":"4D3BED28-F248-11E8-B48F-1D18A9856A87","first_name":"Jimena","last_name":"Royo-Letelier"}],"status":"public","publication_status":"published","title":"Sharp interface limit for two components Bose-Einstein condensates","department":[{"_id":"RoSe"}],"intvolume":" 21","publisher":"EDP Sciences","year":"2015","_id":"1807","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We study a double Cahn-Hilliard type functional related to the Gross-Pitaevskii energy of two-components Bose-Einstein condensates. In the case of large but same order intercomponent and intracomponent coupling strengths, we prove Γ-convergence to a perimeter minimisation functional with an inhomogeneous surface tension. We study the asymptotic behavior of the surface tension as the ratio between the intercomponent and intracomponent coupling strengths becomes very small or very large and obtain good agreement with the physical literature. We obtain as a consequence, symmetry breaking of the minimisers for the harmonic potential.","lang":"eng"}],"publist_id":"5303","issue":"3","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2015-05-01T00:00:00Z","doi":"10.1051/cocv/2014040","quality_controlled":"1","page":"603 - 624","publication":"ESAIM - Control, Optimisation and Calculus of Variations","citation":{"ieee":"M. Goldman and J. Royo-Letelier, “Sharp interface limit for two components Bose-Einstein condensates,” ESAIM - Control, Optimisation and Calculus of Variations, vol. 21, no. 3. EDP Sciences, pp. 603–624, 2015.","apa":"Goldman, M., & Royo-Letelier, J. (2015). Sharp interface limit for two components Bose-Einstein condensates. ESAIM - Control, Optimisation and Calculus of Variations. EDP Sciences. https://doi.org/10.1051/cocv/2014040","ista":"Goldman M, Royo-Letelier J. 2015. Sharp interface limit for two components Bose-Einstein condensates. ESAIM - Control, Optimisation and Calculus of Variations. 21(3), 603–624.","ama":"Goldman M, Royo-Letelier J. Sharp interface limit for two components Bose-Einstein condensates. ESAIM - Control, Optimisation and Calculus of Variations. 2015;21(3):603-624. doi:10.1051/cocv/2014040","chicago":"Goldman, Michael, and Jimena Royo-Letelier. “Sharp Interface Limit for Two Components Bose-Einstein Condensates.” ESAIM - Control, Optimisation and Calculus of Variations. EDP Sciences, 2015. https://doi.org/10.1051/cocv/2014040.","short":"M. Goldman, J. Royo-Letelier, ESAIM - Control, Optimisation and Calculus of Variations 21 (2015) 603–624.","mla":"Goldman, Michael, and Jimena Royo-Letelier. “Sharp Interface Limit for Two Components Bose-Einstein Condensates.” ESAIM - Control, Optimisation and Calculus of Variations, vol. 21, no. 3, EDP Sciences, 2015, pp. 603–24, doi:10.1051/cocv/2014040."},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1401.1727","open_access":"1"}],"day":"01","month":"05","scopus_import":1},{"date_updated":"2021-01-12T06:53:18Z","date_created":"2018-12-11T11:54:05Z","volume":18,"author":[{"full_name":"Sandra Siegert","first_name":"Sandra","last_name":"Siegert","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8635-0877"},{"full_name":"Seo, Jinsoo","last_name":"Seo","first_name":"Jinsoo"},{"full_name":"Kwon, Ester J","last_name":"Kwon","first_name":"Ester"},{"full_name":"Rudenko, Andrii","last_name":"Rudenko","first_name":"Andrii"},{"first_name":"Sukhee","last_name":"Cho","full_name":"Cho, Sukhee"},{"full_name":"Wang, Wenyuan","last_name":"Wang","first_name":"Wenyuan"},{"last_name":"Flood","first_name":"Zachary","full_name":"Flood, Zachary C"},{"full_name":"Martorell, Anthony J","last_name":"Martorell","first_name":"Anthony"},{"last_name":"Ericsson","first_name":"Maria","full_name":"Ericsson, Maria"},{"first_name":"Alison","last_name":"Mungenast","full_name":"Mungenast, Alison E"},{"first_name":"Lihuei","last_name":"Tsai","full_name":"Tsai, Lihuei"}],"title":"The schizophrenia risk gene product miR-137 alters presynaptic plasticity","status":"public","publication_status":"published","publisher":"Nature Publishing Group","intvolume":" 18","year":"2015","_id":"1802","acknowledgement":"S.S. was supported by a Human Frontier Science Program (HFSP) long-term postdoctoral fellowship and a Swiss National Science Foundation fellowship for prospective researchers. E.J.K. was supported by a Simons Foundation Postdoctoral Fellowship. A.R. was supported by a NARSAD Young Investigator Award. This work was supported by a Seed Grant from the Simons Center for the Social Brain and US National Institutes of Health grant RO1 MH 091115 to L.-H.T.","extern":1,"abstract":[{"lang":"eng","text":"Noncoding variants in the human MIR137 gene locus increase schizophrenia risk with genome-wide significance. However, the functional consequence of these risk alleles is unknown. Here we examined induced human neurons harboring the minor alleles of four disease-associated single nucleotide polymorphisms in MIR137. We observed increased MIR137 levels compared to those in major allele–carrying cells. microRNA-137 gain of function caused downregulation of the presynaptic target genes complexin-1 (Cplx1), Nsf and synaptotagmin-1 (Syt1), leading to impaired vesicle release. In vivo, miR-137 gain of function resulted in changes in synaptic vesicle pool distribution, impaired induction of mossy fiber long-term potentiation and deficits in hippocampus-dependent learning and memory. By sequestering endogenous miR-137, we were able to ameliorate the synaptic phenotypes. Moreover, reinstatement of Syt1 expression partially restored synaptic plasticity, demonstrating the importance of Syt1 as a miR-137 target. Our data provide new insight into the mechanism by which miR-137 dysregulation can impair synaptic plasticity in the hippocampus."}],"publist_id":"5308","type":"journal_article","date_published":"2015-07-01T00:00:00Z","doi":"10.1038/nn.4023","quality_controlled":0,"page":"1008 - 1016","publication":"Nature Neuroscience","citation":{"mla":"Siegert, Sandra, et al. “The Schizophrenia Risk Gene Product MiR-137 Alters Presynaptic Plasticity.” Nature Neuroscience, vol. 18, Nature Publishing Group, 2015, pp. 1008–16, doi:10.1038/nn.4023.","short":"S. Siegert, J. Seo, E. Kwon, A. Rudenko, S. Cho, W. Wang, Z. Flood, A. Martorell, M. Ericsson, A. Mungenast, L. Tsai, Nature Neuroscience 18 (2015) 1008–1016.","chicago":"Siegert, Sandra, Jinsoo Seo, Ester Kwon, Andrii Rudenko, Sukhee Cho, Wenyuan Wang, Zachary Flood, et al. “The Schizophrenia Risk Gene Product MiR-137 Alters Presynaptic Plasticity.” Nature Neuroscience. Nature Publishing Group, 2015. https://doi.org/10.1038/nn.4023.","ama":"Siegert S, Seo J, Kwon E, et al. The schizophrenia risk gene product miR-137 alters presynaptic plasticity. Nature Neuroscience. 2015;18:1008-1016. doi:10.1038/nn.4023","ista":"Siegert S, Seo J, Kwon E, Rudenko A, Cho S, Wang W, Flood Z, Martorell A, Ericsson M, Mungenast A, Tsai L. 2015. The schizophrenia risk gene product miR-137 alters presynaptic plasticity. Nature Neuroscience. 18, 1008–1016.","ieee":"S. Siegert et al., “The schizophrenia risk gene product miR-137 alters presynaptic plasticity,” Nature Neuroscience, vol. 18. Nature Publishing Group, pp. 1008–1016, 2015.","apa":"Siegert, S., Seo, J., Kwon, E., Rudenko, A., Cho, S., Wang, W., … Tsai, L. (2015). The schizophrenia risk gene product miR-137 alters presynaptic plasticity. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.4023"},"day":"01","month":"07"},{"year":"2015","publication_status":"published","publisher":"Elsevier","department":[{"_id":"ToBo"}],"author":[{"full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Mark Tobias"}],"date_updated":"2021-01-12T06:53:21Z","date_created":"2018-12-11T11:54:08Z","volume":27,"file_date_updated":"2020-07-14T12:45:17Z","ec_funded":1,"publist_id":"5298","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"},"quality_controlled":"1","project":[{"grant_number":"P27201-B22","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425","name":"Revealing the mechanisms underlying drug interactions","call_identifier":"FWF"},{"name":"Optimality principles in responses to antibiotics","call_identifier":"FP7","_id":"25E83C2C-B435-11E9-9278-68D0E5697425","grant_number":"303507"},{"name":"Revealing the fundamental limits of cell growth","grant_number":"RGP0042/2013","_id":"25EB3A80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.mib.2015.05.008","language":[{"iso":"eng"}],"month":"06","_id":"1810","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Antimicrobial interactions: Mechanisms and implications for drug discovery and resistance evolution","status":"public","ddc":["570"],"intvolume":" 27","pubrep_id":"493","file":[{"relation":"main_file","file_id":"5277","checksum":"1683bb0f42ef892a5b3b71a050d65d25","date_created":"2018-12-12T10:17:23Z","date_updated":"2020-07-14T12:45:17Z","access_level":"open_access","file_name":"IST-2016-493-v1+1_1-s2.0-S1369527415000594-main.pdf","file_size":1047255,"content_type":"application/pdf","creator":"system"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Combining antibiotics is a promising strategy for increasing treatment efficacy and for controlling resistance evolution. When drugs are combined, their effects on cells may be amplified or weakened, that is the drugs may show synergistic or antagonistic interactions. Recent work revealed the underlying mechanisms of such drug interactions by elucidating the drugs'; joint effects on cell physiology. Moreover, new treatment strategies that use drug combinations to exploit evolutionary tradeoffs were shown to affect the rate of resistance evolution in predictable ways. High throughput studies have further identified drug candidates based on their interactions with established antibiotics and general principles that enable the prediction of drug interactions were suggested. Overall, the conceptual and technical foundation for the rational design of potent drug combinations is rapidly developing.","lang":"eng"}],"publication":"Current Opinion in Microbiology","citation":{"ama":"Bollenbach MT. Antimicrobial interactions: Mechanisms and implications for drug discovery and resistance evolution. Current Opinion in Microbiology. 2015;27:1-9. doi:10.1016/j.mib.2015.05.008","ieee":"M. T. Bollenbach, “Antimicrobial interactions: Mechanisms and implications for drug discovery and resistance evolution,” Current Opinion in Microbiology, vol. 27. Elsevier, pp. 1–9, 2015.","apa":"Bollenbach, M. T. (2015). Antimicrobial interactions: Mechanisms and implications for drug discovery and resistance evolution. Current Opinion in Microbiology. Elsevier. https://doi.org/10.1016/j.mib.2015.05.008","ista":"Bollenbach MT. 2015. Antimicrobial interactions: Mechanisms and implications for drug discovery and resistance evolution. Current Opinion in Microbiology. 27, 1–9.","short":"M.T. Bollenbach, Current Opinion in Microbiology 27 (2015) 1–9.","mla":"Bollenbach, Mark Tobias. “Antimicrobial Interactions: Mechanisms and Implications for Drug Discovery and Resistance Evolution.” Current Opinion in Microbiology, vol. 27, Elsevier, 2015, pp. 1–9, doi:10.1016/j.mib.2015.05.008.","chicago":"Bollenbach, Mark Tobias. “Antimicrobial Interactions: Mechanisms and Implications for Drug Discovery and Resistance Evolution.” Current Opinion in Microbiology. Elsevier, 2015. https://doi.org/10.1016/j.mib.2015.05.008."},"page":"1 - 9","date_published":"2015-06-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1"},{"author":[{"full_name":"Lahrz, Martin","first_name":"Martin","last_name":"Lahrz"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"last_name":"Mathey","first_name":"Ludwig","full_name":"Mathey, Ludwig"}],"date_updated":"2021-01-12T06:53:22Z","date_created":"2018-12-11T11:54:09Z","volume":17,"year":"2015","publication_status":"published","publisher":"IOP Publishing Ltd.","department":[{"_id":"MiLe"}],"file_date_updated":"2020-07-14T12:45:17Z","publist_id":"5294","article_number":"045005","doi":"10.1088/1367-2630/17/4/045005","language":[{"iso":"eng"}],"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"},"quality_controlled":"1","month":"04","pubrep_id":"446","oa_version":"Published Version","file":[{"file_name":"IST-2016-446-v1+1_document.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1900925,"creator":"system","relation":"main_file","file_id":"5184","date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:15:59Z","checksum":"551f751a75b39b89a1db2f7f498f9a49"}],"_id":"1812","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"title":"Exotic roton excitations in quadrupolar Bose–Einstein condensates ","status":"public","intvolume":" 17","abstract":[{"text":"We investigate the occurrence of rotons in a quadrupolar Bose–Einstein condensate confined to two dimensions. Depending on the particle density, the ratio of the contact and quadrupole–quadrupole interactions, and the alignment of the quadrupole moments with respect to the confinement plane, the dispersion relation features two or four point-like roton minima or one ring-shaped minimum. We map out the entire parameter space of the roton behavior and identify the instability regions. We propose to observe the exotic rotons by monitoring the characteristic density wave dynamics resulting from a short local perturbation, and discuss the possibilities to detect the predicted effects in state-of-the-art experiments with ultracold homonuclear molecules.\r\n","lang":"eng"}],"issue":"4","type":"journal_article","date_published":"2015-04-01T00:00:00Z","publication":"New Journal of Physics","citation":{"mla":"Lahrz, Martin, et al. “Exotic Roton Excitations in Quadrupolar Bose–Einstein Condensates .” New Journal of Physics, vol. 17, no. 4, 045005, IOP Publishing Ltd., 2015, doi:10.1088/1367-2630/17/4/045005.","short":"M. Lahrz, M. Lemeshko, L. Mathey, New Journal of Physics 17 (2015).","chicago":"Lahrz, Martin, Mikhail Lemeshko, and Ludwig Mathey. “Exotic Roton Excitations in Quadrupolar Bose–Einstein Condensates .” New Journal of Physics. IOP Publishing Ltd., 2015. https://doi.org/10.1088/1367-2630/17/4/045005.","ama":"Lahrz M, Lemeshko M, Mathey L. Exotic roton excitations in quadrupolar Bose–Einstein condensates . New Journal of Physics. 2015;17(4). doi:10.1088/1367-2630/17/4/045005","ista":"Lahrz M, Lemeshko M, Mathey L. 2015. Exotic roton excitations in quadrupolar Bose–Einstein condensates . New Journal of Physics. 17(4), 045005.","apa":"Lahrz, M., Lemeshko, M., & Mathey, L. (2015). Exotic roton excitations in quadrupolar Bose–Einstein condensates . New Journal of Physics. IOP Publishing Ltd. https://doi.org/10.1088/1367-2630/17/4/045005","ieee":"M. Lahrz, M. Lemeshko, and L. Mathey, “Exotic roton excitations in quadrupolar Bose–Einstein condensates ,” New Journal of Physics, vol. 17, no. 4. IOP Publishing Ltd., 2015."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1},{"oa_version":"Preprint","_id":"1811","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 56","title":"Analytical evaluation of atomic form factors: Application to Rayleigh scattering","status":"public","issue":"5","abstract":[{"text":"Atomic form factors are widely used for the characterization of targets and specimens, from crystallography to biology. By using recent mathematical results, here we derive an analytical expression for the atomic form factor within the independent particle model constructed from nonrelativistic screened hydrogenic wave functions. The range of validity of this analytical expression is checked by comparing the analytically obtained form factors with the ones obtained within the Hartee-Fock method. As an example, we apply our analytical expression for the atomic form factor to evaluate the differential cross section for Rayleigh scattering off neutral atoms.","lang":"eng"}],"type":"journal_article","date_published":"2015-05-20T00:00:00Z","citation":{"ama":"Safari L, Santos J, Amaro P, Jänkälä K, Fratini F. Analytical evaluation of atomic form factors: Application to Rayleigh scattering. Journal of Mathematical Physics. 2015;56(5). doi:10.1063/1.4921227","ista":"Safari L, Santos J, Amaro P, Jänkälä K, Fratini F. 2015. Analytical evaluation of atomic form factors: Application to Rayleigh scattering. Journal of Mathematical Physics. 56(5), 052105.","ieee":"L. Safari, J. Santos, P. Amaro, K. Jänkälä, and F. Fratini, “Analytical evaluation of atomic form factors: Application to Rayleigh scattering,” Journal of Mathematical Physics, vol. 56, no. 5. American Institute of Physics, 2015.","apa":"Safari, L., Santos, J., Amaro, P., Jänkälä, K., & Fratini, F. (2015). Analytical evaluation of atomic form factors: Application to Rayleigh scattering. Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4921227","mla":"Safari, Laleh, et al. “Analytical Evaluation of Atomic Form Factors: Application to Rayleigh Scattering.” Journal of Mathematical Physics, vol. 56, no. 5, 052105, American Institute of Physics, 2015, doi:10.1063/1.4921227.","short":"L. Safari, J. Santos, P. Amaro, K. Jänkälä, F. Fratini, Journal of Mathematical Physics 56 (2015).","chicago":"Safari, Laleh, José Santos, Pedro Amaro, Kari Jänkälä, and Filippo Fratini. “Analytical Evaluation of Atomic Form Factors: Application to Rayleigh Scattering.” Journal of Mathematical Physics. American Institute of Physics, 2015. https://doi.org/10.1063/1.4921227."},"publication":"Journal of Mathematical Physics","day":"20","scopus_import":1,"author":[{"last_name":"Safari","first_name":"Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","full_name":"Safari, Laleh"},{"full_name":"Santos, José","last_name":"Santos","first_name":"José"},{"first_name":"Pedro","last_name":"Amaro","full_name":"Amaro, Pedro"},{"last_name":"Jänkälä","first_name":"Kari","full_name":"Jänkälä, Kari"},{"full_name":"Fratini, Filippo","last_name":"Fratini","first_name":"Filippo"}],"volume":56,"date_created":"2018-12-11T11:54:08Z","date_updated":"2021-01-12T06:53:21Z","acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n◦ [291734]. F.F. acknowledges support by Fundação de Amparo à Pesquisa do estado de Minas Gerais (FAPEMIG), by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), and by the Austrian Science Fund (FWF) through the START Grant No. Y 591-N16.","year":"2015","publisher":"American Institute of Physics","department":[{"_id":"MiLe"}],"publication_status":"published","publist_id":"5295","ec_funded":1,"article_number":"052105","doi":"10.1063/1.4921227","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1409.0110","open_access":"1"}],"oa":1,"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"month":"05"},{"month":"05","day":"18","scopus_import":1,"date_published":"2015-05-18T00:00:00Z","doi":"10.1103/PhysRevLett.114.203001","language":[{"iso":"eng"}],"publication":"Physical Review Letters","main_file_link":[{"url":"http://arxiv.org/abs/1502.03447","open_access":"1"}],"citation":{"chicago":"Schmidt, Richard, and Mikhail Lemeshko. “Rotation of Quantum Impurities in the Presence of a Many-Body Environment.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.203001.","mla":"Schmidt, Richard, and Mikhail Lemeshko. “Rotation of Quantum Impurities in the Presence of a Many-Body Environment.” Physical Review Letters, vol. 114, no. 20, 203001, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.203001.","short":"R. Schmidt, M. Lemeshko, Physical Review Letters 114 (2015).","ista":"Schmidt R, Lemeshko M. 2015. Rotation of quantum impurities in the presence of a many-body environment. Physical Review Letters. 114(20), 203001.","ieee":"R. Schmidt and M. Lemeshko, “Rotation of quantum impurities in the presence of a many-body environment,” Physical Review Letters, vol. 114, no. 20. American Physical Society, 2015.","apa":"Schmidt, R., & Lemeshko, M. (2015). Rotation of quantum impurities in the presence of a many-body environment. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.203001","ama":"Schmidt R, Lemeshko M. Rotation of quantum impurities in the presence of a many-body environment. Physical Review Letters. 2015;114(20). doi:10.1103/PhysRevLett.114.203001"},"oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"We develop a microscopic theory describing a quantum impurity whose rotational degree of freedom is coupled to a many-particle bath. We approach the problem by introducing the concept of an “angulon”—a quantum rotor dressed by a quantum field—and reveal its quasiparticle properties using a combination of variational and diagrammatic techniques. Our theory predicts renormalization of the impurity rotational structure, such as that observed in experiments with molecules in superfluid helium droplets, in terms of a rotational Lamb shift induced by the many-particle environment. Furthermore, we discover a rich many-body-induced fine structure, emerging in rotational spectra due to a redistribution of angular momentum within the quantum many-body system."}],"issue":"20","publist_id":"5293","article_number":"203001","type":"journal_article","author":[{"full_name":"Schmidt, Richard","last_name":"Schmidt","first_name":"Richard"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"date_created":"2018-12-11T11:54:09Z","date_updated":"2021-01-12T06:53:22Z","volume":114,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1813","year":"2015","publication_status":"published","status":"public","title":"Rotation of quantum impurities in the presence of a many-body environment","publisher":"American Physical Society","intvolume":" 114","department":[{"_id":"MiLe"}]},{"publist_id":"5302","issue":"2","type":"journal_article","article_number":"7","oa_version":"None","volume":25,"date_created":"2018-12-11T11:54:07Z","date_updated":"2021-01-12T06:53:20Z","author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"intvolume":" 25","department":[{"_id":"ToHe"}],"publisher":"ACM","title":"Guest editors' introduction to special issue on computational methods in systems biology","status":"public","publication_status":"published","_id":"1808","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","day":"01","language":[{"iso":"eng"}],"doi":"10.1145/2745799","date_published":"2015-05-01T00:00:00Z","quality_controlled":"1","citation":{"ama":"Gupta A, Henzinger TA. Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. 2015;25(2). doi:10.1145/2745799","ista":"Gupta A, Henzinger TA. 2015. Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. 25(2), 7.","apa":"Gupta, A., & Henzinger, T. A. (2015). Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. ACM. https://doi.org/10.1145/2745799","ieee":"A. Gupta and T. A. Henzinger, “Guest editors’ introduction to special issue on computational methods in systems biology,” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2. ACM, 2015.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger. “Guest Editors’ Introduction to Special Issue on Computational Methods in Systems Biology.” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2, 7, ACM, 2015, doi:10.1145/2745799.","short":"A. Gupta, T.A. Henzinger, ACM Transactions on Modeling and Computer Simulation 25 (2015).","chicago":"Gupta, Ashutosh, and Thomas A Henzinger. “Guest Editors’ Introduction to Special Issue on Computational Methods in Systems Biology.” ACM Transactions on Modeling and Computer Simulation. ACM, 2015. https://doi.org/10.1145/2745799."},"publication":"ACM Transactions on Modeling and Computer Simulation"},{"page":"217 - 221","citation":{"short":"S. Porazinski, H. Wang, Y. Asaoka, M. Behrndt, T. Miyamoto, H. Morita, S. Hata, T. Sasaki, G. Krens, Y. Osada, S. Asaka, A. Momoi, S. Linton, J. Miesfeld, B. Link, T. Senga, A. Castillo Morales, A. Urrutia, N. Shimizu, H. Nagase, S. Matsuura, S. Bagby, H. Kondoh, H. Nishina, C.-P.J. Heisenberg, M. Furutani Seiki, Nature 521 (2015) 217–221.","mla":"Porazinski, Sean, et al. “YAP Is Essential for Tissue Tension to Ensure Vertebrate 3D Body Shape.” Nature, vol. 521, no. 7551, Nature Publishing Group, 2015, pp. 217–21, doi:10.1038/nature14215.","chicago":"Porazinski, Sean, Huijia Wang, Yoichi Asaoka, Martin Behrndt, Tatsuo Miyamoto, Hitoshi Morita, Shoji Hata, et al. “YAP Is Essential for Tissue Tension to Ensure Vertebrate 3D Body Shape.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature14215.","ama":"Porazinski S, Wang H, Asaoka Y, et al. YAP is essential for tissue tension to ensure vertebrate 3D body shape. Nature. 2015;521(7551):217-221. doi:10.1038/nature14215","apa":"Porazinski, S., Wang, H., Asaoka, Y., Behrndt, M., Miyamoto, T., Morita, H., … Furutani Seiki, M. (2015). YAP is essential for tissue tension to ensure vertebrate 3D body shape. Nature. Nature Publishing Group. https://doi.org/10.1038/nature14215","ieee":"S. Porazinski et al., “YAP is essential for tissue tension to ensure vertebrate 3D body shape,” Nature, vol. 521, no. 7551. Nature Publishing Group, pp. 217–221, 2015.","ista":"Porazinski S, Wang H, Asaoka Y, Behrndt M, Miyamoto T, Morita H, Hata S, Sasaki T, Krens G, Osada Y, Asaka S, Momoi A, Linton S, Miesfeld J, Link B, Senga T, Castillo Morales A, Urrutia A, Shimizu N, Nagase H, Matsuura S, Bagby S, Kondoh H, Nishina H, Heisenberg C-PJ, Furutani Seiki M. 2015. YAP is essential for tissue tension to ensure vertebrate 3D body shape. Nature. 521(7551), 217–221."},"publication":"Nature","date_published":"2015-03-16T00:00:00Z","scopus_import":1,"day":"16","intvolume":" 521","title":"YAP is essential for tissue tension to ensure vertebrate 3D body shape","status":"public","_id":"1817","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","issue":"7551","abstract":[{"text":"Vertebrates have a unique 3D body shape in which correct tissue and organ shape and alignment are essential for function. For example, vision requires the lens to be centred in the eye cup which must in turn be correctly positioned in the head. Tissue morphogenesis depends on force generation, force transmission through the tissue, and response of tissues and extracellular matrix to force. Although a century ago D'Arcy Thompson postulated that terrestrial animal body shapes are conditioned by gravity, there has been no animal model directly demonstrating how the aforementioned mechano-morphogenetic processes are coordinated to generate a body shape that withstands gravity. Here we report a unique medaka fish (Oryzias latipes) mutant, hirame (hir), which is sensitive to deformation by gravity. hir embryos display a markedly flattened body caused by mutation of YAP, a nuclear executor of Hippo signalling that regulates organ size. We show that actomyosin-mediated tissue tension is reduced in hir embryos, leading to tissue flattening and tissue misalignment, both of which contribute to body flattening. By analysing YAP function in 3D spheroids of human cells, we identify the Rho GTPase activating protein ARHGAP18 as an effector of YAP in controlling tissue tension. Together, these findings reveal a previously unrecognised function of YAP in regulating tissue shape and alignment required for proper 3D body shape. Understanding this morphogenetic function of YAP could facilitate the use of embryonic stem cells to generate complex organs requiring correct alignment of multiple tissues. ","lang":"eng"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4720436/"}],"external_id":{"pmid":["25778702"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/nature14215","month":"03","department":[{"_id":"CaHe"}],"publisher":"Nature Publishing Group","publication_status":"published","pmid":1,"year":"2015","volume":521,"date_created":"2018-12-11T11:54:10Z","date_updated":"2021-01-12T06:53:23Z","author":[{"last_name":"Porazinski","first_name":"Sean","full_name":"Porazinski, Sean"},{"full_name":"Wang, Huijia","first_name":"Huijia","last_name":"Wang"},{"full_name":"Asaoka, Yoichi","last_name":"Asaoka","first_name":"Yoichi"},{"full_name":"Behrndt, Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Behrndt"},{"last_name":"Miyamoto","first_name":"Tatsuo","full_name":"Miyamoto, Tatsuo"},{"id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87","first_name":"Hitoshi","last_name":"Morita","full_name":"Morita, Hitoshi"},{"full_name":"Hata, Shoji","last_name":"Hata","first_name":"Shoji"},{"full_name":"Sasaki, Takashi","last_name":"Sasaki","first_name":"Takashi"},{"full_name":"Krens, Gabriel","first_name":"Gabriel","last_name":"Krens","id":"2B819732-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4761-5996"},{"first_name":"Yumi","last_name":"Osada","full_name":"Osada, Yumi"},{"full_name":"Asaka, Satoshi","last_name":"Asaka","first_name":"Satoshi"},{"full_name":"Momoi, Akihiro","last_name":"Momoi","first_name":"Akihiro"},{"full_name":"Linton, Sarah","last_name":"Linton","first_name":"Sarah"},{"full_name":"Miesfeld, Joel","last_name":"Miesfeld","first_name":"Joel"},{"last_name":"Link","first_name":"Brian","full_name":"Link, Brian"},{"full_name":"Senga, Takeshi","first_name":"Takeshi","last_name":"Senga"},{"first_name":"Atahualpa","last_name":"Castillo Morales","full_name":"Castillo Morales, Atahualpa"},{"full_name":"Urrutia, Araxi","first_name":"Araxi","last_name":"Urrutia"},{"last_name":"Shimizu","first_name":"Nobuyoshi","full_name":"Shimizu, Nobuyoshi"},{"first_name":"Hideaki","last_name":"Nagase","full_name":"Nagase, Hideaki"},{"first_name":"Shinya","last_name":"Matsuura","full_name":"Matsuura, Shinya"},{"first_name":"Stefan","last_name":"Bagby","full_name":"Bagby, Stefan"},{"full_name":"Kondoh, Hisato","last_name":"Kondoh","first_name":"Hisato"},{"last_name":"Nishina","first_name":"Hiroshi","full_name":"Nishina, Hiroshi"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Makoto","last_name":"Furutani Seiki","full_name":"Furutani Seiki, Makoto"}],"publist_id":"5289"},{"page":"3496-3502","citation":{"apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5, 3496–3502.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . Vol 5. AAAI Press; 2015:3496-3502.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp. 3496–3502.","mla":"Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , vol. 5, AAAI Press, 2015, pp. 3496–502."},"publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence ","date_published":"2015-06-01T00:00:00Z","scopus_import":1,"day":"01","intvolume":" 5","title":"Optimal cost almost-sure reachability in POMDPs","status":"public","_id":"1820","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","alternative_title":["Artifical Intelligence"],"type":"conference","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objec- tive we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the problem of approximating the optimal cost is decidable and present ap- proximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst- case running time of our algorithm is double exponential, we present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples."}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"quality_controlled":"1","external_id":{"arxiv":["1411.3880"]},"main_file_link":[{"url":"http://arxiv.org/abs/1411.3880","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Austin, TX, USA","start_date":"2015-01-25","end_date":"2015-01-30","name":"IAAI: Innovative Applications of Artificial Intelligence"},"month":"06","department":[{"_id":"KrCh"}],"publisher":"AAAI Press","publication_status":"published","year":"2015","acknowledgement":" The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","volume":5,"date_updated":"2023-02-23T10:02:57Z","date_created":"2018-12-11T11:54:11Z","related_material":{"record":[{"id":"1529","relation":"later_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"last_name":"Gupta","first_name":"Raghav","full_name":"Gupta, Raghav"},{"full_name":"Kanodia, Ayush","first_name":"Ayush","last_name":"Kanodia"}],"publist_id":"5286","ec_funded":1},{"file_date_updated":"2020-07-14T12:45:17Z","publist_id":"5292","ec_funded":1,"article_number":"27","date_created":"2018-12-11T11:54:09Z","date_updated":"2023-02-23T10:15:40Z","volume":34,"author":[{"full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","first_name":"Stefan"},{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"ChWo"}],"publisher":"ACM","year":"2015","month":"04","language":[{"iso":"eng"}],"doi":"10.1145/2714572","quality_controlled":"1","project":[{"grant_number":"P 24352-N23","_id":"25357BD2-B435-11E9-9278-68D0E5697425","name":"Deep Pictures: Creating Visual and Haptic Vector Images","call_identifier":"FWF"},{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"}],"oa":1,"abstract":[{"lang":"eng","text":"We present an efficient wavefront tracking algorithm for animating bodies of water that interact with their environment. Our contributions include: a novel wavefront tracking technique that enables dispersion, refraction, reflection, and diffraction in the same simulation; a unique multivalued function interpolation method that enables our simulations to elegantly sidestep the Nyquist limit; a dispersion approximation for efficiently amplifying the number of simulated waves by several orders of magnitude; and additional extensions that allow for time-dependent effects and interactive artistic editing of the resulting animation. Our contributions combine to give us multitudes more wave details than similar algorithms, while maintaining high frame rates and allowing close camera zooms."}],"issue":"3","type":"journal_article","file":[{"date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:12:15Z","checksum":"67c9f4fa370def68cdf31299e48bc91f","file_id":"4933","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":23712153,"file_name":"IST-2016-575-v1+1_wavefront_preprint.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"575","ddc":["000"],"status":"public","title":"Water wave animation via wavefront parameter interpolation","intvolume":" 34","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1814","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2015-04-01T00:00:00Z","publication":"ACM Transactions on Graphics","citation":{"chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Animation via Wavefront Parameter Interpolation.” ACM Transactions on Graphics. ACM, 2015. https://doi.org/10.1145/2714572.","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Animation via Wavefront Parameter Interpolation.” ACM Transactions on Graphics, vol. 34, no. 3, 27, ACM, 2015, doi:10.1145/2714572.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 34 (2015).","ista":"Jeschke S, Wojtan C. 2015. Water wave animation via wavefront parameter interpolation. ACM Transactions on Graphics. 34(3), 27.","apa":"Jeschke, S., & Wojtan, C. (2015). Water wave animation via wavefront parameter interpolation. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2714572","ieee":"S. Jeschke and C. Wojtan, “Water wave animation via wavefront parameter interpolation,” ACM Transactions on Graphics, vol. 34, no. 3. ACM, 2015.","ama":"Jeschke S, Wojtan C. Water wave animation via wavefront parameter interpolation. ACM Transactions on Graphics. 2015;34(3). doi:10.1145/2714572"}},{"publist_id":"5288","ec_funded":1,"pmid":1,"year":"2015","department":[{"_id":"NiBa"}],"publisher":"National Academy of Sciences","publication_status":"published","author":[{"first_name":"Jitka","last_name":"Polechova","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0951-3112","full_name":"Polechova, Jitka"},{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"volume":112,"date_created":"2018-12-11T11:54:11Z","date_updated":"2021-01-12T06:53:24Z","month":"05","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4443383/"}],"external_id":{"pmid":["25941385"]},"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"quality_controlled":"1","doi":"10.1073/pnas.1421515112","language":[{"iso":"eng"}],"type":"journal_article","issue":"20","abstract":[{"text":"Why do species not adapt to ever-wider ranges of conditions, gradually expanding their ecological niche and geographic range? Gene flow across environments has two conflicting effects: although it increases genetic variation, which is a prerequisite for adaptation, gene flow may swamp adaptation to local conditions. In 1956, Haldane proposed that, when the environment varies across space, "swamping" by gene flow creates a positive feedback between low population size and maladaptation, leading to a sharp range margin. However, current deterministic theory shows that, when variance can evolve, there is no such limit. Using simple analytical tools and simulations, we show that genetic drift can generate a sharp margin to a species' range, by reducing genetic variance below the level needed for adaptation to spatially variable conditions. Aided by separation of ecological and evolutionary timescales, the identified effective dimensionless parameters reveal a simple threshold that predicts when adaptation at the range margin fails. Two observable parameters determine the threshold: (i) the effective environmental gradient, which can be measured by the loss of fitness due to dispersal to a different environment; and (ii) the efficacy of selection relative to genetic drift. The theory predicts sharp range margins even in the absence of abrupt changes in the environment. Furthermore, it implies that gradual worsening of conditions across a species' habitat may lead to a sudden range fragmentation, when adaptation to a wide span of conditions within a single species becomes impossible.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1818","intvolume":" 112","status":"public","title":"Limits to adaptation along environmental gradients","oa_version":"Submitted Version","scopus_import":1,"day":"19","citation":{"chicago":"Polechova, Jitka, and Nicholas H Barton. “Limits to Adaptation along Environmental Gradients.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1421515112.","mla":"Polechova, Jitka, and Nicholas H. Barton. “Limits to Adaptation along Environmental Gradients.” PNAS, vol. 112, no. 20, National Academy of Sciences, 2015, pp. 6401–06, doi:10.1073/pnas.1421515112.","short":"J. Polechova, N.H. Barton, PNAS 112 (2015) 6401–6406.","ista":"Polechova J, Barton NH. 2015. Limits to adaptation along environmental gradients. PNAS. 112(20), 6401–6406.","apa":"Polechova, J., & Barton, N. H. (2015). Limits to adaptation along environmental gradients. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1421515112","ieee":"J. Polechova and N. H. Barton, “Limits to adaptation along environmental gradients,” PNAS, vol. 112, no. 20. National Academy of Sciences, pp. 6401–6406, 2015.","ama":"Polechova J, Barton NH. Limits to adaptation along environmental gradients. PNAS. 2015;112(20):6401-6406. doi:10.1073/pnas.1421515112"},"publication":"PNAS","page":"6401 - 6406","date_published":"2015-05-19T00:00:00Z"},{"citation":{"ista":"Zwiewka M, Nodzyński T, Robert S, Vanneste S, Friml J. 2015. Osmotic stress modulates the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis thaliana. Molecular Plant. 8(8), 1175–1187.","apa":"Zwiewka, M., Nodzyński, T., Robert, S., Vanneste, S., & Friml, J. (2015). Osmotic stress modulates the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis thaliana. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2015.03.007","ieee":"M. Zwiewka, T. Nodzyński, S. Robert, S. Vanneste, and J. Friml, “Osmotic stress modulates the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis thaliana,” Molecular Plant, vol. 8, no. 8. Elsevier, pp. 1175–1187, 2015.","ama":"Zwiewka M, Nodzyński T, Robert S, Vanneste S, Friml J. Osmotic stress modulates the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis thaliana. Molecular Plant. 2015;8(8):1175-1187. doi:10.1016/j.molp.2015.03.007","chicago":"Zwiewka, Marta, Tomasz Nodzyński, Stéphanie Robert, Steffen Vanneste, and Jiří Friml. “Osmotic Stress Modulates the Balance between Exocytosis and Clathrin Mediated Endocytosis in Arabidopsis Thaliana.” Molecular Plant. Elsevier, 2015. https://doi.org/10.1016/j.molp.2015.03.007.","mla":"Zwiewka, Marta, et al. “Osmotic Stress Modulates the Balance between Exocytosis and Clathrin Mediated Endocytosis in Arabidopsis Thaliana.” Molecular Plant, vol. 8, no. 8, Elsevier, 2015, pp. 1175–87, doi:10.1016/j.molp.2015.03.007.","short":"M. Zwiewka, T. Nodzyński, S. Robert, S. Vanneste, J. Friml, Molecular Plant 8 (2015) 1175–1187."},"publication":"Molecular Plant","page":"1175 - 1187","date_published":"2015-08-03T00:00:00Z","scopus_import":1,"day":"03","_id":"1819","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 8","title":"Osmotic stress modulates the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis thaliana","status":"public","oa_version":"None","type":"journal_article","issue":"8","abstract":[{"lang":"eng","text":"The sessile life style of plants creates the need to deal with an often adverse environment, in which water availability can change on a daily basis, challenging the cellular physiology and integrity. Changes in osmotic conditions disrupt the equilibrium of the plasma membrane: hypoosmotic conditions increase and hyperosmotic environment decrease the cell volume. Here, we show that short-term extracellular osmotic treatments are closely followed by a shift in the balance between endocytosis and exocytosis in root meristem cells. Acute hyperosmotic treatments (ionic and nonionic) enhance clathrin-mediated endocytosis simultaneously attenuating exocytosis, whereas hypoosmotic treatments have the opposite effects. In addition to clathrin recruitment to the plasma membrane, components of early endocytic trafficking are essential during hyperosmotic stress responses. Consequently, growth of seedlings defective in elements of clathrin or early endocytic machinery is more sensitive to hyperosmotic treatments. We also found that the endocytotic response to a change of osmotic status in the environment is dominant over the presumably evolutionary more recent regulatory effect of plant hormones, such as auxin. These results imply that osmotic perturbation influences the balance between endocytosis and exocytosis acting through clathrin-mediated endocytosis. We propose that tension on the plasma membrane determines the addition or removal of membranes at the cell surface, thus preserving cell integrity."}],"project":[{"call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"quality_controlled":"1","doi":"10.1016/j.molp.2015.03.007","language":[{"iso":"eng"}],"month":"08","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP); European Social Fund (CZ.1.07/2.3.00/20.0043) and the Czech Science Foundation GAČR (GA13-40637S) to J.F.; project Postdoc I. (CZ.1.07/2.3.00/30.0009) co-financed by the European Social Fund and the state budget of the Czech Republic to M.Z. and T.N..","year":"2015","publisher":"Elsevier","department":[{"_id":"JiFr"}],"publication_status":"published","author":[{"full_name":"Zwiewka, Marta","first_name":"Marta","last_name":"Zwiewka"},{"full_name":"Nodzyński, Tomasz","last_name":"Nodzyński","first_name":"Tomasz"},{"last_name":"Robert","first_name":"Stéphanie","full_name":"Robert, Stéphanie"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"full_name":"Friml, Jiřĺ","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiřĺ"}],"volume":8,"date_created":"2018-12-11T11:54:11Z","date_updated":"2021-01-12T06:53:24Z","publist_id":"5287","ec_funded":1},{"pubrep_id":"395","oa_version":"Published Version","file":[{"file_name":"IST-2015-395-v1+1_807.full.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1273573,"creator":"system","relation":"main_file","file_id":"5087","date_created":"2018-12-12T10:14:34Z","date_updated":"2020-07-14T12:45:17Z","checksum":"4289b518fbe2166682fb1a1ef9b405f3"}],"_id":"1823","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 11","ddc":["570"],"title":"Systematic discovery of drug interaction mechanisms","status":"public","issue":"4","abstract":[{"lang":"eng","text":"Abstract Drug combinations are increasingly important in disease treatments, for combating drug resistance, and for elucidating fundamental relationships in cell physiology. When drugs are combined, their individual effects on cells may be amplified or weakened. Such drug interactions are crucial for treatment efficacy, but their underlying mechanisms remain largely unknown. To uncover the causes of drug interactions, we developed a systematic approach based on precise quantification of the individual and joint effects of antibiotics on growth of genome-wide Escherichia coli gene deletion strains. We found that drug interactions between antibiotics representing the main modes of action are highly robust to genetic perturbation. This robustness is encapsulated in a general principle of bacterial growth, which enables the quantitative prediction of mutant growth rates under drug combinations. Rare violations of this principle exposed recurring cellular functions controlling drug interactions. In particular, we found that polysaccharide and ATP synthesis control multiple drug interactions with previously unexplained mechanisms, and small molecule adjuvants targeting these functions synthetically reshape drug interactions in predictable ways. These results provide a new conceptual framework for the design of multidrug combinations and suggest that there are universal mechanisms at the heart of most drug interactions. Synopsis A general principle of bacterial growth enables the prediction of mutant growth rates under drug combinations. Rare violations of this principle expose cellular functions that control drug interactions and can be targeted by small molecules to alter drug interactions in predictable ways. Drug interactions between antibiotics are highly robust to genetic perturbations. A general principle of bacterial growth enables the prediction of mutant growth rates under drug combinations. Rare violations of this principle expose cellular functions that control drug interactions. Diverse drug interactions are controlled by recurring cellular functions, including LPS synthesis and ATP synthesis. A general principle of bacterial growth enables the prediction of mutant growth rates under drug combinations. Rare violations of this principle expose cellular functions that control drug interactions and can be targeted by small molecules to alter drug interactions in predictable ways."}],"type":"journal_article","date_published":"2015-04-01T00:00:00Z","citation":{"ama":"Chevereau G, Bollenbach MT. Systematic discovery of drug interaction mechanisms. Molecular Systems Biology. 2015;11(4). doi:10.15252/msb.20156098","apa":"Chevereau, G., & Bollenbach, M. T. (2015). Systematic discovery of drug interaction mechanisms. Molecular Systems Biology. Nature Publishing Group. https://doi.org/10.15252/msb.20156098","ieee":"G. Chevereau and M. T. Bollenbach, “Systematic discovery of drug interaction mechanisms,” Molecular Systems Biology, vol. 11, no. 4. Nature Publishing Group, 2015.","ista":"Chevereau G, Bollenbach MT. 2015. Systematic discovery of drug interaction mechanisms. Molecular Systems Biology. 11(4), 807.","short":"G. Chevereau, M.T. Bollenbach, Molecular Systems Biology 11 (2015).","mla":"Chevereau, Guillaume, and Mark Tobias Bollenbach. “Systematic Discovery of Drug Interaction Mechanisms.” Molecular Systems Biology, vol. 11, no. 4, 807, Nature Publishing Group, 2015, doi:10.15252/msb.20156098.","chicago":"Chevereau, Guillaume, and Mark Tobias Bollenbach. “Systematic Discovery of Drug Interaction Mechanisms.” Molecular Systems Biology. Nature Publishing Group, 2015. https://doi.org/10.15252/msb.20156098."},"publication":"Molecular Systems Biology","has_accepted_license":"1","day":"01","scopus_import":1,"author":[{"id":"424D78A0-F248-11E8-B48F-1D18A9856A87","first_name":"Guillaume","last_name":"Chevereau","full_name":"Chevereau, Guillaume"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","first_name":"Mark Tobias","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias"}],"volume":11,"date_created":"2018-12-11T11:54:12Z","date_updated":"2021-01-12T06:53:26Z","year":"2015","department":[{"_id":"ToBo"}],"publisher":"Nature Publishing Group","publication_status":"published","ec_funded":1,"publist_id":"5283","file_date_updated":"2020-07-14T12:45:17Z","article_number":"807","doi":"10.15252/msb.20156098","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,"project":[{"_id":"25E9AF9E-B435-11E9-9278-68D0E5697425","grant_number":"P27201-B22","name":"Revealing the mechanisms underlying drug interactions","call_identifier":"FWF"},{"grant_number":"RGP0042/2013","_id":"25EB3A80-B435-11E9-9278-68D0E5697425","name":"Revealing the fundamental limits of cell growth"},{"grant_number":"303507","_id":"25E83C2C-B435-11E9-9278-68D0E5697425","name":"Optimality principles in responses to antibiotics","call_identifier":"FP7"}],"quality_controlled":"1","month":"04"},{"month":"04","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.1038/ncomms7977","article_number":"6977","publist_id":"5282","file_date_updated":"2020-07-14T12:45:17Z","publisher":"Nature Publishing Group","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2015","volume":6,"date_created":"2018-12-11T11:54:13Z","date_updated":"2021-01-12T06:53:26Z","author":[{"last_name":"Knebel","first_name":"Johannes","full_name":"Knebel, Johannes"},{"full_name":"Weber, Markus","last_name":"Weber","first_name":"Markus"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger"},{"full_name":"Frey, Erwin","first_name":"Erwin","last_name":"Frey"}],"scopus_import":1,"has_accepted_license":"1","day":"24","citation":{"ama":"Knebel J, Weber M, Krüger TH, Frey E. Evolutionary games of condensates in coupled birth-death processes. Nature Communications. 2015;6. doi:10.1038/ncomms7977","ista":"Knebel J, Weber M, Krüger TH, Frey E. 2015. Evolutionary games of condensates in coupled birth-death processes. Nature Communications. 6, 6977.","apa":"Knebel, J., Weber, M., Krüger, T. H., & Frey, E. (2015). Evolutionary games of condensates in coupled birth-death processes. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms7977","ieee":"J. Knebel, M. Weber, T. H. Krüger, and E. Frey, “Evolutionary games of condensates in coupled birth-death processes,” Nature Communications, vol. 6. Nature Publishing Group, 2015.","mla":"Knebel, Johannes, et al. “Evolutionary Games of Condensates in Coupled Birth-Death Processes.” Nature Communications, vol. 6, 6977, Nature Publishing Group, 2015, doi:10.1038/ncomms7977.","short":"J. Knebel, M. Weber, T.H. Krüger, E. Frey, Nature Communications 6 (2015).","chicago":"Knebel, Johannes, Markus Weber, Torben H Krüger, and Erwin Frey. “Evolutionary Games of Condensates in Coupled Birth-Death Processes.” Nature Communications. Nature Publishing Group, 2015. https://doi.org/10.1038/ncomms7977."},"publication":"Nature Communications","date_published":"2015-04-24T00:00:00Z","type":"journal_article","abstract":[{"text":"Condensation phenomena arise through a collective behaviour of particles. They are observed in both classical and quantum systems, ranging from the formation of traffic jams in mass transport models to the macroscopic occupation of the energetic ground state in ultra-cold bosonic gases (Bose-Einstein condensation). Recently, it has been shown that a driven and dissipative system of bosons may form multiple condensates. Which states become the condensates has, however, remained elusive thus far. The dynamics of this condensation are described by coupled birth-death processes, which also occur in evolutionary game theory. Here we apply concepts from evolutionary game theory to explain the formation of multiple condensates in such driven-dissipative bosonic systems. We show that the vanishing of relative entropy production determines their selection. The condensation proceeds exponentially fast, but the system never comes to rest. Instead, the occupation numbers of condensates may oscillate, as we demonstrate for a rock-paper-scissors game of condensates.","lang":"eng"}],"intvolume":" 6","ddc":["530"],"status":"public","title":"Evolutionary games of condensates in coupled birth-death processes","_id":"1824","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_name":"IST-2016-451-v1+1_ncomms7977.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1151501,"creator":"system","relation":"main_file","file_id":"5245","date_created":"2018-12-12T10:16:54Z","date_updated":"2020-07-14T12:45:17Z","checksum":"c4cffb5c8b245e658a34eac71a03e7cc"}],"pubrep_id":"451"},{"oa_version":"Submitted Version","_id":"1831","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies","status":"public","intvolume":" 370","abstract":[{"text":"This paper introduces a theme issue presenting the latest developments in research on the impacts of sociality on health and fitness. The articles that follow cover research on societies ranging from insects to humans. Variation in measures of fitness (i.e. survival and reproduction) has been linked to various aspects of sociality in humans and animals alike, and variability in individual health and condition has been recognized as a key mediator of these relationships. Viewed from a broad evolutionary perspective, the evolutionary transitions from a solitary lifestyle to group living have resulted in several new health-related costs and benefits of sociality. Social transmission of parasites within groups represents a major cost of group living, but some behavioural mechanisms, such as grooming, have evolved repeatedly to reduce this cost. Group living also has created novel costs in terms of altered susceptibility to infectious and non-infectious disease as a result of the unavoidable physiological consequences of social competition and integration, which are partly alleviated by social buffering in some vertebrates. Here, we define the relevant aspects of sociality, summarize their health-related costs and benefits, and discuss possible fitness measures in different study systems. Given the pervasive effects of social factors on health and fitness, we propose a synthesis of existing conceptual approaches in disease ecology, ecological immunology and behavioural neurosciences by adding sociality as a key factor, with the goal to generate a broader framework for organismal integration of health-related research.","lang":"eng"}],"issue":"1669","type":"journal_article","date_published":"2015-05-01T00:00:00Z","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","citation":{"ama":"Kappeler P, Cremer S, Nunn C. Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies. Philosophical Transactions of the Royal Society of London Series B, Biological Sciences. 2015;370(1669). doi:10.1098/rstb.2014.0116","ista":"Kappeler P, Cremer S, Nunn C. 2015. Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 370(1669), 20140116.","apa":"Kappeler, P., Cremer, S., & Nunn, C. (2015). Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. Royal Society. https://doi.org/10.1098/rstb.2014.0116","ieee":"P. Kappeler, S. Cremer, and C. Nunn, “Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies,” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences, vol. 370, no. 1669. Royal Society, 2015.","mla":"Kappeler, Peter, et al. “Sociality and Health: Impacts of Sociality on Disease Susceptibility and Transmission in Animal and Human Societies.” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences, vol. 370, no. 1669, 20140116, Royal Society, 2015, doi:10.1098/rstb.2014.0116.","short":"P. Kappeler, S. Cremer, C. Nunn, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 370 (2015).","chicago":"Kappeler, Peter, Sylvia Cremer, and Charles Nunn. “Sociality and Health: Impacts of Sociality on Disease Susceptibility and Transmission in Animal and Human Societies.” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. Royal Society, 2015. https://doi.org/10.1098/rstb.2014.0116."},"day":"01","scopus_import":1,"author":[{"last_name":"Kappeler","first_name":"Peter","full_name":"Kappeler, Peter"},{"orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","first_name":"Sylvia","full_name":"Cremer, Sylvia"},{"full_name":"Nunn, Charles","first_name":"Charles","last_name":"Nunn"}],"date_created":"2018-12-11T11:54:15Z","date_updated":"2021-01-12T06:53:29Z","volume":370,"acknowledgement":"We thank the German Research Foundation (DFG), the Ministry of Science and Culture of Lower-Saxony (MWK Hannover) and the German Primate Centre (DPZ) for their support of the 9. Göttinger Freilandtage in 2013, a conference at which most contributions to this issue were first presented, the referees of the contributions to this issue for their constructive comments, Meggan Craft for comments, and Helen Eaton for her support in producing this theme issue.","year":"2015","pmid":1,"publication_status":"published","department":[{"_id":"SyCr"}],"publisher":"Royal Society","publist_id":"5272","article_number":"20140116","doi":"10.1098/rstb.2014.0116","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4410382/"}],"external_id":{"pmid":["25870402"]},"quality_controlled":"1","month":"05"},{"ec_funded":1,"publist_id":"5276","publisher":"Springer","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2015","volume":160,"date_updated":"2021-01-12T06:53:28Z","date_created":"2018-12-11T11:54:14Z","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy"},{"last_name":"Pirogov","first_name":"Sergey","full_name":"Pirogov, Sergey"},{"first_name":"Aleksandr","last_name":"Rybko","full_name":"Rybko, Aleksandr"}],"month":"07","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"arxiv.org/abs/1406.5313","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10955-015-1238-5","type":"journal_article","issue":"1","abstract":[{"text":"We construct a non-linear Markov process connected with a biological model of a bacterial genome recombination. The description of invariant measures of this process gives us the solution of one problem in elementary probability theory.","lang":"eng"}],"intvolume":" 160","status":"public","title":"Invariant measures of genetic recombination process","_id":"1828","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","scopus_import":1,"article_processing_charge":"No","day":"01","page":"163 - 167","citation":{"mla":"Akopyan, Arseniy, et al. “Invariant Measures of Genetic Recombination Process.” Journal of Statistical Physics, vol. 160, no. 1, Springer, 2015, pp. 163–67, doi:10.1007/s10955-015-1238-5.","short":"A. Akopyan, S. Pirogov, A. Rybko, Journal of Statistical Physics 160 (2015) 163–167.","chicago":"Akopyan, Arseniy, Sergey Pirogov, and Aleksandr Rybko. “Invariant Measures of Genetic Recombination Process.” Journal of Statistical Physics. Springer, 2015. https://doi.org/10.1007/s10955-015-1238-5.","ama":"Akopyan A, Pirogov S, Rybko A. Invariant measures of genetic recombination process. Journal of Statistical Physics. 2015;160(1):163-167. doi:10.1007/s10955-015-1238-5","ista":"Akopyan A, Pirogov S, Rybko A. 2015. Invariant measures of genetic recombination process. Journal of Statistical Physics. 160(1), 163–167.","ieee":"A. Akopyan, S. Pirogov, and A. Rybko, “Invariant measures of genetic recombination process,” Journal of Statistical Physics, vol. 160, no. 1. Springer, pp. 163–167, 2015.","apa":"Akopyan, A., Pirogov, S., & Rybko, A. (2015). Invariant measures of genetic recombination process. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-015-1238-5"},"publication":"Journal of Statistical Physics","date_published":"2015-07-01T00:00:00Z"},{"ec_funded":1,"publist_id":"5266","author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Kovács","first_name":"Laura","full_name":"Kovács, Laura"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zwirchmayr, Jakob","first_name":"Jakob","last_name":"Zwirchmayr"}],"volume":9032,"date_created":"2018-12-11T11:54:16Z","date_updated":"2020-08-11T10:09:32Z","year":"2015","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","month":"04","doi":"10.1007/978-3-662-46669-8_5","conference":{"name":"ESOP: European Symposium on Programming","end_date":"2015-04-18","location":"London, United Kingdom","start_date":"2015-04-11"},"language":[{"iso":"eng"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"In the standard framework for worst-case execution time (WCET) analysis of programs, the main data structure is a single instance of integer linear programming (ILP) that represents the whole program. The instance of this NP-hard problem must be solved to find an estimate forWCET, and it must be refined if the estimate is not tight.We propose a new framework for WCET analysis, based on abstract segment trees (ASTs) as the main data structure. The ASTs have two advantages. First, they allow computing WCET by solving a number of independent small ILP instances. Second, ASTs store more expressive constraints, thus enabling a more efficient and precise refinement procedure. In order to realize our framework algorithmically, we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework to obtain parametric estimates of WCET. We experimentally evaluate our approach on a set of examples from WCET benchmark suites and linear-algebra packages. We show that our analysis, with comparable effort, provides WCET estimates that in many cases significantly improve those computed by existing tools."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"None","_id":"1836","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9032","title":"Segment abstraction for worst-case execution time analysis","status":"public","day":"01","scopus_import":1,"series_title":"Lecture Notes in Computer Science","date_published":"2015-04-01T00:00:00Z","citation":{"ista":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment abstraction for worst-case execution time analysis. 9032, 105–131.","ieee":"P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.","apa":"Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., & Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46669-8_5","ama":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction for worst-case execution time analysis. 2015;9032:105-131. doi:10.1007/978-3-662-46669-8_5","chicago":"Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46669-8_5.","mla":"Cerny, Pavol, et al. Segment Abstraction for Worst-Case Execution Time Analysis. Vol. 9032, Springer, 2015, pp. 105–31, doi:10.1007/978-3-662-46669-8_5.","short":"P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032 (2015) 105–131."},"page":"105 - 131"},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Synthesis of program parts is particularly useful for concurrent systems. However, most approaches do not support common design tasks, like modifying a single process without having to re-synthesize or verify the whole system. Assume-guarantee synthesis (AGS) provides robustness against modifications of system parts, but thus far has been limited to the perfect information setting. This means that local variables cannot be hidden from other processes, which renders synthesis results cumbersome or even impossible to realize.We resolve this shortcoming by defining AGS under partial information. We analyze the complexity and decidability in different settings, showing that the problem has a high worstcase complexity and is undecidable in many interesting cases. Based on these observations, we present a pragmatic algorithm based on bounded synthesis, and demonstrate its practical applicability on several examples.","lang":"eng"}],"title":"Assume-guarantee synthesis for concurrent reactive programs with partial information","status":"public","intvolume":" 9035","_id":"1838","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","scopus_import":1,"day":"01","page":"517 - 532","citation":{"mla":"Bloem, Roderick, et al. Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. Vol. 9035, Springer, 2015, pp. 517–32, doi:10.1007/978-3-662-46681-0_50.","short":"R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,” 9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.","ama":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis for concurrent reactive programs with partial information. In: Vol 9035. Springer; 2015:517-532. doi:10.1007/978-3-662-46681-0_50","ista":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.","ieee":"R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.","apa":"Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50"},"date_published":"2015-01-01T00:00:00Z","publist_id":"5264","ec_funded":1,"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by the European Commission through an ERC Start grant (279307: Graph Games) and project STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR 14 AVACS and project ASDPS(JA 2357/2-1).","year":"2015","date_created":"2018-12-11T11:54:17Z","date_updated":"2021-01-12T06:53:32Z","volume":9035,"author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Jacobs, Swen","first_name":"Swen","last_name":"Jacobs"},{"last_name":"Könighofer","first_name":"Robert","full_name":"Könighofer, Robert"}],"month":"01","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1411.4604","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"London, United Kingdom","start_date":"2015-04-11","end_date":"2015-04-18"},"doi":"10.1007/978-3-662-46681-0_50"},{"month":"01","quality_controlled":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.03093"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2015-04-11","location":"London, United Kingdom","end_date":"2015-04-18"},"doi":"10.1007/978-3-662-46681-0_12","ec_funded":1,"publist_id":"5263","publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"year":"2015","date_updated":"2020-01-21T13:18:52Z","date_created":"2018-12-11T11:54:18Z","volume":9035,"author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"full_name":"Kučera, Antonín","last_name":"Kučera","first_name":"Antonín"}],"series_title":"Lecture Notes in Computer Science","day":"01","page":"181 - 187","citation":{"ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:10.1007/978-3-662-46681-0_12","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.","ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.","apa":"Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12","mla":"Brázdil, Tomáš, et al. Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. Vol. 9035, Springer, 2015, pp. 181–87, doi:10.1007/978-3-662-46681-0_12.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12."},"date_published":"2015-01-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We present MultiGain, a tool to synthesize strategies for Markov decision processes (MDPs) with multiple mean-payoff objectives. Our models are described in PRISM, and our tool uses the existing interface and simulator of PRISM. Our tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives, and also provides features such as (i) generating strategies and exploring them for simulation, and checking them with respect to other properties; and (ii) generating an approximate Pareto curve for two mean-payoff objectives. In addition, we present a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives under memoryless strategies.","lang":"eng"}],"status":"public","title":"Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives","intvolume":" 9035","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1839","oa_version":"Preprint"},{"oa_version":"Preprint","intvolume":" 770","title":"Subcritical versus supercritical transition to turbulence in curved pipes","status":"public","_id":"1837","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"5","abstract":[{"lang":"eng","text":"Transition to turbulence in straight pipes occurs in spite of the linear stability of the laminar Hagen-Poiseuille flow if both the amplitude of flow perturbations and the Reynolds number Re exceed a minimum threshold (subcritical transition). As the pipe curvature increases, centrifugal effects become important, modifying the basic flow as well as the most unstable linear modes. If the curvature (tube-to-coiling diameter d/D) is sufficiently large, a Hopf bifurcation (supercritical instability) is encountered before turbulence can be excited (subcritical instability). We trace the instability thresholds in the Re - d/D parameter space in the range 0.01 ≤ d/D\\ ≤ 0.1 by means of laser-Doppler velocimetry and determine the point where the subcritical and supercritical instabilities meet. Two different experimental set-ups are used: a closed system where the pipe forms an axisymmetric torus and an open system employing a helical pipe. Implications for the measurement of friction factors in curved pipes are discussed."}],"type":"journal_article","date_published":"2015-04-08T00:00:00Z","article_type":"original","citation":{"chicago":"Kühnen, Jakob, P Braunshier, M Schwegel, Hendrik Kuhlmann, and Björn Hof. “Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” Journal of Fluid Mechanics. Cambridge University Press, 2015. https://doi.org/10.1017/jfm.2015.184.","mla":"Kühnen, Jakob, et al. “Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” Journal of Fluid Mechanics, vol. 770, no. 5, R3, Cambridge University Press, 2015, doi:10.1017/jfm.2015.184.","short":"J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, B. Hof, Journal of Fluid Mechanics 770 (2015).","ista":"Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. 2015. Subcritical versus supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics. 770(5), R3.","apa":"Kühnen, J., Braunshier, P., Schwegel, M., Kuhlmann, H., & Hof, B. (2015). Subcritical versus supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2015.184","ieee":"J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, and B. Hof, “Subcritical versus supercritical transition to turbulence in curved pipes,” Journal of Fluid Mechanics, vol. 770, no. 5. Cambridge University Press, 2015.","ama":"Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. Subcritical versus supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics. 2015;770(5). doi:10.1017/jfm.2015.184"},"publication":"Journal of Fluid Mechanics","article_processing_charge":"No","day":"08","scopus_import":1,"volume":770,"date_created":"2018-12-11T11:54:17Z","date_updated":"2021-01-12T06:53:31Z","author":[{"orcid":"0000-0003-4312-0179","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","last_name":"Kühnen","first_name":"Jakob","full_name":"Kühnen, Jakob"},{"first_name":"P","last_name":"Braunshier","full_name":"Braunshier, P"},{"first_name":"M","last_name":"Schwegel","full_name":"Schwegel, M"},{"first_name":"Hendrik","last_name":"Kuhlmann","full_name":"Kuhlmann, Hendrik"},{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof"}],"publisher":"Cambridge University Press","department":[{"_id":"BjHo"}],"publication_status":"published","year":"2015","publist_id":"5265","ec_funded":1,"article_number":"R3","language":[{"iso":"eng"}],"doi":"10.1017/jfm.2015.184","project":[{"_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7"}],"quality_controlled":"1","external_id":{"arxiv":["1508.06559"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.06559"}],"month":"04"},{"type":"journal_article","abstract":[{"lang":"eng","text":"The ability to escape apoptosis is a hallmark of cancer-initiating cells and a key factor of resistance to oncolytic therapy. Here, we identify FAM96A as a ubiquitous, evolutionarily conserved apoptosome-activating protein and investigate its potential pro-apoptotic tumor suppressor function in gastrointestinal stromal tumors (GISTs). Interaction between FAM96A and apoptotic peptidase activating factor 1 (APAF1) was identified in yeast two-hybrid screen and further studied by deletion mutants, glutathione-S-transferase pull-down, co-immunoprecipitation and immunofluorescence. Effects of FAM96A overexpression and knock-down on apoptosis sensitivity were examined in cancer cells and zebrafish embryos. Expression of FAM96A in GISTs and histogenetically related cells including interstitial cells of Cajal (ICCs), “fibroblast-like cells” (FLCs) and ICC stem cells (ICC-SCs) was investigated by Northern blotting, reverse transcription—polymerase chain reaction, immunohistochemistry and Western immunoblotting. Tumorigenicity of GIST cells and transformed murine ICC-SCs stably transduced to re-express FAM96A was studied by xeno- and allografting into immunocompromised mice. FAM96A was found to bind APAF1 and to enhance the induction of mitochondrial apoptosis. FAM96A protein or mRNA was dramatically reduced or lost in 106 of 108 GIST samples representing three independent patient cohorts. Whereas ICCs, ICC-SCs and FLCs, the presumed normal counterparts of GIST, were found to robustly express FAM96A protein and mRNA, FAM96A expression was much reduced in tumorigenic ICC-SCs. Re-expression of FAM96A in GIST cells and transformed ICC-SCs increased apoptosis sensitivity and diminished tumorigenicity. Our data suggest FAM96A is a novel pro-apoptotic tumor suppressor that is lost during GIST tumorigenesis."}],"issue":"6","_id":"1848","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors","status":"public","intvolume":" 137","oa_version":"Submitted Version","scopus_import":1,"day":"01","article_processing_charge":"No","publication":"International Journal of Cancer","citation":{"ama":"Schwamb B, Pick R, Fernández S, et al. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. 2015;137(6):1318-1329. doi:10.1002/ijc.29498","ieee":"B. Schwamb et al., “FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors,” International Journal of Cancer, vol. 137, no. 6. Wiley, pp. 1318–1329, 2015.","apa":"Schwamb, B., Pick, R., Fernández, S., Völp, K., Heering, J., Dötsch, V., … Zörnig, M. (2015). FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. Wiley. https://doi.org/10.1002/ijc.29498","ista":"Schwamb B, Pick R, Fernández S, Völp K, Heering J, Dötsch V, Bösser S, Jung J, Beinoravičiute Kellner R, Wesely J, Zörnig I, Hammerschmidt M, Nowak M, Penzel R, Zatloukal K, Joos S, Rieker R, Agaimy A, Söder S, Reid Lombardo K, Kendrick M, Bardsley M, Hayashi Y, Asuzu D, Syed S, Ördög T, Zörnig M. 2015. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. 137(6), 1318–1329.","short":"B. Schwamb, R. Pick, S. Fernández, K. Völp, J. Heering, V. Dötsch, S. Bösser, J. Jung, R. Beinoravičiute Kellner, J. Wesely, I. Zörnig, M. Hammerschmidt, M. Nowak, R. Penzel, K. Zatloukal, S. Joos, R. Rieker, A. Agaimy, S. Söder, K. Reid Lombardo, M. Kendrick, M. Bardsley, Y. Hayashi, D. Asuzu, S. Syed, T. Ördög, M. Zörnig, International Journal of Cancer 137 (2015) 1318–1329.","mla":"Schwamb, Bettina, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” International Journal of Cancer, vol. 137, no. 6, Wiley, 2015, pp. 1318–29, doi:10.1002/ijc.29498.","chicago":"Schwamb, Bettina, Robert Pick, Sara Fernández, Kirsten Völp, Jan Heering, Volker Dötsch, Susanne Bösser, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” International Journal of Cancer. Wiley, 2015. https://doi.org/10.1002/ijc.29498."},"article_type":"original","page":"1318 - 1329","date_published":"2015-09-01T00:00:00Z","publist_id":"5253","year":"2015","pmid":1,"publication_status":"published","department":[{"_id":"LifeSc"}],"publisher":"Wiley","author":[{"full_name":"Schwamb, Bettina","last_name":"Schwamb","first_name":"Bettina"},{"full_name":"Pick, Robert","first_name":"Robert","last_name":"Pick"},{"first_name":"Sara","last_name":"Fernández","full_name":"Fernández, Sara"},{"last_name":"Völp","first_name":"Kirsten","full_name":"Völp, Kirsten"},{"last_name":"Heering","first_name":"Jan","full_name":"Heering, Jan"},{"full_name":"Dötsch, Volker","first_name":"Volker","last_name":"Dötsch"},{"last_name":"Bösser","first_name":"Susanne","full_name":"Bösser, Susanne"},{"last_name":"Jung","first_name":"Jennifer","full_name":"Jung, Jennifer"},{"first_name":"Rasa","last_name":"Beinoravičiute Kellner","full_name":"Beinoravičiute Kellner, Rasa"},{"first_name":"Josephine","last_name":"Wesely","full_name":"Wesely, Josephine"},{"full_name":"Zörnig, Inka","last_name":"Zörnig","first_name":"Inka"},{"first_name":"Matthias","last_name":"Hammerschmidt","full_name":"Hammerschmidt, Matthias"},{"first_name":"Matthias","last_name":"Nowak","id":"30845DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Nowak, Matthias"},{"full_name":"Penzel, Roland","first_name":"Roland","last_name":"Penzel"},{"full_name":"Zatloukal, Kurt","last_name":"Zatloukal","first_name":"Kurt"},{"full_name":"Joos, Stefan","last_name":"Joos","first_name":"Stefan"},{"full_name":"Rieker, Ralf","last_name":"Rieker","first_name":"Ralf"},{"full_name":"Agaimy, Abbas","first_name":"Abbas","last_name":"Agaimy"},{"full_name":"Söder, Stephan","first_name":"Stephan","last_name":"Söder"},{"full_name":"Reid Lombardo, Kmarie","first_name":"Kmarie","last_name":"Reid Lombardo"},{"last_name":"Kendrick","first_name":"Michael","full_name":"Kendrick, Michael"},{"full_name":"Bardsley, Michael","first_name":"Michael","last_name":"Bardsley"},{"first_name":"Yujiro","last_name":"Hayashi","full_name":"Hayashi, Yujiro"},{"last_name":"Asuzu","first_name":"David","full_name":"Asuzu, David"},{"full_name":"Syed, Sabriya","last_name":"Syed","first_name":"Sabriya"},{"full_name":"Ördög, Tamás","first_name":"Tamás","last_name":"Ördög"},{"first_name":"Martin","last_name":"Zörnig","full_name":"Zörnig, Martin"}],"date_created":"2018-12-11T11:54:20Z","date_updated":"2021-01-12T06:53:36Z","volume":137,"month":"09","oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4497860/","open_access":"1"}],"external_id":{"pmid":["25716227"]},"quality_controlled":"1","doi":"10.1002/ijc.29498","language":[{"iso":"eng"}]},{"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","year":"2015","date_created":"2018-12-11T11:54:20Z","date_updated":"2021-01-12T06:53:35Z","volume":52,"author":[{"full_name":"Beneš, Nikola","last_name":"Beneš","first_name":"Nikola"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"full_name":"Larsen, Kim","last_name":"Larsen","first_name":"Kim"},{"full_name":"Möller, Mikael","first_name":"Mikael","last_name":"Möller"},{"last_name":"Sickert","first_name":"Salomon","full_name":"Sickert, Salomon"},{"last_name":"Srba","first_name":"Jiří","full_name":"Srba, Jiří"}],"file_date_updated":"2020-07-14T12:45:19Z","ec_funded":1,"publist_id":"5255","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00236-015-0215-4","month":"04","ddc":["000"],"title":"Refinement checking on parametric modal transition systems","status":"public","intvolume":" 52","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1846","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"2015_ActaInfo_Benes.pdf","creator":"dernst","content_type":"application/pdf","file_size":488482,"file_id":"7854","relation":"main_file","checksum":"fb4037ddc4fc05f33080dd3547ede350","date_updated":"2020-07-14T12:45:19Z","date_created":"2020-05-15T08:57:44Z"}],"type":"journal_article","abstract":[{"text":"Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS.","lang":"eng"}],"issue":"2-3","article_type":"original","page":"269 - 297","publication":"Acta Informatica","citation":{"chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” Acta Informatica. Springer, 2015. https://doi.org/10.1007/s00236-015-0215-4.","mla":"Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.” Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.","ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., & Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer. https://doi.org/10.1007/s00236-015-0215-4","ieee":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” Acta Informatica, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.","ama":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297. doi:10.1007/s00236-015-0215-4"},"date_published":"2015-04-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No"},{"type":"journal_article","issue":"6","abstract":[{"lang":"eng","text":"Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression. Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression."}],"intvolume":" 85","title":"Excitement about inhibitory presynaptic terminals","ddc":["570"],"status":"public","_id":"1845","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":411832,"creator":"system","access_level":"open_access","file_name":"IST-2017-822-v1+1_Perspective_Fig__Final.pdf","checksum":"d1808550e376a0eca2a950fda017cfa6","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:16:07Z","relation":"main_file","file_id":"5192"},{"file_size":100769,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-822-v1+2_Perspective_Final2.pdf","access_level":"open_access","date_created":"2018-12-12T10:16:07Z","date_updated":"2020-07-14T12:45:19Z","checksum":"a279f4ae61e6c8f33d68f69a0d02097d","relation":"main_file","file_id":"5193"}],"pubrep_id":"822","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"18","page":"1149 - 1151","citation":{"ama":"Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic terminals. Neuron. 2015;85(6):1149-1151. doi:10.1016/j.neuron.2015.03.006","ista":"Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory presynaptic terminals. Neuron. 85(6), 1149–1151.","apa":"Vandael, D. H., Espinoza Martinez, C., & Jonas, P. M. (2015). Excitement about inhibitory presynaptic terminals. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2015.03.006","ieee":"D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory presynaptic terminals,” Neuron, vol. 85, no. 6. Elsevier, pp. 1149–1151, 2015.","mla":"Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.” Neuron, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:10.1016/j.neuron.2015.03.006.","short":"D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.","chicago":"Vandael, David H, Claudia Espinoza Martinez, and Peter M Jonas. “Excitement about Inhibitory Presynaptic Terminals.” Neuron. Elsevier, 2015. https://doi.org/10.1016/j.neuron.2015.03.006."},"publication":"Neuron","date_published":"2015-03-18T00:00:00Z","publist_id":"5256","file_date_updated":"2020-07-14T12:45:19Z","department":[{"_id":"PeJo"}],"publisher":"Elsevier","publication_status":"published","year":"2015","volume":85,"date_updated":"2021-10-08T09:07:34Z","date_created":"2018-12-11T11:54:19Z","author":[{"orcid":"0000-0001-7577-1676","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","last_name":"Vandael","first_name":"David H","full_name":"Vandael, David H"},{"last_name":"Espinoza Martinez","first_name":"Claudia ","orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","full_name":"Espinoza Martinez, Claudia "},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"month":"03","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.neuron.2015.03.006"},{"title":"Optimal Kullback-Leibler aggregation via information bottleneck","status":"public","intvolume":" 60","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1840","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions.","lang":"eng"}],"issue":"4","page":"1010 - 1022","publication":"IEEE Transactions on Automatic Control","citation":{"ama":"Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 2015;60(4):1010-1022. doi:10.1109/TAC.2014.2364971","ieee":"B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” IEEE Transactions on Automatic Control, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.","apa":"Geiger, B., Petrov, T., Kubin, G., & Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/TAC.2014.2364971","ista":"Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.","short":"B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic Control 60 (2015) 1010–1022.","mla":"Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions on Automatic Control, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:10.1109/TAC.2014.2364971.","chicago":"Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2014.2364971."},"date_published":"2015-04-01T00:00:00Z","scopus_import":1,"day":"01","publication_status":"published","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"publisher":"IEEE","year":"2015","acknowledgement":"This work was supported by the Austrian Research Association under Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2 128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n","date_created":"2018-12-11T11:54:18Z","date_updated":"2021-01-12T06:53:33Z","volume":60,"author":[{"full_name":"Geiger, Bernhard","last_name":"Geiger","first_name":"Bernhard"},{"first_name":"Tatjana","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana"},{"full_name":"Kubin, Gernot","first_name":"Gernot","last_name":"Kubin"},{"full_name":"Koeppl, Heinz","first_name":"Heinz","last_name":"Koeppl"}],"publist_id":"5262","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.6603"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/TAC.2014.2364971","month":"04","publication_identifier":{"issn":["0018-9286"]}},{"scopus_import":1,"day":"01","page":"919 - 930","citation":{"mla":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.","short":"V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.","chicago":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465.","ama":"Kolmogorov V. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465","ista":"Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.","ieee":"V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930, 2015.","apa":"Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465"},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","date_published":"2015-05-01T00:00:00Z","type":"journal_article","issue":"5","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 Diffusion (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. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results.","lang":"eng"}],"intvolume":" 37","title":"A new look at reweighted message passing","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1841","oa_version":"Preprint","month":"05","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/TPAMI.2014.2363465","publist_id":"5261","ec_funded":1,"publisher":"IEEE","department":[{"_id":"VlKo"}],"publication_status":"published","year":"2015","volume":37,"date_updated":"2021-01-12T06:53:33Z","date_created":"2018-12-11T11:54:18Z","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"}]},{"type":"journal_article","abstract":[{"lang":"eng","text":"Cell polarity is a fundamental property of pro- and eukaryotic cells. It is necessary for coordination of cell division, cell morphogenesis and signaling processes. How polarity is generated and maintained is a complex issue governed by interconnected feed-back regulations between small GTPase signaling and membrane tension-based signaling that controls membrane trafficking, and cytoskeleton organization and dynamics. Here, we will review the potential role for calcium as a crucial signal that connects and coordinates the respective processes during polarization processes in plants. This article is part of a Special Issue entitled: 13th European Symposium on Calcium."}],"issue":"9","publist_id":"5252","title":"Calcium is an organizer of cell polarity in plants","publication_status":"published","status":"public","intvolume":" 1853","department":[{"_id":"JiFr"}],"publisher":"Elsevier","acknowledgement":"The contributing authors were supported by the Ghent University Special Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33 and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), and the Research Foundation Flanders (to S.V.).","_id":"1849","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","date_created":"2018-12-11T11:54:21Z","date_updated":"2021-01-12T06:53:36Z","volume":1853,"oa_version":"None","author":[{"last_name":"Himschoot","first_name":"Ellie","full_name":"Himschoot, Ellie"},{"last_name":"Beeckman","first_name":"Tom","full_name":"Beeckman, Tom"},{"full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"}],"scopus_import":1,"month":"09","day":"01","quality_controlled":"1","page":"2168 - 2172","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","citation":{"ista":"Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(9), 2168–2172.","apa":"Himschoot, E., Beeckman, T., Friml, J., & Vanneste, S. (2015). Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2015.02.017","ieee":"E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer of cell polarity in plants,” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.","ama":"Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. 2015;1853(9):2168-2172. doi:10.1016/j.bbamcr.2015.02.017","chicago":"Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2015.02.017.","mla":"Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 9, Elsevier, 2015, pp. 2168–72, doi:10.1016/j.bbamcr.2015.02.017.","short":"E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 2168–2172."},"language":[{"iso":"eng"}],"doi":"10.1016/j.bbamcr.2015.02.017","date_published":"2015-09-01T00:00:00Z"},{"day":"02","month":"03","scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.molp.2014.12.013","date_published":"2015-03-02T00:00:00Z","quality_controlled":"1","page":"356 - 358","publication":"Molecular Plant","citation":{"ista":"Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.","apa":"Grones, P., & Friml, J. (2015). ABP1: Finally docking. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2014.12.013","ieee":"P. Grones and J. Friml, “ABP1: Finally docking,” Molecular Plant, vol. 8, no. 3. Elsevier, pp. 356–358, 2015.","ama":"Grones P, Friml J. ABP1: Finally docking. Molecular Plant. 2015;8(3):356-358. doi:10.1016/j.molp.2014.12.013","chicago":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant. Elsevier, 2015. https://doi.org/10.1016/j.molp.2014.12.013.","mla":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant, vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:10.1016/j.molp.2014.12.013.","short":"P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358."},"publist_id":"5254","issue":"3","type":"journal_article","date_updated":"2021-01-12T06:53:35Z","date_created":"2018-12-11T11:54:20Z","oa_version":"None","volume":8,"author":[{"first_name":"Peter","last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter"},{"full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"title":"ABP1: Finally docking","status":"public","publication_status":"published","intvolume":" 8","publisher":"Elsevier","department":[{"_id":"JiFr"}],"_id":"1847","year":"2015","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and the Czech Science Foundation GAČR (GA13-40637S).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5251","ec_funded":1,"author":[{"full_name":"Novak, Sebastian","last_name":"Novak","first_name":"Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"}],"date_updated":"2021-01-12T06:53:37Z","date_created":"2018-12-11T11:54:21Z","volume":372,"year":"2015","publication_status":"published","publisher":"Elsevier","department":[{"_id":"NiBa"},{"_id":"SyCr"}],"month":"05","doi":"10.1016/j.jtbi.2015.02.018","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071"}],"abstract":[{"lang":"eng","text":"Entomopathogenic fungi are potent biocontrol agents that are widely used against insect pests, many of which are social insects. Nevertheless, theoretical investigations of their particular life history are scarce. We develop a model that takes into account the main distinguishing features between traditionally studied diseases and obligate killing pathogens, like the (biocontrol-relevant) insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic fungi produce new infectious particles (conidiospores) only after host death and not yet on the living host. Second, the killing rates of entomopathogenic fungi depend strongly on the initial exposure dosage, thus we explicitly consider the pathogen load of individual hosts. Further, we make the model applicable not only to solitary host species, but also to group living species by incorporating social interactions between hosts, like the collective disease defences of insect societies. Our results identify the optimal killing rate for the pathogen that minimises its invasion threshold. Furthermore, we find that the rate of contact between hosts has an ambivalent effect: dense interaction networks between individuals are considered to facilitate disease outbreaks because of increased pathogen transmission. In social insects, this is compensated by their collective disease defences, i.e., social immunity. For the type of pathogens considered here, we show that even without social immunity, high contact rates between live individuals dilute the pathogen in the host colony and hence can reduce individual pathogen loads below disease-causing levels."}],"issue":"5","type":"journal_article","pubrep_id":"329","file":[{"checksum":"3c0dcacc900bc45cc65a453dfda4ca43","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:18:07Z","relation":"main_file","file_id":"5326","content_type":"application/pdf","file_size":1546914,"creator":"system","access_level":"open_access","file_name":"IST-2015-329-v1+1_manuscript.pdf"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1850","status":"public","title":"Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates","ddc":["576"],"intvolume":" 372","day":"07","has_accepted_license":"1","scopus_import":1,"date_published":"2015-05-07T00:00:00Z","publication":"Journal of Theoretical Biology","citation":{"chicago":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” Journal of Theoretical Biology. Elsevier, 2015. https://doi.org/10.1016/j.jtbi.2015.02.018.","short":"S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.","mla":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” Journal of Theoretical Biology, vol. 372, no. 5, Elsevier, 2015, pp. 54–64, doi:10.1016/j.jtbi.2015.02.018.","apa":"Novak, S., & Cremer, S. (2015). Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2015.02.018","ieee":"S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates,” Journal of Theoretical Biology, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.","ista":"Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. 372(5), 54–64.","ama":"Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. 2015;372(5):54-64. doi:10.1016/j.jtbi.2015.02.018"},"page":"54 - 64"},{"_id":"1851","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["570"],"title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","intvolume":" 69","oa_version":"Submitted Version","file":[{"file_id":"7855","relation":"main_file","date_updated":"2020-07-14T12:45:19Z","date_created":"2020-05-15T09:05:34Z","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798","file_name":"2015_Evolution_Priklopil.pdf","access_level":"open_access","creator":"dernst","file_size":967214,"content_type":"application/pdf"}],"type":"journal_article","abstract":[{"text":"We consider mating strategies for females who search for males sequentially during a season of limited length. We show that the best strategy rejects a given male type if encountered before a time-threshold but accepts him after. For frequency-independent benefits, we obtain the optimal time-thresholds explicitly for both discrete and continuous distributions of males, and allow for mistakes being made in assessing the correct male type. When the benefits are indirect (genes for the offspring) and the population is under frequency-dependent ecological selection, the benefits depend on the mating strategy of other females as well. This case is particularly relevant to speciation models that seek to explore the stability of reproductive isolation by assortative mating under frequency-dependent ecological selection. We show that the indirect benefits are to be quantified by the reproductive values of couples, and describe how the evolutionarily stable time-thresholds can be found. We conclude with an example based on the Levene model, in which we analyze the evolutionarily stable assortative mating strategies and the strength of reproductive isolation provided by them.","lang":"eng"}],"issue":"4","publication":"Evolution","citation":{"mla":"Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.","short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","chicago":"Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12618.","ama":"Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618","ista":"Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 69(4), 1015–1026.","apa":"Priklopil, T., Kisdi, E., & Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. Wiley. https://doi.org/10.1111/evo.12618","ieee":"T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026, 2015."},"article_type":"original","page":"1015 - 1026","date_published":"2015-02-09T00:00:00Z","scopus_import":"1","day":"09","article_processing_charge":"No","has_accepted_license":"1","year":"2015","pmid":1,"publication_status":"published","publisher":"Wiley","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"author":[{"full_name":"Priklopil, Tadeas","first_name":"Tadeas","last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Eva","last_name":"Kisdi","full_name":"Kisdi, Eva"},{"full_name":"Gyllenberg, Mats","first_name":"Mats","last_name":"Gyllenberg"}],"date_updated":"2022-06-07T10:52:37Z","date_created":"2018-12-11T11:54:21Z","volume":69,"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5249","ec_funded":1,"oa":1,"external_id":{"pmid":["25662095"]},"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"doi":"10.1111/evo.12618","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]}},{"type":"conference","abstract":[{"lang":"eng","text":"Structural support vector machines (SSVMs) are amongst the best performing models for structured computer vision tasks, such as semantic image segmentation or human pose estimation. Training SSVMs, however, is computationally costly, because it requires repeated calls to a structured prediction subroutine (called \\emph{max-oracle}), which has to solve an optimization problem itself, e.g. a graph cut.\r\nIn this work, we introduce a new algorithm for SSVM training that is more efficient than earlier techniques when the max-oracle is computationally expensive, as it is frequently the case in computer vision tasks. The main idea is to (i) combine the recent stochastic Block-Coordinate Frank-Wolfe algorithm with efficient hyperplane caching, and (ii) use an automatic selection rule for deciding whether to call the exact max-oracle or to rely on an approximate one based on the cached hyperplanes.\r\nWe show experimentally that this strategy leads to faster convergence to the optimum with respect to the number of requires oracle calls, and that this translates into faster convergence with respect to the total runtime when the max-oracle is slow compared to the other steps of the algorithm. "}],"ec_funded":1,"publist_id":"5240","_id":"1859","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","status":"public","title":"A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle","publication_status":"published","publisher":"IEEE","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"author":[{"full_name":"Shah, Neel","first_name":"Neel","last_name":"Shah","id":"31ABAF80-F248-11E8-B48F-1D18A9856A87"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"date_updated":"2021-01-12T06:53:40Z","date_created":"2018-12-11T11:54:24Z","oa_version":"Preprint","scopus_import":1,"day":"01","month":"06","oa":1,"citation":{"chicago":"Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,” 2737–45. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298890.","short":"N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.","mla":"Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45, doi:10.1109/CVPR.2015.7298890.","apa":"Shah, N., Kolmogorov, V., & Lampert, C. (2015). A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp. 2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7298890","ieee":"N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.","ista":"Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer Vision and Pattern Recognition, 2737–2745.","ama":"Shah N, Kolmogorov V, Lampert C. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. In: IEEE; 2015:2737-2745. doi:10.1109/CVPR.2015.7298890"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.6804"}],"quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"},{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"page":"2737 - 2745","conference":{"end_date":"2015-06-12","location":"Boston, MA, USA","start_date":"2015-06-07","name":"CVPR: Computer Vision and Pattern Recognition"},"doi":"10.1109/CVPR.2015.7298890","date_published":"2015-06-01T00:00:00Z","language":[{"iso":"eng"}]},{"status":"public","publication_status":"published","title":"Classifier adaptation at prediction time","publisher":"IEEE","department":[{"_id":"ChLa"}],"_id":"1860","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:24Z","date_updated":"2021-01-12T06:53:41Z","oa_version":"Submitted Version","author":[{"full_name":"Royer, Amélie","first_name":"Amélie","last_name":"Royer"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","abstract":[{"lang":"eng","text":"Classifiers for object categorization are usually evaluated by their accuracy on a set of i.i.d. test examples. This provides us with an estimate of the expected error when applying the classifiers to a single new image. In real application, however, classifiers are rarely only used for a single image and then discarded. Instead, they are applied sequentially to many images, and these are typically not i.i.d. samples from a fixed data distribution, but they carry dependencies and their class distribution varies over time. In this work, we argue that the phenomenon of correlated data at prediction time is not a nuisance, but a blessing in disguise. We describe a probabilistic method for adapting classifiers at prediction time without having to retrain them. We also introduce a framework for creating realistically distributed image sequences, which offers a way to benchmark classifier adaptation methods, such as the one we propose. Experiments on the ILSVRC2010 and ILSVRC2012 datasets show that adapting object classification systems at prediction time can significantly reduce their error rate, even with no additional human feedback."}],"publist_id":"5239","ec_funded":1,"quality_controlled":"1","page":"1401 - 1409","project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"citation":{"chicago":"Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction Time,” 1401–9. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298746.","short":"A. Royer, C. Lampert, in:, IEEE, 2015, pp. 1401–1409.","mla":"Royer, Amélie, and Christoph Lampert. Classifier Adaptation at Prediction Time. IEEE, 2015, pp. 1401–09, doi:10.1109/CVPR.2015.7298746.","ieee":"A. Royer and C. Lampert, “Classifier adaptation at prediction time,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 1401–1409.","apa":"Royer, A., & Lampert, C. (2015). Classifier adaptation at prediction time (pp. 1401–1409). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298746","ista":"Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR: Computer Vision and Pattern Recognition, 1401–1409.","ama":"Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409. doi:10.1109/CVPR.2015.7298746"},"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Royer_Classifier_Adaptation_at_2015_CVPR_paper.pdf"}],"language":[{"iso":"eng"}],"conference":{"name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2015-06-12","start_date":"2015-06-07","location":"Boston, MA, United States"},"doi":"10.1109/CVPR.2015.7298746","date_published":"2015-06-01T00:00:00Z","scopus_import":1,"month":"06","day":"01"},{"day":"15","month":"10","scopus_import":1,"conference":{"location":"Boston, MA, United States","start_date":"2015-06-07","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition"},"date_published":"2015-10-15T00:00:00Z","doi":"10.1109/CVPR.2015.7298696","language":[{"iso":"eng"}],"external_id":{"arxiv":["1406.5362"]},"oa":1,"citation":{"ama":"Lampert C. Predicting the future behavior of a time-varying probability distribution. In: IEEE; 2015:942-950. doi:10.1109/CVPR.2015.7298696","ista":"Lampert C. 2015. Predicting the future behavior of a time-varying probability distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.","ieee":"C. Lampert, “Predicting the future behavior of a time-varying probability distribution,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 942–950.","apa":"Lampert, C. (2015). Predicting the future behavior of a time-varying probability distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298696","mla":"Lampert, Christoph. Predicting the Future Behavior of a Time-Varying Probability Distribution. IEEE, 2015, pp. 942–50, doi:10.1109/CVPR.2015.7298696.","short":"C. Lampert, in:, IEEE, 2015, pp. 942–950.","chicago":"Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability Distribution,” 942–50. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298696."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.5362"}],"quality_controlled":"1","page":"942 - 950","abstract":[{"text":"We study the problem of predicting the future, though only in the probabilistic sense of estimating a future state of a time-varying probability distribution. This is not only an interesting academic problem, but solving this extrapolation problem also has many practical application, e.g. for training classifiers that have to operate under time-varying conditions. Our main contribution is a method for predicting the next step of the time-varying distribution from a given sequence of sample sets from earlier time steps. For this we rely on two recent machine learning techniques: embedding probability distributions into a reproducing kernel Hilbert space, and learning operators by vector-valued regression. We illustrate the working principles and the practical usefulness of our method by experiments on synthetic and real data. We also highlight an exemplary application: training a classifier in a domain adaptation setting without having access to examples from the test time distribution at training time.","lang":"eng"}],"publist_id":"5241","type":"conference","author":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"date_created":"2018-12-11T11:54:24Z","date_updated":"2021-01-12T06:53:40Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1858","year":"2015","title":"Predicting the future behavior of a time-varying probability distribution","status":"public","publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"IEEE"},{"_id":"1857","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Curriculum learning of multiple tasks","publication_status":"published","publisher":"IEEE","department":[{"_id":"ChLa"}],"author":[{"full_name":"Pentina, Anastasia","first_name":"Anastasia","last_name":"Pentina","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sharmanska, Viktoriia","first_name":"Viktoriia","last_name":"Sharmanska","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0192-9308"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"date_created":"2018-12-11T11:54:23Z","date_updated":"2023-02-23T10:17:31Z","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"Sharing information between multiple tasks enables algorithms to achieve good generalization performance even from small amounts of training data. However, in a realistic scenario of multi-task learning not all tasks are equally related to each other, hence it could be advantageous to transfer information only between the most related tasks. In this work we propose an approach that processes multiple tasks in a sequence with sharing between subsequent tasks instead of solving all tasks jointly. Subsequently, we address the question of curriculum learning of tasks, i.e. finding the best order of tasks to be learned. Our approach is based on a generalization bound criterion for choosing the task order that optimizes the average expected classification performance over all tasks. Our experimental results show that learning multiple related tasks sequentially can be more effective than learning them jointly, the order in which tasks are being solved affects the overall performance, and that our model is able to automatically discover the favourable order of tasks. "}],"publist_id":"5243","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1412.1353"}],"citation":{"ama":"Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks. In: IEEE; 2015:5492-5500. doi:10.1109/CVPR.2015.7299188","ista":"Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.","ieee":"A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 5492–5500.","apa":"Pentina, A., Sharmanska, V., & Lampert, C. (2015). Curriculum learning of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7299188","mla":"Pentina, Anastasia, et al. Curriculum Learning of Multiple Tasks. IEEE, 2015, pp. 5492–500, doi:10.1109/CVPR.2015.7299188.","short":"A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.","chicago":"Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299188."},"quality_controlled":"1","page":"5492 - 5500","conference":{"name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2015-06-12","start_date":"2015-06-07","location":"Boston, MA, United States"},"date_published":"2015-06-01T00:00:00Z","doi":"10.1109/CVPR.2015.7299188","language":[{"iso":"eng"}],"scopus_import":1,"day":"01","month":"06"},{"publisher":"Wiley","department":[{"_id":"HaJa"}],"publication_status":"published","year":"2015","volume":36,"date_updated":"2021-01-12T06:53:43Z","date_created":"2018-12-11T11:54:26Z","author":[{"first_name":"Jens","last_name":"Hühner","full_name":"Hühner, Jens"},{"full_name":"Inglés Prieto, Álvaro","first_name":"Álvaro","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5409-8571"},{"first_name":"Christian","last_name":"Neusüß","full_name":"Neusüß, Christian"},{"full_name":"Lämmerhofer, Michael","first_name":"Michael","last_name":"Lämmerhofer"},{"full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","first_name":"Harald L"}],"publist_id":"5230","ec_funded":1,"project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","grant_number":"RGY0084/2012","_id":"255BFFFA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1002/elps.201400451","month":"02","intvolume":" 36","title":"Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection","status":"public","_id":"1867","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","pubrep_id":"836","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"Cultured mammalian cells essential are model systems in basic biology research, production platforms of proteins for medical use, and testbeds in synthetic biology. Flavin cofactors, in particular flavin mononucleotide (FMN) and flavin adenine dinucleotide (FAD), are critical for cellular redox reactions and sense light in naturally occurring photoreceptors and optogenetic tools. Here, we quantified flavin contents of commonly used mammalian cell lines. We first compared three procedures for extraction of free and noncovalently protein-bound flavins and verified extraction using fluorescence spectroscopy. For separation, two CE methods with different BGEs were established, and detection was performed by LED-induced fluorescence with limit of detections (LODs 0.5-3.8 nM). We found that riboflavin (RF), FMN, and FAD contents varied significantly between cell lines. RF (3.1-14 amol/cell) and FAD (2.2-17.0 amol/cell) were the predominant flavins, while FMN (0.46-3.4 amol/cell) was found at markedly lower levels. Observed flavin contents agree with those previously extracted from mammalian tissues, yet reduced forms of RF were detected that were not described previously. Quantification of flavins in mammalian cell lines will allow a better understanding of cellular redox reactions and optogenetic tools."}],"page":"518 - 525","citation":{"chicago":"Hühner, Jens, Álvaro Inglés Prieto, Christian Neusüß, Michael Lämmerhofer, and Harald L Janovjak. “Quantification of Riboflavin, Flavin Mononucleotide, and Flavin Adenine Dinucleotide in Mammalian Model Cells by CE with LED-Induced Fluorescence Detection.” Electrophoresis. Wiley, 2015. https://doi.org/10.1002/elps.201400451.","short":"J. Hühner, Á. Inglés Prieto, C. Neusüß, M. Lämmerhofer, H.L. Janovjak, Electrophoresis 36 (2015) 518–525.","mla":"Hühner, Jens, et al. “Quantification of Riboflavin, Flavin Mononucleotide, and Flavin Adenine Dinucleotide in Mammalian Model Cells by CE with LED-Induced Fluorescence Detection.” Electrophoresis, vol. 36, no. 4, Wiley, 2015, pp. 518–25, doi:10.1002/elps.201400451.","ieee":"J. Hühner, Á. Inglés Prieto, C. Neusüß, M. Lämmerhofer, and H. L. Janovjak, “Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection,” Electrophoresis, vol. 36, no. 4. Wiley, pp. 518–525, 2015.","apa":"Hühner, J., Inglés Prieto, Á., Neusüß, C., Lämmerhofer, M., & Janovjak, H. L. (2015). Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection. Electrophoresis. Wiley. https://doi.org/10.1002/elps.201400451","ista":"Hühner J, Inglés Prieto Á, Neusüß C, Lämmerhofer M, Janovjak HL. 2015. Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection. Electrophoresis. 36(4), 518–525.","ama":"Hühner J, Inglés Prieto Á, Neusüß C, Lämmerhofer M, Janovjak HL. Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection. Electrophoresis. 2015;36(4):518-525. doi:10.1002/elps.201400451"},"publication":"Electrophoresis","date_published":"2015-02-01T00:00:00Z","scopus_import":1,"day":"01"},{"month":"02","language":[{"iso":"eng"}],"doi":"10.1242/dev.115832","quality_controlled":"1","project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"publist_id":"5231","date_updated":"2021-01-12T06:53:43Z","date_created":"2018-12-11T11:54:26Z","volume":142,"author":[{"last_name":"Robert","first_name":"Hélène","full_name":"Robert, Hélène"},{"last_name":"Grunewald","first_name":"Wim","full_name":"Grunewald, Wim"},{"last_name":"Sauer","first_name":"Michael","full_name":"Sauer, Michael"},{"full_name":"Cannoot, Bernard","last_name":"Cannoot","first_name":"Bernard"},{"full_name":"Soriano, Mercedes","first_name":"Mercedes","last_name":"Soriano"},{"last_name":"Swarup","first_name":"Ranjan","full_name":"Swarup, Ranjan"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"first_name":"Malcolm","last_name":"Bennett","full_name":"Bennett, Malcolm"},{"full_name":"Boutilier, Kim","first_name":"Kim","last_name":"Boutilier"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"}],"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Company of Biologists","year":"2015","acknowledgement":"W.G. is a post-doctoral fellow of the Research Foundation Flanders. H.S.R. is supported by Employment of Best Young Scientists for International Cooperation Empowerment [CZ.1.07/2.3.00/30.0037], co-financed by the European Social Fund and the state budget of the Czech Republic. Mi.S. was funded by the Ramón y Cajal program. This work was supported by the European Research Council [project ERC-2011-StG-20101109-PSDP], project ‘CEITEC – Central European Institute of Technology’ [CZ.1.05/1.1.00/02.0068], the European Social Fund [CZ.1.07/2.3.00/20.0043] and the Czech Science Foundation GACR [GA13-40637S] to J.F. We acknowledge funding from the Biological and Biotechnological Science Research Council (BBSRC) and Engineering Physics Science Research Council (EPSRC) to R.S. and M.B","day":"15","scopus_import":1,"date_published":"2015-02-15T00:00:00Z","page":"702 - 711","publication":"Development","citation":{"chicago":"Robert, Hélène, Wim Grunewald, Michael Sauer, Bernard Cannoot, Mercedes Soriano, Ranjan Swarup, Dolf Weijers, Malcolm Bennett, Kim Boutilier, and Jiří Friml. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” Development. Company of Biologists, 2015. https://doi.org/10.1242/dev.115832.","mla":"Robert, Hélène, et al. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” Development, vol. 142, no. 4, Company of Biologists, 2015, pp. 702–11, doi:10.1242/dev.115832.","short":"H. Robert, W. Grunewald, M. Sauer, B. Cannoot, M. Soriano, R. Swarup, D. Weijers, M. Bennett, K. Boutilier, J. Friml, Development 142 (2015) 702–711.","ista":"Robert H, Grunewald W, Sauer M, Cannoot B, Soriano M, Swarup R, Weijers D, Bennett M, Boutilier K, Friml J. 2015. Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. 142(4), 702–711.","ieee":"H. Robert et al., “Plant embryogenesis requires AUX/LAX-mediated auxin influx,” Development, vol. 142, no. 4. Company of Biologists, pp. 702–711, 2015.","apa":"Robert, H., Grunewald, W., Sauer, M., Cannoot, B., Soriano, M., Swarup, R., … Friml, J. (2015). Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. Company of Biologists. https://doi.org/10.1242/dev.115832","ama":"Robert H, Grunewald W, Sauer M, et al. Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. 2015;142(4):702-711. doi:10.1242/dev.115832"},"abstract":[{"lang":"eng","text":"The plant hormone auxin and its directional transport are known to play a crucial role in defining the embryonic axis and subsequent development of the body plan. Although the role of PIN auxin efflux transporters has been clearly assigned during embryonic shoot and root specification, the role of the auxin influx carriers AUX1 and LIKE-AUX1 (LAX) proteins is not well established. Here, we used chemical and genetic tools on Brassica napus microspore-derived embryos and Arabidopsis thaliana zygotic embryos, and demonstrate that AUX1, LAX1 and LAX2 are required for both shoot and root pole formation, in concert with PIN efflux carriers. Furthermore, we uncovered a positive-feedback loop betweenMONOPTEROS(ARF5)-dependent auxin signalling and auxin transport. ThisMONOPTEROSdependent transcriptional regulation of auxin influx (AUX1, LAX1 and LAX2) and auxin efflux (PIN1 and PIN4) carriers by MONOPTEROS helps to maintain proper auxin transport to the root tip. These results indicate that auxin-dependent cell specification during embryo development requires balanced auxin transport involving both influx and efflux mechanisms, and that this transport is maintained by a positive transcriptional feedback on auxin signalling."}],"issue":"4","type":"journal_article","oa_version":"None","status":"public","title":"Plant embryogenesis requires AUX/LAX-mediated auxin influx","intvolume":" 142","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1865"}]