[{"author":[{"full_name":"Correggi, Michele","last_name":"Correggi","first_name":"Michele"},{"full_name":"Giuliani, Alessandro","last_name":"Giuliani","first_name":"Alessandro"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"abstract":[{"text":"Spin-wave theory is a key ingredient in our comprehension of quantum spin systems, and is used successfully for understanding a wide range of magnetic phenomena, including magnon condensation and stability of patterns in dipolar systems. Nevertheless, several decades of research failed to establish the validity of spin-wave theory rigorously, even for the simplest models of quantum spins. A rigorous justification of the method for the three-dimensional quantum Heisenberg ferromagnet at low temperatures is presented here. We derive sharp bounds on its free energy by combining a bosonic formulation of the model introduced by Holstein and Primakoff with probabilistic estimates and operator inequalities.","lang":"eng"}],"citation":{"ama":"Correggi M, Giuliani A, Seiringer R. Validity of spin-wave theory for the quantum Heisenberg model. <i>EPL</i>. 2014;108(2). doi:<a href=\"https://doi.org/10.1209/0295-5075/108/20003\">10.1209/0295-5075/108/20003</a>","mla":"Correggi, Michele, et al. “Validity of Spin-Wave Theory for the Quantum Heisenberg Model.” <i>EPL</i>, vol. 108, no. 2, 20003, IOP Publishing Ltd., 2014, doi:<a href=\"https://doi.org/10.1209/0295-5075/108/20003\">10.1209/0295-5075/108/20003</a>.","ista":"Correggi M, Giuliani A, Seiringer R. 2014. Validity of spin-wave theory for the quantum Heisenberg model. EPL. 108(2), 20003.","short":"M. Correggi, A. Giuliani, R. Seiringer, EPL 108 (2014).","ieee":"M. Correggi, A. Giuliani, and R. Seiringer, “Validity of spin-wave theory for the quantum Heisenberg model,” <i>EPL</i>, vol. 108, no. 2. IOP Publishing Ltd., 2014.","apa":"Correggi, M., Giuliani, A., &#38; Seiringer, R. (2014). Validity of spin-wave theory for the quantum Heisenberg model. <i>EPL</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1209/0295-5075/108/20003\">https://doi.org/10.1209/0295-5075/108/20003</a>","chicago":"Correggi, Michele, Alessandro Giuliani, and Robert Seiringer. “Validity of Spin-Wave Theory for the Quantum Heisenberg Model.” <i>EPL</i>. IOP Publishing Ltd., 2014. <a href=\"https://doi.org/10.1209/0295-5075/108/20003\">https://doi.org/10.1209/0295-5075/108/20003</a>."},"publication_status":"published","oa_version":"Submitted Version","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"239694; ERC; European Research Council","_id":"2029","publist_id":"5044","volume":108,"date_updated":"2021-01-12T06:54:50Z","oa":1,"title":"Validity of spin-wave theory for the quantum Heisenberg model","doi":"10.1209/0295-5075/108/20003","year":"2014","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.4717"}],"article_number":"20003","status":"public","intvolume":"       108","type":"journal_article","day":"13","publication":"EPL","issue":"2","language":[{"iso":"eng"}],"scopus_import":1,"publisher":"IOP Publishing Ltd.","date_published":"2014-10-13T00:00:00Z","month":"10","date_created":"2018-12-11T11:55:18Z","department":[{"_id":"RoSe"}]},{"scopus_import":1,"publisher":"eLife Sciences Publications","language":[{"iso":"eng"}],"month":"12","date_published":"2014-12-09T00:00:00Z","date_created":"2018-12-11T11:55:19Z","file":[{"creator":"system","file_id":"5094","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:26Z","checksum":"c240f915450d4ebe8f95043a2a8c7b1a","date_created":"2018-12-12T10:14:41Z","file_size":2239563,"file_name":"IST-2016-421-v1+1_e04057.full.pdf"}],"has_accepted_license":"1","department":[{"_id":"PeJo"}],"intvolume":"         3","status":"public","day":"09","type":"journal_article","publication":"eLife","file_date_updated":"2020-07-14T12:45:26Z","title":"Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse","pubrep_id":"421","year":"2014","doi":"10.7554/eLife.04057","ec_funded":1,"ddc":["570"],"abstract":[{"lang":"eng","text":"A puzzling property of synaptic transmission, originally established at the neuromuscular junction, is that the time course of transmitter release is independent of the extracellular Ca2+ concentration ([Ca2+]o), whereas the rate of release is highly [Ca2+]o-dependent. Here, we examine the time course of release at inhibitory basket cell-Purkinje cell synapses and show that it is independent of [Ca2+]o. Modeling of Ca2+-dependent transmitter release suggests that the invariant time course of release critically depends on tight coupling between Ca2+ channels and release sensors. Experiments with exogenous Ca2+ chelators reveal that channel-sensor coupling at basket cell-Purkinje cell synapses is very tight, with a mean distance of 10–20 nm. Thus, tight channel-sensor coupling provides a mechanistic explanation for the apparent [Ca2+]o independence of the time course of release."}],"author":[{"id":"32A73F6C-F248-11E8-B48F-1D18A9856A87","full_name":"Arai, Itaru","last_name":"Arai","first_name":"Itaru"},{"first_name":"Peter M","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Arai  itaru, Jonas PM. 2014. Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse. eLife. 3.","short":"itaru Arai, P.M. Jonas, ELife 3 (2014).","ama":"Arai  itaru, Jonas PM. Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse. <i>eLife</i>. 2014;3. doi:<a href=\"https://doi.org/10.7554/eLife.04057\">10.7554/eLife.04057</a>","mla":"Arai, itaru, and Peter M. Jonas. “Nanodomain Coupling Explains Ca^2+ Independence of Transmitter Release Time Course at a Fast Central Synapse.” <i>ELife</i>, vol. 3, eLife Sciences Publications, 2014, doi:<a href=\"https://doi.org/10.7554/eLife.04057\">10.7554/eLife.04057</a>.","chicago":"Arai, itaru, and Peter M Jonas. “Nanodomain Coupling Explains Ca^2+ Independence of Transmitter Release Time Course at a Fast Central Synapse.” <i>ELife</i>. eLife Sciences Publications, 2014. <a href=\"https://doi.org/10.7554/eLife.04057\">https://doi.org/10.7554/eLife.04057</a>.","ieee":"itaru Arai and P. M. Jonas, “Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse,” <i>eLife</i>, vol. 3. eLife Sciences Publications, 2014.","apa":"Arai,  itaru, &#38; Jonas, P. M. (2014). Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.04057\">https://doi.org/10.7554/eLife.04057</a>"},"publication_status":"published","_id":"2031","quality_controlled":"1","project":[{"grant_number":"P24909-B24","call_identifier":"FWF","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","name":"Mechanisms of transmitter release at GABAergic synapses"},{"call_identifier":"FP7","_id":"25C0F108-B435-11E9-9278-68D0E5697425","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548"}],"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":3,"publist_id":"5041","date_updated":"2021-01-12T06:54:51Z","oa":1},{"volume":1,"publist_id":"5040","date_updated":"2021-01-12T06:54:51Z","oa":1,"_id":"2032","quality_controlled":"1","oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Karin Schelch, Harald L Janovjak, and Michael Grusch. “The Optogenetic Promise for Oncology: Episode I.” <i>Molecular and Cellular Oncology</i>. Taylor &#38; Francis, 2014. <a href=\"https://doi.org/10.4161/23723548.2014.964045\">https://doi.org/10.4161/23723548.2014.964045</a>.","apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Schelch, K., Janovjak, H. L., &#38; Grusch, M. (2014). The optogenetic promise for oncology: Episode I. <i>Molecular and Cellular Oncology</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/23723548.2014.964045\">https://doi.org/10.4161/23723548.2014.964045</a>","ieee":"Á. Inglés Prieto, E. Gschaider-Reichhart, K. Schelch, H. L. Janovjak, and M. Grusch, “The optogenetic promise for oncology: Episode I,” <i>Molecular and Cellular Oncology</i>, vol. 1, no. 4. Taylor &#38; Francis, 2014.","short":"Á. Inglés Prieto, E. Gschaider-Reichhart, K. Schelch, H.L. Janovjak, M. Grusch, Molecular and Cellular Oncology 1 (2014).","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Schelch K, Janovjak HL, Grusch M. 2014. The optogenetic promise for oncology: Episode I. Molecular and Cellular Oncology. 1(4), e964045.","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Schelch K, Janovjak HL, Grusch M. The optogenetic promise for oncology: Episode I. <i>Molecular and Cellular Oncology</i>. 2014;1(4). doi:<a href=\"https://doi.org/10.4161/23723548.2014.964045\">10.4161/23723548.2014.964045</a>","mla":"Inglés Prieto, Álvaro, et al. “The Optogenetic Promise for Oncology: Episode I.” <i>Molecular and Cellular Oncology</i>, vol. 1, no. 4, e964045, Taylor &#38; Francis, 2014, doi:<a href=\"https://doi.org/10.4161/23723548.2014.964045\">10.4161/23723548.2014.964045</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"As light-based control of fundamental signaling pathways is becoming a reality, the field of optogenetics is rapidly moving beyond neuroscience. We have recently developed receptor tyrosine kinases that are activated by light and control cell proliferation, epithelial–mesenchymal transition, and angiogenic sprouting—cell behaviors central to cancer progression."}],"author":[{"orcid":"0000-0002-5409-8571","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto","first_name":"Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gschaider-Reichhart","full_name":"Gschaider-Reichhart, Eva","orcid":"0000-0002-7218-7738","first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schelch, Karin","last_name":"Schelch","first_name":"Karin"},{"first_name":"Harald L","orcid":"0000-0002-8023-9315","last_name":"Janovjak","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Grusch, Michael","last_name":"Grusch","first_name":"Michael"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"article_number":"e964045","ddc":["570"],"year":"2014","doi":"10.4161/23723548.2014.964045","title":"The optogenetic promise for oncology: Episode I","publication":"Molecular and Cellular Oncology","issue":"4","file_date_updated":"2020-07-14T12:45:26Z","day":"31","type":"journal_article","intvolume":"         1","status":"public","has_accepted_license":"1","department":[{"_id":"HaJa"}],"date_created":"2018-12-11T11:55:19Z","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:26Z","file_size":1765933,"file_name":"2014_Taylor_Alvaro.pdf","checksum":"44e17ad40577ab46eb602e88a8b0b8fd","date_created":"2019-05-16T13:39:11Z","relation":"main_file","content_type":"application/pdf","creator":"kschuh","file_id":"6464"}],"month":"12","date_published":"2014-12-31T00:00:00Z","scopus_import":1,"publisher":"Taylor & Francis","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"title":"Mind the nuisance: Gaussian process classification using privileged noise","scopus_import":1,"publisher":"Neural Information Processing Systems","date_published":"2014-12-08T00:00:00Z","month":"12","year":"2014","date_created":"2018-12-11T11:55:20Z","conference":{"location":"Montreal, Canada","name":"NIPS: Neural Information Processing Systems","end_date":"2014-12-13","start_date":"2014-12-08"},"main_file_link":[{"open_access":"1","url":"https://papers.nips.cc/paper/5373-mind-the-nuisance-gaussian-process-classification-using-privileged-noise"}],"department":[{"_id":"ChLa"}],"status":"public","author":[{"full_name":"Hernandez Lobato, Daniel","last_name":"Hernandez Lobato","first_name":"Daniel"},{"id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","first_name":"Viktoriia","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308"},{"first_name":"Kristian","last_name":"Kersting","full_name":"Kersting, Kristian"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Quadrianto","full_name":"Quadrianto, Novi","first_name":"Novi"}],"abstract":[{"lang":"eng","text":"The learning with privileged information setting has recently attracted a lot of attention within the machine learning community, as it allows the integration of additional knowledge into the training process of a classifier, even when this comes in the form of a data modality that is not available at test time. Here, we show that privileged information can naturally be treated as noise in the latent function of a Gaussian process classifier (GPC). That is, in contrast to the standard GPC setting, the latent function is not just a nuisance but a feature: it becomes a natural measure of confidence about the training data by modulating the slope of the GPC probit likelihood function. Extensive experiments on public datasets show that the proposed GPC method using privileged noise, called GPC+, improves over a standard GPC without privileged knowledge, and also over the current state-of-the-art SVM-based method, SVM+. Moreover, we show that advanced neural networks and deep learning methods can be compressed as privileged information."}],"intvolume":"         1","type":"conference","citation":{"chicago":"Hernandez Lobato, Daniel, Viktoriia Sharmanska, Kristian Kersting, Christoph Lampert, and Novi Quadrianto. “Mind the Nuisance: Gaussian Process Classification Using Privileged Noise.” In <i>Advances in Neural Information Processing Systems</i>, 1:837–45. Neural Information Processing Systems, 2014.","ieee":"D. Hernandez Lobato, V. Sharmanska, K. Kersting, C. Lampert, and N. Quadrianto, “Mind the nuisance: Gaussian process classification using privileged noise,” in <i>Advances in Neural Information Processing Systems</i>, Montreal, Canada, 2014, vol. 1, no. January, pp. 837–845.","apa":"Hernandez Lobato, D., Sharmanska, V., Kersting, K., Lampert, C., &#38; Quadrianto, N. (2014). Mind the nuisance: Gaussian process classification using privileged noise. In <i>Advances in Neural Information Processing Systems</i> (Vol. 1, pp. 837–845). Montreal, Canada: Neural Information Processing Systems.","ista":"Hernandez Lobato D, Sharmanska V, Kersting K, Lampert C, Quadrianto N. 2014. Mind the nuisance: Gaussian process classification using privileged noise. Advances in Neural Information Processing Systems. NIPS: Neural Information Processing Systems vol. 1, 837–845.","short":"D. Hernandez Lobato, V. Sharmanska, K. Kersting, C. Lampert, N. Quadrianto, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems, 2014, pp. 837–845.","mla":"Hernandez Lobato, Daniel, et al. “Mind the Nuisance: Gaussian Process Classification Using Privileged Noise.” <i>Advances in Neural Information Processing Systems</i>, vol. 1, no. January, Neural Information Processing Systems, 2014, pp. 837–45.","ama":"Hernandez Lobato D, Sharmanska V, Kersting K, Lampert C, Quadrianto N. Mind the nuisance: Gaussian process classification using privileged noise. In: <i>Advances in Neural Information Processing Systems</i>. Vol 1. Neural Information Processing Systems; 2014:837-845."},"day":"08","publication_status":"published","quality_controlled":"1","oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2033","page":"837-845","volume":1,"oa":1,"publist_id":"5038","date_updated":"2023-02-23T10:25:24Z","publication":"Advances in Neural Information Processing Systems","issue":"January"},{"issue":"1794","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","day":"17","type":"journal_article","intvolume":"       281","status":"public","department":[{"_id":"CaGu"}],"date_created":"2018-12-11T11:55:21Z","month":"09","date_published":"2014-09-17T00:00:00Z","publisher":"Royal Society, The","scopus_import":1,"language":[{"iso":"eng"}],"date_updated":"2023-02-23T14:06:44Z","oa":1,"volume":281,"publist_id":"5019","_id":"2036","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The project was supported by Leverhulme Trust.","quality_controlled":"1","oa_version":"Submitted Version","publication_status":"published","citation":{"chicago":"Lagator, Mato, Nick Colegrave, and Paul Neve. “Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The, 2014. <a href=\"https://doi.org/10.1098/rspb.2014.1679\">https://doi.org/10.1098/rspb.2014.1679</a>.","apa":"Lagator, M., Colegrave, N., &#38; Neve, P. (2014). Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rspb.2014.1679\">https://doi.org/10.1098/rspb.2014.1679</a>","ieee":"M. Lagator, N. Colegrave, and P. Neve, “Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 281, no. 1794. Royal Society, The, 2014.","short":"M. Lagator, N. Colegrave, P. Neve, Proceedings of the Royal Society of London Series B Biological Sciences 281 (2014).","ista":"Lagator M, Colegrave N, Neve P. 2014. Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. Proceedings of the Royal Society of London Series B Biological Sciences. 281(1794), 20141679.","mla":"Lagator, Mato, et al. “Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 281, no. 1794, 20141679, Royal Society, The, 2014, doi:<a href=\"https://doi.org/10.1098/rspb.2014.1679\">10.1098/rspb.2014.1679</a>.","ama":"Lagator M, Colegrave N, Neve P. Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2014;281(1794). doi:<a href=\"https://doi.org/10.1098/rspb.2014.1679\">10.1098/rspb.2014.1679</a>"},"abstract":[{"text":" In rapidly changing environments, selection history may impact the dynamics of adaptation. Mutations selected in one environment may result in pleiotropic fitness trade-offs in subsequent novel environments, slowing the rates of adaptation. Epistatic interactions between mutations selected in sequential stressful environments may slow or accelerate subsequent rates of adaptation, depending on the nature of that interaction. We explored the dynamics of adaptation during sequential exposure to herbicides with different modes of action in Chlamydomonas reinhardtii. Evolution of resistance to two of the herbicides was largely independent of selection history. For carbetamide, previous adaptation to other herbicide modes of action positively impacted the likelihood of adaptation to this herbicide. Furthermore, while adaptation to all individual herbicides was associated with pleiotropic fitness costs in stress-free environments, we observed that accumulation of resistance mechanisms was accompanied by a reduction in overall fitness costs. We suggest that antagonistic epistasis may be a driving mechanism that enables populations to more readily adapt in novel environments. These findings highlight the potential for sequences of xenobiotics to facilitate the rapid evolution of multiple-drug and -pesticide resistance, as well as the potential for epistatic interactions between adaptive mutations to facilitate evolutionary rescue in rapidly changing environments. ","lang":"eng"}],"author":[{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato","last_name":"Lagator","full_name":"Lagator, Mato"},{"first_name":"Nick","last_name":"Colegrave","full_name":"Colegrave, Nick"},{"full_name":"Neve, Paul","last_name":"Neve","first_name":"Paul"}],"article_number":"20141679","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4211454/","open_access":"1"}],"related_material":{"record":[{"id":"9741","relation":"research_data","status":"public"}]},"doi":"10.1098/rspb.2014.1679","year":"2014","title":"Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses"},{"status":"public","intvolume":"        15","type":"journal_article","day":"16","file_date_updated":"2020-07-14T12:45:26Z","issue":"4","publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"publisher":"ACM","scopus_import":1,"article_type":"original","date_published":"2014-09-16T00:00:00Z","month":"09","date_created":"2018-12-11T11:55:21Z","file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4851","creator":"system","date_updated":"2020-07-14T12:45:26Z","access_level":"open_access","file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","file_size":346184,"date_created":"2018-12-12T10:10:59Z","checksum":"354c41d37500b56320afce94cf9a99c2"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"has_accepted_license":"1","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"abstract":[{"lang":"eng","text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with &quot;controlled accumulation,&quot; allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable."}],"publication_status":"published","citation":{"chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4. ACM, 2014.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2014). Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2014;15(4). doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4, 27, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","quality_controlled":"1","oa_version":"Submitted Version","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"_id":"2038","date_updated":"2023-02-23T12:23:54Z","oa":1,"volume":15,"publist_id":"5013","article_processing_charge":"No","pubrep_id":"192","title":"Temporal specifications with accumulative values","ec_funded":1,"doi":"10.1145/2629686","year":"2014","ddc":["000","004"],"related_material":{"record":[{"id":"3356","relation":"earlier_version","status":"public"},{"id":"5385","relation":"earlier_version","status":"public"}]},"article_number":"27"},{"date_published":"2014-09-11T00:00:00Z","month":"09","language":[{"iso":"eng"}],"publisher":"Public Library of Science","scopus_import":1,"department":[{"_id":"KrCh"}],"has_accepted_license":"1","date_created":"2018-12-11T11:55:22Z","file":[{"relation":"main_file","content_type":"application/pdf","creator":"system","file_id":"4890","file_size":1399093,"file_name":"IST-2016-440-v1+1_journal.pcbi.1003818.pdf","checksum":"712d4c5787ddf97809cfc962507f0738","date_created":"2018-12-12T10:11:35Z","access_level":"open_access","date_updated":"2020-07-14T12:45:26Z"}],"type":"journal_article","day":"11","status":"public","intvolume":"        10","file_date_updated":"2020-07-14T12:45:26Z","issue":"9","publication":"PLoS Computational Biology","ec_funded":1,"doi":"10.1371/journal.pcbi.1003818","year":"2014","pubrep_id":"440","title":"The time scale of evolutionary innovation","article_number":"7p","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"related_material":{"record":[{"id":"9739","relation":"research_data","status":"public"}]},"publication_status":"published","citation":{"chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.” <i>PLoS Computational Biology</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">https://doi.org/10.1371/journal.pcbi.1003818</a>.","ieee":"K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” <i>PLoS Computational Biology</i>, vol. 10, no. 9. Public Library of Science, 2014.","apa":"Chatterjee, K., Pavlogiannis, A., Adlam, B., &#38; Nowak, M. (2014). The time scale of evolutionary innovation. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">https://doi.org/10.1371/journal.pcbi.1003818</a>","ista":"Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9), 7p.","short":"K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Nowak, PLoS Computational Biology 10 (2014).","mla":"Chatterjee, Krishnendu, et al. “The Time Scale of Evolutionary Innovation.” <i>PLoS Computational Biology</i>, vol. 10, no. 9, 7p, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">10.1371/journal.pcbi.1003818</a>.","ama":"Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. The time scale of evolutionary innovation. <i>PLoS Computational Biology</i>. 2014;10(9). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">10.1371/journal.pcbi.1003818</a>"},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"last_name":"Adlam","full_name":"Adlam, Ben","first_name":"Ben"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"abstract":[{"lang":"eng","text":"A fundamental question in biology is the following: what is the time scale that is needed for evolutionary innovations? There are many results that characterize single steps in terms of the fixation time of new mutants arising in populations of certain size and structure. But here we ask a different question, which is concerned with the much longer time scale of evolutionary trajectories: how long does it take for a population exploring a fitness landscape to find target sequences that encode new biological functions? Our key variable is the length, (Formula presented.) of the genetic sequence that undergoes adaptation. In computer science there is a crucial distinction between problems that require algorithms which take polynomial or exponential time. The latter are considered to be intractable. Here we develop a theoretical approach that allows us to estimate the time of evolution as function of (Formula presented.) We show that adaptation on many fitness landscapes takes time that is exponential in (Formula presented.) even if there are broad selection gradients and many targets uniformly distributed in sequence space. These negative results lead us to search for specific mechanisms that allow evolution to work on polynomial time scales. We study a regeneration process and show that it enables evolution to work in polynomial time."}],"date_updated":"2023-02-23T14:06:36Z","oa":1,"publist_id":"5012","volume":10,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","_id":"2039"},{"language":[{"iso":"eng"}],"scopus_import":1,"title":"Coordination of progenitor specification and growth in mouse and chick spinal cord","publisher":"American Association for the Advancement of Science","date_published":"2014-09-26T00:00:00Z","month":"09","doi":"10.1126/science.1254927","year":"2014","date_created":"2018-12-11T11:55:22Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4228193/"}],"article_number":"1254927","department":[{"_id":"ToBo"}],"status":"public","author":[{"full_name":"Kicheva, Anna","last_name":"Kicheva","first_name":"Anna"},{"first_name":"Mark Tobias","full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ana","last_name":"Ribeiro","full_name":"Ribeiro, Ana"},{"full_name":"Pérez Valle, Helena","last_name":"Pérez Valle","first_name":"Helena"},{"first_name":"Robin","last_name":"Lovell Badge","full_name":"Lovell Badge, Robin"},{"last_name":"Episkopou","full_name":"Episkopou, Vasso","first_name":"Vasso"},{"first_name":"James","last_name":"Briscoe","full_name":"Briscoe, James"}],"intvolume":"       345","abstract":[{"text":"Development requires tissue growth as well as cell diversification. To address how these processes are coordinated, we analyzed the development of molecularly distinct domains of neural progenitors in the mouse and chick neural tube. We show that during development, these domains undergo changes in size that do not scale with changes in overall tissue size. Our data show that domain proportions are first established by opposing morphogen gradients and subsequently controlled by domain-specific regulation of differentiation rate but not differences in proliferation rate. Regulation of differentiation rate is key to maintaining domain proportions while accommodating both intra- and interspecies variations in size. Thus, the sequential control of progenitor specification and differentiation elaborates pattern without requiring that signaling gradients grow as tissues expand. ","lang":"eng"}],"type":"journal_article","citation":{"mla":"Kicheva, Anna, et al. “Coordination of Progenitor Specification and Growth in Mouse and Chick Spinal Cord.” <i>Science</i>, vol. 345, no. 6204, 1254927, American Association for the Advancement of Science, 2014, doi:<a href=\"https://doi.org/10.1126/science.1254927\">10.1126/science.1254927</a>.","ama":"Kicheva A, Bollenbach MT, Ribeiro A, et al. Coordination of progenitor specification and growth in mouse and chick spinal cord. <i>Science</i>. 2014;345(6204). doi:<a href=\"https://doi.org/10.1126/science.1254927\">10.1126/science.1254927</a>","ista":"Kicheva A, Bollenbach MT, Ribeiro A, Pérez Valle H, Lovell Badge R, Episkopou V, Briscoe J. 2014. Coordination of progenitor specification and growth in mouse and chick spinal cord. Science. 345(6204), 1254927.","short":"A. Kicheva, M.T. Bollenbach, A. Ribeiro, H. Pérez Valle, R. Lovell Badge, V. Episkopou, J. Briscoe, Science 345 (2014).","apa":"Kicheva, A., Bollenbach, M. T., Ribeiro, A., Pérez Valle, H., Lovell Badge, R., Episkopou, V., &#38; Briscoe, J. (2014). Coordination of progenitor specification and growth in mouse and chick spinal cord. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1254927\">https://doi.org/10.1126/science.1254927</a>","ieee":"A. Kicheva <i>et al.</i>, “Coordination of progenitor specification and growth in mouse and chick spinal cord,” <i>Science</i>, vol. 345, no. 6204. American Association for the Advancement of Science, 2014.","chicago":"Kicheva, Anna, Mark Tobias Bollenbach, Ana Ribeiro, Helena Pérez Valle, Robin Lovell Badge, Vasso Episkopou, and James Briscoe. “Coordination of Progenitor Specification and Growth in Mouse and Chick Spinal Cord.” <i>Science</i>. American Association for the Advancement of Science, 2014. <a href=\"https://doi.org/10.1126/science.1254927\">https://doi.org/10.1126/science.1254927</a>."},"day":"26","publication_status":"published","oa_version":"Submitted Version","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2040","volume":345,"oa":1,"date_updated":"2021-01-12T06:54:55Z","publist_id":"5011","publication":"Science","issue":"6204"},{"_id":"2041","quality_controlled":"1","oa_version":"Published Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":8,"oa":1,"publist_id":"5010","date_updated":"2021-01-12T06:54:55Z","abstract":[{"text":"The hippocampus mediates several higher brain functions, such as learning, memory, and spatial coding. The input region of the hippocampus, the dentate gyrus, plays a critical role in these processes. Several lines of evidence suggest that the dentate gyrus acts as a preprocessor of incoming information, preparing it for subsequent processing in CA3. For example, the dentate gyrus converts input from the entorhinal cortex, where cells have multiple spatial fields, into the spatially more specific place cell activity characteristic of the CA3 region. Furthermore, the dentate gyrus is involved in pattern separation, transforming relatively similar input patterns into substantially different output patterns. Finally, the dentate gyrus produces a very sparse coding scheme in which only a very small fraction of neurons are active at any one time.","lang":"eng"}],"author":[{"first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"John","last_name":"Lisman","full_name":"Lisman, John"}],"citation":{"short":"P.M. Jonas, J. Lisman, Frontiers in Neural Circuits 8 (2014).","ista":"Jonas PM, Lisman J. 2014. Structure, function and plasticity of hippocampal dentate gyrus microcircuits. Frontiers in Neural Circuits. 8, 2p.","mla":"Jonas, Peter M., and John Lisman. “Structure, Function and Plasticity of Hippocampal Dentate Gyrus Microcircuits.” <i>Frontiers in Neural Circuits</i>, vol. 8, 2p, Frontiers Research Foundation, 2014, doi:<a href=\"https://doi.org/10.3389/fncir.2014.00107\">10.3389/fncir.2014.00107</a>.","ama":"Jonas PM, Lisman J. Structure, function and plasticity of hippocampal dentate gyrus microcircuits. <i>Frontiers in Neural Circuits</i>. 2014;8. doi:<a href=\"https://doi.org/10.3389/fncir.2014.00107\">10.3389/fncir.2014.00107</a>","chicago":"Jonas, Peter M, and John Lisman. “Structure, Function and Plasticity of Hippocampal Dentate Gyrus Microcircuits.” <i>Frontiers in Neural Circuits</i>. Frontiers Research Foundation, 2014. <a href=\"https://doi.org/10.3389/fncir.2014.00107\">https://doi.org/10.3389/fncir.2014.00107</a>.","apa":"Jonas, P. M., &#38; Lisman, J. (2014). Structure, function and plasticity of hippocampal dentate gyrus microcircuits. <i>Frontiers in Neural Circuits</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fncir.2014.00107\">https://doi.org/10.3389/fncir.2014.00107</a>","ieee":"P. M. Jonas and J. Lisman, “Structure, function and plasticity of hippocampal dentate gyrus microcircuits,” <i>Frontiers in Neural Circuits</i>, vol. 8. Frontiers Research Foundation, 2014."},"publication_status":"published","ddc":["570"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_number":"2p","title":"Structure, function and plasticity of hippocampal dentate gyrus microcircuits","pubrep_id":"424","year":"2014","doi":"10.3389/fncir.2014.00107","publication":"Frontiers in Neural Circuits","file_date_updated":"2020-07-14T12:45:26Z","intvolume":"         8","status":"public","day":"10","type":"journal_article","file":[{"file_id":"5294","creator":"system","relation":"main_file","content_type":"application/pdf","checksum":"3ca57b164045523f876407e9f13a9fb8","date_created":"2018-12-12T10:17:38Z","file_size":201110,"file_name":"IST-2016-424-v1+1_fncir-08-00107.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:26Z"}],"date_created":"2018-12-11T11:55:22Z","has_accepted_license":"1","department":[{"_id":"PeJo"}],"scopus_import":1,"publisher":"Frontiers Research Foundation","language":[{"iso":"eng"}],"month":"09","date_published":"2014-09-10T00:00:00Z"},{"date_created":"2018-12-11T11:55:23Z","file":[{"date_updated":"2020-07-14T12:45:26Z","access_level":"open_access","date_created":"2018-12-12T10:11:24Z","checksum":"3f6d2776b90a842a28359cc957d3d04b","file_name":"IST-2015-396-v1+1_1471-2164-15-663.pdf","file_size":1489769,"creator":"system","file_id":"4878","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"JoBo"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"scopus_import":1,"publisher":"BioMed Central","date_published":"2014-08-08T00:00:00Z","month":"08","file_date_updated":"2020-07-14T12:45:26Z","publication":"BMC Genomics","issue":"1","status":"public","intvolume":"        15","type":"journal_article","day":"08","ddc":["570"],"article_number":"663","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"title":"Motif depletion in bacteriophages infecting hosts with CRISPR systems","pubrep_id":"396","doi":"10.1186/1471-2164-15-663","year":"2014","quality_controlled":"1","oa_version":"Published Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"2042","volume":15,"publist_id":"5009","date_updated":"2021-01-12T06:54:56Z","oa":1,"author":[{"id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Anne","full_name":"Kupczok, Anne","last_name":"Kupczok"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","last_name":"Bollback","full_name":"Bollback, Jonathan P","first_name":"Jonathan P"}],"abstract":[{"lang":"eng","text":"Background: CRISPR is a microbial immune system likely to be involved in host-parasite coevolution. It functions using target sequences encoded by the bacterial genome, which interfere with invading nucleic acids using a homology-dependent system. The system also requires protospacer associated motifs (PAMs), short motifs close to the target sequence that are required for interference in CRISPR types I and II. Here, we investigate whether PAMs are depleted in phage genomes due to selection pressure to escape recognition.Results: To this end, we analyzed two data sets. Phages infecting all bacterial hosts were analyzed first, followed by a detailed analysis of phages infecting the genus Streptococcus, where PAMs are best understood. We use two different measures of motif underrepresentation that control for codon bias and the frequency of submotifs. We compare phages infecting species with a particular CRISPR type to those infecting species without that type. Since only known PAMs were investigated, the analysis is restricted to CRISPR types I-C and I-E and in Streptococcus to types I-C and II. We found evidence for PAM depletion in Streptococcus phages infecting hosts with CRISPR type I-C, in Vibrio phages infecting hosts with CRISPR type I-E and in Streptococcus thermopilus phages infecting hosts with type II-A, known as CRISPR3.Conclusions: The observed motif depletion in phages with hosts having CRISPR can be attributed to selection rather than to mutational bias, as mutational bias should affect the phages of all hosts. This observation implies that the CRISPR system has been efficient in the groups discussed here."}],"citation":{"chicago":"Kupczok, Anne, and Jonathan P Bollback. “Motif Depletion in Bacteriophages Infecting Hosts with CRISPR Systems.” <i>BMC Genomics</i>. BioMed Central, 2014. <a href=\"https://doi.org/10.1186/1471-2164-15-663\">https://doi.org/10.1186/1471-2164-15-663</a>.","ieee":"A. Kupczok and J. P. Bollback, “Motif depletion in bacteriophages infecting hosts with CRISPR systems,” <i>BMC Genomics</i>, vol. 15, no. 1. BioMed Central, 2014.","apa":"Kupczok, A., &#38; Bollback, J. P. (2014). Motif depletion in bacteriophages infecting hosts with CRISPR systems. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2164-15-663\">https://doi.org/10.1186/1471-2164-15-663</a>","ista":"Kupczok A, Bollback JP. 2014. Motif depletion in bacteriophages infecting hosts with CRISPR systems. BMC Genomics. 15(1), 663.","short":"A. Kupczok, J.P. Bollback, BMC Genomics 15 (2014).","ama":"Kupczok A, Bollback JP. Motif depletion in bacteriophages infecting hosts with CRISPR systems. <i>BMC Genomics</i>. 2014;15(1). doi:<a href=\"https://doi.org/10.1186/1471-2164-15-663\">10.1186/1471-2164-15-663</a>","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Motif Depletion in Bacteriophages Infecting Hosts with CRISPR Systems.” <i>BMC Genomics</i>, vol. 15, no. 1, 663, BioMed Central, 2014, doi:<a href=\"https://doi.org/10.1186/1471-2164-15-663\">10.1186/1471-2164-15-663</a>."},"publication_status":"published"},{"month":"01","date_published":"2014-01-01T00:00:00Z","publisher":"Society of Industrial and Applied Mathematics","scopus_import":1,"language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"conference":{"location":"Portland, USA","name":"ALENEX: Algorithm Engineering and Experiments","end_date":"2014-01-05","start_date":"2014-01-05"},"date_created":"2018-12-11T11:55:23Z","day":"01","type":"conference","status":"public","publication":"Proceedings of the Workshop on Algorithm Engineering and Experiments","page":"31 - 38","year":"2014","doi":"10.1137/1.9781611973198.4","ec_funded":1,"title":"Distributed computation of persistent homology","main_file_link":[{"url":"http://arxiv.org/abs/1310.0710","open_access":"1"}],"publication_status":"published","citation":{"chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Distributed Computation of Persistent Homology.” In <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, edited by Catherine  McGeoch and Ulrich Meyer, 31–38. Society of Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973198.4\">https://doi.org/10.1137/1.9781611973198.4</a>.","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Distributed computation of persistent homology,” in <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, Portland, USA, 2014, pp. 31–38.","apa":"Bauer, U., Kerber, M., &#38; Reininghaus, J. (2014). Distributed computation of persistent homology. In C.  McGeoch &#38; U. Meyer (Eds.), <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i> (pp. 31–38). Portland, USA: Society of Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973198.4\">https://doi.org/10.1137/1.9781611973198.4</a>","ista":"Bauer U, Kerber M, Reininghaus J. 2014. Distributed computation of persistent homology. Proceedings of the Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, 31–38.","short":"U. Bauer, M. Kerber, J. Reininghaus, in:, C.  McGeoch, U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2014, pp. 31–38.","mla":"Bauer, Ulrich, et al. “Distributed Computation of Persistent Homology.” <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, edited by Catherine  McGeoch and Ulrich Meyer, Society of Industrial and Applied Mathematics, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.1137/1.9781611973198.4\">10.1137/1.9781611973198.4</a>.","ama":"Bauer U, Kerber M, Reininghaus J. Distributed computation of persistent homology. In:  McGeoch C, Meyer U, eds. <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>. Society of Industrial and Applied Mathematics; 2014:31-38. doi:<a href=\"https://doi.org/10.1137/1.9781611973198.4\">10.1137/1.9781611973198.4</a>"},"abstract":[{"lang":"eng","text":"Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically – as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems [1], we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits the computation of much larger instances than on a single machine. Moreover, we observe that the parallelism at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms. In our experiments, we were able to compute the persistent homology of filtrations with more than a billion (109) elements within seconds on a cluster with 32 nodes using less than 6GB of memory per node."}],"author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael"},{"first_name":"Jan","full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87"}],"editor":[{"last_name":" McGeoch","full_name":" McGeoch, Catherine","first_name":"Catherine"},{"last_name":"Meyer","full_name":"Meyer, Ulrich","first_name":"Ulrich"}],"oa":1,"publist_id":"5008","date_updated":"2021-01-12T06:54:56Z","_id":"2043","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Submitted Version"},{"status":"public","day":"19","series_title":"Mathematics and Visualization","type":"book_chapter","publication":"Topological Methods in Data Analysis and Visualization III","page":"103 - 117","scopus_import":1,"publisher":"Springer","language":[{"iso":"eng"}],"month":"03","date_published":"2014-03-19T00:00:00Z","date_created":"2018-12-11T11:55:23Z","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"We present a parallel algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which uses discrete Morse Theory to compute persistence; we derive the same worst-case complexity bound in a more general context. The algorithm employs several practical optimization techniques, which are of independent interest. Our sequential implementation of the algorithm is competitive with state-of-the-art methods, and we further improve the performance through parallel computation."}],"author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich"},{"last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","first_name":"Michael"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Reininghaus","full_name":"Reininghaus, Jan"}],"citation":{"ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent Homology in Chunks,” in <i>Topological Methods in Data Analysis and Visualization III</i>, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Springer, 2014, pp. 103–117.","apa":"Bauer, U., Kerber, M., &#38; Reininghaus, J. (2014). Clear and Compress: Computing Persistent Homology in Chunks. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III</i> (pp. 103–117). Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">https://doi.org/10.1007/978-3-319-04099-8_7</a>","chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Clear and Compress: Computing Persistent Homology in Chunks.” In <i>Topological Methods in Data Analysis and Visualization III</i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 103–17. Mathematics and Visualization. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">https://doi.org/10.1007/978-3-319-04099-8_7</a>.","ama":"Bauer U, Kerber M, Reininghaus J. Clear and Compress: Computing Persistent Homology in Chunks. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological Methods in Data Analysis and Visualization III</i>. Mathematics and Visualization. Springer; 2014:103-117. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">10.1007/978-3-319-04099-8_7</a>","mla":"Bauer, Ulrich, et al. “Clear and Compress: Computing Persistent Homology in Chunks.” <i>Topological Methods in Data Analysis and Visualization III</i>, edited by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">10.1007/978-3-319-04099-8_7</a>.","short":"U. Bauer, M. Kerber, J. Reininghaus, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III, Springer, 2014, pp. 103–117.","ista":"Bauer U, Kerber M, Reininghaus J. 2014.Clear and Compress: Computing Persistent Homology in Chunks. In: Topological Methods in Data Analysis and Visualization III. , 103–117."},"publication_status":"published","_id":"2044","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Bremer","full_name":"Bremer, Peer-Timo","first_name":"Peer-Timo"},{"first_name":"Ingrid","last_name":"Hotz","full_name":"Hotz, Ingrid"},{"full_name":"Pascucci, Valerio","last_name":"Pascucci","first_name":"Valerio"},{"first_name":"Ronald","full_name":"Peikert, Ronald","last_name":"Peikert"}],"oa":1,"publist_id":"5007","date_updated":"2021-01-12T06:54:56Z","title":"Clear and Compress: Computing Persistent Homology in Chunks","year":"2014","doi":"10.1007/978-3-319-04099-8_7","ec_funded":1,"main_file_link":[{"url":"http://arxiv.org/abs/1303.0477","open_access":"1"}]},{"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","page":"329 - 344","day":"01","type":"conference","intvolume":"      8383","status":"public","department":[{"_id":"KrPi"}],"conference":{"name":"PKC: Public Key Crypography","location":"Buenos Aires, Argentina","end_date":"2014-03-28","start_date":"2014-03-26"},"date_created":"2018-12-11T11:55:24Z","month":"01","date_published":"2014-01-01T00:00:00Z","publisher":"Springer","scopus_import":1,"language":[{"iso":"eng"}],"editor":[{"full_name":"Krawczyk, Hugo","last_name":"Krawczyk","first_name":"Hugo"}],"volume":8383,"date_updated":"2021-01-12T06:54:57Z","publist_id":"5006","oa":1,"_id":"2045","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The second author was supported by EPSRC grant EP/H043454/1.","quality_controlled":"1","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668"}],"oa_version":"Submitted Version","publication_status":"published","citation":{"short":"D. Dachman Soled, G. Fuchsbauer, P. Mohassel, A. O’Neill, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 329–344.","ista":"Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. 2014. Enhanced chosen-ciphertext security and applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol. 8383, 329–344.","ama":"Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. Enhanced chosen-ciphertext security and applications. In: Krawczyk H, ed. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8383. Springer; 2014:329-344. doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">10.1007/978-3-642-54631-0_19</a>","mla":"Dachman Soled, Dana, et al. “Enhanced Chosen-Ciphertext Security and Applications.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 329–44, doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">10.1007/978-3-642-54631-0_19</a>.","chicago":"Dachman Soled, Dana, Georg Fuchsbauer, Payman Mohassel, and Adam O’Neill. “Enhanced Chosen-Ciphertext Security and Applications.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, 8383:329–44. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">https://doi.org/10.1007/978-3-642-54631-0_19</a>.","ieee":"D. Dachman Soled, G. Fuchsbauer, P. Mohassel, and A. O’Neill, “Enhanced chosen-ciphertext security and applications,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Buenos Aires, Argentina, 2014, vol. 8383, pp. 329–344.","apa":"Dachman Soled, D., Fuchsbauer, G., Mohassel, P., &#38; O’Neill, A. (2014). Enhanced chosen-ciphertext security and applications. In H. Krawczyk (Ed.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8383, pp. 329–344). Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">https://doi.org/10.1007/978-3-642-54631-0_19</a>"},"abstract":[{"lang":"eng","text":"We introduce and study a new notion of enhanced chosen-ciphertext security (ECCA) for public-key encryption. Loosely speaking, in the ECCA security experiment, the decryption oracle provided to the adversary is augmented to return not only the output of the decryption algorithm on a queried ciphertext but also of a randomness-recovery algorithm associated to the scheme. Our results mainly concern the case where the randomness-recovery algorithm is efficient. We provide constructions of ECCA-secure encryption from adaptive trapdoor functions as defined by Kiltz et al. (EUROCRYPT 2010), resulting in ECCA encryption from standard number-theoretic assumptions. We then give two applications of ECCA-secure encryption: (1) We use it as a unifying concept in showing equivalence of adaptive trapdoor functions and tag-based adaptive trapdoor functions, resolving an open question of Kiltz et al. (2) We show that ECCA-secure encryption can be used to securely realize an approach to public-key encryption with non-interactive opening (PKENO) originally suggested by Damgård and Thorbek (EUROCRYPT 2007), resulting in new and practical PKENO schemes quite different from those in prior work. Our results demonstrate that ECCA security is of both practical and theoretical interest."}],"author":[{"first_name":"Dana","full_name":"Dachman Soled, Dana","last_name":"Dachman Soled"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"},{"last_name":"Mohassel","full_name":"Mohassel, Payman","first_name":"Payman"},{"last_name":"O’Neill","full_name":"O’Neill, Adam","first_name":"Adam"}],"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2012/543"}],"year":"2014","doi":"10.1007/978-3-642-54631-0_19","ec_funded":1,"title":"Enhanced chosen-ciphertext security and applications"},{"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","page":"520 - 537","intvolume":"      8383","status":"public","day":"01","type":"conference","conference":{"start_date":"2014-05-26","name":"PKC: Public Key Crypography","location":"Buenos Aires, Argentina","end_date":"2014-05-28"},"date_created":"2018-12-11T11:55:24Z","department":[{"_id":"KrPi"}],"scopus_import":1,"publisher":"Springer","language":[{"iso":"eng"}],"month":"01","date_published":"2014-01-01T00:00:00Z","_id":"2046","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"quality_controlled":"1","oa_version":"Submitted Version","acknowledgement":"Part of his work was done while at Bristol University, supported by EPSRC grant EP/H043454/1.","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Krawczyk","full_name":"Krawczyk, Hugo","first_name":"Hugo"}],"volume":8383,"oa":1,"publist_id":"5005","date_updated":"2021-01-12T06:54:57Z","abstract":[{"lang":"eng","text":"We introduce policy-based signatures (PBS), where a signer can only sign messages conforming to some authority-specified policy. The main requirements are unforgeability and privacy, the latter meaning that signatures not reveal the policy. PBS offers value along two fronts: (1) On the practical side, they allow a corporation to control what messages its employees can sign under the corporate key. (2) On the theoretical side, they unify existing work, capturing other forms of signatures as special cases or allowing them to be easily built. Our work focuses on definitions of PBS, proofs that this challenging primitive is realizable for arbitrary policies, efficient constructions for specific policies, and a few representative applications."}],"author":[{"first_name":"Mihir","full_name":"Bellare, Mihir","last_name":"Bellare"},{"first_name":"Georg","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Bellare M, Fuchsbauer G. 2014. Policy-based signatures. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol. 8383, 520–537.","short":"M. Bellare, G. Fuchsbauer, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 520–537.","mla":"Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 520–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">10.1007/978-3-642-54631-0_30</a>.","ama":"Bellare M, Fuchsbauer G. Policy-based signatures. In: Krawczyk H, ed. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8383. Springer; 2014:520-537. doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">10.1007/978-3-642-54631-0_30</a>","chicago":"Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, 8383:520–37. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">https://doi.org/10.1007/978-3-642-54631-0_30</a>.","ieee":"M. Bellare and G. Fuchsbauer, “Policy-based signatures,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Buenos Aires, Argentina, 2014, vol. 8383, pp. 520–537.","apa":"Bellare, M., &#38; Fuchsbauer, G. (2014). Policy-based signatures. In H. Krawczyk (Ed.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8383, pp. 520–537). Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">https://doi.org/10.1007/978-3-642-54631-0_30</a>"},"publication_status":"published","alternative_title":["LNCS"],"main_file_link":[{"url":"https://eprint.iacr.org/2013/413","open_access":"1"}],"title":"Policy-based signatures","doi":"10.1007/978-3-642-54631-0_30","year":"2014","ec_funded":1},{"department":[{"_id":"KrPi"},{"_id":"CaUh"}],"date_created":"2018-12-11T11:55:24Z","conference":{"start_date":"2014-09-17","end_date":"2014-09-19","name":"PSD: Privacy in Statistical Databases","location":"Ibiza, Spain"},"date_published":"2014-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":1,"page":"170 - 184","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","type":"conference","day":"01","status":"public","intvolume":"      8744","main_file_link":[{"url":"http://arxiv.org/abs/1407.8067","open_access":"1"}],"alternative_title":["LNCS"],"year":"2014","doi":"10.1007/978-3-319-11257-2_14","external_id":{"arxiv":["1407.8067"]},"title":"Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases","date_updated":"2021-01-12T06:54:57Z","publist_id":"5004","oa":1,"volume":8744,"arxiv":1,"editor":[{"first_name":"Josep","full_name":"Domingo Ferrer, Josep","last_name":"Domingo Ferrer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was partially supported by BCS- 0941518 to the Department of Statistics at Carnegie Mellon University.","oa_version":"Submitted Version","project":[{"_id":"25636330-B435-11E9-9278-68D0E5697425","name":"ROOTS Genome-wide Analysis of Root Traits","grant_number":"11-NSF-1070"}],"quality_controlled":"1","_id":"2047","publication_status":"published","citation":{"ieee":"F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Ibiza, Spain, 2014, vol. 8744, pp. 170–184.","apa":"Yu, F., Rybar, M., Uhler, C., &#38; Fienberg, S. (2014). Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In J. Domingo Ferrer (Ed.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8744, pp. 170–184). Ibiza, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">https://doi.org/10.1007/978-3-319-11257-2_14</a>","chicago":"Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Josep Domingo Ferrer, 8744:170–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">https://doi.org/10.1007/978-3-319-11257-2_14</a>.","mla":"Yu, Fei, et al. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">10.1007/978-3-319-11257-2_14</a>.","ama":"Yu F, Rybar M, Uhler C, Fienberg S. Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In: Domingo Ferrer J, ed. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8744. Springer; 2014:170-184. doi:<a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">10.1007/978-3-319-11257-2_14</a>","short":"F. Yu, M. Rybar, C. Uhler, S. Fienberg, in:, J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 170–184.","ista":"Yu F, Rybar M, Uhler C, Fienberg S. 2014. Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PSD: Privacy in Statistical Databases, LNCS, vol. 8744, 170–184."},"author":[{"first_name":"Fei","full_name":"Yu, Fei","last_name":"Yu"},{"last_name":"Rybar","full_name":"Rybar, Michal","first_name":"Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","last_name":"Uhler","full_name":"Uhler, Caroline","first_name":"Caroline"},{"full_name":"Fienberg, Stephen","last_name":"Fienberg","first_name":"Stephen"}],"abstract":[{"text":"Following the publication of an attack on genome-wide association studies (GWAS) data proposed by Homer et al., considerable attention has been given to developing methods for releasing GWAS data in a privacy-preserving way. Here, we develop an end-to-end differentially private method for solving regression problems with convex penalty functions and selecting the penalty parameters by cross-validation. In particular, we focus on penalized logistic regression with elastic-net regularization, a method widely used to in GWAS analyses to identify disease-causing genes. We show how a differentially private procedure for penalized logistic regression with elastic-net regularization can be applied to the analysis of GWAS data and evaluate our method’s performance.","lang":"eng"}]},{"page":"463 - 491","publication":"Journal of Fluid Mechanics","status":"public","intvolume":"       738","type":"journal_article","day":"10","date_created":"2018-12-11T11:55:25Z","department":[{"_id":"BjHo"}],"language":[{"iso":"eng"}],"publisher":"Cambridge University Press","scopus_import":1,"date_published":"2014-01-10T00:00:00Z","month":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","quality_controlled":"1","_id":"2050","oa":1,"publist_id":"5001","date_updated":"2021-01-12T06:54:59Z","volume":738,"article_processing_charge":"No","arxiv":1,"author":[{"orcid":"0000-0003-4312-0179","full_name":"Kühnen, Jakob","last_name":"Kühnen","first_name":"Jakob","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Holzner, Markus","last_name":"Holzner","first_name":"Markus"},{"first_name":"Björn","full_name":"Hof, Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kuhlmann, Hendrik","last_name":"Kuhlmann","first_name":"Hendrik"}],"abstract":[{"text":"The flow instability and further transition to turbulence in a toroidal pipe (torus) with curvature ratio (tube-to-coiling diameter) 0.049 is investigated experimentally. The flow inside the toroidal pipe is driven by a steel sphere fitted to the inner pipe diameter. The sphere is moved with constant azimuthal velocity from outside the torus by a moving magnet. The experiment is designed to investigate curved pipe flow by optical measurement techniques. Using stereoscopic particle image velocimetry, laser Doppler velocimetry and pressure drop measurements, the flow is measured for Reynolds numbers ranging from 1000 to 15 000. Time- and space-resolved velocity fields are obtained and analysed. The steady axisymmetric basic flow is strongly influenced by centrifugal effects. On an increase of the Reynolds number we find a sequence of bifurcations. For Re=4075±2% a supercritical bifurcation to an oscillatory flow is found in which waves travel in the streamwise direction with a phase velocity slightly faster than the mean flow. The oscillatory flow is superseded by a presumably quasi-periodic flow at a further increase of the Reynolds number before turbulence sets in. The results are found to be compatible, in general, with earlier experimental and numerical investigations on transition to turbulence in helical and curved pipes. However, important aspects of the bifurcation scenario differ considerably.","lang":"eng"}],"publication_status":"published","citation":{"apa":"Kühnen, J., Holzner, M., Hof, B., &#38; Kuhlmann, H. (2014). Experimental investigation of transitional flow in a toroidal pipe. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2013.603\">https://doi.org/10.1017/jfm.2013.603</a>","ieee":"J. Kühnen, M. Holzner, B. Hof, and H. Kuhlmann, “Experimental investigation of transitional flow in a toroidal pipe,” <i>Journal of Fluid Mechanics</i>, vol. 738. Cambridge University Press, pp. 463–491, 2014.","chicago":"Kühnen, Jakob, Markus Holzner, Björn Hof, and Hendrik Kuhlmann. “Experimental Investigation of Transitional Flow in a Toroidal Pipe.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2014. <a href=\"https://doi.org/10.1017/jfm.2013.603\">https://doi.org/10.1017/jfm.2013.603</a>.","mla":"Kühnen, Jakob, et al. “Experimental Investigation of Transitional Flow in a Toroidal Pipe.” <i>Journal of Fluid Mechanics</i>, vol. 738, Cambridge University Press, 2014, pp. 463–91, doi:<a href=\"https://doi.org/10.1017/jfm.2013.603\">10.1017/jfm.2013.603</a>.","ama":"Kühnen J, Holzner M, Hof B, Kuhlmann H. Experimental investigation of transitional flow in a toroidal pipe. <i>Journal of Fluid Mechanics</i>. 2014;738:463-491. doi:<a href=\"https://doi.org/10.1017/jfm.2013.603\">10.1017/jfm.2013.603</a>","short":"J. Kühnen, M. Holzner, B. Hof, H. Kuhlmann, Journal of Fluid Mechanics 738 (2014) 463–491.","ista":"Kühnen J, Holzner M, Hof B, Kuhlmann H. 2014. Experimental investigation of transitional flow in a toroidal pipe. Journal of Fluid Mechanics. 738, 463–491."},"main_file_link":[{"url":"https://arxiv.org/abs/1508.06546","open_access":"1"}],"title":"Experimental investigation of transitional flow in a toroidal pipe","external_id":{"arxiv":["1508.06546"]},"year":"2014","doi":"10.1017/jfm.2013.603"},{"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01065586","open_access":"1"}],"date_created":"2018-12-11T11:55:26Z","conference":{"name":"NIPS: Neural Information Processing Systems"},"date_published":"2014-01-01T00:00:00Z","month":"01","year":"2014","publisher":"Neural Information Processing Systems","title":"Multilabel structured output learning with random spanning trees of max-margin Markov networks","date_updated":"2021-01-12T06:54:59Z","publist_id":"4996","oa":1,"quality_controlled":0,"_id":"2051","extern":1,"type":"conference","publication_status":"published","citation":{"chicago":"Marchand, Mario, Su Hongyu, Emilie Morvant, Juho Rousu, and John Shawe Taylor. “Multilabel Structured Output Learning with Random Spanning Trees of Max-Margin Markov Networks.” Neural Information Processing Systems, 2014.","apa":"Marchand, M., Hongyu, S., Morvant, E., Rousu, J., &#38; Shawe Taylor, J. (2014). Multilabel structured output learning with random spanning trees of max-margin Markov networks. Presented at the NIPS: Neural Information Processing Systems, Neural Information Processing Systems.","ieee":"M. Marchand, S. Hongyu, E. Morvant, J. Rousu, and J. Shawe Taylor, “Multilabel structured output learning with random spanning trees of max-margin Markov networks,” presented at the NIPS: Neural Information Processing Systems, 2014.","short":"M. Marchand, S. Hongyu, E. Morvant, J. Rousu, J. Shawe Taylor, in:, Neural Information Processing Systems, 2014.","ista":"Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. 2014. Multilabel structured output learning with random spanning trees of max-margin Markov networks. NIPS: Neural Information Processing Systems.","mla":"Marchand, Mario, et al. <i>Multilabel Structured Output Learning with Random Spanning Trees of Max-Margin Markov Networks</i>. Neural Information Processing Systems, 2014.","ama":"Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. Multilabel structured output learning with random spanning trees of max-margin Markov networks. In: Neural Information Processing Systems; 2014."},"day":"01","status":"public","author":[{"last_name":"Marchand","full_name":"Marchand, Mario","first_name":"Mario"},{"first_name":"Su","full_name":"Hongyu, Su","last_name":"Hongyu"},{"id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","first_name":"Emilie","last_name":"Morvant","full_name":"Emilie Morvant","orcid":"0000-0002-8301-7240"},{"first_name":"Juho","full_name":"Rousu, Juho","last_name":"Rousu"},{"full_name":"Shawe-Taylor, John","last_name":"Shawe Taylor","first_name":"John"}],"abstract":[{"lang":"eng","text":"We show that the usual score function for conditional Markov networks can be written as the expectation over the scores of their spanning trees. We also show that a small random sample of these output trees can attain a significant fraction of the margin obtained by the complete graph and we provide conditions under which we can perform tractable inference. The experimental results confirm that practical learning is scalable to realistic datasets using this approach."}]},{"_id":"2052","oa_version":"None","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The second, third, fourth and fifth authors were supported by the Austrian National Research Network S11403-N23 (RiSE) of the Austrian Science Fund (FWF) and by the Vienna Science and Technology Fund (WWTF) through grants PROSEED, ICT12-059, and VRG11-005.","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","editor":[{"last_name":"Baldan","full_name":"Baldan, Paolo","first_name":"Paolo"},{"first_name":"Daniele","full_name":"Gorla, Daniele","last_name":"Gorla"}],"page":"109 - 124","publist_id":"4994","volume":8704,"date_updated":"2021-01-12T06:54:59Z","intvolume":"      8704","abstract":[{"lang":"eng","text":"A standard technique for solving the parameterized model checking problem is to reduce it to the classic model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the parameterized model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that model checking the parameterized system can be reduced to model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata."}],"author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","full_name":"Aminof, Benjamin","last_name":"Aminof","first_name":"Benjamin"},{"first_name":"Tomer","full_name":"Kotek, Tomer","last_name":"Kotek"},{"first_name":"Sacha","full_name":"Rubin, Sacha","last_name":"Rubin"},{"first_name":"Francesco","full_name":"Spegni, Francesco","last_name":"Spegni"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"}],"status":"public","citation":{"short":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–124.","ista":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model checking of rendezvous systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">10.1007/978-3-662-44584-6_9</a>.","ama":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking of rendezvous systems. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:109-124. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">10.1007/978-3-662-44584-6_9</a>","chicago":"Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut Veith. “Parameterized Model Checking of Rendezvous Systems.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">https://doi.org/10.1007/978-3-662-44584-6_9</a>.","ieee":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 109–124.","apa":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., &#38; Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">https://doi.org/10.1007/978-3-662-44584-6_9</a>"},"day":"01","publication_status":"published","type":"conference","conference":{"start_date":"2014-09-02","name":"CONCUR: Concurrency Theory","end_date":"2014-09-05","location":"Rome, Italy"},"date_created":"2018-12-11T11:55:26Z","alternative_title":["LNCS"],"department":[{"_id":"KrCh"}],"title":"Parameterized model checking of rendezvous systems","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"month":"09","year":"2014","doi":"10.1007/978-3-662-44584-6_9","date_published":"2014-09-01T00:00:00Z"},{"page":"249 - 265","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","status":"public","intvolume":"      8704","type":"conference","day":"01","date_created":"2018-12-11T11:55:27Z","conference":{"start_date":"2014-09-02","name":"CONCUR: Concurrency Theory","location":"Rome, Italy","end_date":"2014-09-05"},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2014-09-01T00:00:00Z","month":"09","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work is supported by the EU 7th Framework Programme under grant agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"oa_version":"Submitted Version","_id":"2053","oa":1,"volume":8704,"date_updated":"2021-01-12T06:55:00Z","publist_id":"4993","editor":[{"first_name":"Paolo","last_name":"Baldan","full_name":"Baldan, Paolo"},{"last_name":"Gorla","full_name":"Gorla, Daniele","first_name":"Daniele"}],"author":[{"last_name":"Hermanns","full_name":"Hermanns, Holger","first_name":"Holger"},{"last_name":"Krčál","full_name":"Krčál, Jan","first_name":"Jan"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition refines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems."}],"publication_status":"published","citation":{"short":"H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.","ista":"Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.","ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>.","chicago":"Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>.","apa":"Hermanns, H., Krčál, J., &#38; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>","ieee":"H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 249–265."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5084"}],"alternative_title":["LNCS"],"title":"Probabilistic bisimulation: Naturally on distributions","ec_funded":1,"doi":"10.1007/978-3-662-44584-6_18","year":"2014"},{"department":[{"_id":"KrCh"}],"conference":{"start_date":"2014-09-02","location":"Rome, Italy","end_date":"2014-09-05","name":"CONCUR: Concurrency Theory"},"date_created":"2018-12-11T11:55:27Z","month":"09","date_published":"2014-09-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","page":"544 - 559","day":"01","type":"conference","intvolume":"      8704","status":"public","alternative_title":["LNCS"],"related_material":{"record":[{"id":"3354","relation":"earlier_version","status":"public"}]},"doi":"10.1007/978-3-662-44584-6_37","year":"2014","ec_funded":1,"title":"Qualitative concurrent parity games: Bounded rationality","editor":[{"last_name":"Baldan","full_name":"Baldan, Paolo","first_name":"Paolo"},{"first_name":"Daniele","full_name":"Gorla, Daniele","last_name":"Gorla"}],"volume":8704,"date_updated":"2023-02-23T11:23:36Z","publist_id":"4992","_id":"2054","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"None","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","publication_status":"published","citation":{"ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 544–559.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>.","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>","mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>.","ista":"Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.","short":"K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559."},"abstract":[{"lang":"eng","text":"We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games."}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}]}]