[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"mla":"Anonymous, 1, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria; 2015.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 22p."},"date_updated":"2023-09-19T14:36:19Z","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","file_date_updated":"2020-07-14T12:46:57Z","author":[{"first_name":"1","last_name":"Anonymous","full_name":"Anonymous, 1"},{"first_name":"2","full_name":"Anonymous, 2","last_name":"Anonymous"},{"first_name":"3","full_name":"Anonymous, 3","last_name":"Anonymous"},{"last_name":"Anonymous","full_name":"Anonymous, 4","first_name":"4"}],"_id":"5442","status":"public","pubrep_id":"344","type":"technical_report","day":"14","file":[{"checksum":"98fd936102f3e057fc321ef6d316001d","file_id":"5498","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2015-343-v2+1_main.pdf","date_created":"2018-12-12T11:53:37Z","file_size":658747,"date_updated":"2020-07-14T12:46:57Z","creator":"system"},{"content_type":"text/plain","access_level":"closed","relation":"main_file","file_id":"6316","checksum":"b31d09b1241b59c75e1f42dadf09d258","date_updated":"2020-07-14T12:46:57Z","file_size":139,"creator":"dernst","date_created":"2019-04-16T12:36:08Z","file_name":"IST-2015-343-v2+2_anonymous.txt"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2015","date_published":"2015-07-14T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"1437","status":"public"},{"id":"5441","status":"public","relation":"later_version"},{"id":"6009","status":"public","relation":"later_version"}]},"date_created":"2018-12-12T11:39:21Z","page":"22","oa_version":"Published Version","abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural properties that arise in program analysis.\r\nWe consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \\emph{one-time} preprocessing and for \\emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\n\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, \r\neach subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving \r\nthe worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks.","lang":"eng"}],"month":"07","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","scopus_import":1,"oa":1},{"date_updated":"2023-09-20T09:43:09Z","citation":{"ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728608","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:259-268. doi:10.1145/2728606.2728608","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Mária","full_name":"Svoreňová, Mária","last_name":"Svoreňová"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Ivana","full_name":"Cěrná, Ivana","last_name":"Cěrná"},{"first_name":"Cǎlin","last_name":"Belta","full_name":"Belta, Cǎlin"}],"publist_id":"5456","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","_id":"1689","type":"conference","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2015-04-14","location":"Seattle, WA, United States","end_date":"2015-04-16"},"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","year":"2015","day":"14","language":[{"iso":"eng"}],"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","page":"259 - 268","related_material":{"record":[{"id":"1407","status":"public","relation":"later_version"}]},"date_published":"2015-04-14T00:00:00Z","doi":"10.1145/2728606.2728608","date_created":"2018-12-11T11:53:29Z","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study."}],"oa_version":"Preprint","scopus_import":1,"publisher":"ACM","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.5387"}],"month":"04"},{"ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1130"},{"id":"1338","status":"public","relation":"later_version"}]},"volume":9207,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"local","content_type":"application/pdf","checksum":"6ff58ac220e2f20cb001ba35d4924495","file_id":"4715","creator":"system","file_size":481922,"date_updated":"2020-07-14T12:45:13Z","file_name":"IST-2015-336-v1+1_long_version.pdf","date_created":"2018-12-12T10:08:53Z"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 9207","month":"07","abstract":[{"text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions.","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:13Z","date_updated":"2023-09-20T11:13:50Z","ddc":["000"],"conference":{"start_date":"2015-07-18","end_date":"2015-07-24","location":"San Francisco, CA, United States","name":"CAV: Computer Aided Verification"},"type":"conference","pubrep_id":"336","status":"public","_id":"1729","series_title":"Lecture Notes in Computer Science","page":"180 - 197","date_created":"2018-12-11T11:53:42Z","doi":"10.1007/978-3-319-21668-3_11","date_published":"2015-07-01T00:00:00Z","year":"2015","has_accepted_license":"1","day":"01","quality_controlled":"1","publisher":"Springer","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"first_name":"Edmund","full_name":"Clarke, Edmund","last_name":"Clarke"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk","first_name":"Leonid"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","last_name":"Samanta","full_name":"Samanta, Roopsha"},{"orcid":"0000-0003-4409-8487","full_name":"Tarrach, Thorsten","last_name":"Tarrach","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5398","title":"From non-preemptive to preemptive scheduling using synchronization synthesis","citation":{"chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197.","mla":"Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11","ieee":"P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}]},{"quality_controlled":"1","publisher":"Springer","oa":1,"acknowledgement":"SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2 148797.\r\n","doi":"10.1007/978-3-662-46681-0_47","date_published":"2015-04-01T00:00:00Z","date_created":"2018-12-11T11:54:16Z","page":"469 - 483","day":"01","year":"2015","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"title":"Model checking gene regulatory networks","publist_id":"5267","author":[{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Paixao","orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago"},{"last_name":"Petrov","full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Giacobbe, Mirco, et al. Model Checking Gene Regulatory Networks. Vol. 9035, Springer, 2015, pp. 469–83, doi:10.1007/978-3-662-46681-0_47.","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking gene regulatory networks. 2015;9035:469-483. doi:10.1007/978-3-662-46681-0_47","apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov, T. (2015). Model checking gene regulatory networks. 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_47","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035 (2015) 469–483.","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.","chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_47.","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model checking gene regulatory networks. 9035, 469–483."},"month":"04","intvolume":" 9035","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"http://arxiv.org/abs/1410.7704","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs –an important problem of interest in evolutionary biology– more efficiently than the classical simulation method. We specify the property in linear temporal logics. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights."}],"related_material":{"record":[{"status":"public","id":"1351","relation":"later_version"}]},"volume":9035,"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"conference","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"},"_id":"1835","series_title":"Lecture Notes in Computer Science","department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"date_updated":"2023-09-20T11:06:03Z"},{"acknowledgement":"This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP to JF). JM internship was supported by the grant “Action Austria – Slovakia”.\r\nData associated with the article are available under the terms of the Creative Commons Zero \"No rights reserved\" data waiver (CC0 1.0 Public domain dedication). \r\n\r\nData availability: \r\nF1000Research: Dataset 1. Dataset 1, 10.5256/f1000research.7143.d104552\r\n\r\nF1000Research: Dataset 2. Dataset 2, 10.5256/f1000research.7143.d104553\r\n\r\nF1000Research: Dataset 3. Dataset 3, 10.5256/f1000research.7143.d104554","quality_controlled":"1","publisher":"F1000 Research","oa":1,"day":"01","publication":"F1000 Research ","has_accepted_license":"1","year":"2015","doi":"10.12688/f1000research.7143.1","date_published":"2015-10-01T00:00:00Z","date_created":"2018-12-11T11:52:26Z","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"282300","name":"Polarity and subcellular dynamics in plants"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Michalko, Jaroslav, et al. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research , vol. 4, F1000 Research, 2015, doi:10.12688/f1000research.7143.1.","ieee":"J. Michalko, M. Lukacisinova, M. T. Bollenbach, and J. Friml, “Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene,” F1000 Research , vol. 4. F1000 Research, 2015.","short":"J. Michalko, M. Lukacisinova, M.T. Bollenbach, J. Friml, F1000 Research 4 (2015).","apa":"Michalko, J., Lukacisinova, M., Bollenbach, M. T., & Friml, J. (2015). Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . F1000 Research. https://doi.org/10.12688/f1000research.7143.1","ama":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 2015;4. doi:10.12688/f1000research.7143.1","chicago":"Michalko, Jaroslav, Marta Lukacisinova, Mark Tobias Bollenbach, and Jiří Friml. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research . F1000 Research, 2015. https://doi.org/10.12688/f1000research.7143.1.","ista":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. 2015. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 4."},"title":"Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene","publist_id":"5668","author":[{"full_name":"Michalko, Jaroslav","last_name":"Michalko","first_name":"Jaroslav","id":"483727CA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87","full_name":"Dravecka, Marta","orcid":"0000-0002-2519-8004","last_name":"Dravecka"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","last_name":"Bollenbach","orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Tobias"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"text":"The Auxin Binding Protein1 (ABP1) has been identified based on its ability to bind auxin with high affinity and studied for a long time as a prime candidate for the extracellular auxin receptor responsible for mediating in particular the fast non-transcriptional auxin responses. However, the contradiction between the embryo-lethal phenotypes of the originally described Arabidopsis T-DNA insertional knock-out alleles (abp1-1 and abp1-1s) and the wild type-like phenotypes of other recently described loss-of-function alleles (abp1-c1 and abp1-TD1) questions the biological importance of ABP1 and relevance of the previous genetic studies. Here we show that there is no hidden copy of the ABP1 gene in the Arabidopsis genome but the embryo-lethal phenotypes of abp1-1 and abp1-1s alleles are very similar to the knock-out phenotypes of the neighboring gene, BELAYA SMERT (BSM). Furthermore, the allelic complementation test between bsm and abp1 alleles shows that the embryo-lethality in the abp1-1 and abp1-1s alleles is caused by the off-target disruption of the BSM locus by the T-DNA insertions. This clarifies the controversy of different phenotypes among published abp1 knock-out alleles and asks for reflections on the developmental role of ABP1.","lang":"eng"}],"month":"10","intvolume":" 4","scopus_import":"1","file":[{"file_name":"IST-2016-497-v1+1_10.12688_f1000research.7143.1_20151102.pdf","date_created":"2018-12-12T10:16:12Z","file_size":4414248,"date_updated":"2020-07-14T12:44:59Z","creator":"system","file_id":"5198","checksum":"8beae5cbe988e1060265ae7de2ee8306","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":4,"ec_funded":1,"_id":"1509","status":"public","pubrep_id":"497","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2023-10-10T14:10:24Z","department":[{"_id":"JiFr"},{"_id":"ToBo"}],"file_date_updated":"2020-07-14T12:44:59Z"},{"article_processing_charge":"No","author":[{"last_name":"Priklopil","full_name":"Priklopil, Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","first_name":"Tadeas"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"publist_id":"5467","title":"Evolution of decisions in population games with sequentially searching individuals","citation":{"short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.","ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. Games. 2015;6(4):413-437. doi:10.3390/g6040413","apa":"Priklopil, T., & Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI. https://doi.org/10.3390/g6040413","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:10.3390/g6040413.","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games. MDPI, 2015. https://doi.org/10.3390/g6040413."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"page":"413 - 437","date_created":"2018-12-11T11:53:26Z","doi":"10.3390/g6040413","date_published":"2015-09-29T00:00:00Z","year":"2015","has_accepted_license":"1","publication":"Games","day":"29","oa":1,"quality_controlled":"1","publisher":"MDPI","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:12Z","date_updated":"2023-10-17T11:42:52Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","pubrep_id":"448","status":"public","_id":"1681","ec_funded":1,"volume":6,"issue":"4","publication_status":"published","publication_identifier":{"eissn":["2073-4336"]},"language":[{"iso":"eng"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:45:12Z","file_size":518832,"date_created":"2018-12-12T10:12:41Z","file_name":"IST-2016-448-v1+1_games-06-00413.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"912e1acbaf201100f447a43e4d5958bd","file_id":"4959"}],"scopus_import":"1","intvolume":" 6","month":"09","abstract":[{"text":"In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game.","lang":"eng"}],"oa_version":"Published Version"},{"ec_funded":1,"issue":"10","volume":17,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"945d99631a96e0315acb26dc8541dcf9","file_id":"4943","date_updated":"2020-07-14T12:45:08Z","file_size":6455007,"creator":"system","date_created":"2018-12-12T10:12:25Z","file_name":"IST-2016-464-v1+1_entropy-17-07266.pdf"}],"publication_status":"published","intvolume":" 17","month":"10","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Quantifying behaviors of robots which were generated autonomously from task-independent objective functions is an important prerequisite for objective comparisons of algorithms and movements of animals. The temporal sequence of such a behavior can be considered as a time series and hence complexity measures developed for time series are natural candidates for its quantification. The predictive information and the excess entropy are such complexity measures. They measure the amount of information the past contains about the future and thus quantify the nonrandom structure in the temporal sequence. However, when using these measures for systems with continuous states one has to deal with the fact that their values will depend on the resolution with which the systems states are observed. For deterministic systems both measures will diverge with increasing resolution. We therefore propose a new decomposition of the excess entropy in resolution dependent and resolution independent parts and discuss how they depend on the dimensionality of the dynamics, correlations and the noise level. For the practical estimation we propose to use estimates based on the correlation integral instead of the direct estimation of the mutual information based on next neighbor statistics because the latter allows less control of the scale dependencies. Using our algorithm we are able to show how autonomous learning generates behavior of increasing complexity with increasing learning duration."}],"file_date_updated":"2020-07-14T12:45:08Z","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"ddc":["000"],"date_updated":"2023-10-17T11:42:00Z","pubrep_id":"464","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"1655","date_created":"2018-12-11T11:53:17Z","date_published":"2015-10-23T00:00:00Z","doi":"10.3390/e17107266","page":"7266 - 7297","publication":"Entropy","day":"23","year":"2015","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"MDPI","acknowledgement":"This work was supported by the DFG priority program 1527 (Autonomous Learning) and by the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 318723 (MatheMACS) and from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734.","title":"Quantifying emergent behavior of autonomous robots","article_processing_charge":"No","author":[{"first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","full_name":"Martius, Georg S"},{"first_name":"Eckehard","full_name":"Olbrich, Eckehard","last_name":"Olbrich"}],"publist_id":"5495","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"G.S. Martius, E. Olbrich, Entropy 17 (2015) 7266–7297.","ieee":"G. S. Martius and E. Olbrich, “Quantifying emergent behavior of autonomous robots,” Entropy, vol. 17, no. 10. MDPI, pp. 7266–7297, 2015.","ama":"Martius GS, Olbrich E. Quantifying emergent behavior of autonomous robots. Entropy. 2015;17(10):7266-7297. doi:10.3390/e17107266","apa":"Martius, G. S., & Olbrich, E. (2015). Quantifying emergent behavior of autonomous robots. Entropy. MDPI. https://doi.org/10.3390/e17107266","mla":"Martius, Georg S., and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” Entropy, vol. 17, no. 10, MDPI, 2015, pp. 7266–97, doi:10.3390/e17107266.","ista":"Martius GS, Olbrich E. 2015. Quantifying emergent behavior of autonomous robots. Entropy. 17(10), 7266–7297.","chicago":"Martius, Georg S, and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” Entropy. MDPI, 2015. https://doi.org/10.3390/e17107266."},"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"scopus_import":"1","month":"04","intvolume":" 7","abstract":[{"lang":"eng","text":"Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal neurogenesis and neurocognitive functions, and most of them showed impairment at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours. Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear discrimination learning tests were performed to determine the influence on spatial learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted hippocampal neurogenesis and increased the survival of newborn cells and the proportion of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated rats performed better during the training days of the Morris water maze test and in contextual-fear discrimination learning test. These results suggest that a subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal rats and facilitates their performance in dentate gyrus-dependent learning tasks."}],"oa_version":"Published Version","volume":7,"issue":"2","publication_status":"published","file":[{"file_id":"5057","checksum":"53e16bd3fc2ae2c0d7de9164626c37aa","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2016-456-v1+1_ASN_Neuro-2015-Chen-.pdf","date_created":"2018-12-12T10:14:08Z","file_size":1146814,"date_updated":"2020-07-14T12:45:18Z","creator":"system"}],"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","pubrep_id":"456","_id":"1834","department":[{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:45:18Z","date_updated":"2023-10-18T06:47:30Z","ddc":["570"],"quality_controlled":"1","publisher":"SAGE Publications","oa":1,"date_published":"2015-04-13T00:00:00Z","doi":"10.1177/1759091415575845","date_created":"2018-12-11T11:54:16Z","has_accepted_license":"1","year":"2015","day":"13","publication":"ASN Neuro","publist_id":"5269","author":[{"last_name":"Chen","full_name":"Chen, Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","first_name":"Chong"},{"first_name":"Chao","full_name":"Wang, Chao","last_name":"Wang"},{"first_name":"Xuan","last_name":"Zhao","full_name":"Zhao, Xuan"},{"first_name":"Tao","full_name":"Zhou, Tao","last_name":"Zhou"},{"first_name":"Dao","last_name":"Xu","full_name":"Xu, Dao"},{"first_name":"Zhi","full_name":"Wang, Zhi","last_name":"Wang"},{"first_name":"Ying","last_name":"Wang","full_name":"Wang, Ying"}],"article_processing_charge":"No","title":"Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats","citation":{"mla":"Chen, Chong, et al. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro, vol. 7, no. 2, SAGE Publications, 2015, doi:10.1177/1759091415575845.","ieee":"C. Chen et al., “Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats,” ASN Neuro, vol. 7, no. 2. SAGE Publications, 2015.","short":"C. Chen, C. Wang, X. Zhao, T. Zhou, D. Xu, Z. Wang, Y. Wang, ASN Neuro 7 (2015).","ama":"Chen C, Wang C, Zhao X, et al. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 2015;7(2). doi:10.1177/1759091415575845","apa":"Chen, C., Wang, C., Zhao, X., Zhou, T., Xu, D., Wang, Z., & Wang, Y. (2015). Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. SAGE Publications. https://doi.org/10.1177/1759091415575845","chicago":"Chen, Chong, Chao Wang, Xuan Zhao, Tao Zhou, Dao Xu, Zhi Wang, and Ying Wang. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro. SAGE Publications, 2015. https://doi.org/10.1177/1759091415575845.","ista":"Chen C, Wang C, Zhao X, Zhou T, Xu D, Wang Z, Wang Y. 2015. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 7(2)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":24,"issue":"4","language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 24","month":"01","main_file_link":[{"url":"http://arxiv.org/abs/1409.8605","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We calculate a Ricci curvature lower bound for some classical examples of random walks, namely, a chain on a slice of the n-dimensional discrete cube (the so-called Bernoulli-Laplace model) and the random transposition shuffle of the symmetric group of permutations on n letters."}],"department":[{"_id":"JaMa"}],"date_updated":"2023-10-18T07:48:28Z","status":"public","article_type":"original","type":"journal_article","_id":"1635","date_created":"2018-12-11T11:53:10Z","date_published":"2015-01-01T00:00:00Z","doi":"10.5802/afst.1464","page":"781 - 800","publication":"Annales de la faculté des sciences de Toulouse","day":"01","year":"2015","oa":1,"publisher":"Faculté des sciences de Toulouse","quality_controlled":"1","title":"Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models","external_id":{"arxiv":["1409.8605"]},"article_processing_charge":"No","author":[{"first_name":"Matthias","full_name":"Erbar, Matthias","last_name":"Erbar"},{"last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Prasad","last_name":"Tetali","full_name":"Tetali, Prasad"}],"publist_id":"5520","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Erbar M, Maas J, Tetali P. 2015. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 24(4), 781–800.","chicago":"Erbar, Matthias, Jan Maas, and Prasad Tetali. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” Annales de La Faculté Des Sciences de Toulouse. Faculté des sciences de Toulouse, 2015. https://doi.org/10.5802/afst.1464.","ama":"Erbar M, Maas J, Tetali P. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 2015;24(4):781-800. doi:10.5802/afst.1464","apa":"Erbar, M., Maas, J., & Tetali, P. (2015). Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de La Faculté Des Sciences de Toulouse. Faculté des sciences de Toulouse. https://doi.org/10.5802/afst.1464","short":"M. Erbar, J. Maas, P. Tetali, Annales de La Faculté Des Sciences de Toulouse 24 (2015) 781–800.","ieee":"M. Erbar, J. Maas, and P. Tetali, “Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models,” Annales de la faculté des sciences de Toulouse, vol. 24, no. 4. Faculté des sciences de Toulouse, pp. 781–800, 2015.","mla":"Erbar, Matthias, et al. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” Annales de La Faculté Des Sciences de Toulouse, vol. 24, no. 4, Faculté des sciences de Toulouse, 2015, pp. 781–800, doi:10.5802/afst.1464."}},{"date_updated":"2023-11-07T11:56:32Z","extern":"1","_id":"14303","article_type":"letter_note","type":"journal_article","status":"public","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":15,"issue":"7","abstract":[{"text":"Scaffolded DNA origami enables the fabrication of a variety of complex nanostructures that promise utility in diverse fields of application, ranging from biosensing over advanced therapeutics to metamaterials. The broad applicability of DNA origami as a material beyond the level of proof-of-concept studies critically depends, among other factors, on the availability of large amounts of pure single-stranded scaffold DNA. Here, we present a method for the efficient production of M13 bacteriophage-derived genomic DNA using high-cell-density fermentation of Escherichia coli in stirred-tank bioreactors. We achieve phage titers of up to 1.6 × 1014 plaque-forming units per mL. Downstream processing yields up to 410 mg of high-quality single-stranded DNA per one liter reaction volume, thus upgrading DNA origami-based nanotechnology from the milligram to the gram scale.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.nanolett.5b01461"}],"month":"06","intvolume":" 15","citation":{"mla":"Kick, B., et al. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” Nano Letters, vol. 15, no. 7, ACS Publications, 2015, pp. 4672–76, doi:10.1021/acs.nanolett.5b01461.","short":"B. Kick, F.M. Praetorius, H. Dietz, D. Weuster-Botz, Nano Letters 15 (2015) 4672–4676.","ieee":"B. Kick, F. M. Praetorius, H. Dietz, and D. Weuster-Botz, “Efficient production of single-stranded phage DNA as scaffolds for DNA origami,” Nano Letters, vol. 15, no. 7. ACS Publications, pp. 4672–4676, 2015.","apa":"Kick, B., Praetorius, F. M., Dietz, H., & Weuster-Botz, D. (2015). Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. ACS Publications. https://doi.org/10.1021/acs.nanolett.5b01461","ama":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 2015;15(7):4672-4676. doi:10.1021/acs.nanolett.5b01461","chicago":"Kick, B, Florian M Praetorius, H Dietz, and D Weuster-Botz. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” Nano Letters. ACS Publications, 2015. https://doi.org/10.1021/acs.nanolett.5b01461.","ista":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. 2015. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 15(7), 4672–4676."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"B","full_name":"Kick, B","last_name":"Kick"},{"last_name":"Praetorius","full_name":"Praetorius, Florian M","first_name":"Florian M","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62"},{"first_name":"H","full_name":"Dietz, H","last_name":"Dietz"},{"first_name":"D","last_name":"Weuster-Botz","full_name":"Weuster-Botz, D"}],"external_id":{"pmid":["26028443"]},"article_processing_charge":"No","title":"Efficient production of single-stranded phage DNA as scaffolds for DNA origami","year":"2015","day":"01","publication":"Nano Letters","page":"4672-4676","date_published":"2015-06-01T00:00:00Z","doi":"10.1021/acs.nanolett.5b01461","date_created":"2023-09-06T12:52:47Z","publisher":"ACS Publications","quality_controlled":"1","oa":1},{"title":"Counterexample explanation by learning small strategies in Markov decision processes","publist_id":"5564","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Fellner","full_name":"Fellner, Andreas"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.","ama":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample explanation by learning small strategies in Markov decision processes. In: Vol 9206. Springer; 2015:158-177. doi:10.1007/978-3-319-21690-4_10","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10","mla":"Brázdil, Tomáš, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10."},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-319-21690-4_10","date_published":"2015-07-16T00:00:00Z","date_created":"2018-12-11T11:52:58Z","page":"158 - 177","day":"16","year":"2015","publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2024-02-21T13:52:07Z","status":"public","type":"conference","conference":{"start_date":"2015-07-18","location":"San Francisco, CA, United States","end_date":"2015-07-24","name":"CAV: Computer Aided Verification"},"_id":"1603","volume":9206,"related_material":{"record":[{"id":"5549","status":"public","relation":"research_paper"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-319-21690-4"]},"publication_status":"published","month":"07","intvolume":" 9206","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.02834"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation.\r\nThe key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour."}]},{"project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.","short":"A. Fellner, (2015).","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:28."},"title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","article_processing_charge":"No","publist_id":"5564","author":[{"last_name":"Fellner","full_name":"Fellner, Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"oa":1,"publisher":"Institute of Science and Technology Austria","day":"13","year":"2015","has_accepted_license":"1","date_created":"2018-12-12T12:31:29Z","doi":"10.15479/AT:ISTA:28","date_published":"2015-08-13T00:00:00Z","_id":"5549","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"status":"public","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"type":"research_data","ddc":["004"],"date_updated":"2024-02-21T13:52:07Z","file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication."}],"month":"08","file":[{"content_type":"application/zip","access_level":"open_access","relation":"main_file","file_id":"5597","checksum":"b8bcb43c0893023cda66c1b69c16ac62","date_updated":"2020-07-14T12:47:00Z","file_size":49557109,"creator":"system","date_created":"2018-12-12T13:02:31Z","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip"}],"datarep_id":"28","contributor":[{"last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","ec_funded":1,"related_material":{"record":[{"id":"1603","status":"public","relation":"popular_science"}]}},{"date_updated":"2024-02-28T12:59:37Z","ddc":["510"],"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:45:00Z","_id":"1512","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22","location":"Eindhoven, Netherlands","end_date":"2015-06-25"},"status":"public","pubrep_id":"501","publication_status":"published","file":[{"checksum":"e6881df44d87fe0c2529c9f7b2724614","file_id":"4794","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2016-501-v1+1_46.pdf","date_created":"2018-12-12T10:10:09Z","file_size":633712,"date_updated":"2020-07-14T12:45:00Z","creator":"system"}],"language":[{"iso":"eng"}],"volume":34,"related_material":{"record":[{"status":"public","id":"424","relation":"later_version"}]},"abstract":[{"lang":"eng","text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent interest."}],"oa_version":"Submitted Version","alternative_title":["LIPIcs"],"scopus_import":"1","month":"01","intvolume":" 34","citation":{"ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers,” 34:507–21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.507.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi:10.4230/LIPIcs.SOCG.2015.507","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2015). Bounding Helly numbers via Betti numbers (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.507","mla":"Goaoc, Xavier, et al. Bounding Helly Numbers via Betti Numbers. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:10.4230/LIPIcs.SOCG.2015.507."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5665","author":[{"first_name":"Xavier","last_name":"Goaoc","full_name":"Goaoc, Xavier"},{"first_name":"Pavel","full_name":"Paták, Pavel","last_name":"Paták"},{"first_name":"Zuzana","orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana","last_name":"Patakova"},{"first_name":"Martin","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"article_processing_charge":"No","title":"Bounding Helly numbers via Betti numbers","has_accepted_license":"1","year":"2015","day":"01","page":"507 - 521","doi":"10.4230/LIPIcs.SOCG.2015.507","date_published":"2015-01-01T00:00:00Z","date_created":"2018-12-11T11:52:27Z","acknowledgement":"PP, ZP and MT were partially supported by the Charles University Grant GAUK 421511. ZP was\r\npartially supported by the Charles University Grant SVV-2014-260103. ZP and MT were partially\r\nsupported by the ERC Advanced Grant No. 267165 and by the project CE-ITI (GACR P202/12/G061)\r\nof the Czech Science Foundation. UW was partially supported by the Swiss National Science Foundation\r\n(grants SNSF-200020-138230 and SNSF-PP00P2-138948). Part of this work was done when XG was affiliated with INRIA Nancy Grand-Est and when MT was affiliated with Institutionen för matematik, Kungliga Tekniska Högskolan, then IST Austria.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1},{"related_material":{"record":[{"relation":"later_version","status":"public","id":"256"}]},"volume":2017,"issue":"731","publication_status":"submitted","publication_identifier":{"issn":["0075-4102"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.4489"}],"intvolume":" 2017","month":"02","abstract":[{"lang":"eng","text":"We show that a non-singular integral form of degree d is soluble non-trivially over the integers if and only if it is soluble non-trivially over the reals and the p-adic numbers, provided that the form has at least (d-\\sqrt{d}/2)2^d variables. This improves on a longstanding result of Birch."}],"oa_version":"Preprint","date_updated":"2024-03-05T12:09:22Z","extern":"1","type":"journal_article","article_type":"original","status":"public","_id":"271","page":"203 - 234","date_created":"2018-12-11T11:45:32Z","date_published":"2015-02-20T00:00:00Z","doi":"10.1515/crelle-2014-0122","year":"2015","publication":"Journal fur die Reine und Angewandte Mathematik","day":"20","oa":1,"publisher":"Walter de Gruyter","quality_controlled":"1","acknowledgement":"While working on this paper the authors were supported by the Leverhulme Trust and ERC grant 306457.","external_id":{"arxiv":["1402.4489"]},"article_processing_charge":"No","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","last_name":"Browning"},{"first_name":"Sean","last_name":"Prendiville","full_name":"Prendiville, Sean"}],"publist_id":"7631","title":"Improvements in Birch's theorem on forms in many variables","citation":{"mla":"Browning, Timothy D., and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik, vol. 2017, no. 731, Walter de Gruyter, pp. 203–34, doi:10.1515/crelle-2014-0122.","ama":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731):203-234. doi:10.1515/crelle-2014-0122","apa":"Browning, T. D., & Prendiville, S. (n.d.). Improvements in Birch’s theorem on forms in many variables. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle-2014-0122","short":"T.D. Browning, S. Prendiville, Journal Fur Die Reine Und Angewandte Mathematik 2017 (n.d.) 203–234.","ieee":"T. D. Browning and S. Prendiville, “Improvements in Birch’s theorem on forms in many variables,” Journal fur die Reine und Angewandte Mathematik, vol. 2017, no. 731. Walter de Gruyter, pp. 203–234.","chicago":"Browning, Timothy D, and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, n.d. https://doi.org/10.1515/crelle-2014-0122.","ista":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731), 203–234."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"pubrep_id":"671","status":"public","conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16","end_date":"2015-08-20","location":"Santa Barbara, CA, United States"},"type":"conference","_id":"1675","department":[{"_id":"VlKo"},{"_id":"KrPi"}],"date_updated":"2024-03-20T08:31:49Z","intvolume":" 9216","month":"08","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2013/796.pdf"}],"scopus_import":"1","alternative_title":["LNCS"],"oa_version":"Preprint","abstract":[{"text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs - so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high “pebbling complexity” and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log logN) such that even if one places Θ(N) pebbles on the nodes of the graph, there’s a constant fraction of nodes that needs Θ(N) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble).","lang":"eng"}],"ec_funded":1,"volume":9216,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2274"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783662479995"],"issn":["0302-9743"]},"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"title":"Proofs of space","article_processing_charge":"No","author":[{"last_name":"Dziembowski","full_name":"Dziembowski, Stefan","first_name":"Stefan"},{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"publist_id":"5474","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dziembowski, Stefan, et al. “Proofs of Space.” 35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.","short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.","ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. In: 35th Annual Cryptology Conference. Vol 9216. Springer; 2015:585-605. doi:10.1007/978-3-662-48000-7_29","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2015). Proofs of space. In 35th Annual Cryptology Conference (Vol. 9216, pp. 585–605). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_29","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.” In 35th Annual Cryptology Conference, 9216:585–605. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_29.","ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 35th Annual Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 585–605."},"oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T11:53:24Z","date_published":"2015-08-01T00:00:00Z","doi":"10.1007/978-3-662-48000-7_29","page":"585 - 605","publication":"35th Annual Cryptology Conference","day":"01","year":"2015"},{"_id":"15160","type":"journal_article","article_type":"original","keyword":["Cell Biology","Molecular Biology"],"status":"public","date_updated":"2024-03-25T11:52:26Z","extern":"1","abstract":[{"text":"The circadian clock orchestrates global changes in transcriptional regulation on a daily basis via the bHLH-PAS transcription factor CLOCK:BMAL1. Pathways driven by other bHLH-PAS transcription factors have a homologous repressor that modulates activity on a tissue-specific basis, but none have been identified for CLOCK:BMAL1. We show here that the cancer/testis antigen PASD1 fulfills this role to suppress circadian rhythms. PASD1 is evolutionarily related to CLOCK and interacts with the CLOCK:BMAL1 complex to repress transcriptional activation. Expression of PASD1 is restricted to germline tissues in healthy individuals but can be induced in cells of somatic origin upon oncogenic transformation. Reducing PASD1 in human cancer cells significantly increases the amplitude of transcriptional oscillations to generate more robust circadian rhythms. Our results describe a function for a germline-specific protein in regulation of the circadian clock and provide a molecular link from oncogenic transformation to suppression of circadian rhythms.","lang":"eng"}],"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1016/j.molcel.2015.03.031","open_access":"1"}],"scopus_import":"1","intvolume":" 58","month":"06","publication_status":"published","publication_identifier":{"issn":["1097-2765"]},"language":[{"iso":"eng"}],"issue":"5","volume":58,"citation":{"ista":"Michael AK, Harvey SL, Sammons PJ, Anderson AP, Kopalle HM, Banham AH, Partch CL. 2015. Cancer/Testis antigen PASD1 silences the circadian clock. Molecular Cell. 58(5), 743–754.","chicago":"Michael, Alicia K., Stacy L. Harvey, Patrick J. Sammons, Amanda P. Anderson, Hema M. Kopalle, Alison H. Banham, and Carrie L. Partch. “Cancer/Testis Antigen PASD1 Silences the Circadian Clock.” Molecular Cell. Elsevier, 2015. https://doi.org/10.1016/j.molcel.2015.03.031.","apa":"Michael, A. K., Harvey, S. L., Sammons, P. J., Anderson, A. P., Kopalle, H. M., Banham, A. H., & Partch, C. L. (2015). Cancer/Testis antigen PASD1 silences the circadian clock. Molecular Cell. Elsevier. https://doi.org/10.1016/j.molcel.2015.03.031","ama":"Michael AK, Harvey SL, Sammons PJ, et al. Cancer/Testis antigen PASD1 silences the circadian clock. Molecular Cell. 2015;58(5):743-754. doi:10.1016/j.molcel.2015.03.031","short":"A.K. Michael, S.L. Harvey, P.J. Sammons, A.P. Anderson, H.M. Kopalle, A.H. Banham, C.L. Partch, Molecular Cell 58 (2015) 743–754.","ieee":"A. K. Michael et al., “Cancer/Testis antigen PASD1 silences the circadian clock,” Molecular Cell, vol. 58, no. 5. Elsevier, pp. 743–754, 2015.","mla":"Michael, Alicia K., et al. “Cancer/Testis Antigen PASD1 Silences the Circadian Clock.” Molecular Cell, vol. 58, no. 5, Elsevier, 2015, pp. 743–54, doi:10.1016/j.molcel.2015.03.031."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"6437c950-2a03-11ee-914d-d6476dd7b75c","first_name":"Alicia Kathleen","full_name":"Michael, Alicia Kathleen","last_name":"Michael"},{"first_name":"Stacy L.","last_name":"Harvey","full_name":"Harvey, Stacy L."},{"last_name":"Sammons","full_name":"Sammons, Patrick J.","first_name":"Patrick J."},{"last_name":"Anderson","full_name":"Anderson, Amanda P.","first_name":"Amanda P."},{"first_name":"Hema M.","full_name":"Kopalle, Hema M.","last_name":"Kopalle"},{"first_name":"Alison H.","last_name":"Banham","full_name":"Banham, Alison H."},{"full_name":"Partch, Carrie L.","last_name":"Partch","first_name":"Carrie L."}],"title":"Cancer/Testis antigen PASD1 silences the circadian clock","oa":1,"quality_controlled":"1","publisher":"Elsevier","year":"2015","publication":"Molecular Cell","day":"04","page":"743-754","date_created":"2024-03-21T07:58:08Z","doi":"10.1016/j.molcel.2015.03.031","date_published":"2015-06-04T00:00:00Z"},{"article_type":"original","type":"journal_article","status":"public","keyword":["Molecular Biology","Biochemistry"],"_id":"15159","date_updated":"2024-03-25T11:53:58Z","extern":"1","scopus_import":"1","month":"09","intvolume":" 40","abstract":[{"text":"It is widely recognized that BMAL1 is an essential subunit of the primary transcription factor that drives rhythmic circadian transcription in the nucleus. In a surprising turn, Lipton et al. now show that BMAL1 rhythmically interacts with translational machinery in the cytosol to stimulate protein synthesis in response to mTOR signaling.","lang":"eng"}],"oa_version":"None","issue":"9","volume":40,"publication_identifier":{"issn":["0968-0004"]},"publication_status":"published","language":[{"iso":"eng"}],"author":[{"last_name":"Michael","full_name":"Michael, Alicia Kathleen","id":"6437c950-2a03-11ee-914d-d6476dd7b75c","first_name":"Alicia Kathleen"},{"first_name":"Hande","last_name":"Asimgil","full_name":"Asimgil, Hande"},{"first_name":"Carrie L.","full_name":"Partch, Carrie L.","last_name":"Partch"}],"article_processing_charge":"No","title":"Cytosolic BMAL1 moonlights as a translation factor","citation":{"ista":"Michael AK, Asimgil H, Partch CL. 2015. Cytosolic BMAL1 moonlights as a translation factor. Trends in Biochemical Sciences. 40(9), 489–490.","chicago":"Michael, Alicia K., Hande Asimgil, and Carrie L. Partch. “Cytosolic BMAL1 Moonlights as a Translation Factor.” Trends in Biochemical Sciences. Elsevier, 2015. https://doi.org/10.1016/j.tibs.2015.07.006.","ieee":"A. K. Michael, H. Asimgil, and C. L. Partch, “Cytosolic BMAL1 moonlights as a translation factor,” Trends in Biochemical Sciences, vol. 40, no. 9. Elsevier, pp. 489–490, 2015.","short":"A.K. Michael, H. Asimgil, C.L. Partch, Trends in Biochemical Sciences 40 (2015) 489–490.","ama":"Michael AK, Asimgil H, Partch CL. Cytosolic BMAL1 moonlights as a translation factor. Trends in Biochemical Sciences. 2015;40(9):489-490. doi:10.1016/j.tibs.2015.07.006","apa":"Michael, A. K., Asimgil, H., & Partch, C. L. (2015). Cytosolic BMAL1 moonlights as a translation factor. Trends in Biochemical Sciences. Elsevier. https://doi.org/10.1016/j.tibs.2015.07.006","mla":"Michael, Alicia K., et al. “Cytosolic BMAL1 Moonlights as a Translation Factor.” Trends in Biochemical Sciences, vol. 40, no. 9, Elsevier, 2015, pp. 489–90, doi:10.1016/j.tibs.2015.07.006."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Elsevier","page":"489-490","doi":"10.1016/j.tibs.2015.07.006","date_published":"2015-09-01T00:00:00Z","date_created":"2024-03-21T07:57:44Z","year":"2015","day":"01","publication":"Trends in Biochemical Sciences"},{"volume":13,"issue":"11","related_material":{"record":[{"status":"public","id":"9711","relation":"research_data"},{"relation":"research_data","id":"9765","status":"public"},{"id":"6263","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"publication_status":"published","file":[{"date_updated":"2020-07-14T12:45:07Z","file_size":1387760,"creator":"system","date_created":"2018-12-12T10:09:00Z","file_name":"IST-2016-468-v1+1_journal.pbio.1002299.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4723","checksum":"0e82e3279f50b15c6c170c042627802b"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"11","intvolume":" 13","abstract":[{"lang":"eng","text":"The emergence of drug resistant pathogens is a serious public health problem. It is a long-standing goal to predict rates of resistance evolution and design optimal treatment strategies accordingly. To this end, it is crucial to reveal the underlying causes of drug-specific differences in the evolutionary dynamics leading to resistance. However, it remains largely unknown why the rates of resistance evolution via spontaneous mutations and the diversity of mutational paths vary substantially between drugs. Here we comprehensively quantify the distribution of fitness effects (DFE) of mutations, a key determinant of evolutionary dynamics, in the presence of eight antibiotics representing the main modes of action. Using precise high-throughput fitness measurements for genome-wide Escherichia coli gene deletion strains, we find that the width of the DFE varies dramatically between antibiotics and, contrary to conventional wisdom, for some drugs the DFE width is lower than in the absence of stress. We show that this previously underappreciated divergence in DFE width among antibiotics is largely caused by their distinct drug-specific dose-response characteristics. Unlike the DFE, the magnitude of the changes in tolerated drug concentration resulting from genome-wide mutations is similar for most drugs but exceptionally small for the antibiotic nitrofurantoin, i.e., mutations generally have considerably smaller resistance effects for nitrofurantoin than for other drugs. A population genetics model predicts that resistance evolution for drugs with this property is severely limited and confined to reproducible mutational paths. We tested this prediction in laboratory evolution experiments using the “morbidostat”, a device for evolving bacteria in well-controlled drug environments. Nitrofurantoin resistance indeed evolved extremely slowly via reproducible mutations—an almost paradoxical behavior since this drug causes DNA damage and increases the mutation rate. Overall, we identified novel quantitative characteristics of the evolutionary landscape that provide the conceptual foundation for predicting the dynamics of drug resistance evolution."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:07Z","department":[{"_id":"ToBo"}],"date_updated":"2024-03-27T23:30:28Z","ddc":["570"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"468","_id":"1619","doi":"10.1371/journal.pbio.1002299","date_published":"2015-11-18T00:00:00Z","date_created":"2018-12-11T11:53:04Z","has_accepted_license":"1","year":"2015","day":"18","publication":"PLoS Biology","publisher":"Public Library of Science","quality_controlled":"1","oa":1,"author":[{"first_name":"Guillaume","id":"424D78A0-F248-11E8-B48F-1D18A9856A87","last_name":"Chevereau","full_name":"Chevereau, Guillaume"},{"first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87","last_name":"Dravecka","orcid":"0000-0002-2519-8004","full_name":"Dravecka, Marta"},{"full_name":"Batur, Tugce","last_name":"Batur","first_name":"Tugce"},{"last_name":"Guvenek","full_name":"Guvenek, Aysegul","first_name":"Aysegul"},{"first_name":"Dilay","last_name":"Ayhan","full_name":"Ayhan, Dilay"},{"first_name":"Erdal","last_name":"Toprak","full_name":"Toprak, Erdal"},{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias"}],"publist_id":"5547","title":"Quantifying the determinants of evolutionary dynamics leading to drug resistance","citation":{"chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Quantifying the Determinants of Evolutionary Dynamics Leading to Drug Resistance.” PLoS Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.","ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan D, Toprak E, Bollenbach MT. 2015. Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. 13(11), e1002299.","mla":"Chevereau, Guillaume, et al. “Quantifying the Determinants of Evolutionary Dynamics Leading to Drug Resistance.” PLoS Biology, vol. 13, no. 11, e1002299, Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. 2015;13(11). doi:10.1371/journal.pbio.1002299","apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D., Toprak, E., & Bollenbach, M. T. (2015). Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002299","ieee":"G. Chevereau et al., “Quantifying the determinants of evolutionary dynamics leading to drug resistance,” PLoS Biology, vol. 13, no. 11. Public Library of Science, 2015.","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D. Ayhan, E. Toprak, M.T. Bollenbach, PLoS Biology 13 (2015)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"RGP0042/2013","name":"Revealing the fundamental limits of cell growth","_id":"25EB3A80-B435-11E9-9278-68D0E5697425"},{"name":"Revealing the mechanisms underlying drug interactions","grant_number":"P27201-B22","call_identifier":"FWF","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425"},{"_id":"25E83C2C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Optimality principles in responses to antibiotics","grant_number":"303507"}],"article_number":"e1002299"},{"date_updated":"2021-11-29T13:29:05Z","extern":"1","type":"journal_article","article_type":"original","keyword":["multidisciplinary"],"status":"public","_id":"10382","volume":111,"issue":"50","publication_status":"published","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.pnas.org/content/111/50/17869","open_access":"1"}],"scopus_import":"1","intvolume":" 111","month":"12","abstract":[{"text":"Protein oligomers have been implicated as toxic agents in a wide range of amyloid-related diseases. However, it has remained unsolved whether the oligomers are a necessary step in the formation of amyloid fibrils or just a dangerous byproduct. Analogously, it has not been resolved if the amyloid nucleation process is a classical one-step nucleation process or a two-step process involving prenucleation clusters. We use coarse-grained computer simulations to study the effect of nonspecific attractions between peptides on the primary nucleation process underlying amyloid fibrillization. We find that, for peptides that do not attract, the classical one-step nucleation mechanism is possible but only at nonphysiologically high peptide concentrations. At low peptide concentrations, which mimic the physiologically relevant regime, attractive interpeptide interactions are essential for fibril formation. Nucleation then inevitably takes place through a two-step mechanism involving prefibrillar oligomers. We show that oligomers not only help peptides meet each other but also, create an environment that facilitates the conversion of monomers into the β-sheet–rich form characteristic of fibrils. Nucleation typically does not proceed through the most prevalent oligomers but through an oligomer size that is only observed in rare fluctuations, which is why such aggregates might be hard to capture experimentally. Finally, we find that the nucleation of amyloid fibrils cannot be described by classical nucleation theory: in the two-step mechanism, the critical nucleus size increases with increases in both concentration and interpeptide interactions, which is in direct contrast with predictions from classical nucleation theory.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","external_id":{"pmid":["25453085"],"arxiv":["1412.0897"]},"article_processing_charge":"No","author":[{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","last_name":"Šarić","orcid":"0000-0002-7854-2139","full_name":"Šarić, Anđela"},{"first_name":"Yassmine C.","full_name":"Chebaro, Yassmine C.","last_name":"Chebaro"},{"full_name":"Knowles, Tuomas P. J.","last_name":"Knowles","first_name":"Tuomas P. J."},{"first_name":"Daan","last_name":"Frenkel","full_name":"Frenkel, Daan"}],"title":"Crucial role of nonspecific interactions in amyloid nucleation","citation":{"ista":"Šarić A, Chebaro YC, Knowles TPJ, Frenkel D. 2014. Crucial role of nonspecific interactions in amyloid nucleation. Proceedings of the National Academy of Sciences. 111(50), 17869–17874.","chicago":"Šarić, Anđela, Yassmine C. Chebaro, Tuomas P. J. Knowles, and Daan Frenkel. “Crucial Role of Nonspecific Interactions in Amyloid Nucleation.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2014. https://doi.org/10.1073/pnas.1410159111.","ama":"Šarić A, Chebaro YC, Knowles TPJ, Frenkel D. Crucial role of nonspecific interactions in amyloid nucleation. Proceedings of the National Academy of Sciences. 2014;111(50):17869-17874. doi:10.1073/pnas.1410159111","apa":"Šarić, A., Chebaro, Y. C., Knowles, T. P. J., & Frenkel, D. (2014). Crucial role of nonspecific interactions in amyloid nucleation. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1410159111","short":"A. Šarić, Y.C. Chebaro, T.P.J. Knowles, D. Frenkel, Proceedings of the National Academy of Sciences 111 (2014) 17869–17874.","ieee":"A. Šarić, Y. C. Chebaro, T. P. J. Knowles, and D. Frenkel, “Crucial role of nonspecific interactions in amyloid nucleation,” Proceedings of the National Academy of Sciences, vol. 111, no. 50. National Academy of Sciences, pp. 17869–17874, 2014.","mla":"Šarić, Anđela, et al. “Crucial Role of Nonspecific Interactions in Amyloid Nucleation.” Proceedings of the National Academy of Sciences, vol. 111, no. 50, National Academy of Sciences, 2014, pp. 17869–74, doi:10.1073/pnas.1410159111."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"17869-17874","date_created":"2021-11-29T13:09:53Z","doi":"10.1073/pnas.1410159111","date_published":"2014-12-01T00:00:00Z","year":"2014","publication":"Proceedings of the National Academy of Sciences","day":"01","oa":1,"publisher":"National Academy of Sciences","quality_controlled":"1","acknowledgement":"We thank Michele Vendruscolo, Iskra Staneva, and William M. Jacobs, for helpful discussions. A.Š. acknowledges support from the Human Frontier Science Program and Emmanuel College. Y.C.C. and D.F. are supported by Engineering and Physical Sciences Research Council Programme Grant EP/I001352/1. T.P.J.K. acknowledges the Frances and Augustus Newman Foundation, the European Research Council, and the Biotechnology and Biological Sciences Research Council. D.F. acknowledges European Research Council Advanced Grant 227758."},{"month":"05","intvolume":" 89","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1310.0826","open_access":"1"}],"oa_version":"Preprint","pmid":1,"abstract":[{"text":"We use numerical simulations to compute the equation of state of a suspension of spherical self-propelled nanoparticles in two and three dimensions. We study in detail the effect of excluded volume interactions and confinement as a function of the system's temperature, concentration, and strength of the propulsion. We find a striking nonmonotonic dependence of the pressure on the temperature and provide simple scaling arguments to predict and explain the occurrence of such anomalous behavior. We explicitly show how our results have important implications for the effective forces on passive components suspended in a bath of active particles.","lang":"eng"}],"issue":"5","volume":89,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1539-3755"],"eissn":["1550-2376"]},"publication_status":"published","status":"public","type":"journal_article","article_type":"original","_id":"10383","extern":"1","date_updated":"2021-11-29T13:29:01Z","publisher":"American Physical Society","quality_controlled":"1","oa":1,"date_published":"2014-05-06T00:00:00Z","doi":"10.1103/physreve.89.052303","date_created":"2021-11-29T13:10:33Z","day":"06","publication":"Physical Review E","year":"2014","article_number":"052303","title":"Anomalous thermomechanical properties of a self-propelled colloidal fluid","author":[{"first_name":"S. A.","full_name":"Mallory, S. A.","last_name":"Mallory"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","last_name":"Šarić"},{"first_name":"C.","last_name":"Valeriani","full_name":"Valeriani, C."},{"first_name":"A.","full_name":"Cacciuto, A.","last_name":"Cacciuto"}],"external_id":{"pmid":["25353796"],"arxiv":["1310.0826"]},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Mallory, S. A., Anđela Šarić, C. Valeriani, and A. Cacciuto. “Anomalous Thermomechanical Properties of a Self-Propelled Colloidal Fluid.” Physical Review E. American Physical Society, 2014. https://doi.org/10.1103/physreve.89.052303.","ista":"Mallory SA, Šarić A, Valeriani C, Cacciuto A. 2014. Anomalous thermomechanical properties of a self-propelled colloidal fluid. Physical Review E. 89(5), 052303.","mla":"Mallory, S. A., et al. “Anomalous Thermomechanical Properties of a Self-Propelled Colloidal Fluid.” Physical Review E, vol. 89, no. 5, 052303, American Physical Society, 2014, doi:10.1103/physreve.89.052303.","apa":"Mallory, S. A., Šarić, A., Valeriani, C., & Cacciuto, A. (2014). Anomalous thermomechanical properties of a self-propelled colloidal fluid. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.89.052303","ama":"Mallory SA, Šarić A, Valeriani C, Cacciuto A. Anomalous thermomechanical properties of a self-propelled colloidal fluid. Physical Review E. 2014;89(5). doi:10.1103/physreve.89.052303","short":"S.A. Mallory, A. Šarić, C. Valeriani, A. Cacciuto, Physical Review E 89 (2014).","ieee":"S. A. Mallory, A. Šarić, C. Valeriani, and A. Cacciuto, “Anomalous thermomechanical properties of a self-propelled colloidal fluid,” Physical Review E, vol. 89, no. 5. American Physical Society, 2014."}}]