[{"_id":"479","type":"conference","date_created":"2018-12-11T11:46:42Z","year":"2016","day":"14","page":"112 - 121","status":"public","doi":"10.1145/2889160.2889233","acknowledgement":"This work is supported by NSF CNS 13-30077, NSF CNS 13-29886, NSF CNS 15-45002, and NSFC 61303014.\r\nThe authors thank Dr.  Bobby and Dr.  Hill at Carle Hospital, Urbana, IL for their help with the discussion on medical  knowledge.\r\n\r\n","scopus_import":1,"publication":"Proceedings of the 38th International Conference on Software Engineering Companion ","conference":{"location":"Austin, TX, USA","name":"ICSE: International Conference on Software Engineering","start_date":"2016-05-14","end_date":"2016-05-22"},"publist_id":"7341","citation":{"apa":"Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., &#38; Sha, L. (2016). Use runtime verification to improve the quality of medical care practice. In <i>Proceedings of the 38th International Conference on Software Engineering Companion </i> (pp. 112–121). Austin, TX, USA: IEEE. <a href=\"https://doi.org/10.1145/2889160.2889233\">https://doi.org/10.1145/2889160.2889233</a>","ama":"Jiang Y, Liu H, Kong H, et al. Use runtime verification to improve the quality of medical care practice. In: <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>. IEEE; 2016:112-121. doi:<a href=\"https://doi.org/10.1145/2889160.2889233\">10.1145/2889160.2889233</a>","chicago":"Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun, and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care Practice.” In <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, 112–21. IEEE, 2016. <a href=\"https://doi.org/10.1145/2889160.2889233\">https://doi.org/10.1145/2889160.2889233</a>.","ista":"Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime verification to improve the quality of medical care practice. Proceedings of the 38th International Conference on Software Engineering Companion . ICSE: International Conference on Software Engineering, Proceedings International Conference on Software Engineering, , 112–121.","ieee":"Y. Jiang <i>et al.</i>, “Use runtime verification to improve the quality of medical care practice,” in <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, Austin, TX, USA, 2016, pp. 112–121.","short":"Y. Jiang, H. Liu, H. Kong, R. Wang, M. Hosseini, J. Sun, L. Sha, in:, Proceedings of the 38th International Conference on Software Engineering Companion , IEEE, 2016, pp. 112–121.","mla":"Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical Care Practice.” <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, IEEE, 2016, pp. 112–21, doi:<a href=\"https://doi.org/10.1145/2889160.2889233\">10.1145/2889160.2889233</a>."},"oa_version":"None","department":[{"_id":"ToHe"}],"quality_controlled":"1","date_updated":"2021-01-12T08:00:55Z","alternative_title":["Proceedings International Conference on Software Engineering"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Jiang, Yu","first_name":"Yu","last_name":"Jiang"},{"full_name":"Liu, Han","last_name":"Liu","first_name":"Han"},{"orcid":"0000-0002-3066-6941","last_name":"Kong","first_name":"Hui","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rui","last_name":"Wang","full_name":"Wang, Rui"},{"full_name":"Hosseini, Mohamad","first_name":"Mohamad","last_name":"Hosseini"},{"full_name":"Sun, Jiaguang","first_name":"Jiaguang","last_name":"Sun"},{"full_name":"Sha, Lui","first_name":"Lui","last_name":"Sha"}],"publication_status":"published","month":"05","abstract":[{"lang":"eng","text":"Clinical guidelines and decision support systems (DSS) play an important role in daily practices of medicine. Many text-based guidelines have been encoded for work-flow simulation of DSS to automate health care. During the collaboration with Carle hospital to develop a DSS, we identify that, for some complex and life-critical diseases, it is highly desirable to automatically rigorously verify some complex temporal properties in guidelines, which brings new challenges to current simulation based DSS with limited support of automatical formal verification and real-time data analysis. In this paper, we conduct the first study on applying runtime verification to cooperate with current DSS based on real-time data. Within the proposed technique, a user-friendly domain specific language, named DRTV, is designed to specify vital real-time data sampled by medical devices and temporal properties originated from clinical guidelines. Some interfaces are developed for data acquisition and communication. Then, for medical practice scenarios described in DRTV model, we will automatically generate event sequences and runtime property verifier automata. If a temporal property violates, real-time warnings will be produced by the formal verifier and passed to medical DSS. We have used DRTV to specify different kinds of medical care scenarios, and applied the proposed technique to assist existing DSS. As presented in experiment results, in terms of warning detection, it outperforms the only use of DSS or human inspection, and improves the quality of clinical health care of hospital"}],"title":"Use runtime verification to improve the quality of medical care practice","language":[{"iso":"eng"}],"date_published":"2016-05-14T00:00:00Z","publisher":"IEEE"},{"date_updated":"2021-01-12T08:00:56Z","department":[{"_id":"KrCh"}],"citation":{"ama":"Chatterjee K, Doyen L. Perfect-information stochastic games with generalized mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:<a href=\"https://doi.org/10.1145/2933575.2934513\">10.1145/2933575.2934513</a>","ista":"Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2934513\">https://doi.org/10.1145/2933575.2934513</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2934513\">https://doi.org/10.1145/2933575.2934513</a>","ieee":"K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives</i>. Vol. 05-08-July-2016, IEEE, 2016, pp. 247–56, doi:<a href=\"https://doi.org/10.1145/2933575.2934513\">10.1145/2933575.2934513</a>.","short":"K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["Proceedings Symposium on Logic in Computer Science"],"abstract":[{"lang":"eng","text":"Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is 1. Previous results presented a semi-decision procedure for -approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements."}],"publication_status":"published","date_published":"2016-07-05T00:00:00Z","publisher":"IEEE","title":"Perfect-information stochastic games with generalized mean-payoff objectives","oa":1,"day":"05","doi":"10.1145/2933575.2934513","page":"247 - 256","year":"2016","scopus_import":1,"publist_id":"7340","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"oa_version":"Preprint","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"month":"07","language":[{"iso":"eng"}],"volume":"05-08-July-2016","date_created":"2018-12-11T11:46:42Z","_id":"480","type":"conference","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06376"}],"ec_funded":1,"conference":{"end_date":"2016-07-08","start_date":"2016-07-05","name":"LICS: Logic in Computer Science","location":"New York, NY, USA"}},{"citation":{"apa":"Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics, Sydney, Australia: Optica Publishing Group. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>","chicago":"Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing Group, 2016. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>.","ista":"Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .","ama":"Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing Group; 2016. doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>","ieee":"A. Rueda <i>et al.</i>, “Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics, Sydney, Australia, 2016.","mla":"Rueda, Alfredo, et al. <i>Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator</i>. Optica Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>.","short":"A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing Group, 2016."},"oa_version":"None","date_updated":"2023-10-17T12:16:43Z","department":[{"_id":"JoFi"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["Optics InfoBase Conference Papers"],"author":[{"first_name":"Alfredo","last_name":"Rueda","full_name":"Rueda, Alfredo"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"first_name":"Michele","last_name":"Collodo","full_name":"Collodo, Michele"},{"full_name":"Vogl, Ulrich","last_name":"Vogl","first_name":"Ulrich"},{"full_name":"Stiller, Birgit","first_name":"Birgit","last_name":"Stiller"},{"full_name":"Schunk, Gerhard","last_name":"Schunk","first_name":"Gerhard"},{"full_name":"Strekalov, Dmitry","first_name":"Dmitry","last_name":"Strekalov"},{"last_name":"Marquardt","first_name":"Christoph","full_name":"Marquardt, Christoph"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X"},{"full_name":"Painter, Oskar","first_name":"Oskar","last_name":"Painter"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"last_name":"Schwefel","first_name":"Harald","full_name":"Schwefel, Harald"}],"abstract":[{"text":"Nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band is achieved within a crystalline whispering gallery mode resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.","lang":"eng"}],"publication_status":"published","month":"08","article_processing_charge":"No","title":"Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator","publisher":"Optica Publishing Group","language":[{"iso":"eng"}],"date_published":"2016-08-29T00:00:00Z","type":"conference","_id":"482","date_created":"2018-12-11T11:46:43Z","day":"29","status":"public","doi":"10.1364/NP.2016.NTh3A.6","year":"2016","scopus_import":"1","publist_id":"7339","conference":{"name":"NP: Nonlinear Photonics","location":"Sydney, Australia","start_date":"2016-09-05","end_date":"2016-09-08"}},{"date_published":"2016-06-02T00:00:00Z","publisher":"Taylor & Francis","title":"The CLE gene family in Populus trichocarpa","abstract":[{"lang":"eng","text":"The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted signaling peptides that are primarily involved in the regulation of stem cell homeostasis in different plant meristems. Particularly, the characterization of the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on the potential roles of CLE peptides in vascular development and wood formation. Nevertheless, our knowledge on this gene family in a tree species is limited. In a recent study, we reported on a systematically investigation of the CLE gene family in Populus trichocarpa . The potential roles of PtCLE genes were studied by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members, many PtCLE proteins share identical CLE motifs or contain the same CLE motif as that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression patterns comparing to their Arabidopsis counterparts. These fi ndings indicate the existence of both functional conservation and functional divergence between PtCLEs and their AtCLE orthologues. Our results provide valuable resources for future functional investigations of these critical signaling molecules in woody plants. "}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-17T11:13:40Z","department":[{"_id":"JiFr"}],"citation":{"short":"Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &#38; Behavior 11 (2016).","mla":"Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” <i>Plant Signaling &#38; Behavior</i>, vol. 11, no. 6, e1191734, Taylor &#38; Francis, 2016, doi:<a href=\"https://doi.org/10.1080/15592324.2016.1191734\">10.1080/15592324.2016.1191734</a>.","chicago":"Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/15592324.2016.1191734\">https://doi.org/10.1080/15592324.2016.1191734</a>.","ista":"Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family in Populus trichocarpa. Plant Signaling &#38; Behavior. 11(6), e1191734.","ama":"Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. <i>Plant Signaling &#38; Behavior</i>. 2016;11(6). doi:<a href=\"https://doi.org/10.1080/15592324.2016.1191734\">10.1080/15592324.2016.1191734</a>","apa":"Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., &#38; Wang, G. (2016). The CLE gene family in Populus trichocarpa. <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/15592324.2016.1191734\">https://doi.org/10.1080/15592324.2016.1191734</a>","ieee":"Z. Liu <i>et al.</i>, “The CLE gene family in Populus trichocarpa,” <i>Plant Signaling &#38; Behavior</i>, vol. 11, no. 6. Taylor &#38; Francis, 2016."},"intvolume":"        11","publist_id":"7308","publication":"Plant Signaling & Behavior","scopus_import":"1","acknowledgement":"We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading of the article. Work in our group is supported by the National Natural Science Foundation of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of Higher Education from the Ministry of Education of China (20120202120009), the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China (2014JM3064). ","day":"02","doi":"10.1080/15592324.2016.1191734","year":"2016","oa":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","volume":11,"month":"06","issue":"6","article_number":"e1191734","author":[{"last_name":"Liu","first_name":"Zhijun","full_name":"Liu, Zhijun"},{"full_name":"Yang, Nan","last_name":"Yang","first_name":"Nan"},{"full_name":"Lv, Yanting","first_name":"Yanting","last_name":"Lv"},{"first_name":"Lixia","last_name":"Pan","full_name":"Pan, Lixia"},{"full_name":"Lv, Shuo","first_name":"Shuo","last_name":"Lv"},{"first_name":"Huibin","last_name":"Han","full_name":"Han, Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wang, Guodong","first_name":"Guodong","last_name":"Wang"}],"quality_controlled":"1","oa_version":"Submitted Version","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/","open_access":"1"}],"status":"public","date_created":"2018-12-11T11:46:53Z","type":"journal_article","_id":"510"},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"1604"}]},"pubrep_id":"523","date_created":"2018-12-12T11:39:22Z","oa":1,"_id":"5445","type":"technical_report","doi":"10.15479/AT:IST-2016-523-v1-1","publication_identifier":{"issn":["2664-1690"]},"status":"public","page":"33","year":"2016","day":"31","abstract":[{"lang":"eng","text":"We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs. "}],"publication_status":"published","month":"03","has_accepted_license":"1","ddc":["005"],"file":[{"relation":"main_file","file_id":"5513","checksum":"cef516fa091925b5868813e355268fb4","creator":"system","access_level":"open_access","file_size":1012204,"content_type":"application/pdf","date_created":"2018-12-12T11:53:52Z","date_updated":"2020-07-14T12:46:58Z","file_name":"IST-2016-523-v1+1_main.pdf"}],"language":[{"iso":"eng"}],"date_published":"2016-03-31T00:00:00Z","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:58Z","title":"Quantitative interprocedural analysis","date_updated":"2023-02-23T10:06:22Z","department":[{"_id":"KrCh"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Interprocedural Analysis</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">10.15479/AT:IST-2016-523-v1-1</a>.","short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.","ieee":"K. Chatterjee, A. Pavlogiannis, and Y. Velner, <i>Quantitative interprocedural analysis</i>. IST Austria, 2016.","apa":"Chatterjee, K., Pavlogiannis, A., &#38; Velner, Y. (2016). <i>Quantitative interprocedural analysis</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">https://doi.org/10.15479/AT:IST-2016-523-v1-1</a>","ista":"Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. <i>Quantitative Interprocedural Analysis</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">https://doi.org/10.15479/AT:IST-2016-523-v1-1</a>.","ama":"Chatterjee K, Pavlogiannis A, Velner Y. <i>Quantitative Interprocedural Analysis</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-523-v1-1\">10.15479/AT:IST-2016-523-v1-1</a>"},"oa_version":"Published Version","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas"},{"last_name":"Velner","first_name":"Yaron","full_name":"Velner, Yaron"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"]},{"page":"26","publication_identifier":{"issn":["2664-1690"]},"year":"2016","day":"15","status":"public","oa":1,"date_created":"2018-12-12T11:39:23Z","_id":"5446","type":"technical_report","pubrep_id":"618","author":[{"full_name":"Anonymous, 1","last_name":"Anonymous","first_name":"1"},{"last_name":"Anonymous","first_name":"2","full_name":"Anonymous, 2"},{"first_name":"3","last_name":"Anonymous","full_name":"Anonymous, 3"}],"alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-07-14T23:05:05Z","citation":{"apa":"Anonymous, 1, Anonymous, 2, &#38; Anonymous, 3. (2016). <i>Termination and worst-case analysis of recursive programs</i>. IST Austria.","chicago":"Anonymous, 1, 2 Anonymous, and 3 Anonymous. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria, 2016.","ista":"Anonymous 1, Anonymous 2, Anonymous 3. 2016. Termination and worst-case analysis of recursive programs, IST Austria, 26p.","ama":"Anonymous 1, Anonymous 2, Anonymous 3. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria; 2016.","ieee":"1 Anonymous, 2 Anonymous, and 3 Anonymous, <i>Termination and worst-case analysis of recursive programs</i>. IST Austria, 2016.","mla":"Anonymous, 1, et al. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria, 2016.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis of Recursive Programs, IST Austria, 2016."},"oa_version":"Published Version","date_published":"2016-07-15T00:00:00Z","language":[{"iso":"eng"}],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:58Z","title":"Termination and worst-case analysis of recursive programs","publication_status":"published","month":"07","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We study the problem of developing efficient approaches for proving termination of recursive programs with one-dimensional arrays. Ranking functions serve as a sound and complete approach for proving termination of non-recursive programs without array operations. First, we generalize ranking functions to the notion of measure functions, and prove that measure functions (i) provide a sound method to prove termination of recursive programs (with one-dimensional arrays), and (ii) is both sound and complete over recursive programs without array operations. Our second contribution is the synthesis of measure functions of specific forms in polynomial time. More precisely, we prove that (i) polynomial measure functions over recursive programs can be synthesized in polynomial time through Farkas’ Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm and exponentiation can be synthesized in polynomial time through abstraction of logarithmic or exponential terms and Handelman’s Theorem. A key application of our method is the worst-case analysis of recursive programs. While previous methods obtain worst-case polynomial bounds of the form O(n^k), where k is an integer, our polynomial time methods can synthesize bounds of the form O(n log n), as well as O(n^x), where x is not an integer. We show the applicability of our automated technique to obtain worst-case complexity of classical recursive algorithms such as (i) Merge-Sort, the divideand-\r\nconquer algorithm for the Closest-Pair problem, where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for polynomial multiplication and Strassen’s algorithm for matrix multiplication, where we obtain O(n^x) bound, where x is not an integer and close to the best-known bounds for the respective algorithms. Finally, we present experimental results to demonstrate the\r\neffectiveness of our approach."}],"file":[{"file_name":"popl2017a.pdf","date_created":"2019-05-10T13:27:24Z","date_updated":"2020-07-14T12:46:58Z","content_type":"application/pdf","access_level":"open_access","file_size":686241,"file_id":"6403","checksum":"689069a7abbb34b21516164cbee9e0df","creator":"dernst","relation":"main_file"},{"file_size":258,"access_level":"closed","creator":"dernst","checksum":"fc08022bfbaac07bac047a9407c0bbb3","file_id":"6404","relation":"main_file","file_name":"author_names.txt","date_updated":"2020-07-14T12:46:58Z","date_created":"2019-05-10T13:27:31Z","content_type":"text/plain"}],"ddc":["000"]},{"pubrep_id":"619","oa":1,"date_created":"2018-12-12T11:39:23Z","type":"technical_report","_id":"5447","year":"2016","page":"20","publication_identifier":{"issn":["2664-1690"]},"day":"15","status":"public","abstract":[{"text":"We consider the problem of developing automated techniques to aid the average-case complexity analysis of programs. Several classical textbook algorithms have quite efficient average-case complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR). Since the main focus of average-case analysis is to obtain efficient bounds, we consider bounds that are either logarithmic,\r\nlinear, or almost-linear (O(log n), O(n), O(n · log n),\r\nrespectively, where n represents the size of the input). Our main contribution is a sound approach for deriving such average-case bounds for randomized recursive programs. Our approach is efficient (a simple linear-time algorithm), and it is based on (a) the analysis of recurrence relations induced by randomized algorithms, and (b) a guess-and-check technique. Our approach can infer the asymptotically optimal average-case bounds for classical randomized algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR, where the worstcase\r\nbounds are either inefficient (such as linear as compared to logarithmic of average-case, or quadratic as compared to linear or almost-linear of average-case), or ineffective. We have implemented our approach, and the experimental results show that we obtain the bounds efficiently for various classical algorithms.","lang":"eng"}],"has_accepted_license":"1","month":"07","publication_status":"published","file":[{"content_type":"text/plain","date_created":"2019-05-10T13:32:16Z","date_updated":"2020-07-14T12:46:58Z","file_name":"listofauthors.txt","relation":"main_file","file_id":"6406","checksum":"cf53cdb6d092e68db0b4a0a1506ef8fb","creator":"dernst","access_level":"closed","file_size":281},{"relation":"main_file","file_size":563642,"access_level":"open_access","creator":"dernst","checksum":"7bdd94ba13aa0dec9c46887fcf13870b","file_id":"6407","date_updated":"2020-07-14T12:46:58Z","date_created":"2019-05-10T13:32:16Z","content_type":"application/pdf","file_name":"popl2017b.pdf"}],"ddc":["000"],"date_published":"2016-07-15T00:00:00Z","language":[{"iso":"eng"}],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:58Z","title":"Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds","date_updated":"2020-07-14T23:05:06Z","citation":{"short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.","mla":"Anonymous, 1, et al. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. IST Austria, 2016.","ieee":"1 Anonymous, 2 Anonymous, and 3 Anonymous, <i>Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds</i>. IST Austria, 2016.","ama":"Anonymous 1, Anonymous 2, Anonymous 3. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. IST Austria; 2016.","ista":"Anonymous 1, Anonymous 2, Anonymous 3. 2016. Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds, IST Austria, 20p.","chicago":"Anonymous, 1, 2 Anonymous, and 3 Anonymous. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. IST Austria, 2016.","apa":"Anonymous, 1, Anonymous, 2, &#38; Anonymous, 3. (2016). <i>Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds</i>. IST Austria."},"oa_version":"Published Version","author":[{"full_name":"Anonymous, 1","first_name":"1","last_name":"Anonymous"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"]},{"date_created":"2018-12-12T11:39:23Z","oa":1,"type":"technical_report","_id":"5448","day":"15","status":"public","year":"2016","publication_identifier":{"issn":["2664-1690"]},"page":"20","related_material":{"record":[{"relation":"later_version","id":"10417","status":"public"},{"id":"5456","relation":"later_version","status":"public"}]},"pubrep_id":"620","arxiv":1,"date_updated":"2023-02-23T12:27:16Z","citation":{"mla":"Anonymous, 1, et al. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2016.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2016.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, &#38; Anonymous, 4. (2016). <i>Data-centric dynamic partial order reduction</i>. IST Austria.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2016.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2016. Data-centric dynamic partial order reduction, IST Austria, 20p.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria; 2016.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, <i>Data-centric dynamic partial order reduction</i>. IST Austria, 2016."},"oa_version":"Published Version","author":[{"full_name":"Anonymous, 1","first_name":"1","last_name":"Anonymous"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"full_name":"Anonymous, 3","first_name":"3","last_name":"Anonymous"},{"full_name":"Anonymous, 4","first_name":"4","last_name":"Anonymous"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"external_id":{"arxiv":["1610.01188"]},"abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes."}],"has_accepted_license":"1","month":"07","publication_status":"published","file":[{"file_name":"IST-2016-620-v1+1_main.pdf","date_updated":"2020-07-14T12:46:58Z","date_created":"2018-12-12T11:53:45Z","content_type":"application/pdf","file_size":538881,"access_level":"open_access","creator":"system","checksum":"1d69252d66bcdf782615ddfb911d2957","file_id":"5506","relation":"main_file"},{"creator":"dernst","checksum":"deabb0eb8f237cae4f9542b28b0b6eb2","file_id":"6405","file_size":121,"access_level":"closed","relation":"main_file","file_name":"authornames.txt","content_type":"text/plain","date_updated":"2020-07-14T12:46:58Z","date_created":"2019-05-10T13:30:40Z"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:46:58Z","language":[{"iso":"eng"}],"date_published":"2016-07-15T00:00:00Z","publisher":"IST Austria","title":"Data-centric dynamic partial order reduction"},{"ddc":["519"],"file":[{"creator":"system","file_id":"5529","checksum":"8345a8c1e7d7f0cd92516d182b7fc59e","file_size":1264221,"access_level":"open_access","relation":"main_file","file_name":"IST-2016-648-v1+1_tr.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:58Z","date_created":"2018-12-12T11:54:07Z"}],"abstract":[{"lang":"eng","text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population.\r\nThe fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure.\r\nAmplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade.\r\nIn this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively."}],"has_accepted_license":"1","publication_status":"published","month":"11","title":"Amplification on undirected population structures: Comets beat stars","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:58Z","language":[{"iso":"eng"}],"date_published":"2016-11-09T00:00:00Z","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.","mla":"Pavlogiannis, Andreas, et al. <i>Amplification on Undirected Population Structures: Comets Beat Stars</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">10.15479/AT:IST-2016-648-v1-1</a>.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Amplification on undirected population structures: Comets beat stars</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">https://doi.org/10.15479/AT:IST-2016-648-v1-1</a>","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Amplification on Undirected Population Structures: Comets Beat Stars</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">https://doi.org/10.15479/AT:IST-2016-648-v1-1</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Amplification on Undirected Population Structures: Comets Beat Stars</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-648-v1-1\">10.15479/AT:IST-2016-648-v1-1</a>","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Amplification on undirected population structures: Comets beat stars</i>. IST Austria, 2016."},"oa_version":"Updated Version","date_updated":"2023-02-23T12:22:21Z","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"author":[{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"},{"first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"related_material":{"record":[{"status":"public","id":"512","relation":"later_version"}]},"pubrep_id":"648","_id":"5449","type":"technical_report","date_created":"2018-12-12T11:39:24Z","oa":1,"year":"2016","day":"09","status":"public","page":"22","doi":"10.15479/AT:IST-2016-648-v1-1","publication_identifier":{"issn":["2664-1690"]}},{"doi":"10.15479/AT:IST-2016-728-v1-1","publication_identifier":{"issn":["2664-1690"]},"page":"34","day":"30","status":"public","year":"2016","type":"technical_report","_id":"5451","date_created":"2018-12-12T11:39:24Z","oa":1,"pubrep_id":"728","alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"oa_version":"Published Version","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.","mla":"Pavlogiannis, Andreas, et al. <i>Strong Amplifiers of Natural Selection</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">10.15479/AT:IST-2016-728-v1-1</a>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Strong Amplifiers of Natural Selection</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">https://doi.org/10.15479/AT:IST-2016-728-v1-1</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Strong Amplifiers of Natural Selection</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">10.15479/AT:IST-2016-728-v1-1</a>","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Strong amplifiers of natural selection</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2016-728-v1-1\">https://doi.org/10.15479/AT:IST-2016-728-v1-1</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Strong amplifiers of natural selection</i>. IST Austria, 2016."},"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:27:05Z","title":"Strong amplifiers of natural selection","publisher":"IST Austria","date_published":"2016-12-30T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:59Z","file":[{"file_name":"IST-2016-728-v1+1_main.pdf","date_updated":"2020-07-14T12:46:59Z","date_created":"2018-12-12T11:53:04Z","content_type":"application/pdf","file_size":1014732,"access_level":"open_access","creator":"system","checksum":"7b8bb17c322c0556acba6ac169fa71c1","file_id":"5465","relation":"main_file"}],"ddc":["000"],"month":"12","has_accepted_license":"1","publication_status":"published"},{"project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Published Version","author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722"},{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"month":"12","has_accepted_license":"1","file":[{"file_name":"IST-2017-728-v2+1_main.pdf","date_created":"2018-12-12T11:52:59Z","date_updated":"2020-07-14T12:46:59Z","content_type":"application/pdf","access_level":"open_access","file_size":811558,"checksum":"58e895f26c82f560c0f0989bf8b08599","file_id":"5460","creator":"system","relation":"main_file"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2018-12-12T11:39:25Z","type":"technical_report","_id":"5452","status":"public","publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"750","ec_funded":1,"department":[{"_id":"KrCh"}],"date_updated":"2024-02-21T13:48:42Z","citation":{"ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria, 2016.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">https://doi.org/10.15479/AT:IST-2017-728-v2-1</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">10.15479/AT:IST-2017-728-v2-1</a>","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">https://doi.org/10.15479/AT:IST-2017-728-v2-1</a>","mla":"Pavlogiannis, Andreas, et al. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-728-v2-1\">10.15479/AT:IST-2017-728-v2-1</a>.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016."},"alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:46:59Z","publisher":"IST Austria","date_published":"2016-12-30T00:00:00Z","title":"Arbitrarily strong amplifiers of natural selection","oa":1,"year":"2016","page":"32","doi":"10.15479/AT:IST-2017-728-v2-1","day":"30","related_material":{"record":[{"id":"5453","relation":"later_version","status":"public"},{"status":"public","id":"5559","relation":"popular_science"}]}},{"date_created":"2018-12-12T11:39:25Z","oa":1,"type":"technical_report","_id":"5453","day":"30","page":"34","year":"2016","status":"public","doi":"10.15479/AT:IST-2017-749-v3-1","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"status":"public","id":"5452","relation":"earlier_version"}]},"pubrep_id":"755","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:27:07Z","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","mla":"Pavlogiannis, Andreas, et al. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-749-v3-1\">10.15479/AT:IST-2017-749-v3-1</a>.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria, 2016.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria, 2016. <a href=\"https://doi.org/10.15479/AT:IST-2017-749-v3-1\">https://doi.org/10.15479/AT:IST-2017-749-v3-1</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. <i>Arbitrarily Strong Amplifiers of Natural Selection</i>. IST Austria; 2016. doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-749-v3-1\">10.15479/AT:IST-2017-749-v3-1</a>","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2016). <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2017-749-v3-1\">https://doi.org/10.15479/AT:IST-2017-749-v3-1</a>"},"oa_version":"Published Version","author":[{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas"},{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"12","has_accepted_license":"1","file":[{"file_name":"IST-2017-749-v3+1_main.pdf","date_created":"2018-12-12T11:53:13Z","date_updated":"2020-07-14T12:46:59Z","content_type":"application/pdf","access_level":"open_access","file_size":1015647,"file_id":"5474","checksum":"83b0313dab3bff4bdb6ac38695026fda","creator":"system","relation":"main_file"}],"ddc":["000"],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:59Z","date_published":"2016-12-30T00:00:00Z","language":[{"iso":"eng"}],"title":"Arbitrarily strong amplifiers of natural selection"},{"type":"research_data","_id":"5550","date_created":"2018-12-12T12:31:29Z","oa":1,"datarep_id":"34","license":"https://creativecommons.org/publicdomain/zero/1.0/","day":"19","status":"public","year":"2016","doi":"10.15479/AT:ISTA:34","related_material":{"record":[{"id":"1382","relation":"research_paper","status":"public"}]},"publist_id":"5828","oa_version":"Published Version","citation":{"ama":"Ellis T, Field D. Flower colour data and phylogeny (NEXUS) files. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:34\">10.15479/AT:ISTA:34</a>","chicago":"Ellis, Thomas, and David Field. “Flower Colour Data and Phylogeny (NEXUS) Files.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:34\">https://doi.org/10.15479/AT:ISTA:34</a>.","ista":"Ellis T, Field D. 2016. Flower colour data and phylogeny (NEXUS) files, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:34\">10.15479/AT:ISTA:34</a>.","apa":"Ellis, T., &#38; Field, D. (2016). Flower colour data and phylogeny (NEXUS) files. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:34\">https://doi.org/10.15479/AT:ISTA:34</a>","ieee":"T. Ellis and D. Field, “Flower colour data and phylogeny (NEXUS) files.” Institute of Science and Technology Austria, 2016.","short":"T. Ellis, D. Field, (2016).","mla":"Ellis, Thomas, and David Field. <i>Flower Colour Data and Phylogeny (NEXUS) Files</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:34\">10.15479/AT:ISTA:34</a>."},"department":[{"_id":"NiBa"}],"date_updated":"2024-02-21T13:49:54Z","tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","full_name":"Ellis, Thomas","first_name":"Thomas","last_name":"Ellis","orcid":"0000-0002-8511-0254"},{"full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","last_name":"Field","first_name":"David"}],"file":[{"relation":"main_file","checksum":"950f85b80427d357bfeff09608ba02e9","file_id":"5594","creator":"system","access_level":"open_access","file_size":4468543,"content_type":"application/zip","date_created":"2018-12-12T13:02:27Z","date_updated":"2020-07-14T12:47:00Z","file_name":"IST-2016-34-v1+1_tellis_flower_colour_data.zip"}],"ddc":["576"],"has_accepted_license":"1","month":"02","abstract":[{"text":"We collected flower colour information on species in the tribe Antirrhineae from taxonomic literature. We also retreived molecular data from GenBank for as many of these species as possible to estimate phylogenetic relationships among these taxa. We then used the R package 'diversitree' to examine patterns of evolutionary transitions between anthocyanin and yellow pigmentation across the phylogeny.\r\n\r\nFor full details of the methods see:\r\nEllis TJ and Field DL \"Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae”, Annals of Botany (in press)","lang":"eng"}],"title":"Flower colour data and phylogeny (NEXUS) files","article_processing_charge":"No","date_published":"2016-02-19T00:00:00Z","file_date_updated":"2020-07-14T12:47:00Z","publisher":"Institute of Science and Technology Austria"},{"department":[{"_id":"NiBa"}],"date_updated":"2024-02-21T13:51:27Z","contributor":[{"first_name":"David","last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"citation":{"ama":"Ellis T. Data on pollinator observations and offpsring phenotypes. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:35\">10.15479/AT:ISTA:35</a>","chicago":"Ellis, Thomas. “Data on Pollinator Observations and Offpsring Phenotypes.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:35\">https://doi.org/10.15479/AT:ISTA:35</a>.","ista":"Ellis T. 2016. Data on pollinator observations and offpsring phenotypes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:35\">10.15479/AT:ISTA:35</a>.","apa":"Ellis, T. (2016). Data on pollinator observations and offpsring phenotypes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:35\">https://doi.org/10.15479/AT:ISTA:35</a>","ieee":"T. Ellis, “Data on pollinator observations and offpsring phenotypes.” Institute of Science and Technology Austria, 2016.","short":"T. Ellis, (2016).","mla":"Ellis, Thomas. <i>Data on Pollinator Observations and Offpsring Phenotypes</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:35\">10.15479/AT:ISTA:35</a>."},"oa_version":"Published Version","author":[{"orcid":"0000-0002-8511-0254","last_name":"Ellis","first_name":"Thomas","full_name":"Ellis, Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"has_accepted_license":"1","month":"02","abstract":[{"text":"Data from array experiments investigating pollinator behaviour on snapdragons in controlled conditions, and their effect on plant mating. Data were collected as part of Tom Ellis' PhD thesis , submitted February 2016.\r\n\r\nWe placed a total of 36 plants in a grid inside a closed organza tent, with a single hive of commercially bred bumblebees (Bombus hortorum). We used only the yellow-flowered Antirrhinum majus striatum and the magenta-flowered Antirrhinum majus pseudomajus, at ratios of 6:36, 12:24, 18:18, 24:12 and 30:6.\r\n\r\nAfter 24 hours to learn how to deal with snapdragons, I observed pollinators foraging on plants, and recorded the transitions between plants. Thereafter seeds on plants were allowed to develops. A sample of these were grown to maturity when their flower colour could be determined, and they were scored as yellow, magenta, or hybrid.","lang":"eng"}],"file":[{"relation":"main_file","checksum":"aa3eb85d52b110cd192aa23147c4d4f3","file_id":"5640","creator":"system","access_level":"open_access","file_size":32775,"content_type":"application/zip","date_created":"2018-12-12T13:05:12Z","date_updated":"2020-07-14T12:47:01Z","file_name":"IST-2016-35-v1+1_array_data.zip"}],"date_published":"2016-02-19T00:00:00Z","file_date_updated":"2020-07-14T12:47:01Z","publisher":"Institute of Science and Technology Austria","title":"Data on pollinator observations and offpsring phenotypes","article_processing_charge":"No","date_created":"2018-12-12T12:31:29Z","oa":1,"datarep_id":"35","_id":"5551","type":"research_data","doi":"10.15479/AT:ISTA:35","day":"19","status":"public","year":"2016","related_material":{"record":[{"id":"1398","relation":"research_paper","status":"public"}]}},{"type":"research_data","_id":"5552","date_created":"2018-12-12T12:31:30Z","oa":1,"datarep_id":"36","day":"19","doi":"10.15479/AT:ISTA:36","year":"2016","status":"public","related_material":{"record":[{"status":"public","id":"1398","relation":"research_paper"}]},"contributor":[{"last_name":"Field","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"oa_version":"Published Version","citation":{"ista":"Ellis T. 2016. Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data., Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:36\">10.15479/AT:ISTA:36</a>.","chicago":"Ellis, Thomas. “Pollinator Visitation Data for Wild Antirrhinum Majus Plants, with Phenotypic and Frequency Data.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:36\">https://doi.org/10.15479/AT:ISTA:36</a>.","ama":"Ellis T. Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:36\">10.15479/AT:ISTA:36</a>","apa":"Ellis, T. (2016). Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:36\">https://doi.org/10.15479/AT:ISTA:36</a>","ieee":"T. Ellis, “Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.” Institute of Science and Technology Austria, 2016.","short":"T. Ellis, (2016).","mla":"Ellis, Thomas. <i>Pollinator Visitation Data for Wild Antirrhinum Majus Plants, with Phenotypic and Frequency Data.</i> Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:36\">10.15479/AT:ISTA:36</a>."},"department":[{"_id":"NiBa"}],"date_updated":"2024-02-21T13:51:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-8511-0254","first_name":"Thomas","last_name":"Ellis","full_name":"Ellis, Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_name":"IST-2016-36-v1+1_tag_assay_archive.zip","date_created":"2018-12-12T13:03:07Z","date_updated":"2020-07-14T12:47:01Z","content_type":"application/zip","access_level":"open_access","file_size":44905,"file_id":"5625","checksum":"cbc61b523d4d475a04a737d50dc470ef","creator":"system","relation":"main_file"}],"month":"02","has_accepted_license":"1","abstract":[{"text":"Data on pollinator visitation to wild snapdragons in a natural hybrid zone, collected as part of Tom Ellis' PhD thesis (submitted February 2016).\r\n\r\nSnapdragon flowers have a mouth-like structure which pollinators must open to access nectar. We placed 5mm cellophane tags in these mouths, which are held in place by the pressure of the flower until a pollinator visits. When she opens the flower, the tag drops out, and one can infer a visit. We surveyed plants over multiple days in 2010, 2011 and 2012.\r\n\r\nAlso included are data on phenotypic and demographic variables which may be explanatory variables for pollinator visitation.","lang":"eng"}],"title":"Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:01Z","publisher":"Institute of Science and Technology Austria","date_published":"2016-02-19T00:00:00Z"},{"keyword":["paternity assignment","pedigree","matting patterns","assortative mating","Antirrhinum majus","frequency-dependent selection","plant-pollinator interaction"],"related_material":{"record":[{"relation":"research_paper","id":"1398","status":"public"}]},"year":"2016","status":"public","day":"19","doi":"10.15479/AT:ISTA:37","oa":1,"date_created":"2018-12-12T12:31:30Z","datarep_id":"37","_id":"5553","type":"research_data","file_date_updated":"2020-07-14T12:47:01Z","date_published":"2016-02-19T00:00:00Z","publisher":"Institute of Science and Technology Austria","title":"Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012","article_processing_charge":"No","month":"02","has_accepted_license":"1","abstract":[{"text":"Genotypic, phenotypic and demographic data for 2128 wild snapdragons and 1127 open-pollinated progeny from a natural hybrid zone, collected as part of Tom Ellis' PhD thesis (submitted) February 2016).\r\n\r\nTissue samples were sent to LGC Genomics in Berlin for DNA extraction, and genotyping at 70 SNP markers by KASPR genotyping. 29 of these SNPs failed to amplify reliably, and have been removed from this dataset.\r\n\r\nOther data were retreived from an online database of this population at www.antspec.org.","lang":"eng"}],"ddc":["576"],"file":[{"file_name":"IST-2016-37-v1+1_paternity_archive.zip","content_type":"application/zip","date_created":"2018-12-12T13:03:02Z","date_updated":"2020-07-14T12:47:01Z","file_id":"5620","checksum":"4ae751b1fa4897fa216241f975a57313","creator":"system","access_level":"open_access","file_size":132808,"relation":"main_file"}],"author":[{"last_name":"Field","first_name":"David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David"},{"last_name":"Ellis","first_name":"Thomas","orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","full_name":"Ellis, Thomas"}],"tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"NiBa"}],"date_updated":"2024-02-21T13:51:14Z","contributor":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","contributor_type":"project_manager","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"citation":{"mla":"Field, David, and Thomas Ellis. <i>Inference of Mating Patterns among Wild Snapdragons in a Natural Hybrid Zone in 2012</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:37\">10.15479/AT:ISTA:37</a>.","short":"D. Field, T. Ellis, (2016).","ieee":"D. Field and T. Ellis, “Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012.” Institute of Science and Technology Austria, 2016.","ama":"Field D, Ellis T. Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:37\">10.15479/AT:ISTA:37</a>","chicago":"Field, David, and Thomas Ellis. “Inference of Mating Patterns among Wild Snapdragons in a Natural Hybrid Zone in 2012.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:37\">https://doi.org/10.15479/AT:ISTA:37</a>.","ista":"Field D, Ellis T. 2016. Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:37\">10.15479/AT:ISTA:37</a>.","apa":"Field, D., &#38; Ellis, T. (2016). Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:37\">https://doi.org/10.15479/AT:ISTA:37</a>"},"oa_version":"Published Version"},{"day":"12","year":"2016","status":"public","doi":"10.15479/AT:ISTA:43","datarep_id":"43","oa":1,"date_created":"2018-12-12T12:31:30Z","_id":"5554","type":"research_data","related_material":{"record":[{"id":"1131","relation":"used_in_publication","status":"public"}]},"keyword":["RNAP binding","de novo promoter evolution","lac promoter"],"author":[{"orcid":"0000-0002-8523-0758","last_name":"Tugrul","first_name":"Murat","full_name":"Tugrul, Murat","id":"37C323C6-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:50:34Z","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"citation":{"short":"M. Tugrul, (2016).","mla":"Tugrul, Murat. <i>Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:43\">10.15479/AT:ISTA:43</a>.","ista":"Tugrul M. 2016. Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:43\">10.15479/AT:ISTA:43</a>.","ama":"Tugrul M. Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:43\">10.15479/AT:ISTA:43</a>","chicago":"Tugrul, Murat. “Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:43\">https://doi.org/10.15479/AT:ISTA:43</a>.","apa":"Tugrul, M. (2016). Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:43\">https://doi.org/10.15479/AT:ISTA:43</a>","ieee":"M. Tugrul, “Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.” Institute of Science and Technology Austria, 2016."},"oa_version":"Published Version","contributor":[{"id":"2C023F40-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Steinrück","first_name":"Magdalena"},{"first_name":"Fabienne","last_name":"Jesse","contributor_type":"researcher","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:01Z","date_published":"2016-05-12T00:00:00Z","article_processing_charge":"No","title":"Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase","abstract":[{"text":"The data stored here is used in Murat Tugrul's PhD thesis (Chapter 3), which is related to the evolution of bacterial RNA polymerase binding.\r\nMagdalena Steinrueck (PhD Student in Calin Guet's group at IST Austria) performed the experiments and created the data on de novo promoter evolution. Fabienne Jesse (PhD Student in Jon Bollback's group at IST Austria) performed the experiments and created the data on lac promoter evolution.","lang":"eng"}],"month":"05","has_accepted_license":"1","file":[{"date_created":"2018-12-12T13:03:08Z","date_updated":"2020-07-14T12:47:01Z","content_type":"application/zip","file_name":"IST-2016-43-v1+1_DATA_MTugrul_PhDThesis_Chapter3.zip","relation":"main_file","access_level":"open_access","file_size":1123495,"file_id":"5626","checksum":"1fc0a10bb7ce110fcb5e1fbe3cf0c4e2","creator":"system"}]},{"doi":"10.15479/AT:ISTA:44","status":"public","day":"08","year":"2016","date_created":"2018-12-12T12:31:31Z","oa":1,"datarep_id":"44","type":"research_data","_id":"5555","keyword":["cell migration","wide field microscopy","FIJI"],"author":[{"orcid":"0000-0001-9843-3522","first_name":"Robert","last_name":"Hauschild","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"}],"tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"Bio"}],"date_updated":"2024-02-21T13:50:06Z","citation":{"mla":"Hauschild, Robert. <i>Fiji Script to Determine Average Speed and Direction of Migration of Cells</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:44\">10.15479/AT:ISTA:44</a>.","short":"R. Hauschild, (2016).","ieee":"R. Hauschild, “Fiji script to determine average speed and direction of migration of cells.” Institute of Science and Technology Austria, 2016.","chicago":"Hauschild, Robert. “Fiji Script to Determine Average Speed and Direction of Migration of Cells.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:44\">https://doi.org/10.15479/AT:ISTA:44</a>.","ama":"Hauschild R. Fiji script to determine average speed and direction of migration of cells. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:44\">10.15479/AT:ISTA:44</a>","ista":"Hauschild R. 2016. Fiji script to determine average speed and direction of migration of cells, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:44\">10.15479/AT:ISTA:44</a>.","apa":"Hauschild, R. (2016). Fiji script to determine average speed and direction of migration of cells. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:44\">https://doi.org/10.15479/AT:ISTA:44</a>"},"oa_version":"Published Version","date_published":"2016-07-08T00:00:00Z","file_date_updated":"2020-07-14T12:47:02Z","publisher":"Institute of Science and Technology Austria","title":"Fiji script to determine average speed and direction of migration of cells","article_processing_charge":"No","has_accepted_license":"1","month":"07","abstract":[{"text":"This FIJI script calculates the population average of the migration speed as a function of time of all cells from wide field microscopy movies.","lang":"eng"}],"ddc":["570"],"file":[{"relation":"main_file","file_id":"5621","checksum":"9f96cddbcd4ed689f48712ffe234d5e5","creator":"system","access_level":"open_access","file_size":20692,"content_type":"application/zip","date_created":"2018-12-12T13:03:03Z","date_updated":"2020-07-14T12:47:02Z","file_name":"IST-2016-44-v1+1_migrationAnalyzer.zip"}]},{"oa_version":"Published Version","citation":{"ieee":"M. Lukacisin, M. Landon, and R. Jajoo, “MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016.","apa":"Lukacisin, M., Landon, M., &#38; Jajoo, R. (2016). MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:45\">https://doi.org/10.15479/AT:ISTA:45</a>","ista":"Lukacisin M, Landon M, Jajoo R. 2016. MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>.","ama":"Lukacisin M, Landon M, Jajoo R. MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>","chicago":"Lukacisin, Martin, Matthieu Landon, and Rishi Jajoo. “MATLAB Analysis Code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:45\">https://doi.org/10.15479/AT:ISTA:45</a>.","mla":"Lukacisin, Martin, et al. <i>MATLAB Analysis Code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.”</i> Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>.","short":"M. Lukacisin, M. Landon, R. Jajoo, (2016)."},"department":[{"_id":"ToBo"}],"date_updated":"2024-02-21T13:51:53Z","tmp":{"image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Lukacisin","first_name":"Martin","orcid":"0000-0001-6549-4177","id":"298FFE8C-F248-11E8-B48F-1D18A9856A87","full_name":"Lukacisin, Martin"},{"full_name":"Landon, Matthieu","first_name":"Matthieu","last_name":"Landon"},{"full_name":"Jajoo, Rishi","first_name":"Rishi","last_name":"Jajoo"}],"file":[{"file_name":"IST-2016-45-v1+1_PaperCode.zip","content_type":"application/zip","date_updated":"2020-07-14T12:47:02Z","date_created":"2018-12-12T13:02:58Z","creator":"system","file_id":"5616","checksum":"ee697f2b1ade4dc14d6ac0334dd832ab","file_size":296722548,"access_level":"open_access","relation":"main_file"}],"ddc":["571"],"has_accepted_license":"1","month":"08","abstract":[{"lang":"eng","text":"MATLAB code and processed datasets available for reproducing the results in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.\r\n*equal contributions"}],"title":"MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'","article_processing_charge":"No","date_published":"2016-08-25T00:00:00Z","file_date_updated":"2020-07-14T12:47:02Z","publisher":"Institute of Science and Technology Austria","_id":"5556","type":"research_data","oa":1,"date_created":"2018-12-12T12:31:31Z","datarep_id":"45","license":"https://creativecommons.org/licenses/by-sa/4.0/","status":"public","year":"2016","day":"25","doi":"10.15479/AT:ISTA:45","keyword":["transcription","pausing","backtracking","polymerase","RNA","NET-seq","nucleosome","basepairing"],"related_material":{"record":[{"relation":"used_in_publication","id":"8431","status":"deleted"},{"id":"1029","relation":"research_paper","status":"public"}]}},{"citation":{"mla":"Swoboda, Paul. <i>Synthetic Discrete Tomography Problems</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","short":"P. Swoboda, (2016).","ieee":"P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science and Technology Austria, 2016.","apa":"Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>","ama":"Swoboda P. Synthetic discrete tomography problems. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>","ista":"Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","chicago":"Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>."},"oa_version":"Published Version","contributor":[{"contributor_type":"data_collector","first_name":"Jan","last_name":"Kuske"}],"date_updated":"2024-02-21T13:50:21Z","department":[{"_id":"VlKo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"author":[{"first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_name":"IST-2016-46-v1+1_discrete_tomography_synthetic.zip","content_type":"application/zip","date_updated":"2020-07-14T12:47:02Z","date_created":"2018-12-12T13:05:19Z","creator":"system","checksum":"aa5a16a0dc888da7186fb8fc45e88439","file_id":"5645","file_size":36058401,"access_level":"open_access","relation":"main_file"}],"ddc":["006"],"abstract":[{"text":"Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and 256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5.","lang":"eng"}],"month":"09","has_accepted_license":"1","article_processing_charge":"No","title":"Synthetic discrete tomography problems","date_published":"2016-09-20T00:00:00Z","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:02Z","type":"research_data","_id":"5557","datarep_id":"46","date_created":"2018-12-12T12:31:31Z","oa":1,"doi":"10.15479/AT:ISTA:46","status":"public","year":"2016","day":"20","keyword":["discrete tomography"]}]