[{"title":"Optimal geospatial allocation of volunteers for crisis management","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","status":"public","month":"02","year":"2016","day":"11","acknowledgement":"The DRIVER FP7 project has received funding from the European Unions Seventh Framework Programme for research, technological development and demonstration under grant agreement no 607798. RE-ACTA was funded within the framework of the Austrian Security Research Programme KIRAS by the Federal Ministry for Transport, Innovation and Technology.","abstract":[{"text":"Volunteer supporters play an important role in modern crisis and disaster management. In the times of mobile Internet devices, help from thousands of volunteers can be requested within a short time span, thus relieving professional helpers from minor chores or geographically spread-out tasks. However, the simultaneous availability of many volunteers also poses new problems. In particular, the volunteer efforts must be well coordinated, or otherwise situations might emerge in which too many idle volunteers at one location become more of a burden than a relief to the professionals.\r\nIn this work, we study the task of optimally assigning volunteers to selected locations, e.g. in order to perform regular measurements, to report on damage, or to distribute information or resources to the population in a crisis situation. We formulate the assignment tasks as an optimization problem and propose an effective and efficient solution procedure. Experiments on real data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show the effectiveness and efficiency of our approach.","lang":"eng"}],"date_updated":"2021-01-12T06:52:39Z","_id":"1707","author":[{"first_name":"Jasmin","id":"49BC895A-F248-11E8-B48F-1D18A9856A87","last_name":"Pielorz","full_name":"Pielorz, Jasmin"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"article_number":"7402041","scopus_import":1,"publist_id":"5429","citation":{"chicago":"Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation of Volunteers for Crisis Management.” IEEE, 2016. <a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">https://doi.org/10.1109/ICT-DM.2015.7402041</a>.","ista":"Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for crisis management. ICT-DM: Information and Communication Technologies for Disaster Management, 7402041.","apa":"Pielorz, J., &#38; Lampert, C. (2016). Optimal geospatial allocation of volunteers for crisis management. Presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France: IEEE. <a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">https://doi.org/10.1109/ICT-DM.2015.7402041</a>","mla":"Pielorz, Jasmin, and Christoph Lampert. <i>Optimal Geospatial Allocation of Volunteers for Crisis Management</i>. 7402041, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">10.1109/ICT-DM.2015.7402041</a>.","ama":"Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis management. In: IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">10.1109/ICT-DM.2015.7402041</a>","ieee":"J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for crisis management,” presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France, 2016.","short":"J. Pielorz, C. Lampert, in:, IEEE, 2016."},"quality_controlled":"1","date_created":"2018-12-11T11:53:35Z","doi":"10.1109/ICT-DM.2015.7402041","conference":{"start_date":"2015-11-30","name":"ICT-DM: Information and Communication Technologies for Disaster Management","end_date":"2015-12-02","location":"Rennes, France"},"publication_status":"published","date_published":"2016-02-11T00:00:00Z","department":[{"_id":"ChLa"}],"language":[{"iso":"eng"}],"oa_version":"None","type":"conference"},{"type":"journal_article","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"publication":"Algorithmica","date_created":"2018-12-11T11:54:02Z","page":"17 - 46","volume":76,"quality_controlled":"1","external_id":{"arxiv":["1210.0508"]},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2272"}]},"publist_id":"5316","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rustem","last_name":"Takhanov","id":"2CCAC26C-F248-11E8-B48F-1D18A9856A87","full_name":"Takhanov, Rustem"}],"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This work has been partially supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 616160.","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","title":"Inference algorithms for pattern-based CRFs on sequence data","oa_version":"Preprint","date_published":"2016-09-01T00:00:00Z","doi":"10.1007/s00453-015-0017-7","publication_status":"published","citation":{"chicago":"Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>Algorithmica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00453-015-0017-7\">https://doi.org/10.1007/s00453-015-0017-7</a>.","apa":"Kolmogorov, V., &#38; Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-015-0017-7\">https://doi.org/10.1007/s00453-015-0017-7</a>","ista":"Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46.","mla":"Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>Algorithmica</i>, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:<a href=\"https://doi.org/10.1007/s00453-015-0017-7\">10.1007/s00453-015-0017-7</a>.","short":"V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.","ieee":"V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” <i>Algorithmica</i>, vol. 76, no. 1. Springer, pp. 17–46, 2016.","ama":"Kolmogorov V, Takhanov R. Inference algorithms for pattern-based CRFs on sequence data. <i>Algorithmica</i>. 2016;76(1):17-46. doi:<a href=\"https://doi.org/10.1007/s00453-015-0017-7\">10.1007/s00453-015-0017-7</a>"},"intvolume":"        76","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.0508"}],"scopus_import":1,"_id":"1794","arxiv":1,"abstract":[{"text":"We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights.","lang":"eng"}],"issue":"1","date_updated":"2023-10-17T09:51:31Z","year":"2016","month":"09","ec_funded":1,"status":"public","oa":1},{"intvolume":"       143","citation":{"chicago":"Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” <i>Journal of Multivariate Analysis</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">https://doi.org/10.1016/j.jmva.2015.10.005</a>.","ista":"Klimova A, Rudas T. 2016. On the closure of relational models. Journal of Multivariate Analysis. 143, 440–452.","apa":"Klimova, A., &#38; Rudas, T. (2016). On the closure of relational models. <i>Journal of Multivariate Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">https://doi.org/10.1016/j.jmva.2015.10.005</a>","mla":"Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” <i>Journal of Multivariate Analysis</i>, vol. 143, Elsevier, 2016, pp. 440–52, doi:<a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">10.1016/j.jmva.2015.10.005</a>.","short":"A. Klimova, T. Rudas, Journal of Multivariate Analysis 143 (2016) 440–452.","ieee":"A. Klimova and T. Rudas, “On the closure of relational models,” <i>Journal of Multivariate Analysis</i>, vol. 143. Elsevier, pp. 440–452, 2016.","ama":"Klimova A, Rudas T. On the closure of relational models. <i>Journal of Multivariate Analysis</i>. 2016;143:440-452. doi:<a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">10.1016/j.jmva.2015.10.005</a>"},"volume":143,"quality_controlled":"1","publist_id":"5270","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.00600"}],"scopus_import":1,"oa_version":"Preprint","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"CaUh"}],"date_published":"2016-01-01T00:00:00Z","publication_status":"published","doi":"10.1016/j.jmva.2015.10.005","date_created":"2018-12-11T11:54:15Z","page":"440 - 452","publication":"Journal of Multivariate Analysis","month":"01","publisher":"Elsevier","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"On the closure of relational models","oa":1,"author":[{"first_name":"Anna","last_name":"Klimova","id":"31934120-F248-11E8-B48F-1D18A9856A87","full_name":"Klimova, Anna"},{"first_name":"Tamás","last_name":"Rudas","full_name":"Rudas, Tamás"}],"_id":"1833","date_updated":"2021-01-12T06:53:30Z","abstract":[{"lang":"eng","text":"Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. "}],"day":"01","year":"2016"},{"status":"public","oa":1,"month":"02","ec_funded":1,"date_updated":"2021-01-12T06:53:49Z","abstract":[{"text":"We consider random matrices of the form H=W+λV, λ∈ℝ+, where W is a real symmetric or complex Hermitian Wigner matrix of size N and V is a real bounded diagonal random matrix of size N with i.i.d.\\ entries that are independent of W. We assume subexponential decay for the matrix entries of W and we choose λ∼1, so that the eigenvalues of W and λV are typically of the same order. Further, we assume that the density of the entries of V is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is λ+∈ℝ+ such that the largest eigenvalues of H are in the limit of large N determined by the order statistics of V for λ&gt;λ+. In particular, the largest eigenvalue of H has a Weibull distribution in the limit N→∞ if λ&gt;λ+. Moreover, for N sufficiently large, we show that the eigenvectors associated to the largest eigenvalues are partially localized for λ&gt;λ+, while they are completely delocalized for λ&lt;λ+. Similar results hold for the lowest eigenvalues. ","lang":"eng"}],"issue":"1-2","year":"2016","_id":"1881","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1310.7057","open_access":"1"}],"intvolume":"       164","citation":{"short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 164 (2016) 165–241.","ama":"Lee J, Schnelli K. Extremal eigenvalues and eigenvectors of deformed Wigner matrices. <i>Probability Theory and Related Fields</i>. 2016;164(1-2):165-241. doi:<a href=\"https://doi.org/10.1007/s00440-014-0610-8\">10.1007/s00440-014-0610-8</a>","ieee":"J. Lee and K. Schnelli, “Extremal eigenvalues and eigenvectors of deformed Wigner matrices,” <i>Probability Theory and Related Fields</i>, vol. 164, no. 1–2. Springer, pp. 165–241, 2016.","chicago":"Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors of Deformed Wigner Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00440-014-0610-8\">https://doi.org/10.1007/s00440-014-0610-8</a>.","ista":"Lee J, Schnelli K. 2016. Extremal eigenvalues and eigenvectors of deformed Wigner matrices. Probability Theory and Related Fields. 164(1–2), 165–241.","mla":"Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors of Deformed Wigner Matrices.” <i>Probability Theory and Related Fields</i>, vol. 164, no. 1–2, Springer, 2016, pp. 165–241, doi:<a href=\"https://doi.org/10.1007/s00440-014-0610-8\">10.1007/s00440-014-0610-8</a>.","apa":"Lee, J., &#38; Schnelli, K. (2016). Extremal eigenvalues and eigenvectors of deformed Wigner matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-014-0610-8\">https://doi.org/10.1007/s00440-014-0610-8</a>"},"publication_status":"published","doi":"10.1007/s00440-014-0610-8","oa_version":"Preprint","date_published":"2016-02-01T00:00:00Z","publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Extremal eigenvalues and eigenvectors of deformed Wigner matrices","acknowledgement":"Most of the presented work was obtained while Kevin Schnelli was staying at the IAS with the support of\r\nThe Fund For Math.","day":"01","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"author":[{"last_name":"Lee","first_name":"Jioon","full_name":"Lee, Jioon"},{"orcid":"0000-0003-0954-3231","first_name":"Kevin","last_name":"Schnelli","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","full_name":"Schnelli, Kevin"}],"publist_id":"5215","volume":164,"quality_controlled":"1","page":"165 - 241","date_created":"2018-12-11T11:54:31Z","publication":"Probability Theory and Related Fields","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}]},{"tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"day":"01","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","first_name":"Rasmus"}],"file":[{"date_created":"2018-12-12T10:07:59Z","file_name":"IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf","date_updated":"2020-07-14T12:46:35Z","access_level":"open_access","checksum":"848043c812ace05e459579c923f3d3cf","creator":"system","file_id":"4658","file_size":2116225,"relation":"main_file","content_type":"application/pdf"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IOS Press","title":"The complexity of deciding legality of a single step of magic: The gathering","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"has_accepted_license":"1","date_created":"2018-12-11T11:46:41Z","page":"1432 - 1439","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"pubrep_id":"950","publist_id":"7342","volume":285,"quality_controlled":"1","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."}],"date_updated":"2021-01-12T08:00:54Z","year":"2016","_id":"478","status":"public","oa":1,"month":"01","doi":"10.3233/978-1-61499-672-9-1432","publication_status":"published","conference":{"location":"The Hague, Netherlands","end_date":"2016-09-02","name":"ECAI: European Conference on Artificial Intelligence","start_date":"2016-08-29"},"oa_version":"Published Version","date_published":"2016-01-01T00:00:00Z","scopus_import":1,"file_date_updated":"2020-07-14T12:46:35Z","ddc":["004"],"intvolume":"       285","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.","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.","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.","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>","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>."}},{"oa_version":"None","type":"conference","department":[{"_id":"ToHe"}],"date_published":"2016-05-14T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1145/2889160.2889233","publication_status":"published","conference":{"end_date":"2016-05-22","location":"Austin, TX, USA","start_date":"2016-05-14","name":"ICSE: International Conference on Software Engineering"},"publication":"Proceedings of the 38th International Conference on Software Engineering Companion ","date_created":"2018-12-11T11:46:42Z","page":"112 - 121","citation":{"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.","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>","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.","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>","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>.","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.","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>."},"quality_controlled":"1","scopus_import":1,"publist_id":"7341","author":[{"last_name":"Jiang","first_name":"Yu","full_name":"Jiang, Yu"},{"last_name":"Liu","first_name":"Han","full_name":"Liu, Han"},{"last_name":"Kong","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3066-6941","first_name":"Hui","full_name":"Kong, Hui"},{"full_name":"Wang, Rui","first_name":"Rui","last_name":"Wang"},{"full_name":"Hosseini, Mohamad","first_name":"Mohamad","last_name":"Hosseini"},{"first_name":"Jiaguang","last_name":"Sun","full_name":"Sun, Jiaguang"},{"full_name":"Sha, Lui","first_name":"Lui","last_name":"Sha"}],"_id":"479","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","abstract":[{"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","lang":"eng"}],"date_updated":"2021-01-12T08:00:55Z","year":"2016","day":"14","alternative_title":["Proceedings International Conference on Software Engineering"],"month":"05","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","status":"public","title":"Use runtime verification to improve the quality of medical care practice"},{"quality_controlled":"1","volume":"05-08-July-2016","publist_id":"7340","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"page":"247 - 256","date_created":"2018-12-11T11:46:42Z","alternative_title":["Proceedings Symposium on Logic in Computer Science"],"publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Perfect-information stochastic games with generalized mean-payoff objectives","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"day":"05","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>","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.","short":"K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 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>.","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.","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>.","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>"},"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06376"}],"oa_version":"Preprint","date_published":"2016-07-05T00:00:00Z","publication_status":"published","conference":{"name":"LICS: Logic in Computer Science","start_date":"2016-07-05","location":"New York, NY, USA","end_date":"2016-07-08"},"doi":"10.1145/2933575.2934513","month":"07","ec_funded":1,"status":"public","oa":1,"_id":"480","date_updated":"2021-01-12T08:00:56Z","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"}],"year":"2016"},{"month":"08","alternative_title":["Optics InfoBase Conference Papers"],"title":"Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator","status":"public","publisher":"Optica Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"482","author":[{"first_name":"Alfredo","last_name":"Rueda","full_name":"Rueda, Alfredo"},{"full_name":"Sedlmeir, Florian","first_name":"Florian","last_name":"Sedlmeir"},{"last_name":"Collodo","first_name":"Michele","full_name":"Collodo, Michele"},{"first_name":"Ulrich","last_name":"Vogl","full_name":"Vogl, Ulrich"},{"first_name":"Birgit","last_name":"Stiller","full_name":"Stiller, Birgit"},{"full_name":"Schunk, Gerhard","first_name":"Gerhard","last_name":"Schunk"},{"full_name":"Strekalov, Dmitry","last_name":"Strekalov","first_name":"Dmitry"},{"last_name":"Marquardt","first_name":"Christoph","full_name":"Marquardt, Christoph"},{"first_name":"Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M"},{"first_name":"Oskar","last_name":"Painter","full_name":"Painter, Oskar"},{"full_name":"Leuchs, Gerd","last_name":"Leuchs","first_name":"Gerd"},{"full_name":"Schwefel, Harald","first_name":"Harald","last_name":"Schwefel"}],"day":"29","year":"2016","date_updated":"2023-10-17T12:16:43Z","abstract":[{"lang":"eng","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."}],"citation":{"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>.","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>","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, .","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.","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."},"quality_controlled":"1","scopus_import":"1","publist_id":"7339","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2016-08-29T00:00:00Z","department":[{"_id":"JoFi"}],"oa_version":"None","type":"conference","date_created":"2018-12-11T11:46:43Z","conference":{"name":"NP: Nonlinear Photonics","start_date":"2016-09-05","location":"Sydney, Australia","end_date":"2016-09-08"},"publication_status":"published","doi":"10.1364/NP.2016.NTh3A.6"},{"issue":"6","abstract":[{"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. ","lang":"eng"}],"date_updated":"2023-10-17T11:13:40Z","year":"2016","article_number":"e1191734","_id":"510","status":"public","oa":1,"month":"06","doi":"10.1080/15592324.2016.1191734","publication_status":"published","oa_version":"Submitted Version","date_published":"2016-06-02T00:00:00Z","scopus_import":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/","open_access":"1"}],"intvolume":"        11","citation":{"short":"Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &#38; Behavior 11 (2016).","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.","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>","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.","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>","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>."},"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","author":[{"first_name":"Zhijun","last_name":"Liu","full_name":"Liu, Zhijun"},{"first_name":"Nan","last_name":"Yang","full_name":"Yang, Nan"},{"first_name":"Yanting","last_name":"Lv","full_name":"Lv, Yanting"},{"full_name":"Pan, Lixia","first_name":"Lixia","last_name":"Pan"},{"last_name":"Lv","first_name":"Shuo","full_name":"Lv, Shuo"},{"full_name":"Han, Huibin","first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","last_name":"Han"},{"full_name":"Wang, Guodong","last_name":"Wang","first_name":"Guodong"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Taylor & Francis","title":"The CLE gene family in Populus trichocarpa","publication":"Plant Signaling & Behavior","date_created":"2018-12-11T11:46:53Z","type":"journal_article","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","publist_id":"7308","quality_controlled":"1","volume":11},{"has_accepted_license":"1","publication_status":"published","doi":"10.15479/AT:IST-2016-523-v1-1","date_created":"2018-12-12T11:39:22Z","page":"33","oa_version":"Published Version","type":"technical_report","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"date_published":"2016-03-31T00:00:00Z","file_date_updated":"2020-07-14T12:46:58Z","pubrep_id":"523","ddc":["005"],"citation":{"short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.","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>","ieee":"K. Chatterjee, A. Pavlogiannis, and Y. Velner, <i>Quantitative interprocedural analysis</i>. IST Austria, 2016.","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>.","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>.","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."},"related_material":{"record":[{"id":"1604","relation":"later_version","status":"public"}]},"date_updated":"2023-02-23T10:06:22Z","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. "}],"day":"31","year":"2016","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":1012204,"date_updated":"2020-07-14T12:46:58Z","file_name":"IST-2016-523-v1+1_main.pdf","date_created":"2018-12-12T11:53:52Z","file_id":"5513","creator":"system","checksum":"cef516fa091925b5868813e355268fb4","access_level":"open_access"}],"_id":"5445","publisher":"IST Austria","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Quantitative interprocedural analysis","publication_identifier":{"issn":["2664-1690"]},"oa":1,"month":"03","alternative_title":["IST Austria Technical Report"]},{"language":[{"iso":"eng"}],"date_published":"2016-11-09T00:00:00Z","department":[{"_id":"KrCh"}],"oa_version":"Updated Version","type":"technical_report","page":"22","date_created":"2018-12-12T11:39:24Z","publication_status":"published","has_accepted_license":"1","doi":"10.15479/AT:IST-2016-648-v1-1","related_material":{"record":[{"id":"512","relation":"later_version","status":"public"}]},"citation":{"ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Amplification on undirected population structures: Comets beat stars</i>. 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>","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.","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>","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>."},"ddc":["519"],"file_date_updated":"2020-07-14T12:46:58Z","pubrep_id":"648","file":[{"content_type":"application/pdf","relation":"main_file","file_size":1264221,"date_updated":"2020-07-14T12:46:58Z","file_name":"IST-2016-648-v1+1_tr.pdf","date_created":"2018-12-12T11:54:07Z","file_id":"5529","checksum":"8345a8c1e7d7f0cd92516d182b7fc59e","creator":"system","access_level":"open_access"}],"_id":"5449","author":[{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"day":"09","year":"2016","date_updated":"2023-02-23T12:22:21Z","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."}],"month":"11","alternative_title":["IST Austria Technical Report"],"title":"Amplification on undirected population structures: Comets beat stars","oa":1,"publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"author":[{"last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":1014732,"checksum":"7b8bb17c322c0556acba6ac169fa71c1","creator":"system","file_id":"5465","access_level":"open_access","date_updated":"2020-07-14T12:46:59Z","file_name":"IST-2016-728-v1+1_main.pdf","date_created":"2018-12-12T11:53:04Z"}],"_id":"5451","date_updated":"2023-02-23T12:27:05Z","day":"30","year":"2016","month":"12","alternative_title":["IST Austria Technical Report"],"status":"public","publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Strong amplifiers of natural selection","publication_identifier":{"issn":["2664-1690"]},"oa":1,"oa_version":"Published Version","type":"technical_report","language":[{"iso":"eng"}],"date_published":"2016-12-30T00:00:00Z","department":[{"_id":"KrCh"}],"publication_status":"published","has_accepted_license":"1","doi":"10.15479/AT:IST-2016-728-v1-1","date_created":"2018-12-12T11:39:24Z","page":"34","citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Strong amplifiers of natural selection</i>. IST Austria, 2016.","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>","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>."},"file_date_updated":"2020-07-14T12:46:59Z","pubrep_id":"728","ddc":["000"]},{"article_processing_charge":"No","pubrep_id":"750","related_material":{"record":[{"relation":"later_version","status":"public","id":"5453"},{"id":"5559","relation":"popular_science","status":"public"}]},"has_accepted_license":"1","page":"32","date_created":"2018-12-12T11:39:25Z","type":"technical_report","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","title":"Arbitrarily strong amplifiers of natural selection","alternative_title":["IST Austria Technical Report"],"day":"30","author":[{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","first_name":"Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"file":[{"access_level":"open_access","checksum":"58e895f26c82f560c0f0989bf8b08599","creator":"system","file_id":"5460","date_created":"2018-12-12T11:52:59Z","file_name":"IST-2017-728-v2+1_main.pdf","date_updated":"2020-07-14T12:46:59Z","file_size":811558,"relation":"main_file","content_type":"application/pdf"}],"file_date_updated":"2020-07-14T12:46:59Z","ddc":["000"],"citation":{"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>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. IST Austria, 2016.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","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>.","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>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p."},"doi":"10.15479/AT:IST-2017-728-v2-1","publication_status":"published","oa_version":"Published Version","date_published":"2016-12-30T00:00:00Z","status":"public","oa":1,"publication_identifier":{"issn":["2664-1690"]},"month":"12","ec_funded":1,"date_updated":"2024-02-21T13:48:42Z","year":"2016","_id":"5452"},{"date_published":"2016-12-30T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","type":"technical_report","date_created":"2018-12-12T11:39:25Z","page":"34","doi":"10.15479/AT:IST-2017-749-v3-1","has_accepted_license":"1","publication_status":"published","related_material":{"record":[{"id":"5452","relation":"earlier_version","status":"public"}]},"citation":{"short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, <i>Arbitrarily strong amplifiers of natural selection</i>. 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>","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>.","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>","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.","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>."},"ddc":["000"],"pubrep_id":"755","file_date_updated":"2020-07-14T12:46:59Z","_id":"5453","file":[{"file_size":1015647,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"system","checksum":"83b0313dab3bff4bdb6ac38695026fda","file_id":"5474","date_created":"2018-12-12T11:53:13Z","date_updated":"2020-07-14T12:46:59Z","file_name":"IST-2017-749-v3+1_main.pdf"}],"author":[{"orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","full_name":"Tkadlec, Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"year":"2016","day":"30","date_updated":"2023-02-23T12:27:07Z","alternative_title":["IST Austria Technical Report"],"month":"12","oa":1,"publication_identifier":{"issn":["2664-1690"]},"title":"Arbitrarily strong amplifiers of natural selection","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"IST Austria"},{"file":[{"content_type":"application/zip","relation":"main_file","file_size":4468543,"file_name":"IST-2016-34-v1+1_tellis_flower_colour_data.zip","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T13:02:27Z","file_id":"5594","checksum":"950f85b80427d357bfeff09608ba02e9","creator":"system","access_level":"open_access"}],"_id":"5550","author":[{"full_name":"Ellis, Thomas","first_name":"Thomas","orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis"},{"full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field","orcid":"0000-0002-4014-8478","first_name":"David"}],"day":"19","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"year":"2016","date_updated":"2024-02-21T13:49:54Z","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"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","month":"02","title":"Flower colour data and phylogeny (NEXUS) files","oa":1,"publisher":"Institute of Science and Technology Austria","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2016-02-19T00:00:00Z","department":[{"_id":"NiBa"}],"type":"research_data","oa_version":"Published Version","date_created":"2018-12-12T12:31:29Z","datarep_id":"34","has_accepted_license":"1","doi":"10.15479/AT:ISTA:34","related_material":{"record":[{"id":"1382","status":"public","relation":"research_paper"}]},"citation":{"short":"T. Ellis, D. Field, (2016).","ieee":"T. Ellis and D. Field, “Flower colour data and phylogeny (NEXUS) files.” Institute of Science and Technology Austria, 2016.","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>.","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>.","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>","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>."},"ddc":["576"],"file_date_updated":"2020-07-14T12:47:00Z","publist_id":"5828","article_processing_charge":"No"},{"related_material":{"record":[{"relation":"research_paper","status":"public","id":"1398"}]},"citation":{"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>","ieee":"T. Ellis, “Data on pollinator observations and offpsring phenotypes.” Institute of Science and Technology Austria, 2016.","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>","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>.","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>.","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>."},"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:01Z","department":[{"_id":"NiBa"}],"date_published":"2016-02-19T00:00:00Z","oa_version":"Published Version","type":"research_data","datarep_id":"35","date_created":"2018-12-12T12:31:29Z","doi":"10.15479/AT:ISTA:35","has_accepted_license":"1","contributor":[{"last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David"},{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"}],"month":"02","oa":1,"title":"Data on pollinator observations and offpsring phenotypes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Institute of Science and Technology Austria","_id":"5551","file":[{"date_created":"2018-12-12T13:05:12Z","file_name":"IST-2016-35-v1+1_array_data.zip","date_updated":"2020-07-14T12:47:01Z","access_level":"open_access","checksum":"aa3eb85d52b110cd192aa23147c4d4f3","creator":"system","file_id":"5640","file_size":32775,"content_type":"application/zip","relation":"main_file"}],"author":[{"full_name":"Ellis, Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis","first_name":"Thomas","orcid":"0000-0002-8511-0254"}],"year":"2016","day":"19","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"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."}],"date_updated":"2024-02-21T13:51:27Z"},{"title":"Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.","oa":1,"publisher":"Institute of Science and Technology Austria","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","contributor":[{"last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David"},{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"month":"02","day":"19","year":"2016","date_updated":"2024-02-21T13:51:40Z","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"}],"file":[{"file_size":44905,"content_type":"application/zip","relation":"main_file","access_level":"open_access","checksum":"cbc61b523d4d475a04a737d50dc470ef","file_id":"5625","creator":"system","date_created":"2018-12-12T13:03:07Z","date_updated":"2020-07-14T12:47:01Z","file_name":"IST-2016-36-v1+1_tag_assay_archive.zip"}],"_id":"5552","author":[{"last_name":"Ellis","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-8511-0254","full_name":"Ellis, Thomas"}],"file_date_updated":"2020-07-14T12:47:01Z","article_processing_charge":"No","related_material":{"record":[{"id":"1398","relation":"research_paper","status":"public"}]},"citation":{"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>.","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>.","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>","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>.","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>","ieee":"T. Ellis, “Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.” Institute of Science and Technology Austria, 2016."},"date_created":"2018-12-12T12:31:30Z","datarep_id":"36","has_accepted_license":"1","doi":"10.15479/AT:ISTA:36","date_published":"2016-02-19T00:00:00Z","department":[{"_id":"NiBa"}],"oa_version":"Published Version","type":"research_data"},{"file":[{"content_type":"application/zip","relation":"main_file","file_size":132808,"file_id":"5620","checksum":"4ae751b1fa4897fa216241f975a57313","creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:47:01Z","file_name":"IST-2016-37-v1+1_paternity_archive.zip","date_created":"2018-12-12T13:03:02Z"}],"_id":"5553","author":[{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field","orcid":"0000-0002-4014-8478","first_name":"David","full_name":"Field, David"},{"full_name":"Ellis, Thomas","orcid":"0000-0002-8511-0254","first_name":"Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis"}],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"day":"19","year":"2016","date_updated":"2024-02-21T13:51:14Z","abstract":[{"lang":"eng","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."}],"contributor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","contributor_type":"project_manager"}],"month":"02","title":"Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012","oa":1,"publisher":"Institute of Science and Technology Austria","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"NiBa"}],"date_published":"2016-02-19T00:00:00Z","oa_version":"Published Version","type":"research_data","date_created":"2018-12-12T12:31:30Z","datarep_id":"37","has_accepted_license":"1","doi":"10.15479/AT:ISTA:37","related_material":{"record":[{"id":"1398","relation":"research_paper","status":"public"}]},"citation":{"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>","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.","short":"D. Field, T. Ellis, (2016).","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>","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>.","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>.","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>."},"keyword":["paternity assignment","pedigree","matting patterns","assortative mating","Antirrhinum majus","frequency-dependent selection","plant-pollinator interaction"],"ddc":["576"],"file_date_updated":"2020-07-14T12:47:01Z","article_processing_charge":"No"},{"month":"05","contributor":[{"contributor_type":"researcher","first_name":"Magdalena","id":"2C023F40-F248-11E8-B48F-1D18A9856A87","last_name":"Steinrück"},{"contributor_type":"researcher","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87","last_name":"Jesse","first_name":"Fabienne"}],"status":"public","publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase","oa":1,"author":[{"last_name":"Tugrul","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","first_name":"Murat","orcid":"0000-0002-8523-0758","full_name":"Tugrul, Murat"}],"file":[{"access_level":"open_access","checksum":"1fc0a10bb7ce110fcb5e1fbe3cf0c4e2","creator":"system","file_id":"5626","date_created":"2018-12-12T13:03:08Z","file_name":"IST-2016-43-v1+1_DATA_MTugrul_PhDThesis_Chapter3.zip","date_updated":"2020-07-14T12:47:01Z","file_size":1123495,"relation":"main_file","content_type":"application/zip"}],"_id":"5554","date_updated":"2024-02-21T13:50:34Z","abstract":[{"lang":"eng","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."}],"day":"12","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"year":"2016","citation":{"short":"M. Tugrul, (2016).","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>","ieee":"M. Tugrul, “Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.” Institute of Science and Technology Austria, 2016.","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>.","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>.","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>"},"keyword":["RNAP binding","de novo promoter evolution","lac promoter"],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1131"}]},"file_date_updated":"2020-07-14T12:47:01Z","article_processing_charge":"No","oa_version":"Published Version","type":"research_data","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"date_published":"2016-05-12T00:00:00Z","has_accepted_license":"1","doi":"10.15479/AT:ISTA:43","date_created":"2018-12-12T12:31:30Z","datarep_id":"43"},{"month":"07","status":"public","publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Fiji script to determine average speed and direction of migration of cells","oa":1,"author":[{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522","first_name":"Robert","full_name":"Hauschild, Robert"}],"file":[{"relation":"main_file","content_type":"application/zip","file_size":20692,"date_updated":"2020-07-14T12:47:02Z","file_name":"IST-2016-44-v1+1_migrationAnalyzer.zip","date_created":"2018-12-12T13:03:03Z","checksum":"9f96cddbcd4ed689f48712ffe234d5e5","file_id":"5621","creator":"system","access_level":"open_access"}],"_id":"5555","date_updated":"2024-02-21T13:50:06Z","abstract":[{"lang":"eng","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."}],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"day":"08","year":"2016","keyword":["cell migration","wide field microscopy","FIJI"],"citation":{"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.","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>","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>.","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>","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>.","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>."},"file_date_updated":"2020-07-14T12:47:02Z","article_processing_charge":"No","ddc":["570"],"oa_version":"Published Version","type":"research_data","department":[{"_id":"Bio"}],"date_published":"2016-07-08T00:00:00Z","has_accepted_license":"1","doi":"10.15479/AT:ISTA:44","date_created":"2018-12-12T12:31:31Z","datarep_id":"44"}]