[{"language":[{"iso":"eng"}],"volume":116,"intvolume":"       116","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2016-06-10T00:00:00Z","date_created":"2020-04-30T11:40:10Z","quality_controlled":"1","date_updated":"2021-01-12T08:15:21Z","article_type":"original","extern":"1","issue":"23","publication_identifier":{"issn":["0031-9007","1079-7114"]},"article_number":"235501","_id":"7761","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study the effect of dilute pinning on the jamming transition. Pinning reduces the average contact number needed to jam unpinned particles and shifts the jamming threshold to lower densities, leading to a pinning susceptibility, χp. Our main results are that this susceptibility obeys scaling form and diverges in the thermodynamic limit as χp∝|ϕ−ϕ∞c|−γp where ϕ∞c is the jamming threshold in the absence of pins. Finite-size scaling arguments yield these values with associated statistical (systematic) errors γp=1.018±0.026(0.291) in d=2 and γp=1.534±0.120(0.822) in d=3. Logarithmic corrections raise the exponent in d=2 to close to the d=3 value, although the systematic errors are very large."}],"publication_status":"published","month":"06","oa_version":"None","year":"2016","title":"Pinning susceptibility: The effect of dilute, quenched disorder on jamming","status":"public","publication":"Physical Review Letters","publisher":"American Physical Society","citation":{"mla":"Graves, Amy L., et al. “Pinning Susceptibility: The Effect of Dilute, Quenched Disorder on Jamming.” <i>Physical Review Letters</i>, vol. 116, no. 23, 235501, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/physrevlett.116.235501\">10.1103/physrevlett.116.235501</a>.","chicago":"Graves, Amy L., Samer Nashed, Elliot Padgett, Carl Peter Goodrich, Andrea J. Liu, and James P. Sethna. “Pinning Susceptibility: The Effect of Dilute, Quenched Disorder on Jamming.” <i>Physical Review Letters</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/physrevlett.116.235501\">https://doi.org/10.1103/physrevlett.116.235501</a>.","ieee":"A. L. Graves, S. Nashed, E. Padgett, C. P. Goodrich, A. J. Liu, and J. P. Sethna, “Pinning susceptibility: The effect of dilute, quenched disorder on jamming,” <i>Physical Review Letters</i>, vol. 116, no. 23. American Physical Society, 2016.","apa":"Graves, A. L., Nashed, S., Padgett, E., Goodrich, C. P., Liu, A. J., &#38; Sethna, J. P. (2016). Pinning susceptibility: The effect of dilute, quenched disorder on jamming. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.116.235501\">https://doi.org/10.1103/physrevlett.116.235501</a>","short":"A.L. Graves, S. Nashed, E. Padgett, C.P. Goodrich, A.J. Liu, J.P. Sethna, Physical Review Letters 116 (2016).","ista":"Graves AL, Nashed S, Padgett E, Goodrich CP, Liu AJ, Sethna JP. 2016. Pinning susceptibility: The effect of dilute, quenched disorder on jamming. Physical Review Letters. 116(23), 235501.","ama":"Graves AL, Nashed S, Padgett E, Goodrich CP, Liu AJ, Sethna JP. Pinning susceptibility: The effect of dilute, quenched disorder on jamming. <i>Physical Review Letters</i>. 2016;116(23). doi:<a href=\"https://doi.org/10.1103/physrevlett.116.235501\">10.1103/physrevlett.116.235501</a>"},"doi":"10.1103/physrevlett.116.235501","author":[{"first_name":"Amy L.","last_name":"Graves","full_name":"Graves, Amy L."},{"full_name":"Nashed, Samer","first_name":"Samer","last_name":"Nashed"},{"full_name":"Padgett, Elliot","last_name":"Padgett","first_name":"Elliot"},{"orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","full_name":"Goodrich, Carl Peter","last_name":"Goodrich","first_name":"Carl Peter"},{"first_name":"Andrea J.","last_name":"Liu","full_name":"Liu, Andrea J."},{"first_name":"James P.","last_name":"Sethna","full_name":"Sethna, James P."}],"day":"10","type":"journal_article"},{"article_processing_charge":"No","publication_status":"published","abstract":[{"text":"Characterizing structural inhomogeneity is an essential step in understanding the mechanical response of amorphous materials. We introduce a threshold-free measure based on the field of vectors pointing from the center of each particle to the centroid of the Voronoi cell in which the particle resides. These vectors tend to point in toward regions of high free volume and away from regions of low free volume, reminiscent of sinks and sources in a vector field. We compute the local divergence of these vectors, where positive values correspond to overpacked regions and negative values identify underpacked regions within the material. Distributions of this divergence are nearly Gaussian with zero mean, allowing for structural characterization using only the moments of the distribution. We explore how the standard deviation and skewness vary with the packing fraction for simulations of bidisperse systems and find a kink in these moments that coincides with the jamming transition.","lang":"eng"}],"month":"02","_id":"7762","article_number":"088001 ","publication_identifier":{"issn":["0031-9007","1079-7114"]},"issue":"8","extern":"1","date_updated":"2021-01-12T08:15:22Z","article_type":"original","date_created":"2020-04-30T11:40:25Z","quality_controlled":"1","date_published":"2016-02-23T00:00:00Z","language":[{"iso":"eng"}],"volume":116,"intvolume":"       116","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","day":"23","author":[{"full_name":"Rieser, Jennifer M.","last_name":"Rieser","first_name":"Jennifer M."},{"full_name":"Goodrich, Carl Peter","last_name":"Goodrich","first_name":"Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074"},{"last_name":"Liu","first_name":"Andrea J.","full_name":"Liu, Andrea J."},{"first_name":"Douglas J.","last_name":"Durian","full_name":"Durian, Douglas J."}],"publisher":"American Physical Society","doi":"10.1103/physrevlett.116.088001","citation":{"chicago":"Rieser, Jennifer M., Carl Peter Goodrich, Andrea J. Liu, and Douglas J. Durian. “Divergence of Voronoi Cell Anisotropy Vector: A Threshold-Free Characterization of Local Structure in Amorphous Materials.” <i>Physical Review Letters</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/physrevlett.116.088001\">https://doi.org/10.1103/physrevlett.116.088001</a>.","mla":"Rieser, Jennifer M., et al. “Divergence of Voronoi Cell Anisotropy Vector: A Threshold-Free Characterization of Local Structure in Amorphous Materials.” <i>Physical Review Letters</i>, vol. 116, no. 8, 088001, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/physrevlett.116.088001\">10.1103/physrevlett.116.088001</a>.","apa":"Rieser, J. M., Goodrich, C. P., Liu, A. J., &#38; Durian, D. J. (2016). Divergence of Voronoi cell anisotropy vector: A threshold-free characterization of local structure in amorphous materials. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.116.088001\">https://doi.org/10.1103/physrevlett.116.088001</a>","ieee":"J. M. Rieser, C. P. Goodrich, A. J. Liu, and D. J. Durian, “Divergence of Voronoi cell anisotropy vector: A threshold-free characterization of local structure in amorphous materials,” <i>Physical Review Letters</i>, vol. 116, no. 8. American Physical Society, 2016.","ista":"Rieser JM, Goodrich CP, Liu AJ, Durian DJ. 2016. Divergence of Voronoi cell anisotropy vector: A threshold-free characterization of local structure in amorphous materials. Physical Review Letters. 116(8), 088001.","ama":"Rieser JM, Goodrich CP, Liu AJ, Durian DJ. Divergence of Voronoi cell anisotropy vector: A threshold-free characterization of local structure in amorphous materials. <i>Physical Review Letters</i>. 2016;116(8). doi:<a href=\"https://doi.org/10.1103/physrevlett.116.088001\">10.1103/physrevlett.116.088001</a>","short":"J.M. Rieser, C.P. Goodrich, A.J. Liu, D.J. Durian, Physical Review Letters 116 (2016)."},"title":"Divergence of Voronoi cell anisotropy vector: A threshold-free characterization of local structure in amorphous materials","year":"2016","status":"public","publication":"Physical Review Letters","oa_version":"None"},{"_id":"460","publication_status":"published","abstract":[{"lang":"eng","text":"NF-κB signaling is a central pathway of immunity and integrates signal transduction upon a wide array of inflammatory stimuli. Noncanonical NF-κB signaling is activated by a small subset of TNF family receptors and characterized by NF-κB2/p52 transcriptional activity. The medical relevance of this pathway has recently re-emerged from the discovery of primary immunodeficiency patients that have loss-of-function mutations in the MAP3K14 gene encoding NIK. Nevertheless, knowledge of protein interactions that regulate noncanonical NF-κB signaling is sparse. Here we report a detailed state-of-the-art mass spectrometry-based protein–protein interaction network including the noncanonical NF-κB signaling nodes TRAF2, TRAF3, IKKα, NIK, and NF-κB2/p100. The value of the data set was confirmed by the identification of interactions already known to regulate this pathway. In addition, a remarkable number of novel interactors were identified. We provide validation of the novel NIK and IKKα interactor FKBP8, which may regulate processes downstream of noncanonical NF-κB signaling. To understand perturbed noncanonical NF-κB signaling in the context of misregulated NIK in disease, we also provide a differential interactome of NIK mutants that cause immunodeficiency. Altogether, this data set not only provides critical insight into how protein–protein interactions can regulate immune signaling but also offers a novel resource on noncanonical NF-κB signaling."}],"month":"07","intvolume":"        15","volume":15,"date_created":"2018-12-11T11:46:36Z","quality_controlled":0,"date_published":"2016-07-15T00:00:00Z","date_updated":"2021-01-12T08:00:24Z","issue":"9","extern":1,"page":"2900 - 2909","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5295629/","open_access":"1"}],"author":[{"last_name":"Willmann","first_name":"Katharina","full_name":"Willmann, Katharina L"},{"first_name":"Roberto","last_name":"Sacco","full_name":"Roberto Sacco","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Martins, Rui","last_name":"Martins","first_name":"Rui"},{"first_name":"Wojciech","last_name":"Garncarz","full_name":"Garncarz, Wojciech"},{"last_name":"Krolo","first_name":"Ana","full_name":"Krolo, Ana"},{"last_name":"Knapp","first_name":"Sylvia","full_name":"Knapp, Sylvia"},{"last_name":"Bennett","first_name":"Keiryn","full_name":"Bennett, Keiryn L"},{"full_name":"Boztug, Kaan","first_name":"Kaan","last_name":"Boztug"}],"day":"15","type":"journal_article","publist_id":"7361","oa":1,"acknowledgement":"Austrian Science Fund (FWF) Lise Meitner Program Fellowship (FWF M-1809, to K.L.W.),  FWF Infect-ERA framework (I-1620_B22, to S.K.), European Research Council (ERC StG 310857, to K.B.)\nWe thank Jacques Colinge, André C. Müller, and Peter Májek for fruitful discussions and Elisabeth Salzer and Kate G. Ackermann for critically reading the manuscript. We thank Giulio Superti-Furga for providing pTO-SII-HA-GW plasmids. \n\n","title":"Expanding the interactome of the noncanonical NF-κB signaling pathway","year":"2016","status":"public","publication":"Journal of Proteome Research","citation":{"ama":"Willmann K, Sacco R, Martins R, et al. Expanding the interactome of the noncanonical NF-κB signaling pathway. <i>Journal of Proteome Research</i>. 2016;15(9):2900-2909. doi:<a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">10.1021/acs.jproteome.5b01004</a>","ista":"Willmann K, Sacco R, Martins R, Garncarz W, Krolo A, Knapp S, Bennett K, Boztug K. 2016. Expanding the interactome of the noncanonical NF-κB signaling pathway. Journal of Proteome Research. 15(9), 2900–2909.","short":"K. Willmann, R. Sacco, R. Martins, W. Garncarz, A. Krolo, S. Knapp, K. Bennett, K. Boztug, Journal of Proteome Research 15 (2016) 2900–2909.","ieee":"K. Willmann <i>et al.</i>, “Expanding the interactome of the noncanonical NF-κB signaling pathway,” <i>Journal of Proteome Research</i>, vol. 15, no. 9. American Chemical Society, pp. 2900–2909, 2016.","apa":"Willmann, K., Sacco, R., Martins, R., Garncarz, W., Krolo, A., Knapp, S., … Boztug, K. (2016). Expanding the interactome of the noncanonical NF-κB signaling pathway. <i>Journal of Proteome Research</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">https://doi.org/10.1021/acs.jproteome.5b01004</a>","chicago":"Willmann, Katharina, Roberto Sacco, Rui Martins, Wojciech Garncarz, Ana Krolo, Sylvia Knapp, Keiryn Bennett, and Kaan Boztug. “Expanding the Interactome of the Noncanonical NF-ΚB Signaling Pathway.” <i>Journal of Proteome Research</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">https://doi.org/10.1021/acs.jproteome.5b01004</a>.","mla":"Willmann, Katharina, et al. “Expanding the Interactome of the Noncanonical NF-ΚB Signaling Pathway.” <i>Journal of Proteome Research</i>, vol. 15, no. 9, American Chemical Society, 2016, pp. 2900–09, doi:<a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">10.1021/acs.jproteome.5b01004</a>."},"doi":"10.1021/acs.jproteome.5b01004","publisher":"American Chemical Society"},{"abstract":[{"lang":"eng","text":"Magic: the Gathering is a game about magical combat for any number of players. Formally it is a zero-sum, imperfect information stochastic game that consists of a potentially unbounded number of steps. We consider the problem of deciding if a move is legal in a given single step of Magic. We show that the problem is (a) coNP-complete in general; and (b) in P if either of two small sets of cards are not used. Our lower bound holds even for single-player Magic games. The significant aspects of our results are as follows: First, in most real-life game problems, the task of deciding whether a given move is legal in a single step is trivial, and the computationally hard task is to find the best sequence of legal moves in the presence of multiple players. In contrast, quite uniquely our hardness result holds for single step and with only one-player. Second, we establish efficient algorithms for important special cases of Magic."}],"publication_status":"published","intvolume":"       285","volume":285,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:41Z","pubrep_id":"950","scopus_import":1,"day":"01","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"license":"https://creativecommons.org/licenses/by-nc/4.0/","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Deciding Legality of a Single Step of Magic: The Gathering</i>. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">10.3233/978-1-61499-672-9-1432</a>.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">https://doi.org/10.3233/978-1-61499-672-9-1432</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">https://doi.org/10.3233/978-1-61499-672-9-1432</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">10.3233/978-1-61499-672-9-1432</a>","ista":"Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439."},"department":[{"_id":"KrCh"}],"_id":"478","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"month":"01","language":[{"iso":"eng"}],"date_published":"2016-01-01T00:00:00Z","quality_controlled":"1","date_updated":"2021-01-12T08:00:54Z","file":[{"content_type":"application/pdf","access_level":"open_access","checksum":"848043c812ace05e459579c923f3d3cf","relation":"main_file","file_name":"IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf","creator":"system","file_id":"4658","date_created":"2018-12-12T10:07:59Z","date_updated":"2020-07-14T12:46:35Z","file_size":2116225}],"page":"1432 - 1439","file_date_updated":"2020-07-14T12:46:35Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"conference":{"location":"The Hague, Netherlands","start_date":"2016-08-29","name":"ECAI: European Conference on Artificial Intelligence","end_date":"2016-09-02"},"type":"conference","has_accepted_license":"1","oa_version":"Published Version","publist_id":"7342","year":"2016","status":"public","title":"The complexity of deciding legality of a single step of magic: The gathering","publisher":"IOS Press","ddc":["004"],"doi":"10.3233/978-1-61499-672-9-1432"},{"publist_id":"7341","oa_version":"None","year":"2016","title":"Use runtime verification to improve the quality of medical care practice","status":"public","publication":"Proceedings of the 38th International Conference on Software Engineering Companion ","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","publisher":"IEEE","doi":"10.1145/2889160.2889233","citation":{"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>.","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>.","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.","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>","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.","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>","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."},"department":[{"_id":"ToHe"}],"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","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui","last_name":"Kong","full_name":"Kong, Hui"},{"full_name":"Wang, Rui","first_name":"Rui","last_name":"Wang"},{"first_name":"Mohamad","last_name":"Hosseini","full_name":"Hosseini, Mohamad"},{"full_name":"Sun, Jiaguang","last_name":"Sun","first_name":"Jiaguang"},{"last_name":"Sha","first_name":"Lui","full_name":"Sha, Lui"}],"scopus_import":1,"day":"14","alternative_title":["Proceedings International Conference on Software Engineering"],"conference":{"start_date":"2016-05-14","name":"ICSE: International Conference on Software Engineering","end_date":"2016-05-22","location":"Austin, TX, USA"},"type":"conference","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:42Z","date_published":"2016-05-14T00:00:00Z","quality_controlled":"1","date_updated":"2021-01-12T08:00:55Z","page":"112 - 121","_id":"479","publication_status":"published","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"}],"month":"05"},{"alternative_title":["Proceedings Symposium on Logic in Computer Science"],"scopus_import":1,"day":"05","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.","short":"K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.","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.","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>","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>.","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>."},"ec_funded":1,"oa":1,"publication_status":"published","abstract":[{"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.","lang":"eng"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":"05-08-July-2016","date_created":"2018-12-11T11:46:42Z","type":"conference","conference":{"location":"New York, NY, USA","end_date":"2016-07-08","name":"LICS: Logic in Computer Science","start_date":"2016-07-05"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06376"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"title":"Perfect-information stochastic games with generalized mean-payoff objectives","year":"2016","status":"public","doi":"10.1145/2933575.2934513","publisher":"IEEE","oa_version":"Preprint","publist_id":"7340","_id":"480","month":"07","date_updated":"2021-01-12T08:00:56Z","page":"247 - 256","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-07-05T00:00:00Z"},{"date_updated":"2023-10-17T12:16:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:46:43Z","date_published":"2016-08-29T00:00:00Z","quality_controlled":"1","_id":"482","publication_status":"published","month":"08","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"}],"article_processing_charge":"No","year":"2016","status":"public","title":"Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator","doi":"10.1364/NP.2016.NTh3A.6","citation":{"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>","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.","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>.","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>.","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.","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>"},"department":[{"_id":"JoFi"}],"publisher":"Optica Publishing Group","publist_id":"7339","oa_version":"None","alternative_title":["Optics InfoBase Conference Papers"],"day":"29","scopus_import":"1","conference":{"location":"Sydney, Australia","start_date":"2016-09-05","name":"NP: Nonlinear Photonics","end_date":"2016-09-08"},"type":"conference","author":[{"full_name":"Rueda, Alfredo","first_name":"Alfredo","last_name":"Rueda"},{"full_name":"Sedlmeir, Florian","last_name":"Sedlmeir","first_name":"Florian"},{"full_name":"Collodo, Michele","last_name":"Collodo","first_name":"Michele"},{"first_name":"Ulrich","last_name":"Vogl","full_name":"Vogl, Ulrich"},{"last_name":"Stiller","first_name":"Birgit","full_name":"Stiller, Birgit"},{"last_name":"Schunk","first_name":"Gerhard","full_name":"Schunk, Gerhard"},{"full_name":"Strekalov, Dmitry","last_name":"Strekalov","first_name":"Dmitry"},{"full_name":"Marquardt, Christoph","first_name":"Christoph","last_name":"Marquardt"},{"full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"},{"full_name":"Painter, Oskar","last_name":"Painter","first_name":"Oskar"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"full_name":"Schwefel, Harald","last_name":"Schwefel","first_name":"Harald"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":11,"intvolume":"        11","date_created":"2018-12-11T11:46:53Z","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","article_number":"e1191734","publication":"Plant Signaling & Behavior","department":[{"_id":"JiFr"}],"citation":{"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>","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.","short":"Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &#38; Behavior 11 (2016).","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>.","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>.","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.","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>"},"oa":1,"day":"02","scopus_import":"1","date_updated":"2023-10-17T11:13:40Z","issue":"6","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-06-02T00:00:00Z","_id":"510","month":"06","article_processing_charge":"No","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). ","title":"The CLE gene family in Populus trichocarpa","year":"2016","status":"public","doi":"10.1080/15592324.2016.1191734","publisher":"Taylor & Francis","oa_version":"Submitted Version","publist_id":"7308","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/"}],"author":[{"full_name":"Liu, Zhijun","last_name":"Liu","first_name":"Zhijun"},{"first_name":"Nan","last_name":"Yang","full_name":"Yang, Nan"},{"full_name":"Lv, Yanting","first_name":"Yanting","last_name":"Lv"},{"full_name":"Pan, Lixia","last_name":"Pan","first_name":"Lixia"},{"last_name":"Lv","first_name":"Shuo","full_name":"Lv, Shuo"},{"full_name":"Han, Huibin","first_name":"Huibin","last_name":"Han","id":"31435098-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wang","first_name":"Guodong","full_name":"Wang, Guodong"}]},{"date_published":"2016-02-22T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:46:58Z","volume":26,"intvolume":"        26","page":"439 - 449","extern":1,"issue":"4","date_updated":"2021-01-12T08:01:24Z","publication_status":"published","month":"02","abstract":[{"lang":"eng","text":"Plants form new organs with patterned tissue organization throughout their lifespan. It is unknown whether this robust post-embryonic organ formation results from stereotypic dynamic processes, in which the arrangement of cells follows rigid rules. Here, we combine modeling with empirical observations of whole-organ development to identify the principles governing lateral root formation in Arabidopsis. Lateral roots derive from a small pool of founder cells in which some take a dominant role as seen by lineage tracing. The first division of the founders is asymmetric, tightly regulated, and determines the formation of a layered structure. Whereas the pattern of subsequent cell divisions is not stereotypic between different samples, it is characterized by a regular switch in division plane orientation. This switch is also necessary for the appearance of patterned layers as a result of the apical growth of the primordium. Our data suggest that lateral root morphogenesis is based on a limited set of rules. They determine cell growth and division orientation. The organ-level coupling of the cell behavior ensures the emergence of the lateral root's characteristic features. We propose that self-organizing, non-deterministic modes of development account for the robustness of plant organ morphogenesis."}],"_id":"526","publist_id":"7293","citation":{"short":"D. von Wangenheim, J. Fangerau, A. Schmitz, R. Smith, H. Leitte, E. Stelzer, A. Maizel, Current Biology 26 (2016) 439–449.","ista":"von Wangenheim D, Fangerau J, Schmitz A, Smith R, Leitte H, Stelzer E, Maizel A. 2016. Rules and self-organizing properties of post-embryonic plant organ cell division patterns. Current Biology. 26(4), 439–449.","ama":"von Wangenheim D, Fangerau J, Schmitz A, et al. Rules and self-organizing properties of post-embryonic plant organ cell division patterns. <i>Current Biology</i>. 2016;26(4):439-449. doi:<a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">10.1016/j.cub.2015.12.047</a>","mla":"von Wangenheim, Daniel, et al. “Rules and Self-Organizing Properties of Post-Embryonic Plant Organ Cell Division Patterns.” <i>Current Biology</i>, vol. 26, no. 4, Cell Press, 2016, pp. 439–49, doi:<a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">10.1016/j.cub.2015.12.047</a>.","chicago":"Wangenheim, Daniel von, Jens Fangerau, Alexander Schmitz, Richard Smith, Heike Leitte, Ernst Stelzer, and Alexis Maizel. “Rules and Self-Organizing Properties of Post-Embryonic Plant Organ Cell Division Patterns.” <i>Current Biology</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">https://doi.org/10.1016/j.cub.2015.12.047</a>.","ieee":"D. von Wangenheim <i>et al.</i>, “Rules and self-organizing properties of post-embryonic plant organ cell division patterns,” <i>Current Biology</i>, vol. 26, no. 4. Cell Press, pp. 439–449, 2016.","apa":"von Wangenheim, D., Fangerau, J., Schmitz, A., Smith, R., Leitte, H., Stelzer, E., &#38; Maizel, A. (2016). Rules and self-organizing properties of post-embryonic plant organ cell division patterns. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">https://doi.org/10.1016/j.cub.2015.12.047</a>"},"doi":"10.1016/j.cub.2015.12.047","publisher":"Cell Press","acknowledgement":"We thank M.J. Bennett, L. Laplaze, and S. Lemke for their helpful comments.\nThis work was supported by the Land Baden-Württemberg, the Chica und Heinz Schaller Stiftung, the CellNetworks cluster of excellence, and the Boehringer Ingelheim Fond (to J.F. and A.M.) and the Cluster of Excellence “Macromolecular Complexes” at the Goethe University Frankfurt am Main (CEF-MC II; DFG Project EXC 115; to D.v.W., A.S., and E.H.K.S.).\n","title":"Rules and self-organizing properties of post-embryonic plant organ cell division patterns","publication":"Current Biology","year":"2016","status":"public","author":[{"orcid":"0000-0002-6862-1247","id":"49E91952-F248-11E8-B48F-1D18A9856A87","full_name":"Daniel von Wangenheim","last_name":"Von Wangenheim","first_name":"Daniel"},{"full_name":"Fangerau, Jens","first_name":"Jens","last_name":"Fangerau"},{"last_name":"Schmitz","first_name":"Alexander","full_name":"Schmitz, Alexander"},{"last_name":"Smith","first_name":"Richard","full_name":"Smith, Richard S"},{"full_name":"Leitte, Heike","first_name":"Heike","last_name":"Leitte"},{"first_name":"Ernst","last_name":"Stelzer","full_name":"Stelzer, Ernst H"},{"last_name":"Maizel","first_name":"Alexis","full_name":"Maizel, Alexis"}],"type":"journal_article","day":"22"},{"publication_identifier":{"issn":["2664-1690"]},"month":"03","publication_status":"published","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. "}],"_id":"5445","date_published":"2016-03-31T00:00:00Z","date_created":"2018-12-12T11:39:22Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T11:53:52Z","creator":"system","file_id":"5513","file_size":1012204,"date_updated":"2020-07-14T12:46:58Z","content_type":"application/pdf","file_name":"IST-2016-523-v1+1_main.pdf","relation":"main_file","access_level":"open_access","checksum":"cef516fa091925b5868813e355268fb4"}],"page":"33","date_updated":"2023-02-23T10:06:22Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"1604"}]},"pubrep_id":"523","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"file_date_updated":"2020-07-14T12:46:58Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"day":"31","oa":1,"oa_version":"Published Version","has_accepted_license":"1","publisher":"IST Austria","ddc":["005"],"department":[{"_id":"KrCh"}],"citation":{"short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.","ista":"Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.","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>","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>.","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>.","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>"},"doi":"10.15479/AT:IST-2016-523-v1-1","title":"Quantitative interprocedural analysis","status":"public","year":"2016"},{"type":"technical_report","day":"15","alternative_title":["IST Austria Technical Report"],"author":[{"full_name":"Anonymous, 1","last_name":"Anonymous","first_name":"1"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"}],"pubrep_id":"618","file_date_updated":"2020-07-14T12:46:58Z","citation":{"short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis of Recursive Programs, 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.","apa":"Anonymous, 1, Anonymous, 2, &#38; Anonymous, 3. (2016). <i>Termination and worst-case analysis of recursive programs</i>. IST Austria.","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.","chicago":"Anonymous, 1, 2 Anonymous, and 3 Anonymous. <i>Termination and Worst-Case Analysis of Recursive Programs</i>. IST Austria, 2016."},"publisher":"IST Austria","ddc":["000"],"year":"2016","status":"public","title":"Termination and worst-case analysis of recursive programs","oa_version":"Published Version","oa":1,"has_accepted_license":"1","publication_status":"published","month":"07","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."}],"_id":"5446","publication_identifier":{"issn":["2664-1690"]},"page":"26","file":[{"content_type":"application/pdf","file_name":"popl2017a.pdf","access_level":"open_access","relation":"main_file","checksum":"689069a7abbb34b21516164cbee9e0df","date_created":"2019-05-10T13:27:24Z","file_id":"6403","creator":"dernst","file_size":686241,"date_updated":"2020-07-14T12:46:58Z"},{"file_name":"author_names.txt","checksum":"fc08022bfbaac07bac047a9407c0bbb3","relation":"main_file","access_level":"closed","content_type":"text/plain","file_size":258,"date_updated":"2020-07-14T12:46:58Z","date_created":"2019-05-10T13:27:31Z","creator":"dernst","file_id":"6404"}],"date_updated":"2020-07-14T23:05:05Z","date_published":"2016-07-15T00:00:00Z","date_created":"2018-12-12T11:39:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"date_published":"2016-07-15T00:00:00Z","date_created":"2018-12-12T11:39:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"page":"20","file":[{"date_updated":"2020-07-14T12:46:58Z","file_size":281,"creator":"dernst","file_id":"6406","date_created":"2019-05-10T13:32:16Z","checksum":"cf53cdb6d092e68db0b4a0a1506ef8fb","access_level":"closed","relation":"main_file","file_name":"listofauthors.txt","content_type":"text/plain"},{"date_updated":"2020-07-14T12:46:58Z","file_size":563642,"file_id":"6407","creator":"dernst","date_created":"2019-05-10T13:32:16Z","checksum":"7bdd94ba13aa0dec9c46887fcf13870b","relation":"main_file","access_level":"open_access","file_name":"popl2017b.pdf","content_type":"application/pdf"}],"date_updated":"2020-07-14T23:05:06Z","publication_identifier":{"issn":["2664-1690"]},"month":"07","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"}],"publication_status":"published","_id":"5447","oa_version":"Published Version","has_accepted_license":"1","oa":1,"citation":{"short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds, 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.","ama":"Anonymous 1, Anonymous 2, Anonymous 3. <i>Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds</i>. 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.","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.","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.","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."},"publisher":"IST Austria","ddc":["000"],"year":"2016","title":"Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds","status":"public","author":[{"last_name":"Anonymous","first_name":"1","full_name":"Anonymous, 1"},{"full_name":"Anonymous, 2","first_name":"2","last_name":"Anonymous"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"}],"pubrep_id":"619","file_date_updated":"2020-07-14T12:46:58Z","type":"technical_report","day":"15","alternative_title":["IST Austria Technical Report"]},{"title":"Data-centric dynamic partial order reduction","status":"public","year":"2016","publisher":"IST Austria","ddc":["000"],"citation":{"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.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2016.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2016.","mla":"Anonymous, 1, et al. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2016.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, &#38; Anonymous, 4. (2016). <i>Data-centric dynamic partial order reduction</i>. IST Austria.","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","has_accepted_license":"1","oa":1,"day":"15","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:58Z","author":[{"first_name":"1","last_name":"Anonymous","full_name":"Anonymous, 1"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"},{"last_name":"Anonymous","first_name":"4","full_name":"Anonymous, 4"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10417"},{"id":"5456","relation":"later_version","status":"public"}]},"pubrep_id":"620","date_updated":"2023-02-23T12:27:16Z","external_id":{"arxiv":["1610.01188"]},"file":[{"file_name":"IST-2016-620-v1+1_main.pdf","access_level":"open_access","relation":"main_file","checksum":"1d69252d66bcdf782615ddfb911d2957","content_type":"application/pdf","file_size":538881,"date_updated":"2020-07-14T12:46:58Z","date_created":"2018-12-12T11:53:45Z","creator":"system","file_id":"5506"},{"access_level":"closed","relation":"main_file","checksum":"deabb0eb8f237cae4f9542b28b0b6eb2","file_name":"authornames.txt","content_type":"text/plain","date_updated":"2020-07-14T12:46:58Z","file_size":121,"creator":"dernst","file_id":"6405","date_created":"2019-05-10T13:30:40Z"}],"page":"20","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:23Z","date_published":"2016-07-15T00:00:00Z","_id":"5448","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."}],"publication_status":"published","month":"07","publication_identifier":{"issn":["2664-1690"]},"arxiv":1},{"date_published":"2016-11-09T00:00:00Z","date_created":"2018-12-12T11:39:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"page":"22","file":[{"content_type":"application/pdf","file_name":"IST-2016-648-v1+1_tr.pdf","relation":"main_file","access_level":"open_access","checksum":"8345a8c1e7d7f0cd92516d182b7fc59e","date_created":"2018-12-12T11:54:07Z","creator":"system","file_id":"5529","file_size":1264221,"date_updated":"2020-07-14T12:46:58Z"}],"date_updated":"2023-02-23T12:22:21Z","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"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.","lang":"eng"}],"publication_status":"published","month":"11","_id":"5449","oa_version":"Updated Version","oa":1,"has_accepted_license":"1","citation":{"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>.","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>.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Amplification on undirected population structures: Comets beat stars</i>. IST Austria, 2016.","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>","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.","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."},"doi":"10.15479/AT:IST-2016-648-v1-1","department":[{"_id":"KrCh"}],"publisher":"IST Austria","ddc":["519"],"status":"public","year":"2016","title":"Amplification on undirected population structures: Comets beat stars","related_material":{"record":[{"status":"public","relation":"later_version","id":"512"}]},"author":[{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"pubrep_id":"648","file_date_updated":"2020-07-14T12:46:58Z","type":"technical_report","day":"09","alternative_title":["IST Austria Technical Report"]},{"_id":"5451","publication_status":"published","month":"12","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2023-02-23T12:27:05Z","page":"34","file":[{"content_type":"application/pdf","file_name":"IST-2016-728-v1+1_main.pdf","access_level":"open_access","relation":"main_file","checksum":"7b8bb17c322c0556acba6ac169fa71c1","date_created":"2018-12-12T11:53:04Z","creator":"system","file_id":"5465","file_size":1014732,"date_updated":"2020-07-14T12:46:59Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2016-12-30T00:00:00Z","date_created":"2018-12-12T11:39:24Z","day":"30","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:59Z","author":[{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"pubrep_id":"728","title":"Strong amplifiers of natural selection","status":"public","year":"2016","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.","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>","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>.","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>.","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"}],"doi":"10.15479/AT:IST-2016-728-v1-1","ddc":["000"],"publisher":"IST Austria","oa":1,"oa_version":"Published Version","has_accepted_license":"1"},{"author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"file_date_updated":"2020-07-14T12:46:59Z","type":"technical_report","oa_version":"Published Version","has_accepted_license":"1","ddc":["000"],"publisher":"IST Austria","doi":"10.15479/AT:IST-2017-728-v2-1","year":"2016","status":"public","title":"Arbitrarily strong amplifiers of natural selection","publication_identifier":{"issn":["2664-1690"]},"article_processing_charge":"No","month":"12","_id":"5452","date_published":"2016-12-30T00:00:00Z","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T11:52:59Z","file_id":"5460","creator":"system","file_size":811558,"date_updated":"2020-07-14T12:46:59Z","content_type":"application/pdf","file_name":"IST-2017-728-v2+1_main.pdf","relation":"main_file","access_level":"open_access","checksum":"58e895f26c82f560c0f0989bf8b08599"}],"page":"32","date_updated":"2024-02-21T13:48:42Z","pubrep_id":"750","related_material":{"record":[{"relation":"later_version","status":"public","id":"5453"},{"id":"5559","status":"public","relation":"popular_science"}]},"day":"30","alternative_title":["IST Austria Technical Report"],"ec_funded":1,"oa":1,"citation":{"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>.","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>.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria, 2016.","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>","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","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>","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p."},"department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"publication_status":"published","date_created":"2018-12-12T11:39:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"related_material":{"record":[{"id":"5452","status":"public","relation":"earlier_version"}]},"pubrep_id":"755","file_date_updated":"2020-07-14T12:46:59Z","type":"technical_report","day":"30","alternative_title":["IST Austria Technical Report"],"oa":1,"oa_version":"Published Version","has_accepted_license":"1","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","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>","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.","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>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. 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>.","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>."},"doi":"10.15479/AT:IST-2017-749-v3-1","department":[{"_id":"KrCh"}],"publisher":"IST Austria","ddc":["000"],"year":"2016","title":"Arbitrarily strong amplifiers of natural selection","status":"public","publication_identifier":{"issn":["2664-1690"]},"month":"12","publication_status":"published","_id":"5453","date_published":"2016-12-30T00:00:00Z","date_created":"2018-12-12T11:39:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"page":"34","file":[{"creator":"system","file_id":"5474","date_created":"2018-12-12T11:53:13Z","date_updated":"2020-07-14T12:46:59Z","file_size":1015647,"content_type":"application/pdf","checksum":"83b0313dab3bff4bdb6ac38695026fda","access_level":"open_access","relation":"main_file","file_name":"IST-2017-749-v3+1_main.pdf"}],"date_updated":"2023-02-23T12:27:07Z"},{"datarep_id":"34","oa_version":"Published Version","has_accepted_license":"1","oa":1,"publist_id":"5828","ddc":["576"],"publisher":"Institute of Science and Technology Austria","citation":{"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.","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>.","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>.","short":"T. Ellis, D. Field, (2016).","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>.","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>"},"doi":"10.15479/AT:ISTA:34","department":[{"_id":"NiBa"}],"status":"public","title":"Flower colour data and phylogeny (NEXUS) files","year":"2016","author":[{"first_name":"Thomas","last_name":"Ellis","full_name":"Ellis, Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8511-0254"},{"first_name":"David","last_name":"Field","full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478"}],"related_material":{"record":[{"id":"1382","status":"public","relation":"research_paper"}]},"file_date_updated":"2020-07-14T12:47:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","type":"research_data","day":"19","date_created":"2018-12-12T12:31:29Z","date_published":"2016-02-19T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:47:00Z","file_size":4468543,"creator":"system","file_id":"5594","date_created":"2018-12-12T13:02:27Z","relation":"main_file","checksum":"950f85b80427d357bfeff09608ba02e9","access_level":"open_access","file_name":"IST-2016-34-v1+1_tellis_flower_colour_data.zip","content_type":"application/zip"}],"date_updated":"2024-02-21T13:49:54Z","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"abstract":[{"lang":"eng","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)"}],"month":"02","_id":"5550"},{"datarep_id":"35","oa":1,"has_accepted_license":"1","oa_version":"Published Version","doi":"10.15479/AT:ISTA:35","department":[{"_id":"NiBa"}],"citation":{"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>.","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>.","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).","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>","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>."},"publisher":"Institute of Science and Technology Austria","title":"Data on pollinator observations and offpsring phenotypes","year":"2016","status":"public","author":[{"id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ellis","full_name":"Ellis, Thomas","orcid":"0000-0002-8511-0254"}],"related_material":{"record":[{"status":"public","relation":"research_paper","id":"1398"}]},"file_date_updated":"2020-07-14T12:47:01Z","type":"research_data","day":"19","date_published":"2016-02-19T00:00:00Z","date_created":"2018-12-12T12:31:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","access_level":"open_access","checksum":"aa3eb85d52b110cd192aa23147c4d4f3","file_name":"IST-2016-35-v1+1_array_data.zip","content_type":"application/zip","date_updated":"2020-07-14T12:47:01Z","file_size":32775,"file_id":"5640","creator":"system","date_created":"2018-12-12T13:05:12Z"}],"date_updated":"2024-02-21T13:51:27Z","abstract":[{"lang":"eng","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."}],"month":"02","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"article_processing_charge":"No","contributor":[{"last_name":"Field","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"}],"_id":"5551"},{"datarep_id":"36","oa_version":"Published Version","oa":1,"has_accepted_license":"1","doi":"10.15479/AT:ISTA:36","citation":{"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>.","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>.","ieee":"T. Ellis, “Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.” Institute of Science and Technology Austria, 2016.","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>","short":"T. Ellis, (2016).","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>","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>."},"department":[{"_id":"NiBa"}],"publisher":"Institute of Science and Technology Austria","status":"public","year":"2016","title":"Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.","related_material":{"record":[{"id":"1398","relation":"research_paper","status":"public"}]},"author":[{"id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis","first_name":"Thomas","full_name":"Ellis, Thomas","orcid":"0000-0002-8511-0254"}],"file_date_updated":"2020-07-14T12:47:01Z","type":"research_data","day":"19","date_published":"2016-02-19T00:00:00Z","date_created":"2018-12-12T12:31:30Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T13:03:07Z","file_id":"5625","creator":"system","file_size":44905,"date_updated":"2020-07-14T12:47:01Z","content_type":"application/zip","file_name":"IST-2016-36-v1+1_tag_assay_archive.zip","access_level":"open_access","relation":"main_file","checksum":"cbc61b523d4d475a04a737d50dc470ef"}],"date_updated":"2024-02-21T13:51:40Z","abstract":[{"lang":"eng","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."}],"month":"02","article_processing_charge":"No","contributor":[{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David","last_name":"Field"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"_id":"5552"}]