[{"intvolume":" 25","publisher":"ACM","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"publication_status":"published","status":"public","title":"Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks","_id":"1861","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","acknowledgement":"HYCON2; EC; European Commission\r\n","oa_version":"None","volume":25,"date_created":"2018-12-11T11:54:25Z","date_updated":"2021-01-12T06:53:41Z","author":[{"full_name":"Ruess, Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","last_name":"Ruess","first_name":"Jakob"},{"full_name":"Lygeros, John","last_name":"Lygeros","first_name":"John"}],"type":"journal_article","article_number":"8","issue":"2","publist_id":"5238","abstract":[{"lang":"eng","text":"Continuous-time Markov chains are commonly used in practice for modeling biochemical reaction networks in which the inherent randomness of themolecular interactions cannot be ignored. This has motivated recent research effort into methods for parameter inference and experiment design for such models. The major difficulty is that such methods usually require one to iteratively solve the chemical master equation that governs the time evolution of the probability distribution of the system. This, however, is rarely possible, and even approximation techniques remain limited to relatively small and simple systems. An alternative explored in this article is to base methods on only some low-order moments of the entire probability distribution. We summarize the theory behind such moment-based methods for parameter inference and experiment design and provide new case studies where we investigate their performance."}],"quality_controlled":"1","citation":{"ama":"Ruess J, Lygeros J. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 2015;25(2). doi:10.1145/2688906","ista":"Ruess J, Lygeros J. 2015. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 25(2), 8.","apa":"Ruess, J., & Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. ACM. https://doi.org/10.1145/2688906","ieee":"J. Ruess and J. Lygeros, “Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks,” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2. ACM, 2015.","mla":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2, 8, ACM, 2015, doi:10.1145/2688906.","short":"J. Ruess, J. Lygeros, ACM Transactions on Modeling and Computer Simulation 25 (2015).","chicago":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” ACM Transactions on Modeling and Computer Simulation. ACM, 2015. https://doi.org/10.1145/2688906."},"publication":"ACM Transactions on Modeling and Computer Simulation","language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","doi":"10.1145/2688906","scopus_import":1,"day":"01","month":"02"},{"scopus_import":1,"day":"28","month":"01","citation":{"mla":"Henzinger, Thomas A., and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” Communications of the ACM, vol. 58, no. 2, ACM, 2015, pp. 86–86, doi:10.1145/2701001.","short":"T.A. Henzinger, J. Raskin, Communications of the ACM 58 (2015) 86–86.","chicago":"Henzinger, Thomas A, and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” Communications of the ACM. ACM, 2015. https://doi.org/10.1145/2701001.","ama":"Henzinger TA, Raskin J. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 2015;58(2):86-86. doi:10.1145/2701001","ista":"Henzinger TA, Raskin J. 2015. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 58(2), 86–86.","ieee":"T. A. Henzinger and J. Raskin, “The equivalence problem for finite automata: Technical perspective,” Communications of the ACM, vol. 58, no. 2. ACM, pp. 86–86, 2015.","apa":"Henzinger, T. A., & Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. Communications of the ACM. ACM. https://doi.org/10.1145/2701001"},"publication":"Communications of the ACM","page":"86-86","doi":"10.1145/2701001","date_published":"2015-01-28T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","publist_id":"5232","issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1866","year":"2015","department":[{"_id":"ToHe"}],"intvolume":" 58","publisher":"ACM","title":"The equivalence problem for finite automata: Technical perspective","publication_status":"published","status":"public","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"oa_version":"None","volume":58,"date_created":"2018-12-11T11:54:26Z","date_updated":"2021-01-12T06:53:43Z"},{"title":"Auxin transporters and binding proteins at a glance","status":"public","ddc":["570"],"intvolume":" 128","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1871","oa_version":"Submitted Version","file":[{"creator":"system","file_size":1688844,"content_type":"application/pdf","file_name":"IST-2016-563-v1+1_1.full.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:11:00Z","checksum":"24c779f4cd9d549ca6833e26f486be27","file_id":"4852","relation":"main_file"}],"pubrep_id":"563","type":"journal_article","abstract":[{"lang":"eng","text":"The plant hormone auxin is a key regulator of plant growth and development. Differences in auxin distribution within tissues are mediated by the polar auxin transport machinery, and cellular auxin responses occur depending on changes in cellular auxin levels. Multiple receptor systems at the cell surface and in the interior operate to sense and interpret fluctuations in auxin distribution that occur during plant development. Until now, three proteins or protein complexes that can bind auxin have been identified. SCFTIR1 [a SKP1-cullin-1-F-box complex that contains transport inhibitor response 1 (TIR1) as the F-box protein] and S-phase-kinaseassociated protein 2 (SKP2) localize to the nucleus, whereas auxinbinding protein 1 (ABP1), predominantly associates with the endoplasmic reticulum and cell surface. In this Cell Science at a Glance article, we summarize recent discoveries in the field of auxin transport and signaling that have led to the identification of new components of these pathways, as well as their mutual interaction."}],"issue":"1","page":"1 - 7","publication":"Journal of Cell Science","citation":{"mla":"Grones, Peter, and Jiří Friml. “Auxin Transporters and Binding Proteins at a Glance.” Journal of Cell Science, vol. 128, no. 1, Company of Biologists, 2015, pp. 1–7, doi:10.1242/jcs.159418.","short":"P. Grones, J. Friml, Journal of Cell Science 128 (2015) 1–7.","chicago":"Grones, Peter, and Jiří Friml. “Auxin Transporters and Binding Proteins at a Glance.” Journal of Cell Science. Company of Biologists, 2015. https://doi.org/10.1242/jcs.159418.","ama":"Grones P, Friml J. Auxin transporters and binding proteins at a glance. Journal of Cell Science. 2015;128(1):1-7. doi:10.1242/jcs.159418","ista":"Grones P, Friml J. 2015. Auxin transporters and binding proteins at a glance. Journal of Cell Science. 128(1), 1–7.","ieee":"P. Grones and J. Friml, “Auxin transporters and binding proteins at a glance,” Journal of Cell Science, vol. 128, no. 1. Company of Biologists, pp. 1–7, 2015.","apa":"Grones, P., & Friml, J. (2015). Auxin transporters and binding proteins at a glance. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.159418"},"date_published":"2015-01-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","publication_status":"published","publisher":"Company of Biologists","department":[{"_id":"JiFr"}],"year":"2015","acknowledgement":"This work was supported by the European Research Council [project ERC-2011-StG-20101109-PSDP]; European Social Fund [grant number CZ.1.07/2.3.00/20.0043] and the Czech Science Foundation GAČR [grant number GA13-40637S]","date_updated":"2021-01-12T06:53:45Z","date_created":"2018-12-11T11:54:28Z","volume":128,"author":[{"full_name":"Grones, Peter","first_name":"Peter","last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí"}],"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5225","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1242/jcs.159418","month":"01"},{"title":"A three-plane architectonic atlas of the rat hippocampal region","status":"public","publication_status":"published","department":[{"_id":"JoCs"}],"publisher":"Wiley","intvolume":" 25","_id":"1874","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:53:46Z","date_created":"2018-12-11T11:54:29Z","volume":25,"oa_version":"None","author":[{"full_name":"Boccara, Charlotte","first_name":"Charlotte","last_name":"Boccara","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7237-5109"},{"first_name":"Lisa","last_name":"Kjønigsen","full_name":"Kjønigsen, Lisa"},{"first_name":"Ingvild","last_name":"Hammer","full_name":"Hammer, Ingvild"},{"full_name":"Bjaalie, Jan","last_name":"Bjaalie","first_name":"Jan"},{"full_name":"Leergaard, Trygve","last_name":"Leergaard","first_name":"Trygve"},{"last_name":"Witter","first_name":"Menno","full_name":"Witter, Menno"}],"type":"journal_article","abstract":[{"lang":"eng","text":"The hippocampal region, comprising the hippocampal formation and the parahippocampal region, has been one of the most intensively studied parts of the brain for decades. Better understanding of its functional diversity and complexity has led to an increased demand for specificity in experimental procedures and manipulations. In view of the complex 3D structure of the hippocampal region, precisely positioned experimental approaches require a fine-grained architectural description that is available and readable to experimentalists lacking detailed anatomical experience. In this paper, we provide the first cyto- and chemoarchitectural description of the hippocampal formation and parahippocampal region in the rat at high resolution and in the three standard sectional planes: coronal, horizontal and sagittal. The atlas uses a series of adjacent sections stained for neurons and for a number of chemical marker substances, particularly parvalbumin and calbindin. All the borders defined in one plane have been cross-checked against their counterparts in the other two planes. The entire dataset will be made available as a web-based interactive application through the Rodent Brain WorkBench (http://www.rbwb.org) which, together with this paper, provides a unique atlas resource."}],"issue":"7","publist_id":"5222","quality_controlled":"1","page":"838 - 857","publication":"Hippocampus","citation":{"mla":"Boccara, Charlotte N., et al. “A Three-Plane Architectonic Atlas of the Rat Hippocampal Region.” Hippocampus, vol. 25, no. 7, Wiley, 2015, pp. 838–57, doi:10.1002/hipo.22407.","short":"C.N. Boccara, L. Kjønigsen, I. Hammer, J. Bjaalie, T. Leergaard, M. Witter, Hippocampus 25 (2015) 838–857.","chicago":"Boccara, Charlotte N., Lisa Kjønigsen, Ingvild Hammer, Jan Bjaalie, Trygve Leergaard, and Menno Witter. “A Three-Plane Architectonic Atlas of the Rat Hippocampal Region.” Hippocampus. Wiley, 2015. https://doi.org/10.1002/hipo.22407.","ama":"Boccara CN, Kjønigsen L, Hammer I, Bjaalie J, Leergaard T, Witter M. A three-plane architectonic atlas of the rat hippocampal region. Hippocampus. 2015;25(7):838-857. doi:10.1002/hipo.22407","ista":"Boccara CN, Kjønigsen L, Hammer I, Bjaalie J, Leergaard T, Witter M. 2015. A three-plane architectonic atlas of the rat hippocampal region. Hippocampus. 25(7), 838–857.","apa":"Boccara, C. N., Kjønigsen, L., Hammer, I., Bjaalie, J., Leergaard, T., & Witter, M. (2015). A three-plane architectonic atlas of the rat hippocampal region. Hippocampus. Wiley. https://doi.org/10.1002/hipo.22407","ieee":"C. N. Boccara, L. Kjønigsen, I. Hammer, J. Bjaalie, T. Leergaard, and M. Witter, “A three-plane architectonic atlas of the rat hippocampal region,” Hippocampus, vol. 25, no. 7. Wiley, pp. 838–857, 2015."},"language":[{"iso":"eng"}],"doi":"10.1002/hipo.22407","date_published":"2015-07-01T00:00:00Z","scopus_import":1,"day":"01","month":"07"},{"year":"2015","_id":"1873","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"POMDPs under probabilistic semantics","publication_status":"published","publisher":"Elsevier","intvolume":" 221","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T06:53:46Z","date_created":"2018-12-11T11:54:28Z","oa_version":"Preprint","volume":221,"type":"journal_article","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated with every transition, and the payoff of an infinite path is the long-run average of the rewards. We consider two types of path constraints: (i) a quantitative constraint defines the set of paths where the payoff is at least a given threshold λ1ε(0,1]; and (ii) a qualitative constraint which is a special case of the quantitative constraint with λ1=1. We consider the computation of the almost-sure winning set, where the controller needs to ensure that the path constraint is satisfied with probability 1. Our main results for qualitative path constraints are as follows: (i) the problem of deciding the existence of a finite-memory controller is EXPTIME-complete; and (ii) the problem of deciding the existence of an infinite-memory controller is undecidable. For quantitative path constraints we show that the problem of deciding the existence of a finite-memory controller is undecidable. We also present a prototype implementation of our EXPTIME algorithm and experimental results on several examples."}],"publist_id":"5224","publication":"Artificial Intelligence","citation":{"ama":"Chatterjee K, Chmelik M. POMDPs under probabilistic semantics. Artificial Intelligence. 2015;221:46-72. doi:10.1016/j.artint.2014.12.009","ista":"Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.","apa":"Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2014.12.009","ieee":"K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221. Elsevier, pp. 46–72, 2015.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence, vol. 221, Elsevier, 2015, pp. 46–72, doi:10.1016/j.artint.2014.12.009.","short":"K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.2058"}],"external_id":{"arxiv":["1408.2058"]},"oa":1,"quality_controlled":"1","page":"46 - 72","date_published":"2015-04-01T00:00:00Z","doi":"10.1016/j.artint.2014.12.009","language":[{"iso":"eng"}],"scopus_import":1,"month":"04","day":"01"},{"date_created":"2018-12-11T11:54:30Z","date_updated":"2021-01-12T06:53:48Z","volume":259,"author":[{"first_name":"A","last_name":"Kremer","full_name":"Kremer, A"},{"last_name":"Lippens","first_name":"Stefaan","full_name":"Lippens, Stefaan"},{"full_name":"Bartunkova, Sonia","first_name":"Sonia","last_name":"Bartunkova"},{"full_name":"Asselbergh, Bob","last_name":"Asselbergh","first_name":"Bob"},{"full_name":"Blanpain, Cendric","first_name":"Cendric","last_name":"Blanpain"},{"id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","first_name":"Matyas","last_name":"Fendrych","full_name":"Fendrych, Matyas"},{"full_name":"Goossens, A","first_name":"A","last_name":"Goossens"},{"last_name":"Holt","first_name":"Matthew","full_name":"Holt, Matthew"},{"last_name":"Janssens","first_name":"Sophie","full_name":"Janssens, Sophie"},{"full_name":"Krols, Michiel","first_name":"Michiel","last_name":"Krols"},{"full_name":"Larsimont, Jean","last_name":"Larsimont","first_name":"Jean"},{"last_name":"Mc Guire","first_name":"Conor","full_name":"Mc Guire, Conor"},{"first_name":"Moritz","last_name":"Nowack","full_name":"Nowack, Moritz"},{"full_name":"Saelens, Xavier","first_name":"Xavier","last_name":"Saelens"},{"last_name":"Schertel","first_name":"Andreas","full_name":"Schertel, Andreas"},{"first_name":"B","last_name":"Schepens","full_name":"Schepens, B"},{"full_name":"Slezak, M","last_name":"Slezak","first_name":"M"},{"full_name":"Timmerman, Vincent","first_name":"Vincent","last_name":"Timmerman"},{"full_name":"Theunis, Clara","first_name":"Clara","last_name":"Theunis"},{"first_name":"Ronald","last_name":"Van Brempt","full_name":"Van Brempt, Ronald"},{"last_name":"Visser","first_name":"Y","full_name":"Visser, Y"},{"last_name":"Guérin","first_name":"Christophe","full_name":"Guérin, Christophe"}],"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Wiley-Blackwell","acknowledgement":"The Zeiss Merlin with Gatan 3View2XP and Zeiss Auriga were acquired through a CLEM grant from Minister Ingrid Lieten to the VIB Bio-Imaging-Core. Michiel Krols and Saskia Lippens are the recipients of a fellowship from the FWO (Fonds Wetenschappelijk Onderzoek) of Flanders.","year":"2015","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5218","language":[{"iso":"eng"}],"doi":"10.1111/jmi.12211","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"08","oa_version":"Published Version","file":[{"file_name":"IST-2016-459-v1+1_KREMER_et_al-2015-Journal_of_Microscopy.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":2899898,"file_id":"4872","relation":"main_file","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:11:19Z","checksum":"3649c5372d1644062d728ea9287e367f"}],"pubrep_id":"459","status":"public","ddc":["570"],"title":"Developing 3D SEM in a broad biological context","intvolume":" 259","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1879","abstract":[{"text":"When electron microscopy (EM) was introduced in the 1930s it gave scientists their first look into the nanoworld of cells. Over the last 80 years EM has vastly increased our understanding of the complex cellular structures that underlie the diverse functions that cells need to maintain life. One drawback that has been difficult to overcome was the inherent lack of volume information, mainly due to the limit on the thickness of sections that could be viewed in a transmission electron microscope (TEM). For many years scientists struggled to achieve three-dimensional (3D) EM using serial section reconstructions, TEM tomography, and scanning EM (SEM) techniques such as freeze-fracture. Although each technique yielded some special information, they required a significant amount of time and specialist expertise to obtain even a very small 3D EM dataset. Almost 20 years ago scientists began to exploit SEMs to image blocks of embedded tissues and perform serial sectioning of these tissues inside the SEM chamber. Using first focused ion beams (FIB) and subsequently robotic ultramicrotomes (serial block-face, SBF-SEM) microscopists were able to collect large volumes of 3D EM information at resolutions that could address many important biological questions, and do so in an efficient manner. We present here some examples of 3D EM taken from the many diverse specimens that have been imaged in our core facility. We propose that the next major step forward will be to efficiently correlate functional information obtained using light microscopy (LM) with 3D EM datasets to more completely investigate the important links between cell structures and their functions.","lang":"eng"}],"issue":"2","type":"journal_article","date_published":"2015-08-01T00:00:00Z","page":"80 - 96","publication":"Journal of Microscopy","citation":{"ista":"Kremer A, Lippens S, Bartunkova S, Asselbergh B, Blanpain C, Fendrych M, Goossens A, Holt M, Janssens S, Krols M, Larsimont J, Mc Guire C, Nowack M, Saelens X, Schertel A, Schepens B, Slezak M, Timmerman V, Theunis C, Van Brempt R, Visser Y, Guérin C. 2015. Developing 3D SEM in a broad biological context. Journal of Microscopy. 259(2), 80–96.","ieee":"A. Kremer et al., “Developing 3D SEM in a broad biological context,” Journal of Microscopy, vol. 259, no. 2. Wiley-Blackwell, pp. 80–96, 2015.","apa":"Kremer, A., Lippens, S., Bartunkova, S., Asselbergh, B., Blanpain, C., Fendrych, M., … Guérin, C. (2015). Developing 3D SEM in a broad biological context. Journal of Microscopy. Wiley-Blackwell. https://doi.org/10.1111/jmi.12211","ama":"Kremer A, Lippens S, Bartunkova S, et al. Developing 3D SEM in a broad biological context. Journal of Microscopy. 2015;259(2):80-96. doi:10.1111/jmi.12211","chicago":"Kremer, A, Stefaan Lippens, Sonia Bartunkova, Bob Asselbergh, Cendric Blanpain, Matyas Fendrych, A Goossens, et al. “Developing 3D SEM in a Broad Biological Context.” Journal of Microscopy. Wiley-Blackwell, 2015. https://doi.org/10.1111/jmi.12211.","mla":"Kremer, A., et al. “Developing 3D SEM in a Broad Biological Context.” Journal of Microscopy, vol. 259, no. 2, Wiley-Blackwell, 2015, pp. 80–96, doi:10.1111/jmi.12211.","short":"A. Kremer, S. Lippens, S. Bartunkova, B. Asselbergh, C. Blanpain, M. Fendrych, A. Goossens, M. Holt, S. Janssens, M. Krols, J. Larsimont, C. Mc Guire, M. Nowack, X. Saelens, A. Schertel, B. Schepens, M. Slezak, V. Timmerman, C. Theunis, R. Van Brempt, Y. Visser, C. Guérin, Journal of Microscopy 259 (2015) 80–96."},"day":"01","has_accepted_license":"1","scopus_import":1},{"abstract":[{"lang":"eng","text":"We investigate the relation between Bose-Einstein condensation (BEC) and superfluidity in the ground state of a one-dimensional model of interacting bosons in a strong random potential. We prove rigorously that in a certain parameter regime the superfluid fraction can be arbitrarily small while complete BEC prevails. In another regime there is both complete BEC and complete superfluidity, despite the strong disorder"}],"type":"journal_article","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2016-447-v1+1_document_1_.pdf","content_type":"application/pdf","file_size":768108,"creator":"system","relation":"main_file","file_id":"4963","checksum":"38fdf2b5ac30445e26a5d613abd84b16","date_updated":"2020-07-14T12:45:20Z","date_created":"2018-12-12T10:12:44Z"}],"pubrep_id":"447","ddc":["530"],"title":"Superfluid behavior of a Bose-Einstein condensate in a random potential","status":"public","intvolume":" 17","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1880","day":"15","has_accepted_license":"1","scopus_import":1,"date_published":"2015-01-15T00:00:00Z","publication":"New Journal of Physics","citation":{"ista":"Könenberg M, Moser T, Seiringer R, Yngvason J. 2015. Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. 17, 013022.","ieee":"M. Könenberg, T. Moser, R. Seiringer, and J. Yngvason, “Superfluid behavior of a Bose-Einstein condensate in a random potential,” New Journal of Physics, vol. 17. IOP Publishing Ltd., 2015.","apa":"Könenberg, M., Moser, T., Seiringer, R., & Yngvason, J. (2015). Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. IOP Publishing Ltd. https://doi.org/10.1088/1367-2630/17/1/013022","ama":"Könenberg M, Moser T, Seiringer R, Yngvason J. Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. 2015;17. doi:10.1088/1367-2630/17/1/013022","chicago":"Könenberg, Martin, Thomas Moser, Robert Seiringer, and Jakob Yngvason. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” New Journal of Physics. IOP Publishing Ltd., 2015. https://doi.org/10.1088/1367-2630/17/1/013022.","mla":"Könenberg, Martin, et al. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” New Journal of Physics, vol. 17, 013022, IOP Publishing Ltd., 2015, doi:10.1088/1367-2630/17/1/013022.","short":"M. Könenberg, T. Moser, R. Seiringer, J. Yngvason, New Journal of Physics 17 (2015)."},"file_date_updated":"2020-07-14T12:45:20Z","publist_id":"5214","article_number":"013022","date_updated":"2021-01-12T06:53:48Z","date_created":"2018-12-11T11:54:30Z","volume":17,"author":[{"last_name":"Könenberg","first_name":"Martin","full_name":"Könenberg, Martin"},{"id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","last_name":"Moser","first_name":"Thomas","full_name":"Moser, Thomas"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"}],"publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"IOP Publishing Ltd.","acknowledgement":"Support from the Natural Sciences and Engineering Research Council of Canada NSERC (MK and RS) and from the Austrian Science Fund FWF (JY, under project P 22929-N16) is gratefully acknowledged","year":"2015","month":"01","language":[{"iso":"eng"}],"doi":"10.1088/1367-2630/17/1/013022","quality_controlled":"1","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"}},{"scopus_import":1,"day":"30","citation":{"mla":"Fahrenberg, Uli, et al. Compositionality for Quantitative Specifications. Vol. 8997, Springer, 2015, pp. 306–24, doi:10.1007/978-3-319-15317-9_19.","short":"U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.","chicago":"Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,” 8997:306–24. Springer, 2015. https://doi.org/10.1007/978-3-319-15317-9_19.","ama":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. doi:10.1007/978-3-319-15317-9_19","ista":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. 2015. Compositionality for quantitative specifications. FACS: Formal Aspects of Component Software, LNCS, vol. 8997, 306–324.","apa":"Fahrenberg, U., Kretinsky, J., Legay, A., & Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer. https://doi.org/10.1007/978-3-319-15317-9_19","ieee":"U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324."},"page":"306 - 324","date_published":"2015-01-30T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations."}],"_id":"1882","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 8997","status":"public","title":"Compositionality for quantitative specifications","oa_version":"Preprint","month":"01","main_file_link":[{"url":"http://arxiv.org/abs/1408.1256","open_access":"1"}],"oa":1,"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-319-15317-9_19","conference":{"name":"FACS: Formal Aspects of Component Software","end_date":"2014-09-12","start_date":"2014-09-10","location":"Bertinoro, Italy"},"language":[{"iso":"eng"}],"publist_id":"5216","ec_funded":1,"year":"2015","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) project S11402-N23 (RiSE), and by the Czech Science Foundation, grant No. P202/12/G061.","publisher":"Springer","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","author":[{"last_name":"Fahrenberg","first_name":"Uli","full_name":"Fahrenberg, Uli"},{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","full_name":"Kretinsky, Jan"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"last_name":"Traonouez","first_name":"Louis","full_name":"Traonouez, Louis"}],"volume":8997,"date_updated":"2021-01-12T06:53:49Z","date_created":"2018-12-11T11:54:31Z"},{"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.91.022803","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1012.3298"}],"external_id":{"arxiv":["1012.3298"]},"month":"02","date_updated":"2021-01-12T06:53:49Z","date_created":"2018-12-11T11:54:31Z","volume":91,"author":[{"first_name":"Stephanie","last_name":"Keller-Schmidt","full_name":"Keller-Schmidt, Stephanie"},{"last_name":"Tugrul","first_name":"Murat","orcid":"0000-0002-8523-0758","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","full_name":"Tugrul, Murat"},{"full_name":"Eguíluz, Víctor","first_name":"Víctor","last_name":"Eguíluz"},{"last_name":"Hernandez Garcia","first_name":"Emilio","full_name":"Hernandez Garcia, Emilio"},{"full_name":"Klemm, Konstantin","first_name":"Konstantin","last_name":"Klemm"}],"publication_status":"published","publisher":"American Institute of Physics","department":[{"_id":"NiBa"}],"year":"2015","publist_id":"5213","article_number":"022803","date_published":"2015-02-02T00:00:00Z","article_type":"original","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","citation":{"mla":"Keller-Schmidt, Stephanie, et al. “Anomalous Scaling in an Age-Dependent Branching Model.” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 2, 022803, American Institute of Physics, 2015, doi:10.1103/PhysRevE.91.022803.","short":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, K. Klemm, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","chicago":"Keller-Schmidt, Stephanie, Murat Tugrul, Víctor Eguíluz, Emilio Hernandez Garcia, and Konstantin Klemm. “Anomalous Scaling in an Age-Dependent Branching Model.” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2015. https://doi.org/10.1103/PhysRevE.91.022803.","ama":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. 2015;91(2). doi:10.1103/PhysRevE.91.022803","ista":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. 2015. Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(2), 022803.","apa":"Keller-Schmidt, S., Tugrul, M., Eguíluz, V., Hernandez Garcia, E., & Klemm, K. (2015). Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.91.022803","ieee":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, and K. Klemm, “Anomalous scaling in an age-dependent branching model,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 2. American Institute of Physics, 2015."},"day":"02","article_processing_charge":"No","scopus_import":1,"oa_version":"Preprint","title":"Anomalous scaling in an age-dependent branching model","status":"public","intvolume":" 91","_id":"1883","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce a one-parametric family of tree growth models, in which branching probabilities decrease with branch age τ as τ-α. Depending on the exponent α, the scaling of tree depth with tree size n displays a transition between the logarithmic scaling of random trees and an algebraic growth. At the transition (α=1) tree depth grows as (logn)2. This anomalous scaling is in good agreement with the trend observed in evolution of biological species, thus providing a theoretical support for age-dependent speciation and associating it to the occurrence of a critical point.\r\n"}],"issue":"2","type":"journal_article"},{"scopus_import":1,"day":"24","month":"01","publication":"Journal of Plant Research","citation":{"chicago":"Cires Rodriguez, Eduardo, and José Prieto. “Phylogenetic Relationships of Petrocoptis A. Braun Ex Endl. (Caryophyllaceae), a Discussed Genus from the Iberian Peninsula.” Journal of Plant Research. Springer, 2015. https://doi.org/10.1007/s10265-014-0691-6.","mla":"Cires Rodriguez, Eduardo, and José Prieto. “Phylogenetic Relationships of Petrocoptis A. Braun Ex Endl. (Caryophyllaceae), a Discussed Genus from the Iberian Peninsula.” Journal of Plant Research, vol. 128, no. 2, Springer, 2015, pp. 223–38, doi:10.1007/s10265-014-0691-6.","short":"E. Cires Rodriguez, J. Prieto, Journal of Plant Research 128 (2015) 223–238.","ista":"Cires Rodriguez E, Prieto J. 2015. Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. Journal of Plant Research. 128(2), 223–238.","apa":"Cires Rodriguez, E., & Prieto, J. (2015). Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. Journal of Plant Research. Springer. https://doi.org/10.1007/s10265-014-0691-6","ieee":"E. Cires Rodriguez and J. Prieto, “Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula,” Journal of Plant Research, vol. 128, no. 2. Springer, pp. 223–238, 2015.","ama":"Cires Rodriguez E, Prieto J. Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. Journal of Plant Research. 2015;128(2):223-238. doi:10.1007/s10265-014-0691-6"},"quality_controlled":"1","page":"223 - 238","doi":"10.1007/s10265-014-0691-6","date_published":"2015-01-24T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Petrocoptis is a small genus of chasmophytic plants endemic to the Iberian Peninsula, with some localized populations in the French Pyrenees. Within the genus, a dozen species have been recognized based on morphological diversity, most of them with limited distribution area, in small populations and frequently with potential threats to their survival. To date, however, a molecular evaluation of the current systematic treatments has not been carried out. The aim of the present study is to infer phylogenetic relationships among its subordinate taxa by using plastidial rps16 intron and nuclear internal transcribed spacer (ITS) DNA sequences; and evaluate the phylogenetic placement of the genus Petrocoptis within the family Caryophyllaceae. The monophyly of Petrocoptis is supported by both ITS and rps16 intron sequence analyses. Furthermore, time estimates using BEAST analyses indicate a Middle to Late Miocene diversification (10.59 Myr, 6.44–15.26 Myr highest posterior densities [HPD], for ITS; 14.30 Myr, 8.61–21.00 Myr HPD, for rps16 intron).","lang":"eng"}],"publist_id":"5217","issue":"2","_id":"1878","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","status":"public","publication_status":"published","title":"Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula","department":[{"_id":"JiFr"}],"intvolume":" 128","publisher":"Springer","author":[{"full_name":"Cires Rodriguez, Eduardo","last_name":"Cires Rodriguez","first_name":"Eduardo","id":"2AD56A7A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Prieto, José","first_name":"José","last_name":"Prieto"}],"date_updated":"2021-01-12T06:53:47Z","date_created":"2018-12-11T11:54:30Z","oa_version":"None","volume":128},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1885","year":"2015","department":[{"_id":"GaTk"}],"intvolume":" 199","publisher":"Genetics Society of America","title":"Positional information, positional error, and readout precision in morphogenesis: A mathematical framework","status":"public","publication_status":"published","author":[{"full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"},{"full_name":"Dubuis, Julien","last_name":"Dubuis","first_name":"Julien"},{"first_name":"Mariela","last_name":"Petkova","full_name":"Petkova, Mariela"},{"first_name":"Thomas","last_name":"Gregor","full_name":"Gregor, Thomas"}],"volume":199,"oa_version":"Preprint","date_updated":"2021-01-12T06:53:50Z","date_created":"2018-12-11T11:54:32Z","type":"journal_article","issue":"1","publist_id":"5210","abstract":[{"lang":"eng","text":"The concept of positional information is central to our understanding of how cells determine their location in a multicellular structure and thereby their developmental fates. Nevertheless, positional information has neither been defined mathematically nor quantified in a principled way. Here we provide an information-theoretic definition in the context of developmental gene expression patterns and examine the features of expression patterns that affect positional information quantitatively. We connect positional information with the concept of positional error and develop tools to directly measure information and error from experimental data. We illustrate our framework for the case of gap gene expression patterns in the early Drosophila embryo and show how information that is distributed among only four genes is sufficient to determine developmental fates with nearly single-cell resolution. Our approach can be generalized to a variety of different model systems; procedures and examples are discussed in detail. "}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5599"}],"oa":1,"citation":{"chicago":"Tkačik, Gašper, Julien Dubuis, Mariela Petkova, and Thomas Gregor. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” Genetics. Genetics Society of America, 2015. https://doi.org/10.1534/genetics.114.171850.","short":"G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59.","mla":"Tkačik, Gašper, et al. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” Genetics, vol. 199, no. 1, Genetics Society of America, 2015, pp. 39–59, doi:10.1534/genetics.114.171850.","apa":"Tkačik, G., Dubuis, J., Petkova, M., & Gregor, T. (2015). Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.114.171850","ieee":"G. Tkačik, J. Dubuis, M. Petkova, and T. Gregor, “Positional information, positional error, and readout precision in morphogenesis: A mathematical framework,” Genetics, vol. 199, no. 1. Genetics Society of America, pp. 39–59, 2015.","ista":"Tkačik G, Dubuis J, Petkova M, Gregor T. 2015. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. 199(1), 39–59.","ama":"Tkačik G, Dubuis J, Petkova M, Gregor T. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. 2015;199(1):39-59. doi:10.1534/genetics.114.171850"},"publication":"Genetics","page":"39 - 59","quality_controlled":"1","doi":"10.1534/genetics.114.171850","date_published":"2015-01-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":1,"month":"01","day":"01"},{"doi":"10.1103/PhysRevE.91.062710","date_published":"2015-06-15T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.04015"}],"citation":{"chicago":"Sokolowski, Thomas R, and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2015. https://doi.org/10.1103/PhysRevE.91.062710.","short":"T.R. Sokolowski, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","mla":"Sokolowski, Thomas R., and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 6, 062710, American Institute of Physics, 2015, doi:10.1103/PhysRevE.91.062710.","apa":"Sokolowski, T. R., & Tkačik, G. (2015). Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.91.062710","ieee":"T. R. Sokolowski and G. Tkačik, “Optimizing information flow in small genetic networks. IV. Spatial coupling,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 6. American Institute of Physics, 2015.","ista":"Sokolowski TR, Tkačik G. 2015. Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(6), 062710.","ama":"Sokolowski TR, Tkačik G. Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. 2015;91(6). doi:10.1103/PhysRevE.91.062710"},"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","quality_controlled":"1","month":"06","day":"15","scopus_import":1,"author":[{"id":"3E999752-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1287-3779","first_name":"Thomas R","last_name":"Sokolowski","full_name":"Sokolowski, Thomas R"},{"last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"oa_version":"Preprint","volume":91,"date_created":"2018-12-11T11:54:49Z","date_updated":"2021-01-12T06:54:13Z","_id":"1940","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Institute of Physics","department":[{"_id":"GaTk"}],"intvolume":" 91","status":"public","publication_status":"published","title":"Optimizing information flow in small genetic networks. IV. Spatial coupling","publist_id":"5145","issue":"6","abstract":[{"lang":"eng","text":"We typically think of cells as responding to external signals independently by regulating their gene expression levels, yet they often locally exchange information and coordinate. Can such spatial coupling be of benefit for conveying signals subject to gene regulatory noise? Here we extend our information-theoretic framework for gene regulation to spatially extended systems. As an example, we consider a lattice of nuclei responding to a concentration field of a transcriptional regulator (the "input") by expressing a single diffusible target gene. When input concentrations are low, diffusive coupling markedly improves information transmission; optimal gene activation functions also systematically change. A qualitatively new regulatory strategy emerges where individual cells respond to the input in a nearly step-like fashion that is subsequently averaged out by strong diffusion. While motivated by early patterning events in the Drosophila embryo, our framework is generically applicable to spatially coupled stochastic gene expression models."}],"type":"journal_article","article_number":"062710"},{"month":"03","day":"06","scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.physleta.2014.12.010","date_published":"2015-03-06T00:00:00Z","quality_controlled":"1","page":"535 - 541","publication":"Physics Letters, Section A","citation":{"ama":"Pausinger F, Steinerberger S. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 2015;379(6):535-541. doi:10.1016/j.physleta.2014.12.010","apa":"Pausinger, F., & Steinerberger, S. (2015). On the distribution of local extrema in quantum chaos. Physics Letters, Section A. Elsevier. https://doi.org/10.1016/j.physleta.2014.12.010","ieee":"F. Pausinger and S. Steinerberger, “On the distribution of local extrema in quantum chaos,” Physics Letters, Section A, vol. 379, no. 6. Elsevier, pp. 535–541, 2015.","ista":"Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 379(6), 535–541.","short":"F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541.","mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” Physics Letters, Section A, vol. 379, no. 6, Elsevier, 2015, pp. 535–41, doi:10.1016/j.physleta.2014.12.010.","chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” Physics Letters, Section A. Elsevier, 2015. https://doi.org/10.1016/j.physleta.2014.12.010."},"abstract":[{"text":"We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2.","lang":"eng"}],"issue":"6","publist_id":"5152","type":"journal_article","date_updated":"2021-01-12T06:54:12Z","date_created":"2018-12-11T11:54:49Z","volume":379,"oa_version":"None","author":[{"last_name":"Pausinger","first_name":"Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian"},{"first_name":"Stefan","last_name":"Steinerberger","full_name":"Steinerberger, Stefan"}],"status":"public","publication_status":"published","title":"On the distribution of local extrema in quantum chaos","intvolume":" 379","publisher":"Elsevier","department":[{"_id":"HeEd"}],"_id":"1938","year":"2015","acknowledgement":"F.P. was supported by the Graduate School of IST Austria. S.S. was partially supported by CRC1060 of the DFG\r\nThe authors thank Olga Symonova and Michael Kerber for sharing their implementation of the persistence algorithm. ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"doi":"10.1016/j.pbi.2014.12.002","date_published":"2015-02-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"page":"116 - 123","publication":"Current Opinion in Plant Biology","citation":{"chicago":"Rakusová, Hana, Matyas Fendrych, and Jiří Friml. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” Current Opinion in Plant Biology. Elsevier, 2015. https://doi.org/10.1016/j.pbi.2014.12.002.","mla":"Rakusová, Hana, et al. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” Current Opinion in Plant Biology, vol. 23, no. 2, Elsevier, 2015, pp. 116–23, doi:10.1016/j.pbi.2014.12.002.","short":"H. Rakusová, M. Fendrych, J. Friml, Current Opinion in Plant Biology 23 (2015) 116–123.","ista":"Rakusová H, Fendrych M, Friml J. 2015. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. 23(2), 116–123.","ieee":"H. Rakusová, M. Fendrych, and J. Friml, “Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants,” Current Opinion in Plant Biology, vol. 23, no. 2. Elsevier, pp. 116–123, 2015.","apa":"Rakusová, H., Fendrych, M., & Friml, J. (2015). Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/j.pbi.2014.12.002","ama":"Rakusová H, Fendrych M, Friml J. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. 2015;23(2):116-123. doi:10.1016/j.pbi.2014.12.002"},"month":"02","day":"01","scopus_import":1,"date_created":"2018-12-11T11:54:51Z","date_updated":"2021-01-12T06:54:15Z","oa_version":"None","volume":23,"author":[{"full_name":"Rakusová, Hana","first_name":"Hana","last_name":"Rakusová"},{"orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87","last_name":"Fendrych","first_name":"Matyas","full_name":"Fendrych, Matyas"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí"}],"title":"Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants","publication_status":"published","status":"public","publisher":"Elsevier","department":[{"_id":"JiFr"}],"intvolume":" 23","_id":"1944","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP); the Agency for Innovation by Science and Technology (IWT) (predoctoral fellowship to H.R.); and the People Programme (Marie Curie Actions) of the European Union","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","ec_funded":1,"publist_id":"5140","issue":"2","type":"journal_article"},{"year":"2015","department":[{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","author":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"},{"full_name":"Samanta, Roopsha","last_name":"Samanta","first_name":"Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tarrach, Thorsten","orcid":"0000-0003-4409-8487","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","last_name":"Tarrach","first_name":"Thorsten"}],"date_created":"2018-12-11T11:55:05Z","date_updated":"2021-01-12T06:54:33Z","publist_id":"5091","file_date_updated":"2020-07-14T12:45:22Z","oa":1,"quality_controlled":"1","doi":"10.1145/2676726.2677008","conference":{"name":"POPL: Principles of Programming Languages","location":"Mumbai, India","start_date":"2015-01-15","end_date":"2015-01-17"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4503-3300-9"]},"month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1992","ddc":["005"],"status":"public","title":"Succinct representation of concurrent trace sets","pubrep_id":"317","oa_version":"Submitted Version","file":[{"checksum":"f0d4395b600f410a191256ac0b73af32","date_created":"2018-12-12T10:17:56Z","date_updated":"2020-07-14T12:45:22Z","file_id":"5314","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":399462,"access_level":"open_access","file_name":"IST-2015-317-v1+1_author_version.pdf"}],"type":"conference","abstract":[{"text":"We present a method and a tool for generating succinct representations of sets of concurrent traces. We focus on trace sets that contain all correct or all incorrect permutations of events from a given trace. We represent trace sets as HB-Formulas that are Boolean combinations of happens-before constraints between events. To generate a representation of incorrect interleavings, our method iteratively explores interleavings that violate the specification and gathers generalizations of the discovered interleavings into an HB-Formula; its complement yields a representation of correct interleavings.\r\n\r\nWe claim that our trace set representations can drive diverse verification, fault localization, repair, and synthesis techniques for concurrent programs. We demonstrate this by using our tool in three case studies involving synchronization synthesis, bug summarization, and abstraction refinement based verification. In each case study, our initial experimental results have been promising.\r\n\r\nIn the first case study, we present an algorithm for inferring missing synchronization from an HB-Formula representing correct interleavings of a given trace. The algorithm applies rules to rewrite specific patterns in the HB-Formula into locks, barriers, and wait-notify constructs. In the second case study, we use an HB-Formula representing incorrect interleavings for bug summarization. While the HB-Formula itself is a concise counterexample summary, we present additional inference rules to help identify specific concurrency bugs such as data races, define-use order violations, and two-stage access bugs. In the final case study, we present a novel predicate learning procedure that uses HB-Formulas representing abstract counterexamples to accelerate counterexample-guided abstraction refinement (CEGAR). In each iteration of the CEGAR loop, the procedure refines the abstraction to eliminate multiple spurious abstract counterexamples drawn from the HB-Formula.","lang":"eng"}],"citation":{"ama":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. Succinct representation of concurrent trace sets. In: ACM; 2015:433-444. doi:10.1145/2676726.2677008","ista":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. 2015. Succinct representation of concurrent trace sets. POPL: Principles of Programming Languages, 433–444.","ieee":"A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.","apa":"Gupta, A., Henzinger, T. A., Radhakrishna, A., Samanta, R., & Tarrach, T. (2015). Succinct representation of concurrent trace sets (pp. 433–444). Presented at the POPL: Principles of Programming Languages, Mumbai, India: ACM. https://doi.org/10.1145/2676726.2677008","mla":"Gupta, Ashutosh, et al. Succinct Representation of Concurrent Trace Sets. ACM, 2015, pp. 433–44, doi:10.1145/2676726.2677008.","short":"A. Gupta, T.A. Henzinger, A. Radhakrishna, R. Samanta, T. Tarrach, in:, ACM, 2015, pp. 433–444.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,” 433–44. ACM, 2015. https://doi.org/10.1145/2676726.2677008."},"page":"433 - 444","date_published":"2015-01-15T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"15"},{"type":"journal_article","issue":"May-June","publist_id":"5082","abstract":[{"lang":"eng","text":"We prove that the three-state toric homogeneous Markov chain model has Markov degree two. In algebraic terminology this means, that a certain class of toric ideals is generated by quadratic binomials. This was conjectured by Haws, Martin del Campo, Takemura and Yoshida, who proved that they are generated by degree six binomials."}],"department":[{"_id":"CaUh"}],"publisher":"Elsevier","publication_status":"published","title":"The three-state toric homogeneous Markov chain model has Markov degree two","status":"public","_id":"1997","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":"68/Part 2","oa_version":"Preprint","date_updated":"2021-01-12T06:54:35Z","date_created":"2018-12-11T11:55:07Z","author":[{"last_name":"Noren","first_name":"Patrik","id":"46870C74-F248-11E8-B48F-1D18A9856A87","full_name":"Noren, Patrik"}],"scopus_import":1,"month":"05","day":"01","page":"285 - 296","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.0077"}],"citation":{"mla":"Noren, Patrik. “The Three-State Toric Homogeneous Markov Chain Model Has Markov Degree Two.” Journal of Symbolic Computation, vol. 68/Part 2, no. May-June, Elsevier, 2015, pp. 285–96, doi:10.1016/j.jsc.2014.09.014.","short":"P. Noren, Journal of Symbolic Computation 68/Part 2 (2015) 285–296.","chicago":"Noren, Patrik. “The Three-State Toric Homogeneous Markov Chain Model Has Markov Degree Two.” Journal of Symbolic Computation. Elsevier, 2015. https://doi.org/10.1016/j.jsc.2014.09.014.","ama":"Noren P. The three-state toric homogeneous Markov chain model has Markov degree two. Journal of Symbolic Computation. 2015;68/Part 2(May-June):285-296. doi:10.1016/j.jsc.2014.09.014","ista":"Noren P. 2015. The three-state toric homogeneous Markov chain model has Markov degree two. Journal of Symbolic Computation. 68/Part 2(May-June), 285–296.","apa":"Noren, P. (2015). The three-state toric homogeneous Markov chain model has Markov degree two. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2014.09.014","ieee":"P. Noren, “The three-state toric homogeneous Markov chain model has Markov degree two,” Journal of Symbolic Computation, vol. 68/Part 2, no. May-June. Elsevier, pp. 285–296, 2015."},"oa":1,"publication":"Journal of Symbolic Computation","language":[{"iso":"eng"}],"date_published":"2015-05-01T00:00:00Z","doi":"10.1016/j.jsc.2014.09.014"},{"oa_version":"Preprint","intvolume":" 42","status":"public","title":"Iterative scaling in curved exponential families","_id":"2008","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","abstract":[{"lang":"eng","text":"The paper describes a generalized iterative proportional fitting procedure that can be used for maximum likelihood estimation in a special class of the general log-linear model. The models in this class, called relational, apply to multivariate discrete sample spaces that do not necessarily have a Cartesian product structure and may not contain an overall effect. When applied to the cell probabilities, the models without the overall effect are curved exponential families and the values of the sufficient statistics are reproduced by the MLE only up to a constant of proportionality. The paper shows that Iterative Proportional Fitting, Generalized Iterative Scaling, and Improved Iterative Scaling fail to work for such models. The algorithm proposed here is based on iterated Bregman projections. As a by-product, estimates of the multiplicative parameters are also obtained. An implementation of the algorithm is available as an R-package."}],"type":"journal_article","date_published":"2015-09-01T00:00:00Z","page":"832 - 847","citation":{"apa":"Klimova, A., & Rudas, T. (2015). Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. Wiley. https://doi.org/10.1111/sjos.12139","ieee":"A. Klimova and T. Rudas, “Iterative scaling in curved exponential families,” Scandinavian Journal of Statistics, vol. 42, no. 3. Wiley, pp. 832–847, 2015.","ista":"Klimova A, Rudas T. 2015. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 42(3), 832–847.","ama":"Klimova A, Rudas T. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 2015;42(3):832-847. doi:10.1111/sjos.12139","chicago":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” Scandinavian Journal of Statistics. Wiley, 2015. https://doi.org/10.1111/sjos.12139.","short":"A. Klimova, T. Rudas, Scandinavian Journal of Statistics 42 (2015) 832–847.","mla":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” Scandinavian Journal of Statistics, vol. 42, no. 3, Wiley, 2015, pp. 832–47, doi:10.1111/sjos.12139."},"publication":"Scandinavian Journal of Statistics","day":"01","scopus_import":1,"volume":42,"date_created":"2018-12-11T11:55:11Z","date_updated":"2021-01-12T06:54:41Z","author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","first_name":"Anna","last_name":"Klimova","full_name":"Klimova, Anna"},{"full_name":"Rudas, Tamás","last_name":"Rudas","first_name":"Tamás"}],"department":[{"_id":"CaUh"}],"publisher":"Wiley","publication_status":"published","acknowledgement":"Part of the material presented here was contained in the PhD thesis of the first author to which the second author and Thomas Richardson were advisers. The authors wish to thank him for several comments and suggestions. We also thank the reviewers and the Associate Editor for helpful comments. The proof of Proposition 1 uses the idea of Olga Klimova, to whom the authors are also indebted. The second author was supported in part by Grant K-106154 from the Hungarian National Scientific Research Fund (OTKA).","year":"2015","publist_id":"5068","language":[{"iso":"eng"}],"doi":"10.1111/sjos.12139","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1307.3282","open_access":"1"}],"oa":1,"month":"09"},{"intvolume":" 24","status":"public","title":"The monotone secant conjecture in the real Schubert calculus","_id":"2006","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as computational evidence obtained by 1.9 teraHertz-years of computing, and we discuss some of the phenomena we observed in our data. "}],"page":"261 - 269","citation":{"chicago":"Hein, Nicolas, Christopher Hillar, Abraham Martin del Campo Sanchez, Frank Sottile, and Zach Teitler. “The Monotone Secant Conjecture in the Real Schubert Calculus.” Experimental Mathematics. Taylor & Francis, 2015. https://doi.org/10.1080/10586458.2014.980044.","mla":"Hein, Nicolas, et al. “The Monotone Secant Conjecture in the Real Schubert Calculus.” Experimental Mathematics, vol. 24, no. 3, Taylor & Francis, 2015, pp. 261–69, doi:10.1080/10586458.2014.980044.","short":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, Z. Teitler, Experimental Mathematics 24 (2015) 261–269.","ista":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. 2015. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 24(3), 261–269.","apa":"Hein, N., Hillar, C., Martin del Campo Sanchez, A., Sottile, F., & Teitler, Z. (2015). The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. Taylor & Francis. https://doi.org/10.1080/10586458.2014.980044","ieee":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, and Z. Teitler, “The monotone secant conjecture in the real Schubert calculus,” Experimental Mathematics, vol. 24, no. 3. Taylor & Francis, pp. 261–269, 2015.","ama":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 2015;24(3):261-269. doi:10.1080/10586458.2014.980044"},"publication":"Experimental Mathematics","date_published":"2015-06-23T00:00:00Z","scopus_import":1,"article_processing_charge":"No","day":"23","department":[{"_id":"CaUh"}],"publisher":"Taylor & Francis","publication_status":"published","year":"2015","volume":24,"date_updated":"2021-01-12T06:54:40Z","date_created":"2018-12-11T11:55:10Z","author":[{"first_name":"Nicolas","last_name":"Hein","full_name":"Hein, Nicolas"},{"first_name":"Christopher","last_name":"Hillar","full_name":"Hillar, Christopher"},{"full_name":"Martin Del Campo Sanchez, Abraham","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","first_name":"Abraham","last_name":"Martin Del Campo Sanchez"},{"full_name":"Sottile, Frank","last_name":"Sottile","first_name":"Frank"},{"full_name":"Teitler, Zach","last_name":"Teitler","first_name":"Zach"}],"publist_id":"5070","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.3436"}],"language":[{"iso":"eng"}],"doi":"10.1080/10586458.2014.980044","month":"06"},{"type":"journal_article","abstract":[{"lang":"eng","text":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association."}],"issue":"7","publist_id":"5062","title":"Faithfulness and learning hypergraphs from discrete distributions","status":"public","publication_status":"published","department":[{"_id":"CaUh"}],"intvolume":" 87","publisher":"Elsevier","_id":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","date_created":"2018-12-11T11:55:13Z","date_updated":"2021-01-12T06:54:43Z","volume":87,"oa_version":"Preprint","author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","last_name":"Klimova","first_name":"Anna","full_name":"Klimova, Anna"},{"full_name":"Uhler, Caroline","first_name":"Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216"},{"full_name":"Rudas, Tamás","first_name":"Tamás","last_name":"Rudas"}],"scopus_import":1,"day":"01","month":"07","quality_controlled":"1","page":"57 - 72","publication":"Computational Statistics & Data Analysis","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.6617"}],"citation":{"ama":"Klimova A, Uhler C, Rudas T. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 2015;87(7):57-72. doi:10.1016/j.csda.2015.01.017","ista":"Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 87(7), 57–72.","ieee":"A. Klimova, C. Uhler, and T. Rudas, “Faithfulness and learning hypergraphs from discrete distributions,” Computational Statistics & Data Analysis, vol. 87, no. 7. Elsevier, pp. 57–72, 2015.","apa":"Klimova, A., Uhler, C., & Rudas, T. (2015). Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. Elsevier. https://doi.org/10.1016/j.csda.2015.01.017","mla":"Klimova, Anna, et al. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” Computational Statistics & Data Analysis, vol. 87, no. 7, Elsevier, 2015, pp. 57–72, doi:10.1016/j.csda.2015.01.017.","short":"A. Klimova, C. Uhler, T. Rudas, Computational Statistics & Data Analysis 87 (2015) 57–72.","chicago":"Klimova, Anna, Caroline Uhler, and Tamás Rudas. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” Computational Statistics & Data Analysis. Elsevier, 2015. https://doi.org/10.1016/j.csda.2015.01.017."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2015-07-01T00:00:00Z","doi":"10.1016/j.csda.2015.01.017"},{"month":"01","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"quality_controlled":"1","doi":"10.1016/j.bbamcr.2014.10.009","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:25Z","publist_id":"5047","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","year":"2015","publication_status":"published","publisher":"Elsevier","department":[{"_id":"DaSi"}],"author":[{"last_name":"Kawada","first_name":"Daiki","full_name":"Kawada, Daiki"},{"full_name":"Kobayashi, Hiromu","first_name":"Hiromu","last_name":"Kobayashi"},{"full_name":"Tomita, Tsuyoshi","last_name":"Tomita","first_name":"Tsuyoshi"},{"last_name":"Nakata","first_name":"Eisuke","full_name":"Nakata, Eisuke"},{"full_name":"Nagano, Makoto","last_name":"Nagano","first_name":"Makoto"},{"last_name":"Siekhaus","first_name":"Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","full_name":"Siekhaus, Daria E"},{"first_name":"Junko","last_name":"Toshima","full_name":"Toshima, Junko"},{"last_name":"Toshimaa","first_name":"Jiro","full_name":"Toshimaa, Jiro"}],"date_updated":"2021-01-12T06:54:48Z","date_created":"2018-12-11T11:55:17Z","volume":1853,"scopus_import":1,"day":"01","has_accepted_license":"1","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","citation":{"ama":"Kawada D, Kobayashi H, Tomita T, et al. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. 2015;1853(1):144-156. doi:10.1016/j.bbamcr.2014.10.009","ieee":"D. Kawada et al., “The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins,” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 1. Elsevier, pp. 144–156, 2015.","apa":"Kawada, D., Kobayashi, H., Tomita, T., Nakata, E., Nagano, M., Siekhaus, D. E., … Toshimaa, J. (2015). The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2014.10.009","ista":"Kawada D, Kobayashi H, Tomita T, Nakata E, Nagano M, Siekhaus DE, Toshima J, Toshimaa J. 2015. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(1), 144–156.","short":"D. Kawada, H. Kobayashi, T. Tomita, E. Nakata, M. Nagano, D.E. Siekhaus, J. Toshima, J. Toshimaa, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 144–156.","mla":"Kawada, Daiki, et al. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 1, Elsevier, 2015, pp. 144–56, doi:10.1016/j.bbamcr.2014.10.009.","chicago":"Kawada, Daiki, Hiromu Kobayashi, Tsuyoshi Tomita, Eisuke Nakata, Makoto Nagano, Daria E Siekhaus, Junko Toshima, and Jiro Toshimaa. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2014.10.009."},"page":"144 - 156","date_published":"2015-01-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular trafficking. Among them, the Rab, Arf, and Rho families function in successive steps of vesicle transport, in forming vesicles from donor membranes, directing vesicle trafficking toward target membranes and docking vesicles onto target membranes. These proteins act as molecular switches that are controlled by a cycle of GTP binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs) and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs in the regulation of the endocytic pathway using fluorescently labeled yeast mating pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells show defective α-factor binding to the cell surface. Interestingly, Ste2p, the α-factor receptor, was mis-localized from the plasma membrane to the vacuole in glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent function, as well as the GAP activity, of Glo3p is important for both α-factor binding and Ste2p localization at the cell surface. Additionally, we found that deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi compartments and causes a defect in transport from the TGN to the plasma membrane. Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN transport pathway, but not in the early endosome-to-TGN transport pathway. These findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell surface proteins.","lang":"eng"}],"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2025","status":"public","title":"The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins","ddc":["570"],"intvolume":" 1853","pubrep_id":"615","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:12:18Z","date_updated":"2020-07-14T12:45:25Z","checksum":"5bb328edebb6a91337cadd7d63f961b7","file_id":"4936","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":926685,"file_name":"IST-2016-615-v1+1_BBAMCR.pdf","access_level":"open_access"}]},{"doi":"10.1016/j.compfluid.2014.09.021","date_published":"2015-01-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Computers and Fluids","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1311.2481","open_access":"1"}],"citation":{"ieee":"L. Shi, M. Rampp, B. Hof, and M. Avila, “A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow,” Computers and Fluids, vol. 106, no. 1. Elsevier, pp. 1–11, 2015.","apa":"Shi, L., Rampp, M., Hof, B., & Avila, M. (2015). A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. Elsevier. https://doi.org/10.1016/j.compfluid.2014.09.021","ista":"Shi L, Rampp M, Hof B, Avila M. 2015. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. 106(1), 1–11.","ama":"Shi L, Rampp M, Hof B, Avila M. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. 2015;106(1):1-11. doi:10.1016/j.compfluid.2014.09.021","chicago":"Shi, Liang, Markus Rampp, Björn Hof, and Marc Avila. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” Computers and Fluids. Elsevier, 2015. https://doi.org/10.1016/j.compfluid.2014.09.021.","short":"L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11.","mla":"Shi, Liang, et al. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” Computers and Fluids, vol. 106, no. 1, Elsevier, 2015, pp. 1–11, doi:10.1016/j.compfluid.2014.09.021."},"quality_controlled":"1","page":"1 - 11","month":"01","day":"01","scopus_import":1,"author":[{"last_name":"Shi","first_name":"Liang","id":"374A3F1A-F248-11E8-B48F-1D18A9856A87","full_name":"Shi, Liang"},{"full_name":"Rampp, Markus","first_name":"Markus","last_name":"Rampp"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"},{"last_name":"Avila","first_name":"Marc","full_name":"Avila, Marc"}],"date_updated":"2021-01-12T06:54:51Z","date_created":"2018-12-11T11:55:18Z","volume":106,"oa_version":"Preprint","_id":"2030","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","title":"A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow","publication_status":"published","status":"public","intvolume":" 106","publisher":"Elsevier","department":[{"_id":"BjHo"}],"abstract":[{"lang":"eng","text":"A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial and azimuthal directions, and high-order finite differences in the radial direction. Time is advanced by a second-order, semi-implicit projection scheme, which requires the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders very small slip velocities. Nonlinear terms are evaluated with the pseudospectral method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node communications and MPI overhead that become relevant at high processor-core counts, and helps to contain the memory footprint. A strong scaling study shows that the hybrid code maintains scalability up to more than 20,000 processor cores and thus allows to perform simulations at higher resolutions than previously feasible. In particular, it opens up the possibility to simulate turbulent Taylor-Couette flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence in Keplerian flows in experimentally relevant regimes."}],"issue":"1","publist_id":"5042","type":"journal_article"},{"month":"10","quality_controlled":"1","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1007/s10208-014-9223-y","file_date_updated":"2020-07-14T12:45:26Z","publist_id":"5022","ec_funded":1,"publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"acknowledgement":"This research is partially supported by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the Polish National Science Center under Grant No. N201 419639.","year":"2015","date_created":"2018-12-11T11:55:20Z","date_updated":"2021-01-12T06:54:53Z","volume":15,"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"orcid":"0000-0002-3536-9866","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","last_name":"Jablonski","first_name":"Grzegorz","full_name":"Jablonski, Grzegorz"},{"first_name":"Marian","last_name":"Mrozek","full_name":"Mrozek, Marian"}],"scopus_import":1,"day":"01","has_accepted_license":"1","page":"1213 - 1244","publication":"Foundations of Computational Mathematics","citation":{"short":"H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244.","mla":"Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi:10.1007/s10208-014-9223-y.","chicago":"Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics. Springer, 2015. https://doi.org/10.1007/s10208-014-9223-y.","ama":"Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map. Foundations of Computational Mathematics. 2015;15(5):1213-1244. doi:10.1007/s10208-014-9223-y","apa":"Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2015). The persistent homology of a self-map. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-014-9223-y","ieee":"H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of a self-map,” Foundations of Computational Mathematics, vol. 15, no. 5. Springer, pp. 1213–1244, 2015.","ista":"Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244."},"date_published":"2015-10-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.\r\n"}],"issue":"5","ddc":["000"],"title":"The persistent homology of a self-map","status":"public","intvolume":" 15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2035","file":[{"access_level":"open_access","file_name":"IST-2016-486-v1+1_s10208-014-9223-y.pdf","creator":"system","file_size":1317546,"content_type":"application/pdf","file_id":"4670","relation":"main_file","checksum":"3566f3a8b0c1bc550e62914a88c584ff","date_created":"2018-12-12T10:08:10Z","date_updated":"2020-07-14T12:45:26Z"}],"oa_version":"Published Version","pubrep_id":"486"},{"ec_funded":1,"publist_id":"5025","publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2015","volume":115,"date_created":"2018-12-11T11:55:20Z","date_updated":"2021-01-12T06:54:52Z","author":[{"first_name":"Béatrice","last_name":"Bérard","full_name":"Bérard, Béatrice"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Sznajder, Nathalie","first_name":"Nathalie","last_name":"Sznajder"}],"month":"01","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.ipl.2014.09.001","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers."}],"intvolume":" 115","status":"public","title":"Probabilistic opacity for Markov decision processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2034","oa_version":"Preprint","scopus_import":1,"day":"01","page":"52 - 59","citation":{"chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.001.","short":"B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.","mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:10.1016/j.ipl.2014.09.001.","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.","apa":"Bérard, B., Chatterjee, K., & Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2014.09.001","ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. Information Processing Letters. 2015;115(1):52-59. doi:10.1016/j.ipl.2014.09.001"},"publication":" Information Processing Letters","date_published":"2015-01-01T00:00:00Z"},{"publication_status":"published","status":"public","title":"Collective excitations of Bose gases in the mean-field regime","publisher":"Springer","department":[{"_id":"RoSe"}],"intvolume":" 215","_id":"2085","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:55:13Z","date_created":"2018-12-11T11:55:37Z","volume":215,"oa_version":"Preprint","author":[{"full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan","last_name":"Nam"},{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"type":"journal_article","abstract":[{"text":"We study the spectrum of a large system of N identical bosons interacting via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov's theory predicts that the spectrum of the N-particle Hamiltonian can be approximated by that of an effective quadratic Hamiltonian acting on Fock space, which describes the fluctuations around a condensed state. Recently, Bogoliubov's theory has been justified rigorously in the case that the low-energy eigenvectors of the N-particle Hamiltonian display complete condensation in the unique minimizer of the corresponding Hartree functional. In this paper, we shall justify Bogoliubov's theory for the high-energy part of the spectrum of the N-particle Hamiltonian corresponding to (non-linear) excited states of the Hartree functional. Moreover, we shall extend the existing results on the excitation spectrum to the case of non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the latter covers the case of rotating Bose gases, when the rotation speed is large enough to break the symmetry and to produce multiple quantized vortices in the Hartree minimizer. ","lang":"eng"}],"issue":"2","publist_id":"4951","quality_controlled":"1","page":"381 - 417","publication":"Archive for Rational Mechanics and Analysis","citation":{"ama":"Nam P, Seiringer R. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 2015;215(2):381-417. doi:10.1007/s00205-014-0781-6","apa":"Nam, P., & Seiringer, R. (2015). Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-014-0781-6","ieee":"P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field regime,” Archive for Rational Mechanics and Analysis, vol. 215, no. 2. Springer, pp. 381–417, 2015.","ista":"Nam P, Seiringer R. 2015. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 215(2), 381–417.","short":"P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417.","mla":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis, vol. 215, no. 2, Springer, 2015, pp. 381–417, doi:10.1007/s00205-014-0781-6.","chicago":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis. Springer, 2015. https://doi.org/10.1007/s00205-014-0781-6."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.1153"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00205-014-0781-6","date_published":"2015-02-01T00:00:00Z","scopus_import":1,"day":"01","month":"02"},{"day":"01","month":"02","scopus_import":1,"date_published":"2015-02-01T00:00:00Z","doi":"10.1007/s00220-014-2119-5","language":[{"iso":"eng"}],"publication":"Communications in Mathematical Physics","citation":{"ista":"Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 333(3), 1365–1416.","ieee":"L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case,” Communications in Mathematical Physics, vol. 333, no. 3. Springer, pp. 1365–1416, 2015.","apa":"Erdös, L., & Knowles, A. (2015). The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-014-2119-5","ama":"Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 2015;333(3):1365-1416. doi:10.1007/s00220-014-2119-5","chicago":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics. Springer, 2015. https://doi.org/10.1007/s00220-014-2119-5.","mla":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics, vol. 333, no. 3, Springer, 2015, pp. 1365–416, doi:10.1007/s00220-014-2119-5.","short":"L. Erdös, A. Knowles, Communications in Mathematical Physics 333 (2015) 1365–1416."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5106"}],"oa":1,"quality_controlled":"1","page":"1365 - 1416","abstract":[{"lang":"eng","text":"We consider the spectral statistics of large random band matrices on mesoscopic energy scales. We show that the correlation function of the local eigenvalue density exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta statistics. This law had been predicted in the physics literature by Altshuler and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it describes the correlations of the eigenvalue density in general metallic sampleswith weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas for band matrices. In two dimensions, where the leading term vanishes owing to an algebraic cancellation, we identify the first non-vanishing term and show that it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion (Ann. H. Poincaré. arXiv:1309.5107, 2014). "}],"issue":"3","publist_id":"4818","type":"journal_article","author":[{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"full_name":"Knowles, Antti","last_name":"Knowles","first_name":"Antti"}],"date_created":"2018-12-11T11:56:05Z","date_updated":"2021-01-12T06:55:43Z","volume":333,"oa_version":"Preprint","year":"2015","_id":"2166","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case","publication_status":"published","status":"public","publisher":"Springer","intvolume":" 333","department":[{"_id":"LaEr"}]},{"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"language":[{"iso":"eng"}],"doi":"10.2168/LMCS-11(1:20)2015","month":"04","department":[{"_id":"ToHe"}],"publisher":"International Federation of Computational Logic","publication_status":"published","year":"2015","volume":11,"date_updated":"2023-02-23T10:38:13Z","date_created":"2018-12-11T11:54:15Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2328"}]},"author":[{"full_name":"Chakraborty, Soham","first_name":"Soham","last_name":"Chakraborty"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sezgin, Ali","first_name":"Ali","last_name":"Sezgin"},{"last_name":"Vafeiadis","first_name":"Viktor","full_name":"Vafeiadis, Viktor"}],"article_number":"20","license":"https://creativecommons.org/licenses/by-nd/4.0/","ec_funded":1,"publist_id":"5271","file_date_updated":"2020-07-14T12:45:17Z","article_type":"original","citation":{"ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015","chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science. International Federation of Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015.","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.","short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015)."},"publication":"Logical Methods in Computer Science","date_published":"2015-04-01T00:00:00Z","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"01","intvolume":" 11","title":"Aspect-oriented linearizability proofs","status":"public","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1832","file":[{"creator":"system","content_type":"application/pdf","file_size":380203,"access_level":"open_access","file_name":"IST-2015-390-v1+1_1502.07639.pdf","checksum":"7370e164d0a731f442424a92669efc34","date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:11:27Z","file_id":"4881","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"390","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. "}]},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.4219"}],"oa":1,"external_id":{"arxiv":["1311.4219"]},"quality_controlled":"1","doi":"10.1137/130945648","language":[{"iso":"eng"}],"month":"02","year":"2015","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"SIAM","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"last_name":"Thapper","first_name":"Johan","full_name":"Thapper, Johan"},{"first_name":"Stanislav","last_name":"Živný","full_name":"Živný, Stanislav"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2518"}]},"date_created":"2018-12-11T11:56:41Z","date_updated":"2023-02-23T10:46:30Z","volume":44,"publist_id":"4673","publication":"SIAM Journal on Computing","citation":{"chicago":"Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2015. https://doi.org/10.1137/130945648.","short":"V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.","mla":"Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.","ieee":"V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.","apa":"Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648","ista":"Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.","ama":"Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648"},"page":"1 - 36","date_published":"2015-02-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2271","status":"public","title":"The power of linear programming for general-valued CSPs","intvolume":" 44","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. ","lang":"eng"}],"issue":"1"},{"page":"2025 - 2050","quality_controlled":0,"main_file_link":[{"url":"https://arxiv.org/abs/1302.2434","open_access":"1"}],"oa":1,"citation":{"ista":"Browning TD, Munshi R. 2015. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 27(4), 2025–2050.","ieee":"T. D. Browning and R. Munshi, “Pairs of diagonal quadratic forms and linear correlations among sums of two squares,” Forum Mathematicum, vol. 27, no. 4. Walter de Gruyter GmbH, pp. 2025–2050, 2015.","apa":"Browning, T. D., & Munshi, R. (2015). Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. Walter de Gruyter GmbH. https://doi.org/10.1515/forum-2013-6024","ama":"Browning TD, Munshi R. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 2015;27(4):2025-2050. doi:10.1515/forum-2013-6024","chicago":"Browning, Timothy D, and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum. Walter de Gruyter GmbH, 2015. https://doi.org/10.1515/forum-2013-6024.","mla":"Browning, Timothy D., and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum, vol. 27, no. 4, Walter de Gruyter GmbH, 2015, pp. 2025–50, doi:10.1515/forum-2013-6024.","short":"T.D. Browning, R. Munshi, Forum Mathematicum 27 (2015) 2025–2050."},"publication":"Forum Mathematicum","doi":"10.1515/forum-2013-6024","date_published":"2015-07-10T00:00:00Z","day":"10","month":"07","intvolume":" 27","publisher":"Walter de Gruyter GmbH","status":"public","title":"Pairs of diagonal quadratic forms and linear correlations among sums of two squares","publication_status":"published","_id":"257","year":"2015","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457 and the second author was supported by SwarnaJayanti Fellowship 2011–12, DST, Government of India.","volume":27,"date_created":"2018-12-11T11:45:28Z","date_updated":"2021-01-12T06:58:18Z","author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"},{"full_name":"Munshi, Ritabrata","first_name":"Ritabrata","last_name":"Munshi"}],"type":"journal_article","extern":1,"issue":"4","publist_id":"7645","abstract":[{"text":"For suitable pairs of diagonal quadratic forms in eight variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares.","lang":"eng"}]},{"date_created":"2018-12-11T11:45:28Z","date_updated":"2021-01-12T06:58:22Z","oa_version":"None","author":[{"full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"status":"public","title":"A survey of applications of the circle method to rational points","publication_status":"published","publisher":"Cambridge University Press","_id":"258","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","abstract":[{"lang":"eng","text":"Given a number field k and a projective algebraic variety X defined over k, the question of whether X contains a k-rational point is both very natural and very difficult. In the event that the set X(k) of k-rational points is not empty, one can also ask how the points of X(k) are distributed. Are they dense in X under the Zariski topology? Are they dense in the set."}],"publist_id":"7644","type":"book_chapter","language":[{"iso":"eng"}],"date_published":"2015-08-01T00:00:00Z","doi":"10.1017/CBO9781316106877.009","quality_controlled":"1","page":"89 - 113","publication":"Arithmetic and Geometry","citation":{"ama":"Browning TD. A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. Cambridge University Press; 2015:89-113. doi:10.1017/CBO9781316106877.009","ista":"Browning TD. 2015.A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. , 89–113.","apa":"Browning, T. D. (2015). A survey of applications of the circle method to rational points. In Arithmetic and Geometry (pp. 89–113). Cambridge University Press. https://doi.org/10.1017/CBO9781316106877.009","ieee":"T. D. Browning, “A survey of applications of the circle method to rational points,” in Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","mla":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113, doi:10.1017/CBO9781316106877.009.","short":"T.D. Browning, in:, Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","chicago":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” In Arithmetic and Geometry, 89–113. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9781316106877.009."},"day":"01","month":"08"},{"publication":"Geometric and Functional Analysis","citation":{"chicago":"Browning, Timothy D, and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis. Birkhäuser, 2015. https://doi.org/10.1007/s00039-015-0328-5.","mla":"Browning, Timothy D., and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis, vol. 25, no. 3, Birkhäuser, 2015, pp. 671–732, doi:10.1007/s00039-015-0328-5.","short":"T.D. Browning, P. Vishe, Geometric and Functional Analysis 25 (2015) 671–732.","ista":"Browning TD, Vishe P. 2015. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 25(3), 671–732.","ieee":"T. D. Browning and P. Vishe, “Rational points on cubic hypersurfaces over F_q(t) ,” Geometric and Functional Analysis, vol. 25, no. 3. Birkhäuser, pp. 671–732, 2015.","apa":"Browning, T. D., & Vishe, P. (2015). Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. Birkhäuser. https://doi.org/10.1007/s00039-015-0328-5","ama":"Browning TD, Vishe P. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 2015;25(3):671-732. doi:10.1007/s00039-015-0328-5"},"quality_controlled":0,"page":"671 - 732","doi":"10.1007/s00039-015-0328-5","date_published":"2015-06-11T00:00:00Z","month":"06","day":"11","_id":"259","year":"2015","acknowledgement":"EP/J018260/1\tEngineering and Physical Sciences Research Council EPSRC","title":"Rational points on cubic hypersurfaces over F_q(t) ","publication_status":"published","status":"public","intvolume":" 25","publisher":"Birkhäuser","author":[{"full_name":"Timothy Browning","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vishe, Pankaj","last_name":"Vishe","first_name":"Pankaj"}],"date_updated":"2021-01-12T06:58:25Z","date_created":"2018-12-11T11:45:29Z","volume":25,"type":"journal_article","abstract":[{"text":"The Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field ","lang":"eng"}],"publist_id":"7643","issue":"3","extern":1},{"publist_id":"5571","ec_funded":1,"related_material":{"record":[{"id":"2715","status":"public","relation":"earlier_version"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Manas","last_name":"Joglekar","full_name":"Joglekar, Manas"},{"full_name":"Shah, Nisarg","first_name":"Nisarg","last_name":"Shah"}],"volume":573,"date_created":"2018-12-11T11:52:56Z","date_updated":"2023-02-23T10:55:03Z","year":"2015","acknowledgement":"The research was supported by FWF Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n","department":[{"_id":"KrCh"}],"publisher":"Elsevier","publication_status":"published","month":"03","doi":"10.1016/j.tcs.2015.01.050","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.4175"}],"external_id":{"arxiv":["1202.4175"]},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","issue":"3","abstract":[{"text":"We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure winning vertices such that the objective can be ensured with probability 1 from these vertices. We study for the first time the average-case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average-case running time is linear (as compared to the worst-case linear number of iterations and quadratic time complexity). Second, for the average-case analysis over all MDPs we show that the expected number of iterations is constant and the average-case running time is linear (again as compared to the worst-case linear number of iterations and quadratic time complexity). Finally we also show that when all MDPs are equally likely, the probability that the classical algorithm requires more than a constant number of iterations is exponentially small.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1598","intvolume":" 573","status":"public","title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","article_processing_charge":"No","day":"30","scopus_import":1,"date_published":"2015-03-30T00:00:00Z","citation":{"ieee":"K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.","apa":"Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050","ista":"Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89.","ama":"Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050","chicago":"Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.","short":"K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.","mla":"Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050."},"publication":"Theoretical Computer Science","page":"71 - 89"},{"scopus_import":1,"day":"03","page":"606 - 621","publication":"Computational Geometry: Theory and Applications","citation":{"ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 48(8), 606–621.","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” Computational Geometry: Theory and Applications, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2015). Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.010","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 2015;48(8):606-621. doi:10.1016/j.comgeo.2014.08.010","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.010.","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications, vol. 48, no. 8, Elsevier, 2015, pp. 606–21, doi:10.1016/j.comgeo.2014.08.010.","short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621."},"date_published":"2015-06-03T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard."}],"issue":"8","title":"Homological reconstruction and simplification in R3","status":"public","intvolume":" 48","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1805","oa_version":"None","month":"06","quality_controlled":"1","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.comgeo.2014.08.010","publist_id":"5305","ec_funded":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"HeEd"}],"year":"2015","date_updated":"2023-02-23T10:59:19Z","date_created":"2018-12-11T11:54:06Z","volume":48,"author":[{"full_name":"Attali, Dominique","first_name":"Dominique","last_name":"Attali"},{"last_name":"Bauer","first_name":"Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich"},{"full_name":"Devillers, Olivier","last_name":"Devillers","first_name":"Olivier"},{"full_name":"Glisse, Marc","first_name":"Marc","last_name":"Glisse"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2812"}]}},{"language":[{"iso":"eng"}],"date_published":"2015-10-16T00:00:00Z","doi":"10.1021/acs.chemmater.5b03531","page":"7452 - 7458","quality_controlled":"1","article_type":"original","citation":{"ama":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 2015;27(21):7452-7458. doi:10.1021/acs.chemmater.5b03531","ista":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. 2015. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 27(21), 7452–7458.","ieee":"M. Walter, K. Kravchyk, M. Ibáñez, and M. Kovalenko, “Efficient and inexpensive sodium magnesium hybrid battery,” Chemistry of Materials, vol. 27, no. 21. ACS, pp. 7452–7458, 2015.","apa":"Walter, M., Kravchyk, K., Ibáñez, M., & Kovalenko, M. (2015). Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. ACS. https://doi.org/10.1021/acs.chemmater.5b03531","mla":"Walter, Marc, et al. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials, vol. 27, no. 21, ACS, 2015, pp. 7452–58, doi:10.1021/acs.chemmater.5b03531.","short":"M. Walter, K. Kravchyk, M. Ibáñez, M. Kovalenko, Chemistry of Materials 27 (2015) 7452–7458.","chicago":"Walter, Marc, Kostiantyn Kravchyk, Maria Ibáñez, and Maksym Kovalenko. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials. ACS, 2015. https://doi.org/10.1021/acs.chemmater.5b03531."},"publication":"Chemistry of Materials","article_processing_charge":"No","month":"10","day":"16","oa_version":"None","volume":27,"date_created":"2018-12-11T11:45:52Z","date_updated":"2021-01-12T07:42:42Z","author":[{"full_name":"Walter, Marc","last_name":"Walter","first_name":"Marc"},{"last_name":"Kravchyk","first_name":"Kostiantyn","full_name":"Kravchyk, Kostiantyn"},{"last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"full_name":"Kovalenko, Maksym","first_name":"Maksym","last_name":"Kovalenko"}],"publisher":"ACS","intvolume":" 27","title":"Efficient and inexpensive sodium magnesium hybrid battery","status":"public","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"333","year":"2015","extern":"1","publist_id":"7507","issue":"21","abstract":[{"lang":"eng","text":"We present a hybrid intercalation battery based on a sodium/magnesium (Na/Mg) dual salt electrolyte, metallic magnesium anode, and a cathode based on FeS2 nanocrystals (NCs). Compared to lithium or sodium, metallic magnesium anode is safer due to dendrite-free electroplating and offers extremely high volumetric (3833 mAh cm-3) and gravimetric capacities (2205 mAh g-1). Na-ion cathodes, FeS2 NCs in the present study, may serve as attractive alternatives to Mg-ion cathodes due to the higher voltage of operation and fast, highly reversible insertion of Na-ions. In this proof-of-concept study, electrochemical cycling of the Na/Mg hybrid battery was characterized by high rate capability, high Coulombic efficiency of 99.8%, and high energy density. In particular, with an average discharge voltage of ∼1.1 V and a cathodic capacity of 189 mAh g-1 at a current of 200 mA g-1, the presented Mg/FeS2 hybrid battery delivers energy densities of up to 210 Wh kg-1, comparable to commercial Li-ion batteries and approximately twice as high as state-of-the-art Mg-ion batteries based on Mo6S8 cathodes. Further significant gains in the energy density are expected from the development of Na/Mg electrolytes with a broader electrochemical stability window. Fully based on Earth-abundant elements, hybrid Na-Mg batteries are highly promising for large-scale stationary energy storage. "}],"type":"journal_article"},{"day":"11","month":"03","article_processing_charge":"No","date_published":"2015-03-11T00:00:00Z","doi":"10.1021/jacs.5b00091","language":[{"iso":"eng"}],"publication":"Journal of the American Chemical Society","citation":{"chicago":"Ibáñez, Maria, Rachel Korkosz, Zhishan Luo, Pau Riba, Doris Cadavid, Silvia Ortega, Andreu Cabot, and Mercouri Kanatzidis. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” Journal of the American Chemical Society. American Chemical Society, 2015. https://doi.org/10.1021/jacs.5b00091.","mla":"Ibáñez, Maria, et al. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” Journal of the American Chemical Society, vol. 137, no. 12, American Chemical Society, 2015, pp. 4046–49, doi:10.1021/jacs.5b00091.","short":"M. Ibáñez, R. Korkosz, Z. Luo, P. Riba, D. Cadavid, S. Ortega, A. Cabot, M. Kanatzidis, Journal of the American Chemical Society 137 (2015) 4046–4049.","ista":"Ibáñez M, Korkosz R, Luo Z, Riba P, Cadavid D, Ortega S, Cabot A, Kanatzidis M. 2015. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 137(12), 4046–4049.","apa":"Ibáñez, M., Korkosz, R., Luo, Z., Riba, P., Cadavid, D., Ortega, S., … Kanatzidis, M. (2015). Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.5b00091","ieee":"M. Ibáñez et al., “Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement,” Journal of the American Chemical Society, vol. 137, no. 12. American Chemical Society, pp. 4046–4049, 2015.","ama":"Ibáñez M, Korkosz R, Luo Z, et al. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 2015;137(12):4046-4049. doi:10.1021/jacs.5b00091"},"article_type":"original","quality_controlled":"1","page":"4046 - 4049","abstract":[{"lang":"eng","text":"A simple and effective method to introduce precise amounts of doping in nanomaterials produced from the bottom-up assembly of colloidal nanoparticles (NPs) is described. The procedure takes advantage of a ligand displacement step to incorporate controlled concentrations of halide ions while removing carboxylic acids from the NP surface. Upon consolidation of the NPs into dense pellets, halide ions diffuse within the crystal structure, doping the anion sublattice and achieving n-type electrical doping. Through the characterization of the thermoelectric properties of nanocrystalline PbS, we demonstrate this strategy to be effective to control charge transport properties on thermoelectric nanomaterials assembled from NP building blocks. This approach is subsequently extended to PbTexSe1-x@PbS core-shell NPs, where a significant enhancement of the thermoelectric figure of merit is achieved. "}],"publist_id":"7470","issue":"12","extern":"1","type":"journal_article","author":[{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"full_name":"Korkosz, Rachel","last_name":"Korkosz","first_name":"Rachel"},{"full_name":"Luo, Zhishan","first_name":"Zhishan","last_name":"Luo"},{"full_name":"Riba, Pau","first_name":"Pau","last_name":"Riba"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"first_name":"Silvia","last_name":"Ortega","full_name":"Ortega, Silvia"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"},{"full_name":"Kanatzidis, Mercouri","first_name":"Mercouri","last_name":"Kanatzidis"}],"date_created":"2018-12-11T11:45:59Z","date_updated":"2021-01-12T07:44:10Z","oa_version":"None","volume":137,"_id":"354","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"At IREC, work was supported by European Regional Development Funds and the Framework 7 program under project UNION (FP7-NMP 310250). M.I. and S.O. thank AGAUR for their Beatriu i Pinós postdoctoral grant and the PhD grant, respectively. At Northwestern, work was supported by the Revolutionary Materials for Solid State Energy Conversion, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, and Office of Basic Energy Sciences under Award Number DE-SC0001054.","title":"Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement","publication_status":"published","status":"public","publisher":"American Chemical Society","intvolume":" 137"},{"_id":"360","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","intvolume":" 31","publisher":"American Chemical Society","status":"public","publication_status":"published","title":"Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting","author":[{"full_name":"Yu, Xuelian","last_name":"Yu","first_name":"Xuelian"},{"first_name":"Jingjing","last_name":"Liu","full_name":"Liu, Jingjing"},{"last_name":"Genç","first_name":"Aziz","full_name":"Genç, Aziz"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"},{"last_name":"Luo","first_name":"Zhishan","full_name":"Luo, Zhishan"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"full_name":"Zhang, Guangjin","first_name":"Guangjin","last_name":"Zhang"},{"last_name":"Zhang","first_name":"Yihe","full_name":"Zhang, Yihe"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"volume":31,"oa_version":"None","date_updated":"2021-01-12T07:44:34Z","date_created":"2018-12-11T11:46:01Z","type":"journal_article","publist_id":"7467","issue":"38","abstract":[{"lang":"eng","text":"A cation exchange-based route was used to produce Cu2ZnSnS4 (CZTS)-Ag2S nanoparticles with controlled composition. We report a detailed study of the formation of such CZTS-Ag2S nanoheterostructures and of their photocatalytic properties. When compared to pure CZTS, the use of nanoscale p-n heterostructures as light absorbers for photocatalytic water splitting provides superior photocurrents. We associate this experimental fact to a higher separation efficiency of the photogenerated electron-hole pairs. We believe this and other type-II nanoheterostructures will open the door to the use of CZTS, with excellent light absorption properties and made of abundant and environmental friendly elements, to the field of photocatalysis. "}],"extern":"1","citation":{"chicago":"Yu, Xuelian, Jingjing Liu, Aziz Genç, Maria Ibáñez, Zhishan Luo, Alexey Shavel, Jordi Arbiol, Guangjin Zhang, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4-Ag2S Nanoscale p-n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/acs.langmuir.5b02490.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4-Ag2S Nanoscale p-n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir, vol. 31, no. 38, American Chemical Society, 2015, pp. 10555–61, doi:10.1021/acs.langmuir.5b02490.","short":"X. Yu, J. Liu, A. Genç, M. Ibáñez, Z. Luo, A. Shavel, J. Arbiol, G. Zhang, Y. Zhang, A. Cabot, Langmuir 31 (2015) 10555–10561.","ista":"Yu X, Liu J, Genç A, Ibáñez M, Luo Z, Shavel A, Arbiol J, Zhang G, Zhang Y, Cabot A. 2015. Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 31(38), 10555–10561.","ieee":"X. Yu et al., “Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting,” Langmuir, vol. 31, no. 38. American Chemical Society, pp. 10555–10561, 2015.","apa":"Yu, X., Liu, J., Genç, A., Ibáñez, M., Luo, Z., Shavel, A., … Cabot, A. (2015). Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. American Chemical Society. https://doi.org/10.1021/acs.langmuir.5b02490","ama":"Yu X, Liu J, Genç A, et al. Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 2015;31(38):10555-10561. doi:10.1021/acs.langmuir.5b02490"},"publication":"Langmuir","page":"10555 - 10561","date_published":"2015-09-29T00:00:00Z","doi":"10.1021/acs.langmuir.5b02490","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"29","month":"09"},{"day":"07","month":"04","article_processing_charge":"No","page":"3952 - 3957","publication":"Langmuir","citation":{"short":"Z. Lu, M. Ibáñez, A. Antolín, A. Genç, A. Shavel, S. Contreras, F. Medina, J. Arbiol, A. Cabot, Langmuir 31 (2015) 3952–3957.","mla":"Lu, Zhishan, et al. “Size and Aspect Ratio Control of Pd Inf 2 Inf Sn Nanorods and Their Water Denitration Properties.” Langmuir, vol. 31, no. 13, American Chemical Society, 2015, pp. 3952–57, doi:10.1021/la504906q.","chicago":"Lu, Zhishan, Maria Ibáñez, Ana Antolín, Aziz Genç, Alexey Shavel, Sandra Contreras, Francesc Medina, Jordi Arbiol, and Andreu Cabot. “Size and Aspect Ratio Control of Pd Inf 2 Inf Sn Nanorods and Their Water Denitration Properties.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/la504906q.","ama":"Lu Z, Ibáñez M, Antolín A, et al. Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. 2015;31(13):3952-3957. doi:10.1021/la504906q","ieee":"Z. Lu et al., “Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties,” Langmuir, vol. 31, no. 13. American Chemical Society, pp. 3952–3957, 2015.","apa":"Lu, Z., Ibáñez, M., Antolín, A., Genç, A., Shavel, A., Contreras, S., … Cabot, A. (2015). Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. American Chemical Society. https://doi.org/10.1021/la504906q","ista":"Lu Z, Ibáñez M, Antolín A, Genç A, Shavel A, Contreras S, Medina F, Arbiol J, Cabot A. 2015. Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. 31(13), 3952–3957."},"language":[{"iso":"eng"}],"doi":"10.1021/la504906q","date_published":"2015-04-07T00:00:00Z","type":"journal_article","extern":"1","abstract":[{"text":"Monodisperse Pd2Sn nanorods with tuned size and aspect ratio were prepared by co-reduction of metal salts in the presence of trioctylphosphine, amine, and chloride ions. Asymmetric Pd2Sn nanostructures were achieved by the selective desorption of a surfactant mediated by chlorine ions. A preliminary evaluation of the geometry influence on catalytic properties evidenced Pd2Sn nanorods to have improved catalytic performance. In view of these results, Pd2Sn nanorods were also evaluated for water denitration. ","lang":"eng"}],"issue":"13","publist_id":"7469","publication_status":"published","status":"public","title":"Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties","intvolume":" 31","publisher":"American Chemical Society","year":"2015","_id":"362","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:02Z","date_updated":"2021-01-12T07:44:42Z","volume":31,"oa_version":"None","author":[{"full_name":"Lu, Zhishan","last_name":"Lu","first_name":"Zhishan"},{"first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"full_name":"Antolín, Ana","first_name":"Ana","last_name":"Antolín"},{"first_name":"Aziz","last_name":"Genç","full_name":"Genç, Aziz"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"first_name":"Sandra","last_name":"Contreras","full_name":"Contreras, Sandra"},{"last_name":"Medina","first_name":"Francesc","full_name":"Medina, Francesc"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}]},{"doi":"10.1016/j.ic.2015.06.003","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1006.0673","open_access":"1"}],"oa":1,"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","month":"12","related_material":{"record":[{"id":"3856","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Gimbert, Hugo","first_name":"Hugo","last_name":"Gimbert"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"volume":245,"date_updated":"2023-02-23T11:45:42Z","date_created":"2018-12-11T11:53:42Z","year":"2015","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","publist_id":"5395","ec_funded":1,"date_published":"2015-12-01T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” Information and Computation, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. Information and Computation. 2015;245(12):3-16. doi:10.1016/j.ic.2015.06.003","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.06.003"},"publication":"Information and Computation","page":"3 - 16","day":"01","scopus_import":1,"oa_version":"Preprint","_id":"1731","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 245","status":"public","title":"Randomness for free","issue":"12","abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"type":"journal_article"},{"date_created":"2018-12-11T11:45:52Z","date_updated":"2021-01-12T07:42:46Z","volume":31,"oa_version":"None","author":[{"full_name":"Yu, Xuelian","last_name":"Yu","first_name":"Xuelian"},{"last_name":"Liu","first_name":"Jingjing","full_name":"Liu, Jingjing"},{"first_name":"Aziz","last_name":"Genç","full_name":"Genç, Aziz"},{"orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria"},{"last_name":"Luo","first_name":"Zhishan","full_name":"Luo, Zhishan"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Zhang","first_name":"Guangjin","full_name":"Zhang, Guangjin"},{"last_name":"Zhang","first_name":"Yihe","full_name":"Zhang, Yihe"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"publication_status":"published","status":"public","title":"Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting","publisher":"American Chemical Society","intvolume":" 31","year":"2015","_id":"334","acknowledgement":"This work was supported by the European Regional Development Funds, the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486), the Spanish MINECO under Contract ENE2013-46624-C4-3-R and Fundamental Research Funds for the Central Universities (2652015086). Authors acknowledge the funding from Generalitat de Catalunya 2014 SGR 1638.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","abstract":[{"lang":"eng","text":"A cation exchange-based route was used to produce Cu2ZnSnS4 (CZTS)-Ag2S nanoparticles with controlled composition. We report a detailed study of the formation of such CZTS-Ag2S nanoheterostructures and of their photocatalytic properties. When compared to pure CZTS, the use of nanoscale p-n heterostructures as light absorbers for photocatalytic water splitting provides superior photocurrents. We associate this experimental fact to a higher separation efficiency of the photogenerated electron-hole pairs. We believe this and other type-II nanoheterostructures will open the door to the use of CZTS, with excellent light absorption properties and made of abundant and environmental friendly elements, to the field of photocatalysis."}],"publist_id":"7508","issue":"38","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1021/acs.langmuir.5b02490","date_published":"2015-09-07T00:00:00Z","article_type":"original","quality_controlled":"1","page":"10555 - 10561","publication":"Langmuir","citation":{"ama":"Yu X, Liu J, Genç A, et al. Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 2015;31(38):10555-10561. doi:10.1021/acs.langmuir.5b02490","apa":"Yu, X., Liu, J., Genç, A., Ibáñez, M., Luo, Z., Shavel, A., … Cabot, A. (2015). Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. American Chemical Society. https://doi.org/10.1021/acs.langmuir.5b02490","ieee":"X. Yu et al., “Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting,” Langmuir, vol. 31, no. 38. American Chemical Society, pp. 10555–10561, 2015.","ista":"Yu X, Liu J, Genç A, Ibáñez M, Luo Z, Shavel A, Arbiol J, Zhang G, Zhang Y, Cabot A. 2015. Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 31(38), 10555–10561.","short":"X. Yu, J. Liu, A. Genç, M. Ibáñez, Z. Luo, A. Shavel, J. Arbiol, G. Zhang, Y. Zhang, A. Cabot, Langmuir 31 (2015) 10555–10561.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4–Ag2S Nanoscale p–n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir, vol. 31, no. 38, American Chemical Society, 2015, pp. 10555–61, doi:10.1021/acs.langmuir.5b02490.","chicago":"Yu, Xuelian, Jingjing Liu, Aziz Genç, Maria Ibáñez, Zhishan Luo, Alexey Shavel, Jordi Arbiol, Guangjin Zhang, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4–Ag2S Nanoscale p–n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/acs.langmuir.5b02490."},"day":"07","month":"09","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"date_published":"2015-08-26T00:00:00Z","doi":"10.1021/acs.jpcc.5b06199","page":"21882 - 21888","publication":"Journal of Physical Chemistry C","citation":{"chicago":"Yu, Xuelian, Xiaoqiang An, Aziz Genç, Maria Ibáñez, Jordi Arbiol, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4–PtM (M = Co, Ni) Nanoheterostructures for Photocatalytic Hydrogen Evolution.” Journal of Physical Chemistry C. American Chemical Society, 2015. https://doi.org/10.1021/acs.jpcc.5b06199.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4–PtM (M = Co, Ni) Nanoheterostructures for Photocatalytic Hydrogen Evolution.” Journal of Physical Chemistry C, vol. 119, no. 38, American Chemical Society, 2015, pp. 21882–88, doi:10.1021/acs.jpcc.5b06199.","short":"X. Yu, X. An, A. Genç, M. Ibáñez, J. Arbiol, Y. Zhang, A. Cabot, Journal of Physical Chemistry C 119 (2015) 21882–21888.","ista":"Yu X, An X, Genç A, Ibáñez M, Arbiol J, Zhang Y, Cabot A. 2015. Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. 119(38), 21882–21888.","apa":"Yu, X., An, X., Genç, A., Ibáñez, M., Arbiol, J., Zhang, Y., & Cabot, A. (2015). Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. American Chemical Society. https://doi.org/10.1021/acs.jpcc.5b06199","ieee":"X. Yu et al., “Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution,” Journal of Physical Chemistry C, vol. 119, no. 38. American Chemical Society, pp. 21882–21888, 2015.","ama":"Yu X, An X, Genç A, et al. Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. 2015;119(38):21882-21888. doi:10.1021/acs.jpcc.5b06199"},"day":"26","month":"08","article_processing_charge":"No","date_updated":"2021-01-12T07:44:38Z","date_created":"2018-12-11T11:46:01Z","oa_version":"None","volume":119,"author":[{"last_name":"Yu","first_name":"Xuelian","full_name":"Yu, Xuelian"},{"full_name":"An, Xiaoqiang","last_name":"An","first_name":"Xiaoqiang"},{"full_name":"Genç, Aziz","first_name":"Aziz","last_name":"Genç"},{"last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Zhang","first_name":"Yihe","full_name":"Zhang, Yihe"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"publication_status":"published","status":"public","title":"Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution","intvolume":" 119","publisher":"American Chemical Society","_id":"361","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","acknowledgement":"This work was supported by the National Natural Science Foundation of China (Grant 21401212), Fundamental Research Funds for the Central Universities (2652015086), the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486), and the MICINN project ENE2013-46624-C4-3-R. Authors acknowledge the funding from Generalitat de Catalunya 2014 SGR 1638.","extern":"1","abstract":[{"text":"We report the synthesis and photocatalytic and magnetic characterization of colloidal nanoheterostructures formed by combining a Pt-based magnetic metal alloy (PtCo, PtNi) with Cu2ZnSnS4 (CZTS). While CZTS is one of the main candidate materials for solar energy conversion, the introduction of a Pt-based alloy on its surface strongly influences its chemical and electronic properties, ultimately determining its functionality. In this regard, up to a 15-fold increase of the photocatalytic hydrogen evolution activity was obtained with CZTS–PtCo when compared with CZTS. Furthermore, two times higher hydrogen evolution rates were obtained for CZTS–PtCo when compared with CZTS–Pt, in spite of the lower precious metal loading of the former. Besides, the magnetic properties of the PtCo nanoparticles attached to the CZTS nanocrystals were retained in the heterostructures, which could facilitate catalyst purification and recovery for its posterior recycling and/or reutilization.","lang":"eng"}],"issue":"38","publist_id":"7468","type":"journal_article"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1856","intvolume":" 62","status":"public","title":"Measuring and synthesizing systems in probabilistic environments","oa_version":"Preprint","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ε-optimal strategy with a bounded counter, for all ε > 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way."}],"citation":{"ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 2015;62(1). doi:10.1145/2699430","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM. https://doi.org/10.1145/2699430","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).","mla":"Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2699430."},"publication":"Journal of the ACM","date_published":"2015-02-01T00:00:00Z","scopus_import":1,"day":"01","year":"2015","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","related_material":{"record":[{"id":"3864","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"volume":62,"date_created":"2018-12-11T11:54:23Z","date_updated":"2023-02-23T11:46:04Z","article_number":"9","publist_id":"5244","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1004.0739","open_access":"1"}],"oa":1,"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","doi":"10.1145/2699430","language":[{"iso":"eng"}],"month":"02"},{"_id":"388","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3","publication_status":"published","status":"public","intvolume":" 114","publisher":"American Physical Society","author":[{"full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek"},{"last_name":"Mahmood","first_name":"Fahad","full_name":"Mahmood, Fahad"},{"full_name":"Cao, Gang","last_name":"Cao","first_name":"Gang"},{"last_name":"Gedik","first_name":"Nuh","full_name":"Gedik, Nuh"}],"date_created":"2018-12-11T11:46:11Z","date_updated":"2021-01-12T07:52:54Z","volume":114,"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"We use ultrafast optical spectroscopy to observe binding of charged single-particle excitations (SE) in the magnetically frustrated Mott insulator Na2IrO3. Above the antiferromagnetic ordering temperature (TN) the system response is due to both Hubbard excitons (HE) and their constituent unpaired SE. The SE response becomes strongly suppressed immediately below TN. We argue that this increase in binding energy is due to a unique interplay between the frustrated Kitaev and the weak Heisenberg-type ordering term in the Hamiltonian, mediating an effective interaction between the spin-singlet SE. This interaction grows with distance causing the SE to become trapped in the HE, similar to quark confinement inside hadrons. This binding of charged particles, induced by magnetic ordering, is a result of a confinement-deconfinement transition of spin excitations. This observation provides evidence for spin liquid type behavior which is expected in Na2IrO3."}],"publist_id":"7441","issue":"1","extern":"1","publication":"Physical Review Letters","citation":{"chicago":"Alpichshev, Zhanybek, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.017203.","short":"Z. Alpichshev, F. Mahmood, G. Cao, N. Gedik, Physical Review Letters 114 (2015).","mla":"Alpichshev, Zhanybek, et al. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” Physical Review Letters, vol. 114, no. 1, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.017203.","apa":"Alpichshev, Z., Mahmood, F., Cao, G., & Gedik, N. (2015). Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.017203","ieee":"Z. Alpichshev, F. Mahmood, G. Cao, and N. Gedik, “Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3,” Physical Review Letters, vol. 114, no. 1. American Physical Society, 2015.","ista":"Alpichshev Z, Mahmood F, Cao G, Gedik N. 2015. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 114(1).","ama":"Alpichshev Z, Mahmood F, Cao G, Gedik N. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 2015;114(1). doi:10.1103/PhysRevLett.114.017203"},"main_file_link":[{"url":"https://dspace.mit.edu/handle/1721.1/92979","open_access":"1"}],"oa":1,"article_type":"original","quality_controlled":"1","doi":"10.1103/PhysRevLett.114.017203","date_published":"2015-07-07T00:00:00Z","language":[{"iso":"eng"}],"month":"07","day":"07","article_processing_charge":"No"},{"date_created":"2018-12-11T11:53:19Z","date_updated":"2023-02-23T12:20:05Z","volume":"2015-July","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"related_material":{"record":[{"id":"464","relation":"later_version","status":"public"}]},"publication_status":"published","publisher":"IEEE","department":[{"_id":"KrCh"}],"year":"2015","acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","publist_id":"5489","ec_funded":1,"article_number":"7174888","language":[{"iso":"eng"}],"conference":{"name":"LICS: Logic in Computer Science","end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan"},"doi":"10.1109/LICS.2015.34","quality_controlled":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/4368/"}],"month":"07","oa_version":"Submitted Version","status":"public","title":"Improved algorithms for one-pair and k-pair Streett objectives","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"1661","abstract":[{"text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"type":"conference","date_published":"2015-07-01T00:00:00Z","publication":"Proceedings - Symposium on Logic in Computer Science","citation":{"ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34."},"day":"01","article_processing_charge":"No","scopus_import":"1"},{"type":"journal_article","abstract":[{"text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2.","lang":"eng"}],"_id":"473","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2","title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","status":"public","ddc":["539"],"pubrep_id":"951","oa_version":"Published Version","file":[{"file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":1084254,"file_id":"4974","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:12:53Z","checksum":"a40eb4016717ddc9927154798a4c164a"}],"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique, 2015. https://doi.org/10.5802/jep.18.","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:10.5802/jep.18.","apa":"Lewin, M., Nam, P., & Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique. https://doi.org/10.5802/jep.18","ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.","ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2015;2:65-115. doi:10.5802/jep.18"},"publication":"Journal de l'Ecole Polytechnique - Mathematiques","page":"65 - 115","date_published":"2015-01-01T00:00:00Z","ec_funded":1,"publist_id":"7344","file_date_updated":"2020-07-14T12:46:35Z","year":"2015","publisher":"Ecole Polytechnique","department":[{"_id":"RoSe"}],"publication_status":"published","author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"full_name":"Phan Thanh, Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Nam","last_name":"Phan Thanh"},{"full_name":"Rougerie, Nicolas","first_name":"Nicolas","last_name":"Rougerie"}],"volume":2,"date_updated":"2021-01-12T08:00:52Z","date_created":"2018-12-11T11:46:40Z","month":"01","tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.5802/jep.18","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"date_published":"2015-06-15T00:00:00Z","doi":"10.1242/jcs.167999","quality_controlled":"1","page":"2866 - 2880","publication":"Journal of Cell Science","citation":{"ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 2015;128(15):2866-2880. doi:10.1242/jcs.167999","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","ieee":"K. Holst et al., “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” Journal of Cell Science, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.","apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.167999","mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” Journal of Cell Science, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:10.1242/jcs.167999.","short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” Journal of Cell Science. Company of Biologists, 2015. https://doi.org/10.1242/jcs.167999."},"month":"06","day":"15","scopus_import":1,"date_updated":"2021-01-12T08:00:54Z","date_created":"2018-12-11T11:46:41Z","oa_version":"None","volume":128,"author":[{"last_name":"Holst","first_name":"Katrin","full_name":"Holst, Katrin"},{"last_name":"Guseva","first_name":"Daria","full_name":"Guseva, Daria"},{"last_name":"Schindler","first_name":"Susann","full_name":"Schindler, Susann"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"last_name":"Braun","first_name":"Armin","full_name":"Braun, Armin"},{"full_name":"Chopra, Himpriya","first_name":"Himpriya","last_name":"Chopra"},{"full_name":"Pabst, Oliver","first_name":"Oliver","last_name":"Pabst"},{"full_name":"Ponimaskin, Evgeni","last_name":"Ponimaskin","first_name":"Evgeni"}],"status":"public","title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","publication_status":"published","publisher":"Company of Biologists","intvolume":" 128","department":[{"_id":"MiSi"}],"_id":"477","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders."}],"issue":"15","publist_id":"7343","type":"journal_article"},{"abstract":[{"lang":"eng","text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window."}],"issue":"6","type":"journal_article","oa_version":"Preprint","status":"public","title":"Looking at mean-payoff and total-payoff through windows","intvolume":" 242","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"523","day":"24","scopus_import":1,"date_published":"2015-03-24T00:00:00Z","page":"25 - 52","publication":"Information and Computation","citation":{"ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. Information and Computation. 2015;242(6):25-52. doi:10.1016/j.ic.2015.03.010","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","apa":"Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.010","mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:10.1016/j.ic.2015.03.010.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010."},"ec_funded":1,"publist_id":"7296","date_updated":"2023-02-23T10:36:02Z","date_created":"2018-12-11T11:46:57Z","volume":242,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"full_name":"Raskin, Jean","first_name":"Jean","last_name":"Raskin"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2279"}]},"publication_status":"published","publisher":"Elsevier","department":[{"_id":"KrCh"}],"year":"2015","month":"03","language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2015.03.010","quality_controlled":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1302.4248"}]},{"doi":"10.1016/j.cell.2015.09.037","date_published":"2015-10-22T00:00:00Z","language":[{"iso":"eng"}],"citation":{"chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” Cell. Cell Press, 2015. https://doi.org/10.1016/j.cell.2015.09.037.","mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” Cell, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:10.1016/j.cell.2015.09.037.","short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. Cell Press. https://doi.org/10.1016/j.cell.2015.09.037","ieee":"W. Li et al., “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” Cell, vol. 163, no. 3. Cell Press, pp. 670–683, 2015.","ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 2015;163(3):670-683. doi:10.1016/j.cell.2015.09.037"},"publication":"Cell","page":"670 - 683","quality_controlled":"1","day":"22","month":"10","scopus_import":1,"author":[{"first_name":"Wenyang","last_name":"Li","full_name":"Li, Wenyang"},{"last_name":"Ma","first_name":"Mengdi","full_name":"Ma, Mengdi"},{"last_name":"Feng","first_name":"Ying","full_name":"Feng, Ying"},{"full_name":"Li, Hongjiang","first_name":"Hongjiang","last_name":"Li","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5039-9660"},{"last_name":"Wang","first_name":"Yichuan","full_name":"Wang, Yichuan"},{"last_name":"Ma","first_name":"Yutong","full_name":"Ma, Yutong"},{"full_name":"Li, Mingzhe","first_name":"Mingzhe","last_name":"Li"},{"first_name":"Fengying","last_name":"An","full_name":"An, Fengying"},{"full_name":"Guo, Hongwei","last_name":"Guo","first_name":"Hongwei"}],"oa_version":"None","volume":163,"date_created":"2018-12-11T11:47:00Z","date_updated":"2021-01-12T08:01:27Z","_id":"532","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","intvolume":" 163","publisher":"Cell Press","department":[{"_id":"JiFr"}],"status":"public","title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","publication_status":"published","publist_id":"7285","issue":"3","abstract":[{"text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants.","lang":"eng"}],"type":"journal_article"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"524","title":"Qualitative analysis of concurrent mean payoff games","status":"public","intvolume":" 242","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time.","lang":"eng"}],"issue":"6","publication":"Information and Computation","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009.","ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. Information and Computation. 2015;242(6):2-24. doi:10.1016/j.ic.2015.03.009","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.009","ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24."},"page":"2 - 24","date_published":"2015-10-11T00:00:00Z","scopus_import":1,"day":"11","year":"2015","publication_status":"published","publisher":"Elsevier","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"}],"related_material":{"record":[{"id":"5403","relation":"earlier_version","status":"public"}]},"date_created":"2018-12-11T11:46:57Z","date_updated":"2023-02-23T12:24:45Z","volume":242,"publist_id":"7295","external_id":{"arxiv":["1409.5306"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.5306"}],"oa":1,"quality_controlled":"1","doi":"10.1016/j.ic.2015.03.009","language":[{"iso":"eng"}],"month":"10"},{"scopus_import":1,"article_processing_charge":"No","day":"01","page":"745 - 752","citation":{"mla":"Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.","ama":"Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting positions for simple traditional board games. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.","apa":"Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752."},"publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","date_published":"2015-01-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. We present an approach that generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. The presence of such states for standard game variants like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played as the default start state is heavily biased. "}],"intvolume":" 2","title":"Automatic generation of alternative starting positions for simple traditional board games","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1481","oa_version":"None","month":"01","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300"}],"language":[{"iso":"eng"}],"conference":{"name":"AAAI: Conference on Artificial Intelligence","start_date":"2015-01-25","location":"Austin, TX, USA","end_date":"2015-01-30"},"ec_funded":1,"publist_id":"5713","publisher":"AAAI Press","department":[{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n","year":"2015","volume":2,"date_updated":"2023-02-23T12:25:07Z","date_created":"2018-12-11T11:52:16Z","related_material":{"record":[{"id":"5410","relation":"earlier_version","status":"public"}]},"author":[{"first_name":"Umair","last_name":"Ahmed","full_name":"Ahmed, Umair"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Sumit","last_name":"Gulwani","full_name":"Gulwani, Sumit"}]},{"abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty."}],"type":"conference","oa_version":"Preprint","_id":"1732","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","status":"public","day":"01","scopus_import":1,"date_published":"2015-01-01T00:00:00Z","citation":{"ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. doi:10.1109/ICRA.2015.7139019","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IEEE, 2015, pp. 325–30, doi:10.1109/ICRA.2015.7139019.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019."},"page":"325 - 330","ec_funded":1,"publist_id":"5394","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Raghav","last_name":"Gupta","full_name":"Gupta, Raghav"},{"full_name":"Kanodia, Ayush","last_name":"Kanodia","first_name":"Ayush"}],"related_material":{"record":[{"id":"5424","status":"public","relation":"earlier_version"},{"id":"5426","status":"public","relation":"earlier_version"}]},"date_created":"2018-12-11T11:53:43Z","date_updated":"2023-02-23T12:25:52Z","year":"2015","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrCh"}],"month":"01","conference":{"end_date":"2015-05-30","start_date":"2015-05-26","location":"Seattle, WA, United States","name":"ICRA: International Conference on Robotics and Automation"},"doi":"10.1109/ICRA.2015.7139019","language":[{"iso":"eng"}],"external_id":{"arxiv":["1409.3360"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1409.3360"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}]},{"oa_version":"Published Version","file":[{"checksum":"bfb858262c30445b8e472c40069178a2","date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:53:31Z","file_id":"5491","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":661015,"access_level":"open_access","file_name":"IST-2015-322-v1+1_safetygames.pdf"}],"date_updated":"2021-01-12T08:02:13Z","date_created":"2018-12-12T11:39:17Z","pubrep_id":"322","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hansen, Kristoffer","first_name":"Kristoffer","last_name":"Hansen"}],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","status":"public","publication_status":"published","ddc":["005","519"],"title":"The patience of concurrent stochastic games with safety and reachability objectives","_id":"5431","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","abstract":[{"lang":"eng","text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential."}],"file_date_updated":"2020-07-14T12:46:53Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2015-322-v1-1","date_published":"2015-02-19T00:00:00Z","page":"25","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.","mla":"Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.","ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria; 2015. doi:10.15479/AT:IST-2015-322-v1-1"},"oa":1,"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"19","month":"02"},{"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"19","month":"02","page":"16","citation":{"apa":"Anonymous, 1, & Anonymous, 2. (2015). Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria.","ieee":"1 Anonymous and 2 Anonymous, Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria, 2015.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","ama":"Anonymous 1, Anonymous 2. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. IST Austria; 2015.","chicago":"Anonymous, 1, and 2 Anonymous. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.","mla":"Anonymous, 1, and 2 Anonymous. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. IST Austria, 2015."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2015-02-19T00:00:00Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:53Z","abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new method to solve the problem that extends methods for finite-horizon DEC- POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show our approach presents promising results."}],"publisher":"IST Austria","ddc":["000"],"title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","status":"public","publication_status":"published","_id":"5434","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"5475","date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:53:14Z","checksum":"8542fd0b10aed7811cd41077b8ccb632","file_name":"IST-2015-326-v1+1_main.pdf","access_level":"open_access","content_type":"application/pdf","file_size":378162,"creator":"system"},{"access_level":"closed","file_name":"IST-2015-326-v1+2_authors.txt","content_type":"text/plain","file_size":64,"creator":"dernst","relation":"main_file","file_id":"6317","checksum":"84c31c537bdaf7a91909f18d25d640ab","date_created":"2019-04-16T13:00:33Z","date_updated":"2020-07-14T12:46:53Z"}],"oa_version":"Published Version","date_created":"2018-12-12T11:39:18Z","date_updated":"2020-07-14T23:04:59Z","pubrep_id":"326","author":[{"full_name":"Anonymous, 1","last_name":"Anonymous","first_name":"1"},{"last_name":"Anonymous","first_name":"2","full_name":"Anonymous, 2"}]},{"date_published":"2015-07-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.","short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.","apa":"Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:10.1109/LICS.2015.32"},"page":"244 - 256","day":"01","scopus_import":1,"series_title":"LICS","oa_version":"None","_id":"1657","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","status":"public","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"type":"conference","alternative_title":["LICS"],"doi":"10.1109/LICS.2015.32","conference":{"name":"LICS: Logic in Computer Science","end_date":"2015-07-10","location":"Kyoto, Japan","start_date":"2015-07-06"},"language":[{"iso":"eng"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","month":"07","related_material":{"record":[{"id":"466","relation":"later_version","status":"public"},{"relation":"earlier_version","status":"public","id":"5429"},{"id":"5435","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Komárková","first_name":"Zuzana","full_name":"Komárková, Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"}],"date_created":"2018-12-11T11:53:18Z","date_updated":"2023-02-23T12:26:16Z","acknowledgement":"A Technical Report of this paper is available at: https://repository.ist.ac.at/327\r\n","year":"2015","publisher":"IEEE","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","ec_funded":1,"publist_id":"5493"},{"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"467","status":"public","relation":"later_version"},{"status":"public","relation":"earlier_version","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"}]},"date_created":"2018-12-11T11:53:17Z","date_updated":"2023-02-23T12:26:19Z","volume":"2015-July","year":"2015","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nA Technical Report of the paper is available at: \r\nhttps://repository.ist.ac.at/331/\r\n","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"5494","ec_funded":1,"article_number":"7174926","conference":{"start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2015.72","language":[{"iso":"eng"}],"external_id":{"arxiv":["1606.03598"]},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"month":"07","oa_version":"None","_id":"1656","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Nested weighted automata","status":"public","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"type":"conference","date_published":"2015-07-31T00:00:00Z","publication":"Proceedings - Symposium on Logic in Computer Science","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.72","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174926, IEEE, 2015, doi:10.1109/LICS.2015.72.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72."},"day":"31","scopus_import":1},{"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem."}],"file_date_updated":"2020-07-14T12:46:52Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Zuzana","last_name":"Komarkova","full_name":"Komarkova, Zuzana"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan"}],"pubrep_id":"318","related_material":{"record":[{"status":"public","relation":"later_version","id":"1657"},{"status":"public","relation":"later_version","id":"466"},{"id":"5435","status":"public","relation":"later_version"}]},"date_created":"2018-12-12T11:39:17Z","date_updated":"2023-02-23T12:26:16Z","oa_version":"Published Version","file":[{"file_size":689863,"content_type":"application/pdf","creator":"system","file_name":"IST-2015-318-v1+1_main.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:54:11Z","checksum":"e4869a584567c506349abda9c8ec7db3","relation":"main_file","file_id":"5533"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5429","year":"2015","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","ddc":["004"],"status":"public","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"IST Austria","day":"12","month":"01","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_published":"2015-01-12T00:00:00Z","doi":"10.15479/AT:IST-2015-318-v1-1","language":[{"iso":"eng"}],"oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1","ama":"Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1"},"page":"41"},{"doi":"10.15479/AT:IST-2015-318-v2-1","date_published":"2015-02-23T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"citation":{"ama":"Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v2-1","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1."},"page":"51","day":"23","month":"02","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Komarkova","first_name":"Zuzana","full_name":"Komarkova, Zuzana"},{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","full_name":"Kretinsky, Jan"}],"pubrep_id":"327","related_material":{"record":[{"id":"1657","status":"public","relation":"later_version"},{"id":"466","relation":"later_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5429"}]},"date_updated":"2023-02-23T12:26:00Z","date_created":"2018-12-12T11:39:19Z","file":[{"date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:54:03Z","checksum":"75284adec80baabdfe71ff9ebbc27445","file_id":"5525","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":717630,"file_name":"IST-2015-318-v2+1_main.pdf","access_level":"open_access"}],"oa_version":"Published Version","_id":"5435","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","ddc":["004"],"publication_status":"published","status":"public","department":[{"_id":"KrCh"}],"publisher":"IST Austria","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:53Z","type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"day":"24","month":"04","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","page":"29","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-170-v2-2.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-170-v2-2","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2015-04-24T00:00:00Z","doi":"10.15479/AT:IST-2015-170-v2-2","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:54Z","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.\r\nIn nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"publication_status":"published","ddc":["000"],"title":"Nested weighted automata","status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IST Austria","year":"2015","_id":"5436","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:19Z","date_updated":"2023-02-23T12:25:21Z","oa_version":"Published Version","file":[{"checksum":"3c402f47d3669c28d04d1af405a08e3f","date_created":"2018-12-12T11:54:19Z","date_updated":"2020-07-14T12:46:54Z","relation":"main_file","file_id":"5541","content_type":"application/pdf","file_size":569991,"creator":"system","access_level":"open_access","file_name":"IST-2015-170-v2+2_report.pdf"}],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"1656","status":"public","relation":"later_version"},{"id":"467","relation":"later_version","status":"public"},{"id":"5415","relation":"earlier_version","status":"public"}]},"pubrep_id":"331"},{"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"conference":{"end_date":"2015-07-10","location":"Kyoto, Japan","start_date":"2015-007-06","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2015.74","language":[{"iso":"eng"}],"month":"07","publication_identifier":{"eisbn":["978-1-4799-8875-4 "],"issn":["1043-6871 "]},"year":"2015","acknowledgement":"A technical report of the article is available at: https://research-explorer.app.ist.ac.at/record/5439","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"IEEE","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5439"}]},"date_created":"2018-12-11T11:53:19Z","date_updated":"2023-02-23T12:26:27Z","file_date_updated":"2020-07-14T12:45:10Z","ec_funded":1,"publist_id":"5491","publication":"LICS","citation":{"ama":"Boker U, Henzinger TA, Otop J. The target discounted-sum problem. In: LICS. Logic in Computer Science. IEEE; 2015:750-761. doi:10.1109/LICS.2015.74","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS. LICS: Logic in Computer ScienceLogic in Computer Science, 750–761.","ieee":"U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,” in LICS, Kyoto, Japan, 2015, pp. 750–761.","apa":"Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum problem. In LICS (pp. 750–761). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.74","mla":"Boker, Udi, et al. “The Target Discounted-Sum Problem.” LICS, IEEE, 2015, pp. 750–61, doi:10.1109/LICS.2015.74.","short":"U. Boker, T.A. Henzinger, J. Otop, in:, LICS, IEEE, 2015, pp. 750–761.","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. “The Target Discounted-Sum Problem.” In LICS, 750–61. Logic in Computer Science. IEEE, 2015. https://doi.org/10.1109/LICS.2015.74."},"page":"750 - 761","date_published":"2015-07-01T00:00:00Z","scopus_import":1,"series_title":"Logic in Computer Science","day":"01","article_processing_charge":"No","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1659","title":"The target discounted-sum problem","ddc":["000"],"status":"public","file":[{"access_level":"open_access","file_name":"2015_LICS_Boker.pdf","content_type":"application/pdf","file_size":340215,"creator":"dernst","relation":"main_file","file_id":"7852","checksum":"6abebca9c1a620e9e103a8f9222befac","date_updated":"2020-07-14T12:45:10Z","date_created":"2020-05-15T08:53:29Z"}],"oa_version":"Submitted Version","type":"conference","abstract":[{"lang":"eng","text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata."}]},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"1610","intvolume":" 9135","status":"public","title":"Edit distance for pushdown automata","pubrep_id":"321","oa_version":"None","type":"conference","alternative_title":["LNCS"],"issue":"Part II","abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k.","lang":"eng"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” 42nd International Colloquium, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: 42nd International Colloquium. Vol 9135. Springer Nature; 2015:121-133. doi:10.1007/978-3-662-47666-6_10","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_10","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133."},"publication":"42nd International Colloquium","page":"121 - 133","date_published":"2015-07-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","year":"2015","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer Nature","publication_status":"published","related_material":{"record":[{"status":"public","relation":"later_version","id":"465"},{"relation":"earlier_version","status":"public","id":"5438"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"volume":9135,"date_updated":"2023-02-23T12:26:24Z","date_created":"2018-12-11T11:53:01Z","ec_funded":1,"publist_id":"5556","main_file_link":[{"url":"https://arxiv.org/abs/1504.08259","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1504.08259"]},"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","doi":"10.1007/978-3-662-47666-6_10","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-662-47665-9"]},"month":"07"},{"abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. \r\nThe algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main theoretical results are as follows.\r\nFirst, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when the output is $\\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$ and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. "}],"file_date_updated":"2020-07-14T12:46:54Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"1607","status":"public","relation":"later_version"},{"status":"public","relation":"earlier_version","id":"5430"}]},"pubrep_id":"333","date_updated":"2023-02-23T12:26:05Z","date_created":"2018-12-12T11:39:19Z","file":[{"relation":"main_file","file_id":"5473","checksum":"f5917c20f84018b362d385c000a2e123","date_updated":"2020-07-14T12:46:54Z","date_created":"2018-12-12T11:53:12Z","access_level":"open_access","file_name":"IST-2015-330-v2+1_main.pdf","content_type":"application/pdf","file_size":1072137,"creator":"system"}],"oa_version":"Published Version","_id":"5437","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publication_status":"published","ddc":["000"],"title":"Faster algorithms for quantitative verification in constant treewidth graphs","status":"public","publisher":"IST Austria","department":[{"_id":"KrCh"}],"month":"04","day":"27","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2015-330-v2-1","date_published":"2015-04-27T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-330-v2-1","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1."},"page":"27"},{"type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"file_date_updated":"2020-07-14T12:46:52Z","year":"2015","_id":"5430","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publisher":"IST Austria","publication_status":"published","ddc":["000"],"status":"public","title":"Faster algorithms for quantitative verification in constant treewidth graphs","pubrep_id":"319","related_material":{"record":[{"relation":"later_version","status":"public","id":"1607"},{"relation":"later_version","status":"public","id":"5437"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"}],"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":1089651,"creator":"system","file_name":"IST-2015-319-v1+1_long.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:53:21Z","checksum":"62c6ea01e342553dcafb88a070fb1ad5","relation":"main_file","file_id":"5482"}],"date_updated":"2023-02-23T12:26:22Z","date_created":"2018-12-12T11:39:17Z","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","day":"10","month":"02","oa":1,"citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015."},"page":"31","date_published":"2015-02-10T00:00:00Z","doi":"10.15479/AT:IST-2015-319-v1-1","language":[{"iso":"eng"}]},{"file_date_updated":"2020-07-14T12:46:55Z","abstract":[{"text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata. ","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"author":[{"full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"pubrep_id":"335","related_material":{"record":[{"status":"public","relation":"later_version","id":"1659"}]},"date_updated":"2023-02-23T10:08:48Z","date_created":"2018-12-12T11:39:20Z","oa_version":"Published Version","file":[{"creator":"system","content_type":"application/pdf","file_size":589619,"file_name":"IST-2015-335-v1+1_report.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:53:55Z","checksum":"40405907aa012acece1bc26cf0be554d","file_id":"5517","relation":"main_file"}],"_id":"5439","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publication_status":"published","title":"The target discounted-sum problem","ddc":["004","512","513"],"status":"public","publisher":"IST Austria","department":[{"_id":"ToHe"}],"month":"05","day":"18","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","doi":"10.15479/AT:IST-2015-335-v1-1","date_published":"2015-05-18T00:00:00Z","language":[{"iso":"eng"}],"citation":{"apa":"Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum problem. IST Austria. https://doi.org/10.15479/AT:IST-2015-335-v1-1","ieee":"U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem. IST Austria, 2015.","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","ama":"Boker U, Henzinger TA, Otop J. The Target Discounted-Sum Problem. IST Austria; 2015. doi:10.15479/AT:IST-2015-335-v1-1","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. The Target Discounted-Sum Problem. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-335-v1-1.","short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","mla":"Boker, Udi, et al. The Target Discounted-Sum Problem. IST Austria, 2015, doi:10.15479/AT:IST-2015-335-v1-1."},"oa":1,"page":"20"},{"alternative_title":["IST Austria Technical Report"],"type":"technical_report","abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. ","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:55Z","status":"public","title":"Edit distance for pushdown automata","publication_status":"published","ddc":["004"],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","_id":"5438","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:20Z","date_updated":"2023-02-23T12:20:08Z","oa_version":"Published Version","file":[{"checksum":"8a5f2d77560e552af87eb1982437a43b","date_created":"2018-12-12T11:53:56Z","date_updated":"2020-07-14T12:46:55Z","file_id":"5518","relation":"main_file","creator":"system","file_size":422573,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2015-334-v1+1_report.pdf"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"pubrep_id":"334","related_material":{"record":[{"id":"1610","status":"public","relation":"later_version"},{"status":"public","relation":"later_version","id":"465"}]},"month":"05","day":"05","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","page":"15","oa":1,"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1."},"language":[{"iso":"eng"}],"date_published":"2015-05-05T00:00:00Z","doi":"10.15479/AT:IST-2015-334-v1-1"},{"pubrep_id":"338","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5421"},{"status":"public","relation":"earlier_version","id":"5432"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"file":[{"file_id":"5484","relation":"main_file","date_updated":"2020-07-14T12:46:56Z","date_created":"2018-12-12T11:53:23Z","checksum":"66aace7d367032af97c15e35c9be9636","file_name":"IST-2015-323-v2+2_main.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":466161}],"oa_version":"Published Version","date_updated":"2023-02-23T12:26:10Z","date_created":"2018-12-12T11:39:21Z","year":"2015","_id":"5440","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publisher":"IST Austria","publication_status":"published","ddc":["005","576"],"status":"public","title":"The complexity of evolutionary games on graphs","file_date_updated":"2020-07-14T12:46:56Z","abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_published":"2015-06-16T00:00:00Z","doi":"10.15479/AT:IST-2015-323-v2-2","language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v2-2"},"oa":1,"page":"18","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"06","day":"16"},{"_id":"5432","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","department":[{"_id":"KrCh"}],"title":"The complexity of evolutionary games on graphs","ddc":["005","576"],"publication_status":"published","status":"public","related_material":{"record":[{"id":"5421","relation":"earlier_version","status":"public"},{"id":"5440","status":"public","relation":"later_version"}]},"pubrep_id":"323","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"file":[{"date_created":"2018-12-12T11:53:57Z","date_updated":"2020-07-14T12:46:53Z","checksum":"546c1b291d545e7b24aaaf4199dac671","file_id":"5519","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":576347,"file_name":"IST-2015-323-v1+1_main.pdf","access_level":"open_access"}],"oa_version":"Published Version","date_created":"2018-12-12T11:39:18Z","date_updated":"2023-02-23T12:26:33Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:53Z","abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1"},"oa":1,"page":"29","date_published":"2015-02-19T00:00:00Z","doi":"10.15479/AT:IST-2015-323-v1-1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","day":"19","month":"02"},{"_id":"5444","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publisher":"IST Austria","department":[{"_id":"KrCh"}],"publication_status":"published","status":"public","title":"Reconstructing robust phylogenies of metastatic cancers","ddc":["000","576"],"pubrep_id":"399","author":[{"full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","first_name":"Johannes","last_name":"Reiter"},{"first_name":"Alvin","last_name":"Makohon-Moore","full_name":"Makohon-Moore, Alvin"},{"full_name":"Gerold, Jeffrey","first_name":"Jeffrey","last_name":"Gerold"},{"first_name":"Ivana","last_name":"Bozic","full_name":"Bozic, Ivana"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Iacobuzio-Donahue, Christine","last_name":"Iacobuzio-Donahue","first_name":"Christine"},{"full_name":"Vogelstein, Bert","last_name":"Vogelstein","first_name":"Bert"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"file":[{"access_level":"open_access","file_name":"IST-2015-399-v1+1_treeomics.pdf","creator":"system","content_type":"application/pdf","file_size":3533200,"file_id":"5485","relation":"main_file","checksum":"c47d33bdda06181753c0af36f16e7b5d","date_created":"2018-12-12T11:53:24Z","date_updated":"2020-07-14T12:46:58Z"}],"oa_version":"Published Version","date_updated":"2020-07-14T23:05:07Z","date_created":"2018-12-12T11:39:22Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"A comprehensive understanding of the clonal evolution of cancer is critical for understanding neoplasia. Genome-wide sequencing data enables evolutionary studies at unprecedented depth. However, classical phylogenetic methods often struggle with noisy sequencing data of impure DNA samples and fail to detect subclones that have different evolutionary trajectories. We have developed a tool, called Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly available sequencing technologies. Using Bayesian inference and Integer Linear Programming, robust phylogenies consistent with the biological processes underlying cancer evolution were obtained for pancreatic, ovarian, and prostate cancers. Furthermore, Treeomics correctly identified sequencing artifacts such as those resulting from low statistical power; nearly 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumor heterogeneity among distinct samples. Importantly, we show that the evolutionary trees generated with Treeomics are mathematically optimal."}],"file_date_updated":"2020-07-14T12:46:58Z","citation":{"ama":"Reiter J, Makohon-Moore A, Gerold J, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1","ieee":"J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.","apa":"Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1","ista":"Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.","short":"J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.","mla":"Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.","chicago":"Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1."},"oa":1,"page":"25","date_published":"2015-12-30T00:00:00Z","doi":"10.15479/AT:IST-2015-399-v1-1","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"30","month":"12"},{"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"id":"378E0060-F248-11E8-B48F-1D18A9856A87","last_name":"Davies","first_name":"Jessica","full_name":"Davies, Jessica"}],"pubrep_id":"362","related_material":{"record":[{"relation":"later_version","status":"public","id":"1166"}]},"date_updated":"2023-02-21T16:24:05Z","date_created":"2018-12-12T11:39:22Z","oa_version":"Published Version","file":[{"creator":"system","content_type":"application/pdf","file_size":412379,"access_level":"open_access","file_name":"IST-2015-325-v2+1_main.pdf","checksum":"f0fa31ad8161ed655137e94012123ef9","date_updated":"2020-07-14T12:46:57Z","date_created":"2018-12-12T11:53:05Z","file_id":"5466","relation":"main_file"}],"year":"2015","_id":"5443","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"status":"public","title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:57Z","abstract":[{"lang":"eng","text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2015-325-v2-1","date_published":"2015-11-06T00:00:00Z","language":[{"iso":"eng"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.","short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.","ama":"Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1","ista":"Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.","apa":"Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1"},"oa":1,"page":"23","day":"06","month":"11","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"extern":"1","issue":"4","abstract":[{"lang":"eng","text":"We present here the first integer-based algorithm for constructing a well-defined lattice sphere specified by integer radius and integer center. The algorithm evolves from a unique correspondence between the lattice points comprising the sphere and the distribution of sum of three square numbers in integer intervals. We characterize these intervals to derive a useful set of recurrences, which, in turn, aids in efficient computation. Each point of the lattice sphere is determined by resorting to only a few primitive operations in the integer domain. The symmetry of its quadraginta octants provides an added advantage by confining the computation to its prima quadraginta octant. Detailed theoretical analysis and experimental results have been furnished to demonstrate its simplicity and elegance."}],"type":"journal_article","oa_version":"None","volume":624,"date_created":"2019-01-08T20:44:06Z","date_updated":"2021-01-12T08:03:36Z","author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"intvolume":" 624","publisher":"Elsevier","publication_status":"published","title":"From prima quadraginta octant to lattice sphere through primitive integer operations","status":"public","_id":"5804","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publication_identifier":{"issn":["0304-3975"]},"month":"04","day":"18","language":[{"iso":"eng"}],"date_published":"2015-04-18T00:00:00Z","doi":"10.1016/j.tcs.2015.11.018","page":"56-72","quality_controlled":"1","citation":{"chicago":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.11.018.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.","mla":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science, vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi:10.1016/j.tcs.2015.11.018.","apa":"Biswas, R., & Bhowmick, P. (2015). From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.11.018","ieee":"R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere through primitive integer operations,” Theoretical Computer Science, vol. 624, no. 4. Elsevier, pp. 56–72, 2015.","ista":"Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 624(4), 56–72.","ama":"Biswas R, Bhowmick P. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 2015;624(4):56-72. doi:10.1016/j.tcs.2015.11.018"},"publication":"Theoretical Computer Science"},{"publication_identifier":{"issn":["0304-3975"]},"month":"11","day":"09","citation":{"ama":"Biswas R, Bhowmick P. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 2015;605(11):146-163. doi:10.1016/j.tcs.2015.09.003","ista":"Biswas R, Bhowmick P. 2015. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.","ieee":"R. Biswas and P. Bhowmick, “On different topological classes of spherical geodesic paths and circles inZ3,” Theoretical Computer Science, vol. 605, no. 11. Elsevier, pp. 146–163, 2015.","apa":"Biswas, R., & Bhowmick, P. (2015). On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.09.003","mla":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science, vol. 605, no. 11, Elsevier, 2015, pp. 146–63, doi:10.1016/j.tcs.2015.09.003.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.09.003."},"publication":"Theoretical Computer Science","page":"146-163","quality_controlled":"1","date_published":"2015-11-09T00:00:00Z","doi":"10.1016/j.tcs.2015.09.003","language":[{"iso":"eng"}],"type":"journal_article","issue":"11","extern":"1","_id":"5807","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 605","publisher":"Elsevier","title":"On different topological classes of spherical geodesic paths and circles inZ3","status":"public","publication_status":"published","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"oa_version":"None","volume":605,"date_created":"2019-01-08T20:44:52Z","date_updated":"2021-01-12T08:03:37Z"},{"volume":31,"oa_version":"None","date_created":"2019-01-08T20:45:05Z","date_updated":"2021-01-12T08:03:37Z","author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","first_name":"Ranita","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"publisher":"Springer Nature","intvolume":" 31","status":"public","title":"Layer the sphere","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5808","year":"2015","extern":"1","issue":"6-8","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s00371-015-1101-3","date_published":"2015-05-08T00:00:00Z","page":"787-797","quality_controlled":"1","citation":{"short":"R. Biswas, P. Bhowmick, The Visual Computer 31 (2015) 787–797.","mla":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer, vol. 31, no. 6–8, Springer Nature, 2015, pp. 787–97, doi:10.1007/s00371-015-1101-3.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer. Springer Nature, 2015. https://doi.org/10.1007/s00371-015-1101-3.","ama":"Biswas R, Bhowmick P. Layer the sphere. The Visual Computer. 2015;31(6-8):787-797. doi:10.1007/s00371-015-1101-3","ieee":"R. Biswas and P. Bhowmick, “Layer the sphere,” The Visual Computer, vol. 31, no. 6–8. Springer Nature, pp. 787–797, 2015.","apa":"Biswas, R., & Bhowmick, P. (2015). Layer the sphere. The Visual Computer. Springer Nature. https://doi.org/10.1007/s00371-015-1101-3","ista":"Biswas R, Bhowmick P. 2015. Layer the sphere. The Visual Computer. 31(6–8), 787–797."},"publication":"The Visual Computer","publication_identifier":{"issn":["0178-2789","1432-2315"]},"day":"08","month":"05"},{"publication":"Nature Reviews Molecular Cell Biology","citation":{"ama":"Sainsbury S, Bernecky C, Cramer P. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 2015;16(3):129-143. doi:10.1038/nrm3952","ieee":"S. Sainsbury, C. Bernecky, and P. Cramer, “Structural basis of transcription initiation by RNA polymerase II,” Nature Reviews Molecular Cell Biology, vol. 16, no. 3. Nature Publishing Group, pp. 129–143, 2015.","apa":"Sainsbury, S., Bernecky, C., & Cramer, P. (2015). Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. Nature Publishing Group. https://doi.org/10.1038/nrm3952","ista":"Sainsbury S, Bernecky C, Cramer P. 2015. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 16(3), 129–143.","short":"S. Sainsbury, C. Bernecky, P. Cramer, Nature Reviews Molecular Cell Biology 16 (2015) 129–143.","mla":"Sainsbury, Sarah, et al. “Structural Basis of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular Cell Biology, vol. 16, no. 3, Nature Publishing Group, 2015, pp. 129–43, doi:10.1038/nrm3952.","chicago":"Sainsbury, Sarah, Carrie Bernecky, and Patrick Cramer. “Structural Basis of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular Cell Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nrm3952."},"page":"129 - 143","doi":"10.1038/nrm3952","date_published":"2015-03-26T00:00:00Z","language":[{"iso":"eng"}],"day":"26","month":"03","article_processing_charge":"No","year":"2015","_id":"594","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Structural basis of transcription initiation by RNA polymerase II","intvolume":" 16","publisher":"Nature Publishing Group","author":[{"full_name":"Sainsbury, Sarah","last_name":"Sainsbury","first_name":"Sarah"},{"full_name":"Bernecky, Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0893-7036","first_name":"Carrie A","last_name":"Bernecky"},{"full_name":"Cramer, Patrick","last_name":"Cramer","first_name":"Patrick"}],"date_updated":"2021-01-12T08:05:16Z","date_created":"2018-12-11T11:47:23Z","oa_version":"None","volume":16,"type":"journal_article","abstract":[{"lang":"eng","text":"Transcription of eukaryotic protein-coding genes commences with the assembly of a conserved initiation complex, which consists of RNA polymerase II (Pol II) and the general transcription factors, at promoter DNA. After two decades of research, the structural basis of transcription initiation is emerging. Crystal structures of many components of the initiation complex have been resolved, and structural information on Pol II complexes with general transcription factors has recently been obtained. Although mechanistic details await elucidation, available data outline how Pol II cooperates with the general transcription factors to bind to and open promoter DNA, and how Pol II directs RNA synthesis and escapes from the promoter."}],"publist_id":"7206","issue":"3","extern":"1"},{"title":"On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result","status":"public","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1511","file":[{"date_updated":"2020-07-14T12:44:59Z","date_created":"2018-12-12T10:11:18Z","checksum":"0945811875351796324189312ca29e9e","relation":"main_file","file_id":"4871","content_type":"application/pdf","file_size":636735,"creator":"system","file_name":"IST-2016-502-v1+1_42.pdf","access_level":"open_access"}],"oa_version":"Published Version","pubrep_id":"502","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"The fact that the complete graph K_5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph K_n embeds in a closed surface M if and only if (n-3)(n-4) is at most 6b_1(M), where b_1(M) is the first Z_2-Betti number of M. On the other hand, Van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of K_{n+1}) embeds in R^{2k} if and only if n is less or equal to 2k+2. Two decades ago, Kuhnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k-1)-connected 2k-manifold with kth Z_2-Betti number b_k only if the following generalized Heawood inequality holds: binom{n-k-1}{k+1} is at most binom{2k+1}{k+1} b_k. This is a common generalization of the case of graphs on surfaces as well as the Van Kampen--Flores theorem. In the spirit of Kuhnel's conjecture, we prove that if the k-skeleton of the n-simplex embeds in a 2k-manifold with kth Z_2-Betti number b_k, then n is at most 2b_k binom{2k+2}{k} + 2k + 5. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k-1)-connected. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition.","lang":"eng"}],"page":"476 - 490","citation":{"ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:476-490. doi:10.4230/LIPIcs.SOCG.2015.476","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2015. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2015). On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result (Vol. 34, pp. 476–490). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.476","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.","mla":"Goaoc, Xavier, et al. On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–90, doi:10.4230/LIPIcs.SOCG.2015.476.","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result,” 34:476–90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.476."},"date_published":"2015-06-11T00:00:00Z","scopus_import":1,"day":"11","has_accepted_license":"1","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"The work by Z. P. was partially supported by the Charles University Grant SVV-2014-260103. The\r\nwork by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of\r\nthe Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research\r\nwork of M. T. was conducted at IST Austria, supported by an IST Fellowship. The work by U.W.\r\nwas partially supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and\r\nSNSF-PP00P2-138948).","year":"2015","date_updated":"2023-02-23T12:38:00Z","date_created":"2018-12-11T11:52:27Z","volume":"34 ","author":[{"first_name":"Xavier","last_name":"Goaoc","full_name":"Goaoc, Xavier"},{"last_name":"Mabillard","first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Mabillard, Isaac"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"full_name":"Patakova, Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3975-1683","first_name":"Zuzana","last_name":"Patakova"},{"full_name":"Tancer, Martin","first_name":"Martin","last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714"},{"full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"610","relation":"later_version","status":"public"}]},"file_date_updated":"2020-07-14T12:44:59Z","publist_id":"5666","ec_funded":1,"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2015-06-25","start_date":"2015-06-22","location":"Eindhoven, Netherlands","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.4230/LIPIcs.SOCG.2015.476","month":"06"},{"abstract":[{"text":"Carbon dioxide (CO2) gradients are ubiquitous and provide animals with information about their environment, such as the potential presence of prey or predators. The nematode Caenorhabditis elegans avoids elevated CO2, and previous work identified three neuron pairs called “BAG,” “AFD,” and “ASE” that respond to CO2 stimuli. Using in vivo Ca2+ imaging and behavioral analysis, we show that C. elegans can detect CO2 independently of these sensory pathways. Many of the C. elegans sensory neurons we examined, including the AWC olfactory neurons, the ASJ and ASK gustatory neurons, and the ASH and ADL nociceptors, respond to a rise in CO2 with a rise in Ca2+. In contrast, glial sheath cells harboring the sensory endings of C. elegans’ major chemosensory neurons exhibit strong and sustained decreases in Ca2+ in response to high CO2. Some of these CO2 responses appear to be cell intrinsic. Worms therefore may couple detection of CO2 to that of other cues at the earliest stages of sensory processing. We show that C. elegans persistently suppresses oviposition at high CO2. Hermaphrodite-specific neurons (HSNs), the executive neurons driving egg-laying, are tonically inhibited when CO2 is elevated. CO2 modulates the egg-laying system partly through the AWC olfactory neurons: High CO2 tonically activates AWC by a cGMP-dependent mechanism, and AWC output inhibits the HSNs. Our work shows that CO2 is a more complex sensory cue for C. elegans than previously thought, both in terms of behavior and neural circuitry.","lang":"eng"}],"issue":"27","type":"journal_article","file":[{"date_created":"2019-03-19T14:21:07Z","date_updated":"2020-07-14T12:47:20Z","checksum":"3d2da5af8d72467e382a565abc2e003d","file_id":"6119","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":2822681,"file_name":"2015_PNAS_Fenk.pdf","access_level":"open_access"}],"oa_version":"Published Version","status":"public","ddc":["570"],"title":"Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity","intvolume":" 112","_id":"6118","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"07","has_accepted_license":"1","date_published":"2015-07-07T00:00:00Z","page":"E3525-E3534","publication":"Proceedings of the National Academy of Sciences","citation":{"ama":"Fenk LA, de Bono M. Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. 2015;112(27):E3525-E3534. doi:10.1073/pnas.1423808112","ista":"Fenk LA, de Bono M. 2015. Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. 112(27), E3525–E3534.","apa":"Fenk, L. A., & de Bono, M. (2015). Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1423808112","ieee":"L. A. Fenk and M. de Bono, “Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity,” Proceedings of the National Academy of Sciences, vol. 112, no. 27. National Academy of Sciences, pp. E3525–E3534, 2015.","mla":"Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes in Neural Activity.” Proceedings of the National Academy of Sciences, vol. 112, no. 27, National Academy of Sciences, 2015, pp. E3525–34, doi:10.1073/pnas.1423808112.","short":"L.A. Fenk, M. de Bono, Proceedings of the National Academy of Sciences 112 (2015) E3525–E3534.","chicago":"Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes in Neural Activity.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1423808112."},"extern":"1","file_date_updated":"2020-07-14T12:47:20Z","date_updated":"2021-01-12T08:06:12Z","date_created":"2019-03-19T14:15:50Z","volume":112,"author":[{"full_name":"Fenk, Lorenz A.","first_name":"Lorenz A.","last_name":"Fenk"},{"last_name":"de Bono","first_name":"Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"}],"publication_status":"published","publisher":"National Academy of Sciences","year":"2015","pmid":1,"month":"07","publication_identifier":{"issn":["0027-8424","1091-6490"]},"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1423808112","quality_controlled":"1","oa":1,"external_id":{"pmid":["26100886"]}},{"title":"Decoding a neural circuit controlling global animal state in C. elegans","status":"public","ddc":["570"],"intvolume":" 4","_id":"6120","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_size":6723528,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2015_elife_Laurent.pdf","checksum":"cf641b7a363aecd0a101755d23dee7e0","date_updated":"2020-07-14T12:47:20Z","date_created":"2019-03-19T14:29:43Z","relation":"main_file","file_id":"6121"}],"type":"journal_article","abstract":[{"text":"Brains organize behavior and physiology to optimize the response to threats or opportunities. We dissect how 21% O2, an indicator of surface exposure, reprograms C. elegans' global state, inducing sustained locomotory arousal and altering expression of neuropeptides, metabolic enzymes, and other non-neural genes. The URX O2-sensing neurons drive arousal at 21% O2 by tonically activating the RMG interneurons. Stimulating RMG is sufficient to switch behavioral state. Ablating the ASH, ADL, or ASK sensory neurons connected to RMG by gap junctions does not disrupt arousal. However, disrupting cation currents in these neurons curtails RMG neurosecretion and arousal. RMG signals high O2 by peptidergic secretion. Neuropeptide reporters reveal neural circuit state, as neurosecretion stimulates neuropeptide expression. Neural imaging in unrestrained animals shows that URX and RMG encode O2 concentration rather than behavior, while the activity of downstream interneurons such as AVB and AIY reflect both O2 levels and the behavior being executed.","lang":"eng"}],"publication":"eLife","citation":{"short":"P. Laurent, Z. Soltesz, G.M. Nelson, C. Chen, F. Arellano-Carbajal, E. Levy, M. de Bono, ELife 4 (2015).","mla":"Laurent, Patrick, et al. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” ELife, vol. 4, e04241, eLife Sciences Publications, 2015, doi:10.7554/elife.04241.","chicago":"Laurent, Patrick, Zoltan Soltesz, Geoffrey M Nelson, Changchun Chen, Fausto Arellano-Carbajal, Emmanuel Levy, and Mario de Bono. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” ELife. eLife Sciences Publications, 2015. https://doi.org/10.7554/elife.04241.","ama":"Laurent P, Soltesz Z, Nelson GM, et al. Decoding a neural circuit controlling global animal state in C. elegans. eLife. 2015;4. doi:10.7554/elife.04241","apa":"Laurent, P., Soltesz, Z., Nelson, G. M., Chen, C., Arellano-Carbajal, F., Levy, E., & de Bono, M. (2015). Decoding a neural circuit controlling global animal state in C. elegans. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.04241","ieee":"P. Laurent et al., “Decoding a neural circuit controlling global animal state in C. elegans,” eLife, vol. 4. eLife Sciences Publications, 2015.","ista":"Laurent P, Soltesz Z, Nelson GM, Chen C, Arellano-Carbajal F, Levy E, de Bono M. 2015. Decoding a neural circuit controlling global animal state in C. elegans. eLife. 4, e04241."},"date_published":"2015-03-11T00:00:00Z","day":"11","has_accepted_license":"1","publication_status":"published","publisher":"eLife Sciences Publications","year":"2015","pmid":1,"date_updated":"2021-01-12T08:06:13Z","date_created":"2019-03-19T14:23:51Z","volume":4,"author":[{"first_name":"Patrick","last_name":"Laurent","full_name":"Laurent, Patrick"},{"full_name":"Soltesz, Zoltan","last_name":"Soltesz","first_name":"Zoltan"},{"full_name":"Nelson, Geoffrey M","last_name":"Nelson","first_name":"Geoffrey M"},{"last_name":"Chen","first_name":"Changchun","full_name":"Chen, Changchun"},{"last_name":"Arellano-Carbajal","first_name":"Fausto","full_name":"Arellano-Carbajal, Fausto"},{"last_name":"Levy","first_name":"Emmanuel","full_name":"Levy, Emmanuel"},{"orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario"}],"article_number":"e04241","extern":"1","file_date_updated":"2020-07-14T12:47:20Z","quality_controlled":"1","external_id":{"pmid":["25760081"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.7554/elife.04241","month":"03","publication_identifier":{"issn":["2050-084X"]}},{"date_updated":"2023-02-23T12:44:26Z","date_created":"2018-12-11T11:53:10Z","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Krokhin","first_name":"Andrei","full_name":"Krokhin, Andrei"},{"full_name":"Rolinek, Michal","first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"644","status":"public","relation":"other"}]},"publication_status":"published","publisher":"IEEE","department":[{"_id":"VlKo"}],"year":"2015","ec_funded":1,"publist_id":"5518","language":[{"iso":"eng"}],"conference":{"location":"Berkeley, CA, United States","start_date":"2015-10-18","end_date":"2015-10-20","name":"FOCS: Foundations of Computer Science"},"doi":"10.1109/FOCS.2015.80","quality_controlled":"1","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1502.07327","open_access":"1"}],"month":"12","oa_version":"Preprint","status":"public","title":"The complexity of general-valued CSPs","_id":"1637","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P ≠ NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in {0, ∞} corresponds to ordinary CSPs, where one deals only with the feasibility issue and there is no optimization. This case is the subject of the Algebraic CSP Dichotomy Conjecture predicting for which constraint languages CSPs are tractable (i.e. solvable in polynomial time) and for which NP-hard. The case when all allowed functions take only finite values corresponds to finite-valued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Zivny. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e. the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"alternative_title":["56th Annual Symposium on Foundations of Computer Science"],"type":"conference","date_published":"2015-12-01T00:00:00Z","page":"1246 - 1258","citation":{"ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. In: IEEE; 2015:1246-1258. doi:10.1109/FOCS.2015.80","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, , 1246–1258.","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.","apa":"Kolmogorov, V., Krokhin, A., & Rolinek, M. (2015). The complexity of general-valued CSPs (pp. 1246–1258). Presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States: IEEE. https://doi.org/10.1109/FOCS.2015.80","mla":"Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,” 1246–58. IEEE, 2015. https://doi.org/10.1109/FOCS.2015.80."},"day":"01","scopus_import":1},{"publisher":"American Society of Hematology","intvolume":" 127","title":"Structural basis for collagen recognition by the immune receptor OSCAR","publication_status":"published","status":"public","pmid":1,"_id":"6507","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","volume":127,"oa_version":"None","date_created":"2019-05-31T09:38:50Z","date_updated":"2021-01-12T08:07:47Z","author":[{"first_name":"Long","last_name":"Zhou","id":"3E751364-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1864-8951","full_name":"Zhou, Long"},{"last_name":"Hinerman","first_name":"J. M.","full_name":"Hinerman, J. M."},{"first_name":"M.","last_name":"Blaszczyk","full_name":"Blaszczyk, M."},{"full_name":"Miller, J. L. C.","last_name":"Miller","first_name":"J. L. C."},{"full_name":"Conrady, D. G.","first_name":"D. G.","last_name":"Conrady"},{"first_name":"A. D.","last_name":"Barrow","full_name":"Barrow, A. D."},{"last_name":"Chirgadze","first_name":"D. Y.","full_name":"Chirgadze, D. Y."},{"full_name":"Bihan, D.","first_name":"D.","last_name":"Bihan"},{"full_name":"Farndale, R. W.","last_name":"Farndale","first_name":"R. W."},{"full_name":"Herr, A. B.","last_name":"Herr","first_name":"A. B."}],"type":"journal_article","extern":"1","issue":"5","abstract":[{"lang":"eng","text":"The osteoclast-associated receptor (OSCAR) is a collagen-binding immune receptor with important roles in dendritic cell maturation and activation of inflammatory monocytes as well as in osteoclastogenesis. The crystal structure of the OSCAR ectodomain is presented, both free and in complex with a consensus triple-helical peptide (THP). The structures revealed a collagen-binding site in each immunoglobulin-like domain (D1 and D2). The THP binds near a predicted collagen-binding groove in D1, but a more extensive interaction with D2 is facilitated by the unusually wide D1-D2 interdomain angle in OSCAR. Direct binding assays, combined with site-directed mutagenesis, confirm that the primary collagen-binding site in OSCAR resides in D2, in marked contrast to the related collagen receptors, glycoprotein VI (GPVI) and leukocyte-associated immunoglobulin-like receptor-1 (LAIR-1). Monomeric OSCAR D1D2 binds to the consensus THP with a KD of 28 µM measured in solution, but shows a higher affinity (KD 1.5 μM) when binding to a solid-phase THP, most likely due to an avidity effect. These data suggest a 2-stage model for the interaction of OSCAR with a collagen fibril, with transient, low-affinity interactions initiated by the membrane-distal D1, followed by firm adhesion to the primary binding site in D2."}],"page":"529-537","quality_controlled":"1","citation":{"ama":"Zhou L, Hinerman JM, Blaszczyk M, et al. Structural basis for collagen recognition by the immune receptor OSCAR. Blood. 2015;127(5):529-537. doi:10.1182/blood-2015-08-667055","ista":"Zhou L, Hinerman JM, Blaszczyk M, Miller JLC, Conrady DG, Barrow AD, Chirgadze DY, Bihan D, Farndale RW, Herr AB. 2015. Structural basis for collagen recognition by the immune receptor OSCAR. Blood. 127(5), 529–537.","ieee":"L. Zhou et al., “Structural basis for collagen recognition by the immune receptor OSCAR,” Blood, vol. 127, no. 5. American Society of Hematology, pp. 529–537, 2015.","apa":"Zhou, L., Hinerman, J. M., Blaszczyk, M., Miller, J. L. C., Conrady, D. G., Barrow, A. D., … Herr, A. B. (2015). Structural basis for collagen recognition by the immune receptor OSCAR. Blood. American Society of Hematology. https://doi.org/10.1182/blood-2015-08-667055","mla":"Zhou, Long, et al. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” Blood, vol. 127, no. 5, American Society of Hematology, 2015, pp. 529–37, doi:10.1182/blood-2015-08-667055.","short":"L. Zhou, J.M. Hinerman, M. Blaszczyk, J.L.C. Miller, D.G. Conrady, A.D. Barrow, D.Y. Chirgadze, D. Bihan, R.W. Farndale, A.B. Herr, Blood 127 (2015) 529–537.","chicago":"Zhou, Long, J. M. Hinerman, M. Blaszczyk, J. L. C. Miller, D. G. Conrady, A. D. Barrow, D. Y. Chirgadze, D. Bihan, R. W. Farndale, and A. B. Herr. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” Blood. American Society of Hematology, 2015. https://doi.org/10.1182/blood-2015-08-667055."},"external_id":{"pmid":["26552697"]},"publication":"Blood","language":[{"iso":"eng"}],"doi":"10.1182/blood-2015-08-667055","date_published":"2015-11-02T00:00:00Z","publication_identifier":{"issn":["0006-4971","1528-0020"]},"day":"02","month":"11"},{"day":"01","month":"02","language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","doi":"10.1109/tit.2014.2368555","page":"783-800","quality_controlled":"1","external_id":{"arxiv":["1401.6060"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1401.6060"}],"oa":1,"citation":{"ama":"Mondelli M, Hassani H, Sason I, Urbanke R. Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. 2015;61(2):783-800. doi:10.1109/tit.2014.2368555","ista":"Mondelli M, Hassani H, Sason I, Urbanke R. 2015. Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. 61(2), 783–800.","apa":"Mondelli, M., Hassani, H., Sason, I., & Urbanke, R. (2015). Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2014.2368555","ieee":"M. Mondelli, H. Hassani, I. Sason, and R. Urbanke, “Achieving Marton’s region for broadcast channels using polar codes,” IEEE Transactions on Information Theory, vol. 61, no. 2. IEEE, pp. 783–800, 2015.","mla":"Mondelli, Marco, et al. “Achieving Marton’s Region for Broadcast Channels Using Polar Codes.” IEEE Transactions on Information Theory, vol. 61, no. 2, IEEE, 2015, pp. 783–800, doi:10.1109/tit.2014.2368555.","short":"M. Mondelli, H. Hassani, I. Sason, R. Urbanke, IEEE Transactions on Information Theory 61 (2015) 783–800.","chicago":"Mondelli, Marco, Hamed Hassani, Igal Sason, and Rudiger Urbanke. “Achieving Marton’s Region for Broadcast Channels Using Polar Codes.” IEEE Transactions on Information Theory. IEEE, 2015. https://doi.org/10.1109/tit.2014.2368555."},"publication":"IEEE Transactions on Information Theory","extern":"1","issue":"2","abstract":[{"text":"This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all classes of two-user DM-BCs whose capacity regions are known. To accomplish this task, we first construct polar codes for both the superposition as well as binning strategy. By combining these two schemes, we obtain Marton's region with private messages only. Finally, we show how to handle the case of common information. The proposed coding schemes possess the usual advantages of polar codes, i.e., they have low encoding and decoding complexity and a superpolynomial decay rate of the error probability. We follow the lead of Goela, Abbe, and Gastpar, who recently introduced polar codes emulating the superposition and binning schemes. To align the polar indices, for both schemes, their solution involves some degradedness constraints that are assumed to hold between the auxiliary random variables and channel outputs. To remove these constraints, we consider the transmission of k blocks and employ a chaining construction that guarantees the proper alignment of the polarized indices. The techniques described in this paper are quite general, and they can be adopted to many other multiterminal scenarios whenever there polar indices need to be aligned.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","volume":61,"date_created":"2019-07-31T07:03:38Z","date_updated":"2021-01-12T08:08:46Z","author":[{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Hassani, Hamed","last_name":"Hassani","first_name":"Hamed"},{"full_name":"Sason, Igal","last_name":"Sason","first_name":"Igal"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"}],"intvolume":" 61","publisher":"IEEE","title":"Achieving Marton’s region for broadcast channels using polar codes","publication_status":"published","status":"public","_id":"6737","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015"},{"date_published":"2015-09-01T00:00:00Z","doi":"10.1109/tit.2015.2453315","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Information Theory","citation":{"short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 61 (2015) 4838–4851.","mla":"Mondelli, Marco, et al. “Scaling Exponent of List Decoders with Applications to Polar Codes.” IEEE Transactions on Information Theory, vol. 61, no. 9, IEEE, 2015, pp. 4838–51, doi:10.1109/tit.2015.2453315.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Scaling Exponent of List Decoders with Applications to Polar Codes.” IEEE Transactions on Information Theory. IEEE, 2015. https://doi.org/10.1109/tit.2015.2453315.","ama":"Mondelli M, Hassani H, Urbanke R. Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. 2015;61(9):4838-4851. doi:10.1109/tit.2015.2453315","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2015). Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2015.2453315","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Scaling exponent of list decoders with applications to polar codes,” IEEE Transactions on Information Theory, vol. 61, no. 9. IEEE, pp. 4838–4851, 2015.","ista":"Mondelli M, Hassani H, Urbanke R. 2015. Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. 61(9), 4838–4851."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1304.5220"}],"oa":1,"external_id":{"arxiv":["1304.5220"]},"quality_controlled":"1","page":"4838-4851","day":"01","month":"09","author":[{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"}],"date_created":"2019-07-31T06:50:34Z","date_updated":"2021-01-12T08:08:45Z","volume":61,"oa_version":"Preprint","year":"2015","_id":"6736","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Scaling exponent of list decoders with applications to polar codes","publisher":"IEEE","intvolume":" 61","abstract":[{"text":"Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff between the block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under MAP decoding with list size L for any binary-input memoryless output-symmetric channel and for any class of linear codes such that their minimum distance is unbounded as the block length grows large. Then, it is shown that under MAP decoding, although the introduction of a list can significantly improve the involved constants, the scaling exponent itself, i.e., the speed at which capacity is approached, stays unaffected for any finite list size. In particular, this result applies to polar codes, since their minimum distance tends to infinity as the block length increases. A similar result is proved for genie-aided successive cancellation decoding when transmission takes place over the binary erasure channel, namely, the scaling exponent remains constant for any fixed number of helps from the genie. Note that since genie-aided successive cancellation decoding might be strictly worse than successive cancellation list decoding, the problem of establishing the scaling exponent of the latter remains open.","lang":"eng"}],"issue":"9","extern":"1","type":"journal_article"},{"abstract":[{"lang":"eng","text":"Torque magnetization measurements on YBa2Cu3Oy (YBCO) at doping y=6.67 (p=0.12), in dc fields (B) up to 33 T and temperatures down to 4.5 K, show that weak diamagnetism persists above the extrapolated irreversibility field Hirr(T=0)≈24 T. The differential susceptibility dM/dB, however, is more rapidly suppressed for B≳16 T than expected from the properties of the low field superconducting state, and saturates at a low value for fields B≳24 T. In addition, torque measurements on a p=0.11 YBCO crystal in pulsed field up to 65 T and temperatures down to 8 K show similar behavior, with no additional features at higher fields. We offer two candidate scenarios to explain these observations: (a) superconductivity survives but is heavily suppressed at high field by competition with charge-density-wave (CDW) order; (b) static superconductivity disappears near 24 T and is followed by a region of fluctuating superconductivity, which causes dM/dB to saturate at high field. The diamagnetic signal observed above 50 T for the p=0.11 crystal at 40 K and below may be caused by changes in the normal state susceptibility rather than bulk or fluctuating superconductivity. There will be orbital (Landau) diamagnetism from electron pockets and possibly a reduction in spin susceptibility caused by the stronger three-dimensional ordered CDW."}],"issue":"18","extern":"1","article_number":"180509","type":"journal_article","author":[{"last_name":"Yu","first_name":"Jing Fei","full_name":"Yu, Jing Fei"},{"full_name":"Ramshaw, B. J.","last_name":"Ramshaw","first_name":"B. J."},{"full_name":"Kokanović, I.","last_name":"Kokanović","first_name":"I."},{"orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic","first_name":"Kimberly A","full_name":"Modic, Kimberly A"},{"last_name":"Harrison","first_name":"N.","full_name":"Harrison, N."},{"first_name":"James","last_name":"Day","full_name":"Day, James"},{"first_name":"Ruixing","last_name":"Liang","full_name":"Liang, Ruixing"},{"full_name":"Hardy, W. N.","first_name":"W. N.","last_name":"Hardy"},{"last_name":"Bonn","first_name":"D. A.","full_name":"Bonn, D. A."},{"first_name":"A.","last_name":"McCollam","full_name":"McCollam, A."},{"last_name":"Julian","first_name":"S. R.","full_name":"Julian, S. R."},{"full_name":"Cooper, J. R.","last_name":"Cooper","first_name":"J. R."}],"date_created":"2019-11-19T13:22:06Z","date_updated":"2021-01-12T08:11:42Z","oa_version":"None","volume":92,"_id":"7070","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","status":"public","publication_status":"published","title":"Magnetization of underdoped YBa2Cu3Oy above the irreversibility field","intvolume":" 92","publisher":"APS","day":"23","month":"11","article_processing_charge":"No","publication_identifier":{"issn":["1098-0121","1550-235X"]},"doi":"10.1103/physrevb.92.180509","date_published":"2015-11-23T00:00:00Z","language":[{"iso":"eng"}],"publication":"Physical Review B","citation":{"chicago":"Yu, Jing Fei, B. J. Ramshaw, I. Kokanović, Kimberly A Modic, N. Harrison, James Day, Ruixing Liang, et al. “Magnetization of Underdoped YBa2Cu3Oy above the Irreversibility Field.” Physical Review B. APS, 2015. https://doi.org/10.1103/physrevb.92.180509.","short":"J.F. Yu, B.J. Ramshaw, I. Kokanović, K.A. Modic, N. Harrison, J. Day, R. Liang, W.N. Hardy, D.A. Bonn, A. McCollam, S.R. Julian, J.R. Cooper, Physical Review B 92 (2015).","mla":"Yu, Jing Fei, et al. “Magnetization of Underdoped YBa2Cu3Oy above the Irreversibility Field.” Physical Review B, vol. 92, no. 18, 180509, APS, 2015, doi:10.1103/physrevb.92.180509.","apa":"Yu, J. F., Ramshaw, B. J., Kokanović, I., Modic, K. A., Harrison, N., Day, J., … Cooper, J. R. (2015). Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. APS. https://doi.org/10.1103/physrevb.92.180509","ieee":"J. F. Yu et al., “Magnetization of underdoped YBa2Cu3Oy above the irreversibility field,” Physical Review B, vol. 92, no. 18. APS, 2015.","ista":"Yu JF, Ramshaw BJ, Kokanović I, Modic KA, Harrison N, Day J, Liang R, Hardy WN, Bonn DA, McCollam A, Julian SR, Cooper JR. 2015. Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. 92(18), 180509.","ama":"Yu JF, Ramshaw BJ, Kokanović I, et al. Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. 2015;92(18). doi:10.1103/physrevb.92.180509"},"quality_controlled":"1","article_type":"original"},{"page":"12955-12969","article_type":"original","citation":{"apa":"Caruntu, D., Rostamzadeh, T., Costanzo, T., Salemizadeh Parizi, S., & Caruntu, G. (2015). Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. RSC. https://doi.org/10.1039/c5nr00737b","ieee":"D. Caruntu, T. Rostamzadeh, T. Costanzo, S. Salemizadeh Parizi, and G. Caruntu, “Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals,” Nanoscale, vol. 7, no. 30. RSC, pp. 12955–12969, 2015.","ista":"Caruntu D, Rostamzadeh T, Costanzo T, Salemizadeh Parizi S, Caruntu G. 2015. Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. 7(30), 12955–12969.","ama":"Caruntu D, Rostamzadeh T, Costanzo T, Salemizadeh Parizi S, Caruntu G. Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. 2015;7(30):12955-12969. doi:10.1039/c5nr00737b","chicago":"Caruntu, Daniela, Taha Rostamzadeh, Tommaso Costanzo, Saman Salemizadeh Parizi, and Gabriel Caruntu. “Solvothermal Synthesis and Controlled Self-Assembly of Monodisperse Titanium-Based Perovskite Colloidal Nanocrystals.” Nanoscale. RSC, 2015. https://doi.org/10.1039/c5nr00737b.","short":"D. Caruntu, T. Rostamzadeh, T. Costanzo, S. Salemizadeh Parizi, G. Caruntu, Nanoscale 7 (2015) 12955–12969.","mla":"Caruntu, Daniela, et al. “Solvothermal Synthesis and Controlled Self-Assembly of Monodisperse Titanium-Based Perovskite Colloidal Nanocrystals.” Nanoscale, vol. 7, no. 30, RSC, 2015, pp. 12955–69, doi:10.1039/c5nr00737b."},"publication":"Nanoscale","date_published":"2015-08-14T00:00:00Z","article_processing_charge":"No","day":"14","intvolume":" 7","title":"Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7456","oa_version":"None","type":"journal_article","issue":"30","abstract":[{"text":"The rational design of monodisperse ferroelectric nanocrystals with controlled size and shape and their organization into hierarchical structures has been a critical step for understanding the polar ordering in nanoscale ferroelectrics, as well as the design of nanocrystal-based functional materials which harness the properties of individual nanoparticles and the collective interactions between them. We report here on the synthesis and self-assembly of aggregate-free, single-crystalline titanium-based perovskite nanoparticles with controlled morphology and surface composition by using a simple, easily scalable and highly versatile colloidal route. Single-crystalline, non-aggregated BaTiO3 colloidal nanocrystals, used as a model system, have been prepared under solvothermal conditions at temperatures as low as 180 °C. The shape of the nanocrystals was tuned from spheroidal to cubic upon changing the polarity of the solvent, whereas their size was varied from 16 to 30 nm for spheres and 5 to 78 nm for cubes by changing the concentration of the precursors and the reaction time, respectively. The hydrophobic, oleic acid-passivated nanoparticles exhibit very good solubility in non-polar solvents and can be rendered dispersible in polar solvents by a simple process involving the oxidative cleavage of the double bond upon treating the nanopowders with the Lemieux–von Rudloff reagent. Lattice dynamic analysis indicated that regardless of their size, BaTiO3 nanocrystals present local disorder within the perovskite unit cell, associated with the existence of polar ordering. We also demonstrate for the first time that, in addition to being used for fabricating large area, crack-free, highly uniform films, BaTiO3 nanocubes can serve as building blocks for the design of 2D and 3D mesoscale structures, such as superlattices and superparticles. Interestingly, the type of superlattice structure (simple cubic or face centered cubic) appears to be determined by the type of solvent in which the nanocrystals were dispersed. This approach provides an excellent platform for the synthesis of other titanium-based perovskite colloidal nanocrystals with controlled chemical composition, surface structure and morphology and for their assembly into complex architectures, therefore opening the door for the design of novel mesoscale functional materials/nanocomposites with potential applications in energy conversion, data storage and the biomedical field.","lang":"eng"}],"quality_controlled":"1","external_id":{"pmid":["26168304"]},"language":[{"iso":"eng"}],"doi":"10.1039/c5nr00737b","publication_identifier":{"issn":["2040-3364","2040-3372"]},"month":"08","publisher":"RSC","publication_status":"published","pmid":1,"year":"2015","volume":7,"date_updated":"2023-02-23T13:08:24Z","date_created":"2020-02-05T14:16:37Z","author":[{"full_name":"Caruntu, Daniela","last_name":"Caruntu","first_name":"Daniela"},{"full_name":"Rostamzadeh, Taha","last_name":"Rostamzadeh","first_name":"Taha"},{"orcid":"0000-0001-9732-3815","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","first_name":"Tommaso","full_name":"Costanzo, Tommaso"},{"first_name":"Saman","last_name":"Salemizadeh Parizi","full_name":"Salemizadeh Parizi, Saman"},{"full_name":"Caruntu, Gabriel","first_name":"Gabriel","last_name":"Caruntu"}],"extern":"1"},{"abstract":[{"lang":"eng","text":"A new organic–inorganic ferroelectric hybrid capacitor designed by uniformly incorporating surface modified monodisperse 15 nm ferroelectric BaTiO3 nanocubes into non-polar polymer blends of poly(methyl methacrylate) (PMMA) polymer and acrylonitrile-butadiene-styrene (ABS) terpolymer is described. The investigation of spatial distribution of nanofillers via a non-distractive thermal pulse method illustrates that the surface functionalization of nanocubes plays a key role in the uniform distribution of charge polarization within the polymer matrix. The discharged energy density of the nanocomposite with 30 vol% BaTiO3 nanocubes is ∼44 × 10−3 J cm−3, which is almost six times higher than that of the neat polymer. The facile processing, along with the superior mechanical and electrical properties of the BaTiO3/PMMA–ABS nanocomposites make them suitable for implementation into capacitive electrical energy storage devices."}],"issue":"93","extern":"1","type":"journal_article","author":[{"first_name":"Saman Salemizadeh","last_name":"Parizi","full_name":"Parizi, Saman Salemizadeh"},{"first_name":"Gavin","last_name":"Conley","full_name":"Conley, Gavin"},{"full_name":"Costanzo, Tommaso","orcid":"0000-0001-9732-3815","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","first_name":"Tommaso"},{"full_name":"Howell, Bob","last_name":"Howell","first_name":"Bob"},{"full_name":"Mellinger, Axel","first_name":"Axel","last_name":"Mellinger"},{"full_name":"Caruntu, Gabriel","last_name":"Caruntu","first_name":"Gabriel"}],"date_created":"2020-02-05T14:17:26Z","date_updated":"2023-02-23T13:08:26Z","volume":5,"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7457","year":"2015","title":"Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors","status":"public","publication_status":"published","intvolume":" 5","publisher":"RSC","day":"01","month":"09","article_processing_charge":"No","publication_identifier":{"issn":["2046-2069"]},"date_published":"2015-09-01T00:00:00Z","doi":"10.1039/c5ra11347d","language":[{"iso":"eng"}],"publication":"RSC Advances","citation":{"ama":"Parizi SS, Conley G, Costanzo T, Howell B, Mellinger A, Caruntu G. Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. 2015;5(93):76356-76362. doi:10.1039/c5ra11347d","apa":"Parizi, S. S., Conley, G., Costanzo, T., Howell, B., Mellinger, A., & Caruntu, G. (2015). Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. RSC. https://doi.org/10.1039/c5ra11347d","ieee":"S. S. Parizi, G. Conley, T. Costanzo, B. Howell, A. Mellinger, and G. Caruntu, “Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors,” RSC Advances, vol. 5, no. 93. RSC, pp. 76356–76362, 2015.","ista":"Parizi SS, Conley G, Costanzo T, Howell B, Mellinger A, Caruntu G. 2015. Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. 5(93), 76356–76362.","short":"S.S. Parizi, G. Conley, T. Costanzo, B. Howell, A. Mellinger, G. Caruntu, RSC Advances 5 (2015) 76356–76362.","mla":"Parizi, Saman Salemizadeh, et al. “Fabrication of Barium Titanate/Acrylonitrile-Butadiene Styrene/Poly(Methyl Methacrylate) Nanocomposite Films for Hybrid Ferroelectric Capacitors.” RSC Advances, vol. 5, no. 93, RSC, 2015, pp. 76356–62, doi:10.1039/c5ra11347d.","chicago":"Parizi, Saman Salemizadeh, Gavin Conley, Tommaso Costanzo, Bob Howell, Axel Mellinger, and Gabriel Caruntu. “Fabrication of Barium Titanate/Acrylonitrile-Butadiene Styrene/Poly(Methyl Methacrylate) Nanocomposite Films for Hybrid Ferroelectric Capacitors.” RSC Advances. RSC, 2015. https://doi.org/10.1039/c5ra11347d."},"quality_controlled":"1","article_type":"original","page":"76356-76362"},{"extern":"1","issue":"11","abstract":[{"text":"Across-nation differences in the mean values for complex traits are common1,2,3,4,5,6,7,8, but the reasons for these differences are unknown. Here we find that many independent loci contribute to population genetic differences in height and body mass index (BMI) in 9,416 individuals across 14 European countries. Using discovery data on over 250,000 individuals and unbiased effect size estimates from 17,500 sibling pairs, we estimate that 24% (95% credible interval (CI) = 9%, 41%) and 8% (95% CI = 4%, 16%) of the captured additive genetic variance for height and BMI, respectively, reflect population genetic differences. Population genetic divergence differed significantly from that in a null model (height, P < 3.94 × 10−8; BMI, P < 5.95 × 10−4), and we find an among-population genetic correlation for tall and slender individuals (r = −0.80, 95% CI = −0.95, −0.60), consistent with correlated selection for both phenotypes. Observed differences in height among populations reflected the predicted genetic means (r = 0.51; P < 0.001), but environmental differences across Europe masked genetic differentiation for BMI (P < 0.58).","lang":"eng"}],"type":"journal_article","oa_version":"None","volume":47,"date_updated":"2021-01-12T08:15:13Z","date_created":"2020-04-30T10:58:23Z","author":[{"first_name":"Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard"},{"first_name":"Gibran","last_name":"Hemani","full_name":"Hemani, Gibran"},{"first_name":"Carolina","last_name":"Medina-Gomez","full_name":"Medina-Gomez, Carolina"},{"last_name":"Mezzavilla","first_name":"Massimo","full_name":"Mezzavilla, Massimo"},{"first_name":"Tonu","last_name":"Esko","full_name":"Esko, Tonu"},{"full_name":"Shakhbazov, Konstantin","first_name":"Konstantin","last_name":"Shakhbazov"},{"last_name":"Powell","first_name":"Joseph E","full_name":"Powell, Joseph E"},{"first_name":"Anna","last_name":"Vinkhuyzen","full_name":"Vinkhuyzen, Anna"},{"first_name":"Sonja I","last_name":"Berndt","full_name":"Berndt, Sonja I"},{"full_name":"Gustafsson, Stefan","first_name":"Stefan","last_name":"Gustafsson"},{"last_name":"Justice","first_name":"Anne E","full_name":"Justice, Anne E"},{"full_name":"Kahali, Bratati","last_name":"Kahali","first_name":"Bratati"},{"first_name":"Adam E","last_name":"Locke","full_name":"Locke, Adam E"},{"last_name":"Pers","first_name":"Tune H","full_name":"Pers, Tune H"},{"full_name":"Vedantam, Sailaja","first_name":"Sailaja","last_name":"Vedantam"},{"first_name":"Andrew R","last_name":"Wood","full_name":"Wood, Andrew R"},{"first_name":"Wouter","last_name":"van Rheenen","full_name":"van Rheenen, Wouter"},{"full_name":"Andreassen, Ole A","last_name":"Andreassen","first_name":"Ole A"},{"first_name":"Paolo","last_name":"Gasparini","full_name":"Gasparini, Paolo"},{"full_name":"Metspalu, Andres","last_name":"Metspalu","first_name":"Andres"},{"last_name":"Berg","first_name":"Leonard H van den","full_name":"Berg, Leonard H van den"},{"full_name":"Veldink, Jan H","last_name":"Veldink","first_name":"Jan H"},{"first_name":"Fernando","last_name":"Rivadeneira","full_name":"Rivadeneira, Fernando"},{"first_name":"Thomas M","last_name":"Werge","full_name":"Werge, Thomas M"},{"full_name":"Abecasis, Goncalo R","first_name":"Goncalo R","last_name":"Abecasis"},{"full_name":"Boomsma, Dorret I","first_name":"Dorret I","last_name":"Boomsma"},{"first_name":"Daniel I","last_name":"Chasman","full_name":"Chasman, Daniel I"},{"first_name":"Eco J C","last_name":"de Geus","full_name":"de Geus, Eco J C"},{"full_name":"Frayling, Timothy M","first_name":"Timothy M","last_name":"Frayling"},{"first_name":"Joel N","last_name":"Hirschhorn","full_name":"Hirschhorn, Joel N"},{"last_name":"Hottenga","first_name":"Jouke Jan","full_name":"Hottenga, Jouke Jan"},{"full_name":"Ingelsson, Erik","first_name":"Erik","last_name":"Ingelsson"},{"last_name":"Loos","first_name":"Ruth J F","full_name":"Loos, Ruth J F"},{"full_name":"Magnusson, Patrik K E","first_name":"Patrik K E","last_name":"Magnusson"},{"last_name":"Martin","first_name":"Nicholas G","full_name":"Martin, Nicholas G"},{"last_name":"Montgomery","first_name":"Grant W","full_name":"Montgomery, Grant W"},{"full_name":"North, Kari E","first_name":"Kari E","last_name":"North"},{"last_name":"Pedersen","first_name":"Nancy L","full_name":"Pedersen, Nancy L"},{"first_name":"Timothy D","last_name":"Spector","full_name":"Spector, Timothy D"},{"full_name":"Speliotes, Elizabeth K","last_name":"Speliotes","first_name":"Elizabeth K"},{"first_name":"Michael E","last_name":"Goddard","full_name":"Goddard, Michael E"},{"last_name":"Yang","first_name":"Jian","full_name":"Yang, Jian"},{"full_name":"Visscher, Peter M","last_name":"Visscher","first_name":"Peter M"}],"publisher":"Springer Nature","intvolume":" 47","status":"public","publication_status":"published","title":"Population genetic differentiation of height and body mass index across Europe","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7742","year":"2015","publication_identifier":{"issn":["1061-4036","1546-1718"]},"article_processing_charge":"No","month":"09","day":"14","language":[{"iso":"eng"}],"doi":"10.1038/ng.3401","date_published":"2015-09-14T00:00:00Z","page":"1357-1362","article_type":"original","quality_controlled":"1","citation":{"chicago":"Robinson, Matthew Richard, Gibran Hemani, Carolina Medina-Gomez, Massimo Mezzavilla, Tonu Esko, Konstantin Shakhbazov, Joseph E Powell, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics. Springer Nature, 2015. https://doi.org/10.1038/ng.3401.","short":"M.R. Robinson, G. Hemani, C. Medina-Gomez, M. Mezzavilla, T. Esko, K. Shakhbazov, J.E. Powell, A. Vinkhuyzen, S.I. Berndt, S. Gustafsson, A.E. Justice, B. Kahali, A.E. Locke, T.H. Pers, S. Vedantam, A.R. Wood, W. van Rheenen, O.A. Andreassen, P. Gasparini, A. Metspalu, L.H. van den Berg, J.H. Veldink, F. Rivadeneira, T.M. Werge, G.R. Abecasis, D.I. Boomsma, D.I. Chasman, E.J.C. de Geus, T.M. Frayling, J.N. Hirschhorn, J.J. Hottenga, E. Ingelsson, R.J.F. Loos, P.K.E. Magnusson, N.G. Martin, G.W. Montgomery, K.E. North, N.L. Pedersen, T.D. Spector, E.K. Speliotes, M.E. Goddard, J. Yang, P.M. Visscher, Nature Genetics 47 (2015) 1357–1362.","mla":"Robinson, Matthew Richard, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics, vol. 47, no. 11, Springer Nature, 2015, pp. 1357–62, doi:10.1038/ng.3401.","apa":"Robinson, M. R., Hemani, G., Medina-Gomez, C., Mezzavilla, M., Esko, T., Shakhbazov, K., … Visscher, P. M. (2015). Population genetic differentiation of height and body mass index across Europe. Nature Genetics. Springer Nature. https://doi.org/10.1038/ng.3401","ieee":"M. R. Robinson et al., “Population genetic differentiation of height and body mass index across Europe,” Nature Genetics, vol. 47, no. 11. Springer Nature, pp. 1357–1362, 2015.","ista":"Robinson MR, Hemani G, Medina-Gomez C, Mezzavilla M, Esko T, Shakhbazov K, Powell JE, Vinkhuyzen A, Berndt SI, Gustafsson S, Justice AE, Kahali B, Locke AE, Pers TH, Vedantam S, Wood AR, van Rheenen W, Andreassen OA, Gasparini P, Metspalu A, Berg LH van den, Veldink JH, Rivadeneira F, Werge TM, Abecasis GR, Boomsma DI, Chasman DI, de Geus EJC, Frayling TM, Hirschhorn JN, Hottenga JJ, Ingelsson E, Loos RJF, Magnusson PKE, Martin NG, Montgomery GW, North KE, Pedersen NL, Spector TD, Speliotes EK, Goddard ME, Yang J, Visscher PM. 2015. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 47(11), 1357–1362.","ama":"Robinson MR, Hemani G, Medina-Gomez C, et al. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 2015;47(11):1357-1362. doi:10.1038/ng.3401"},"publication":"Nature Genetics"},{"_id":"7741","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 282","title":"Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird","status":"public","oa_version":"Published Version","type":"journal_article","issue":"1810","abstract":[{"lang":"eng","text":"Phenotypes expressed in a social context are not only a function of the individual, but can also be shaped by the phenotypes of social partners. These social effects may play a major role in the evolution of cooperative breeding if social partners differ in the quality of care they provide and if individual carers adjust their effort in relation to that of other carers. When applying social effects models to wild study systems, it is also important to explore sources of individual plasticity that could masquerade as social effects. We studied offspring provisioning rates of parents and helpers in a wild population of long-tailed tits Aegithalos caudatus using a quantitative genetic framework to identify these social effects and partition them into genetic, permanent environment and current environment components. Controlling for other effects, individuals were consistent in their provisioning effort at a given nest, but adjusted their effort based on who was in their social group, indicating the presence of social effects. However, these social effects differed between years and social contexts, indicating a current environment effect, rather than indicating a genetic or permanent environment effect. While this study reveals the importance of examining environmental and genetic sources of social effects, the framework we present is entirely general, enabling a greater understanding of potentially important social effects within any ecological population."}],"citation":{"chicago":"Adams, Mark James, Matthew Richard Robinson, Maria-Elena Mannarelli, and Ben J. Hatchwell. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences. The Royal Society, 2015. https://doi.org/10.1098/rspb.2015.0689.","short":"M.J. Adams, M.R. Robinson, M.-E. Mannarelli, B.J. Hatchwell, Proceedings of the Royal Society B: Biological Sciences 282 (2015).","mla":"Adams, Mark James, et al. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810, 20150689, The Royal Society, 2015, doi:10.1098/rspb.2015.0689.","ieee":"M. J. Adams, M. R. Robinson, M.-E. Mannarelli, and B. J. Hatchwell, “Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird,” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810. The Royal Society, 2015.","apa":"Adams, M. J., Robinson, M. R., Mannarelli, M.-E., & Hatchwell, B. J. (2015). Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. The Royal Society. https://doi.org/10.1098/rspb.2015.0689","ista":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. 2015. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 282(1810), 20150689.","ama":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 2015;282(1810). doi:10.1098/rspb.2015.0689"},"publication":"Proceedings of the Royal Society B: Biological Sciences","article_type":"original","date_published":"2015-07-07T00:00:00Z","article_processing_charge":"No","day":"07","pmid":1,"year":"2015","publisher":"The Royal Society","publication_status":"published","author":[{"full_name":"Adams, Mark James","last_name":"Adams","first_name":"Mark James"},{"orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"},{"first_name":"Maria-Elena","last_name":"Mannarelli","full_name":"Mannarelli, Maria-Elena"},{"first_name":"Ben J.","last_name":"Hatchwell","full_name":"Hatchwell, Ben J."}],"volume":282,"date_created":"2020-04-30T10:58:07Z","date_updated":"2021-01-12T08:15:12Z","article_number":"20150689","extern":"1","external_id":{"pmid":["26063846"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1098/rspb.2015.0689"}],"quality_controlled":"1","doi":"10.1098/rspb.2015.0689","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0962-8452","1471-2954"]},"month":"07"},{"article_processing_charge":"No","publication_identifier":{"issn":["0962-1083"]},"day":"10","month":"12","language":[{"iso":"eng"}],"date_published":"2015-12-10T00:00:00Z","doi":"10.1111/mec.13452","page":"6148-6162","quality_controlled":"1","article_type":"original","oa":1,"citation":{"short":"A.W. Santure, J. Poissant, I. De Cauwer, K. van Oers, M.R. Robinson, J.L. Quinn, M.A.M. Groenen, M.E. Visser, B.C. Sheldon, J. Slate, Molecular Ecology 24 (2015) 6148–6162.","mla":"Santure, Anna W., et al. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology, vol. 24, Wiley, 2015, pp. 6148–62, doi:10.1111/mec.13452.","chicago":"Santure, Anna W., Jocelyn Poissant, Isabelle De Cauwer, Kees van Oers, Matthew Richard Robinson, John L. Quinn, Martien A. M. Groenen, Marcel E. Visser, Ben C. Sheldon, and Jon Slate. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology. Wiley, 2015. https://doi.org/10.1111/mec.13452.","ama":"Santure AW, Poissant J, De Cauwer I, et al. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 2015;24:6148-6162. doi:10.1111/mec.13452","apa":"Santure, A. W., Poissant, J., De Cauwer, I., van Oers, K., Robinson, M. R., Quinn, J. L., … Slate, J. (2015). Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.13452","ieee":"A. W. Santure et al., “Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations,” Molecular Ecology, vol. 24. Wiley, pp. 6148–6162, 2015.","ista":"Santure AW, Poissant J, De Cauwer I, van Oers K, Robinson MR, Quinn JL, Groenen MAM, Visser ME, Sheldon BC, Slate J. 2015. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 24, 6148–6162."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/mec.13452"}],"publication":"Molecular Ecology","extern":"1","abstract":[{"text":"Currently, there is much debate on the genetic architecture of quantitative traits in wild populations. Is trait variation influenced by many genes of small effect or by a few genes of major effect? Where is additive genetic variation located in the genome? Do the same loci cause similar phenotypic variation in different populations? Great tits (Parus major) have been studied extensively in long‐term studies across Europe and consequently are considered an ecological ‘model organism’. Recently, genomic resources have been developed for the great tit, including a custom SNP chip and genetic linkage map. In this study, we used a suite of approaches to investigate the genetic architecture of eight quantitative traits in two long‐term study populations of great tits—one in the Netherlands and the other in the United Kingdom. Overall, we found little evidence for the presence of genes of large effects in either population. Instead, traits appeared to be influenced by many genes of small effect, with conservative estimates of the number of contributing loci ranging from 31 to 310. Despite concordance between population‐specific heritabilities, we found no evidence for the presence of loci having similar effects in both populations. While population‐specific genetic architectures are possible, an undetected shared architecture cannot be rejected because of limited power to map loci of small and moderate effects. This study is one of few examples of genetic architecture analysis in replicated wild populations and highlights some of the challenges and limitations researchers will face when attempting similar molecular quantitative genetic studies in free‐living populations.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","volume":24,"date_updated":"2021-01-12T08:15:12Z","date_created":"2020-04-30T10:51:01Z","author":[{"full_name":"Santure, Anna W.","first_name":"Anna W.","last_name":"Santure"},{"last_name":"Poissant","first_name":"Jocelyn","full_name":"Poissant, Jocelyn"},{"first_name":"Isabelle","last_name":"De Cauwer","full_name":"De Cauwer, Isabelle"},{"full_name":"van Oers, Kees","first_name":"Kees","last_name":"van Oers"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson","full_name":"Robinson, Matthew Richard"},{"first_name":"John L.","last_name":"Quinn","full_name":"Quinn, John L."},{"first_name":"Martien A. M.","last_name":"Groenen","full_name":"Groenen, Martien A. M."},{"last_name":"Visser","first_name":"Marcel E.","full_name":"Visser, Marcel E."},{"first_name":"Ben C.","last_name":"Sheldon","full_name":"Sheldon, Ben C."},{"first_name":"Jon","last_name":"Slate","full_name":"Slate, Jon"}],"intvolume":" 24","publisher":"Wiley","title":"Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations","publication_status":"published","status":"public","year":"2015","_id":"7739","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"conference":{"name":"PPoPP: Principles and Practice of Parallel Pogramming"},"date_published":"2015-01-24T00:00:00Z","doi":"10.1145/2688500.2688523","language":[{"iso":"eng"}],"citation":{"ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2015, vol. 2015–January, pp. 11–20.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., & Shavit, N. (2015). The SprayList: A scalable relaxed priority queue (Vol. 2015–January, pp. 11–20). Presented at the PPoPP: Principles and Practice of Parallel Pogramming, ACM. https://doi.org/10.1145/2688500.2688523","ista":"Alistarh D-A, Kopinsky J, Li J, Shavit N. 2015. The SprayList: A scalable relaxed priority queue. PPoPP: Principles and Practice of Parallel Pogramming vol. 2015–January, 11–20.","ama":"Alistarh D-A, Kopinsky J, Li J, Shavit N. The SprayList: A scalable relaxed priority queue. In: Vol 2015-January. ACM; 2015:11-20. doi:10.1145/2688500.2688523","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015. https://doi.org/10.1145/2688500.2688523.","short":"D.-A. Alistarh, J. Kopinsky, J. Li, N. Shavit, in:, ACM, 2015, pp. 11–20.","mla":"Alistarh, Dan-Adrian, et al. The SprayList: A Scalable Relaxed Priority Queue. Vol. 2015–January, ACM, 2015, pp. 11–20, doi:10.1145/2688500.2688523."},"page":"11 - 20","month":"01","day":"24","article_processing_charge":"No","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Kopinsky, Justin","last_name":"Kopinsky","first_name":"Justin"},{"full_name":"Li, Jerry","last_name":"Li","first_name":"Jerry"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"}],"date_updated":"2023-02-23T13:16:43Z","date_created":"2018-12-11T11:48:26Z","oa_version":"None","volume":"2015-January","_id":"776","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle\r\nand Intel corporations.","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"The SprayList: A scalable relaxed priority queue","status":"public","publisher":"ACM","abstract":[{"lang":"eng","text":"High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by "spraying" themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(plog3p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log3p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. Furthermore, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution."}],"publist_id":"6878","extern":"1","type":"conference"},{"publication_identifier":{"issn":["0031-9007","1079-7114"]},"article_processing_charge":"No","month":"06","day":"04","citation":{"ama":"Goodrich CP, Liu AJ, Nagel SR. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 2015;114(22). doi:10.1103/physrevlett.114.225501","ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior,” Physical Review Letters, vol. 114, no. 22. American Physical Society, 2015.","apa":"Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.114.225501","ista":"Goodrich CP, Liu AJ, Nagel SR. 2015. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 114(22), 225501.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 114 (2015).","mla":"Goodrich, Carl Peter, et al. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters, vol. 114, no. 22, 225501, American Physical Society, 2015, doi:10.1103/physrevlett.114.225501.","chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/physrevlett.114.225501."},"publication":"Physical Review Letters","article_type":"original","quality_controlled":"1","date_published":"2015-06-04T00:00:00Z","doi":"10.1103/physrevlett.114.225501","language":[{"iso":"eng"}],"type":"journal_article","article_number":"225501","issue":"22","abstract":[{"text":"We introduce a principle unique to disordered solids wherein the contribution of any bond to one global perturbation is uncorrelated with its contribution to another. Coupled with sufficient variability in the contributions of different bonds, this “independent bond-level response” paves the way for the design of real materials with unusual and exquisitely tuned properties. To illustrate this, we choose two global perturbations: compression and shear. By applying a bond removal procedure that is both simple and experimentally relevant to remove a very small fraction of bonds, we can drive disordered spring networks to both the incompressible and completely auxetic limits of mechanical behavior.","lang":"eng"}],"extern":"1","year":"2015","_id":"7765","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 114","publisher":"American Physical Society","title":"The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior","publication_status":"published","status":"public","author":[{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","last_name":"Goodrich","full_name":"Goodrich, Carl Peter"},{"full_name":"Liu, Andrea J.","first_name":"Andrea J.","last_name":"Liu"},{"first_name":"Sidney R.","last_name":"Nagel","full_name":"Nagel, Sidney R."}],"oa_version":"None","volume":114,"date_updated":"2021-01-12T08:15:23Z","date_created":"2020-04-30T11:41:08Z"},{"date_created":"2020-04-30T11:41:38Z","date_updated":"2021-01-12T08:15:24Z","volume":91,"oa_version":"None","author":[{"first_name":"Ruben","last_name":"van Drongelen","full_name":"van Drongelen, Ruben"},{"last_name":"Pal","first_name":"Anshuman","full_name":"Pal, Anshuman"},{"full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","last_name":"Goodrich"},{"full_name":"Idema, Timon","first_name":"Timon","last_name":"Idema"}],"publication_status":"published","title":"Collective dynamics of soft active particles","status":"public","publisher":"American Physical Society","intvolume":" 91","_id":"7767","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","extern":"1","abstract":[{"lang":"eng","text":"We present a model of soft active particles that leads to a rich array of collective behavior found also in dense biological swarms of bacteria and other unicellular organisms. Our model uses only local interactions, such as Vicsek-type nearest-neighbor alignment, short-range repulsion, and a local boundary term. Changing the relative strength of these interactions leads to migrating swarms, rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble motion, alternating between migration and either rotating or jammed states. Interestingly, although a migrating swarm moves slower than an individual particle, the diffusion constant can be up to three orders of magnitude larger, suggesting that collective motion can be highly advantageous, for example, when searching for food."}],"issue":"3","article_number":"032706","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1103/physreve.91.032706","date_published":"2015-03-01T00:00:00Z","article_type":"original","quality_controlled":"1","publication":"Physical Review E","citation":{"mla":"van Drongelen, Ruben, et al. “Collective Dynamics of Soft Active Particles.” Physical Review E, vol. 91, no. 3, 032706, American Physical Society, 2015, doi:10.1103/physreve.91.032706.","short":"R. van Drongelen, A. Pal, C.P. Goodrich, T. Idema, Physical Review E 91 (2015).","chicago":"Drongelen, Ruben van, Anshuman Pal, Carl Peter Goodrich, and Timon Idema. “Collective Dynamics of Soft Active Particles.” Physical Review E. American Physical Society, 2015. https://doi.org/10.1103/physreve.91.032706.","ama":"van Drongelen R, Pal A, Goodrich CP, Idema T. Collective dynamics of soft active particles. Physical Review E. 2015;91(3). doi:10.1103/physreve.91.032706","ista":"van Drongelen R, Pal A, Goodrich CP, Idema T. 2015. Collective dynamics of soft active particles. Physical Review E. 91(3), 032706.","apa":"van Drongelen, R., Pal, A., Goodrich, C. P., & Idema, T. (2015). Collective dynamics of soft active particles. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.91.032706","ieee":"R. van Drongelen, A. Pal, C. P. Goodrich, and T. Idema, “Collective dynamics of soft active particles,” Physical Review E, vol. 91, no. 3. American Physical Society, 2015."},"day":"01","month":"03","article_processing_charge":"No","publication_identifier":{"issn":["1539-3755","1550-2376"]}},{"publication_identifier":{"issn":["1744-683X","1744-6848"]},"article_processing_charge":"No","month":"02","day":"15","language":[{"iso":"eng"}],"doi":"10.1039/c4sm02905d","date_published":"2015-02-15T00:00:00Z","page":"2745-2751","article_type":"original","quality_controlled":"1","citation":{"ista":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. 2015. Disordered surface vibrations in jammed sphere packings. Soft Matter. 11(14), 2745–2751.","ieee":"D. M. Sussman, C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Disordered surface vibrations in jammed sphere packings,” Soft Matter, vol. 11, no. 14. Royal Society of Chemistry, pp. 2745–2751, 2015.","apa":"Sussman, D. M., Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). Disordered surface vibrations in jammed sphere packings. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/c4sm02905d","ama":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. Disordered surface vibrations in jammed sphere packings. Soft Matter. 2015;11(14):2745-2751. doi:10.1039/c4sm02905d","chicago":"Sussman, Daniel M., Carl Peter Goodrich, Andrea J. Liu, and Sidney R. Nagel. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter. Royal Society of Chemistry, 2015. https://doi.org/10.1039/c4sm02905d.","mla":"Sussman, Daniel M., et al. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter, vol. 11, no. 14, Royal Society of Chemistry, 2015, pp. 2745–51, doi:10.1039/c4sm02905d.","short":"D.M. Sussman, C.P. Goodrich, A.J. Liu, S.R. Nagel, Soft Matter 11 (2015) 2745–2751."},"publication":"Soft Matter","extern":"1","issue":"14","abstract":[{"text":"We study the vibrational properties near a free surface of disordered spring networks derived from jammed sphere packings. In bulk systems, without surfaces, it is well understood that such systems have a plateau in the density of vibrational modes extending down to a frequency scale ω*. This frequency is controlled by ΔZ = 〈Z〉 − 2d, the difference between the average coordination of the spheres and twice the spatial dimension, d, of the system, which vanishes at the jamming transition. In the presence of a free surface we find that there is a density of disordered vibrational modes associated with the surface that extends far below ω*. The total number of these low-frequency surface modes is controlled by ΔZ, and the profile of their decay into the bulk has two characteristic length scales, which diverge as ΔZ−1/2 and ΔZ−1 as the jamming transition is approached.","lang":"eng"}],"type":"journal_article","oa_version":"None","volume":11,"date_updated":"2021-01-12T08:15:23Z","date_created":"2020-04-30T11:41:23Z","author":[{"full_name":"Sussman, Daniel M.","first_name":"Daniel M.","last_name":"Sussman"},{"full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","last_name":"Goodrich"},{"full_name":"Liu, Andrea J.","first_name":"Andrea J.","last_name":"Liu"},{"last_name":"Nagel","first_name":"Sidney R.","full_name":"Nagel, Sidney R."}],"intvolume":" 11","publisher":"Royal Society of Chemistry","status":"public","title":"Disordered surface vibrations in jammed sphere packings","publication_status":"published","_id":"7766","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015"},{"page":"1900 - 1908","main_file_link":[{"url":"http://papers.nips.cc/paper/5897-streaming-min-max-hypergraph-partitioning"}],"citation":{"short":"D.-A. Alistarh, J. Iglesias, M. Vojnović, in:, Neural Information Processing Systems, 2015, pp. 1900–1908.","mla":"Alistarh, Dan-Adrian, et al. Streaming Min-Max Hypergraph Partitioning. Vol. 2015–January, Neural Information Processing Systems, 2015, pp. 1900–08.","chicago":"Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.","ama":"Alistarh D-A, Iglesias J, Vojnović M. Streaming min-max hypergraph partitioning. In: Vol 2015-January. Neural Information Processing Systems; 2015:1900-1908.","apa":"Alistarh, D.-A., Iglesias, J., & Vojnović, M. (2015). Streaming min-max hypergraph partitioning (Vol. 2015–January, pp. 1900–1908). Presented at the NIPS: Neural Information Processing Systems, Neural Information Processing Systems.","ieee":"D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph partitioning,” presented at the NIPS: Neural Information Processing Systems, 2015, vol. 2015–January, pp. 1900–1908.","ista":"Alistarh D-A, Iglesias J, Vojnović M. 2015. Streaming min-max hypergraph partitioning. NIPS: Neural Information Processing Systems vol. 2015–January, 1900–1908."},"language":[{"iso":"eng"}],"conference":{"name":"NIPS: Neural Information Processing Systems"},"date_published":"2015-01-01T00:00:00Z","day":"01","month":"01","article_processing_charge":"No","title":"Streaming min-max hypergraph partitioning","status":"public","publication_status":"published","publisher":"Neural Information Processing Systems","_id":"777","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:27Z","date_updated":"2023-02-23T13:17:09Z","volume":"2015-January","oa_version":"None","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iglesias","first_name":"Jennifer","full_name":"Iglesias, Jennifer"},{"last_name":"Vojnović","first_name":"Milan","full_name":"Vojnović, Milan"}],"type":"conference","extern":"1","abstract":[{"lang":"eng","text":"In many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges. Equivalently, we are given an input bipartite graph with two types of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items into a given number of components such that the maximum number of topics covered by a component is minimized. This is a clustering problem with various applications, e.g. partitioning of a set of information objects such as documents, images, and videos, and load balancing in the context of modern computation platforms.Inthis paper, we focus on the streaming computation model for this problem, in which items arrive online one at a time and each item must be assigned irrevocably to a component at its arrival time. Motivated by scalability requirements, we focus on the class of streaming computation algorithms with memory limited to be at most linear in the number of components. We show that a greedy assignment strategy is able to recover a hidden co-clustering of items under a natural set of recovery conditions. We also report results of an extensive empirical evaluation, which demonstrate that this greedy strategy yields superior performance when compared with alternative approaches."}],"publist_id":"6879"},{"article_processing_charge":"No","day":"01","date_published":"2015-01-01T00:00:00Z","citation":{"ama":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13","ista":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. 2015. Inherent limitations of hybrid transactional memory. DISC: Distributed Computing, LNCS, vol. 9363, 185–199.","apa":"Alistarh, D.-A., Kopinsky, J., Kuznetsov, P., Ravi, S., & Shavit, N. (2015). Inherent limitations of hybrid transactional memory (Vol. 9363, pp. 185–199). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-662-48653-5_13","ieee":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent limitations of hybrid transactional memory,” presented at the DISC: Distributed Computing, 2015, vol. 9363, pp. 185–199.","mla":"Alistarh, Dan-Adrian, et al. Inherent Limitations of Hybrid Transactional Memory. Vol. 9363, Springer, 2015, pp. 185–99, doi:10.1007/978-3-662-48653-5_13.","short":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 185–199.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99. Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13."},"page":"185 - 199","abstract":[{"lang":"eng","text":"Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed to complement the fast, but best-effort nature of Hardware Transactional Memory (HTM) with a slow, reliable software backup. However, the costs of providing concurrency between hardware and software transactions in HyTM are still not well understood. In this paper, we propose a general model for HyTM implementations, which captures the ability of hardware transactions to buffer memory accesses. The model allows us to formally quantify and analyze the amount of overhead (instrumentation) caused by the potential presence of software transactions.We prove that (1) it is impossible to build a strictly serializable HyTM implementation that has both uninstrumented reads and writes, even for very weak progress guarantees, and (2) the instrumentation cost incurred by a hardware transaction in any progressive opaque HyTM is linear in the size of the transaction’s data set.We further describe two implementations which exhibit optimal instrumentation costs for two different progress conditions. In sum, this paper proposes the first formal HyTM model and captures for the first time the trade-off between the degree of hardware-software TM concurrency and the amount of instrumentation overhead."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"None","_id":"778","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9363","status":"public","title":"Inherent limitations of hybrid transactional memory","month":"01","doi":"10.1007/978-3-662-48653-5_13","conference":{"name":"DISC: Distributed Computing"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1405.5689","open_access":"1"}],"external_id":{"arxiv":["1405.5689"]},"quality_controlled":"1","publist_id":"6880","extern":"1","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"first_name":"Petr","last_name":"Kuznetsov","full_name":"Kuznetsov, Petr"},{"full_name":"Ravi, Srivatsan","first_name":"Srivatsan","last_name":"Ravi"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"volume":9363,"date_created":"2018-12-11T11:48:27Z","date_updated":"2023-02-23T13:17:35Z","acknowledgement":"P. Kuznetsov-The author is supported by the Agence Nationale de la Recherche, ANR-14-CE35-0010-01, project DISCMAT. N. Shavit-Support is gratfeully acknowledgedfrom the National Science Foundation under grants CCF-1217921, CCF-1201926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.","year":"2015","publisher":"Springer","publication_status":"published"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7779","year":"2015","status":"public","title":"Unearthing the anticrystal: Criticality in the linear response of disordered solids","publication_status":"published","author":[{"full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","last_name":"Goodrich"}],"oa_version":"Preprint","date_updated":"2021-01-12T08:15:28Z","date_created":"2020-04-30T12:16:18Z","type":"preprint","abstract":[{"text":"The fact that a disordered material is not constrained in its properties in\r\nthe same way as a crystal presents significant and yet largely untapped\r\npotential for novel material design. However, unlike their crystalline\r\ncounterparts, disordered solids are not well understood. One of the primary\r\nobstacles is the lack of a theoretical framework for thinking about disorder\r\nand its relation to mechanical properties. To this end, we study an idealized\r\nsystem of frictionless athermal soft spheres that, when compressed, undergoes a\r\njamming phase transition with diverging length scales and clean power-law\r\nsignatures. This critical point is the cornerstone of a much larger \"jamming\r\nscenario\" that has the potential to provide the essential theoretical\r\nfoundation necessary for a unified understanding of the mechanics of disordered\r\nsolids. We begin by showing that jammed sphere packings have a valid linear\r\nregime despite the presence of \"contact nonlinearities.\" We then investigate\r\nthe critical nature of the transition, focusing on diverging length scales and\r\nfinite-size effects. Next, we argue that jamming plays the same role for\r\ndisordered solids as the perfect crystal plays for crystalline solids. Not only\r\ncan it be considered an idealized starting point for understanding disordered\r\nmaterials, but it can even influence systems that have a relatively high amount\r\nof crystalline order. The behavior of solids can thus be thought of as existing\r\non a spectrum, with the perfect crystal and the jamming transition at opposing\r\nends. Finally, we introduce a new principle wherein the contribution of an\r\nindividual bond to one global property is independent of its contribution to\r\nanother. This principle allows the different global responses of a disordered\r\nsystem to be manipulated independently and provides a great deal of flexibility\r\nin designing materials with unique, textured and tunable properties.","lang":"eng"}],"extern":"1","external_id":{"arxiv":["1510.08820"]},"citation":{"chicago":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","mla":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","short":"C.P. Goodrich, ArXiv:1510.08820 (2015).","ista":"Goodrich CP. 2015. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:1510.08820, .","ieee":"C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response of disordered solids,” arXiv:1510.08820. 2015.","apa":"Goodrich, C. P. (2015). Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:1510.08820.","ama":"Goodrich CP. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:151008820. 2015."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08820"}],"publication":"arXiv:1510.08820","page":"242","date_published":"2015-10-29T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"10","day":"29"},{"language":[{"iso":"eng"}],"date_published":"2015-06-13T00:00:00Z","doi":"10.1145/2755573.2755600","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"page":"123 - 132","citation":{"chicago":"Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM, 2015. https://doi.org/10.1145/2755573.2755600.","short":"D.-A. Alistarh, A. Matveev, W. Leiserson, N. Shavit, in:, ACM, 2015, pp. 123–132.","mla":"Alistarh, Dan-Adrian, et al. ThreadScan: Automatic and Scalable Memory Reclamation. Vol. 2015–June, ACM, 2015, pp. 123–32, doi:10.1145/2755573.2755600.","apa":"Alistarh, D.-A., Matveev, A., Leiserson, W., & Shavit, N. (2015). ThreadScan: Automatic and scalable memory reclamation (Vol. 2015–June, pp. 123–132). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2755573.2755600","ieee":"D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.","ista":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. 2015. ThreadScan: Automatic and scalable memory reclamation. SPAA: Symposium on Parallelism in Algorithms and Architectures vol. 2015–June, 123–132.","ama":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. ThreadScan: Automatic and scalable memory reclamation. In: Vol 2015-June. ACM; 2015:123-132. doi:10.1145/2755573.2755600"},"article_processing_charge":"No","day":"13","month":"06","oa_version":"None","volume":"2015-June","date_created":"2018-12-11T11:48:27Z","date_updated":"2023-02-23T12:35:42Z","related_material":{"record":[{"id":"6001","status":"public","relation":"later_version"}]},"author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Matveev","first_name":"Alexander","full_name":"Matveev, Alexander"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"}],"publisher":"ACM","title":"ThreadScan: Automatic and scalable memory reclamation","publication_status":"published","status":"public","year":"2015","_id":"779","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle corporation. In particular, we would like to thank Dave Dice, Alex Kogan, and Mark Moir from the Oracle Scalable Synchronization Research Group for very useful feedback on earlier drafts of this paper.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","publist_id":"6876","abstract":[{"lang":"eng","text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU, are either prohibitively expensive or require significant programming expertise, to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated. In this paper, we take a new approach to concurrent memory reclamation: instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads. Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free."}],"type":"conference"},{"type":"conference","extern":"1","publist_id":"6877","abstract":[{"text":"Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computational constructions. Yet, the fastest currently known population protocol for electing a leader only has linear convergence time, and it has recently been shown that no population protocol using a constant number of states per node may overcome this linear bound. In this paper, we give the first population protocol for leader election with polylogarithmic convergence time, using polylogarithmic memory states per node. The protocol structure is quite simple: each node has an associated value, and is either a leader (still in contention) or a minion (following some leader). A leader keeps incrementing its value and “defeats” other leaders in one-to-one interactions, and will drop from contention and become a minion if it meets a leader with higher value. Importantly, a leader also drops out if it meets a minion with higher absolute value. While these rules are quite simple, the proof that this algorithm achieves polylogarithmic convergence time is non-trivial. In particular, the argument combines careful use of concentration inequalities with anti-concentration bounds, showing that the leaders’ values become spread apart as the execution progresses, which in turn implies that straggling leaders get quickly eliminated. We complement our analysis with empirical results, showing that our protocol converges extremely fast, even for large network sizes.","lang":"eng"}],"publisher":"Springer","intvolume":" 9135","title":"Polylogarithmic-time leader election in population protocols","publication_status":"published","status":"public","_id":"780","year":"2015","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.”","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","volume":9135,"date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:11Z","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"}],"day":"01","month":"01","page":"479 - 491","external_id":{"arxiv":["1502.05745"]},"citation":{"ama":"Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38","ista":"Alistarh D-A, Gelashvili R. 2015. Polylogarithmic-time leader election in population protocols. ICALP: International Colloquium on Automota, Languages and Programming vol. 9135, 479–491.","ieee":"D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in population protocols,” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2015, vol. 9135, pp. 479–491.","apa":"Alistarh, D.-A., & Gelashvili, R. (2015). Polylogarithmic-time leader election in population protocols (Vol. 9135, pp. 479–491). Presented at the ICALP: International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-662-47666-6_38","mla":"Alistarh, Dan-Adrian, and Rati Gelashvili. Polylogarithmic-Time Leader Election in Population Protocols. Vol. 9135, Springer, 2015, pp. 479–91, doi:10.1007/978-3-662-47666-6_38.","short":"D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.","chicago":"Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38."},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1502.05745","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-47666-6_38","date_published":"2015-01-01T00:00:00Z","conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"}},{"type":"conference","publist_id":"6873","abstract":[{"lang":"eng","text":"Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states; the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority. Despite considerable research effort, known protocols for this problem are either exact but slow (taking linear parallel time to converge), or fast but approximate (with non-zero probability of error). In this paper, we show that this trade-off between preciasion and speed is not inherent. We present a new protocol called Average and Conquer (AVC) that solves majority ex-actly in expected parallel convergence time O(log n/(sε) + log n log s), where n is the number of nodes, εn is the initial node advantage of the majority state, and s = Ω(log n log log n) is the number of states the protocol employs. This shows that the majority problem can be solved exactly in time poly-logarithmic in n, provided that the memory per node is s = Ω(1/ε + lognlog1/ε). On the negative side, we establish a lower bound of Ω(1/ε) on the expected paraallel convergence time for the case of four memory states per node, and a lower bound of Ω(logn) parallel time for protocols using any number of memory states per node.per node, and a lower bound of (log n) parallel time for protocols using any number of memory states per node."}],"extern":"1","_id":"781","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","publisher":"ACM","status":"public","publication_status":"published","title":"Fast and exact majority in population protocols","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"full_name":"Vojnović, Milan","last_name":"Vojnović","first_name":"Milan"}],"volume":"2015-July","oa_version":"None","date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:35Z","article_processing_charge":"No","month":"07","day":"21","citation":{"short":"D.-A. Alistarh, R. Gelashvili, M. Vojnović, in:, ACM, 2015, pp. 47–56.","mla":"Alistarh, Dan-Adrian, et al. Fast and Exact Majority in Population Protocols. Vol. 2015–July, ACM, 2015, pp. 47–56, doi:10.1145/2767386.2767429.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429.","ama":"Alistarh D-A, Gelashvili R, Vojnović M. Fast and exact majority in population protocols. In: Vol 2015-July. ACM; 2015:47-56. doi:10.1145/2767386.2767429","ieee":"D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority in population protocols,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 47–56.","apa":"Alistarh, D.-A., Gelashvili, R., & Vojnović, M. (2015). Fast and exact majority in population protocols (Vol. 2015–July, pp. 47–56). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767429","ista":"Alistarh D-A, Gelashvili R, Vojnović M. 2015. Fast and exact majority in population protocols. PODC: Principles of Distributed Computing vol. 2015–July, 47–56."},"page":"47 - 56","doi":"10.1145/2767386.2767429","date_published":"2015-07-21T00:00:00Z","conference":{"name":"PODC: Principles of Distributed Computing"},"language":[{"iso":"eng"}]},{"extern":"1","abstract":[{"text":"In this work, we consider the following random process, mo- Tivated by the analysis of lock-free concurrent algorithms under high memory contention. In each round, a new scheduling step is allocated to one of n threads, according to a distribution p = (p1; p2; : : : ; pn), where thread i is scheduled with probability pi. When some thread first reaches a set threshold of executed steps, it registers a win, completing its current operation, and resets its step count to 1. At the same time, threads whose step count was close to the threshold also get reset because of the win, but to 0 steps, being penalized for almost winning. We are interested in two questions: how often does some thread complete an operation (system latency), and how often does a specific thread complete an operation (individual latency)? We provide asymptotically tight bounds for the system and individual latency of this general concurrency pattern, for arbitrary scheduling distributions p. Surprisingly, a sim- ple characterization exists: in expectation, the system will complete a new operation every Θ(1/p 2) steps, while thread i will complete a new operation every Θ(1/2=p i ) steps. The proof is interesting in its own right, as it requires a careful analysis of how the higher norms of the vector p inuence the thread step counts and latencies in this random process. Our result offers a simple connection between the scheduling distribution and the average performance of concurrent algorithms, which has several applications.","lang":"eng"}],"publist_id":"6874","type":"conference","date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:50Z","volume":"2015-July","oa_version":"None","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Thomas","last_name":"Sauerwald","full_name":"Sauerwald, Thomas"},{"full_name":"Vojnović, Milan","first_name":"Milan","last_name":"Vojnović"}],"status":"public","title":"Lock-Free algorithms under stochastic schedulers","publication_status":"published","publisher":"ACM","year":"2015","_id":"782","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","day":"21","article_processing_charge":"No","language":[{"iso":"eng"}],"conference":{"name":"PODC: Principles of Distributed Computing"},"date_published":"2015-07-21T00:00:00Z","doi":"10.1145/2767386.2767430","page":"251 - 260","citation":{"ama":"Alistarh D-A, Sauerwald T, Vojnović M. Lock-Free algorithms under stochastic schedulers. In: Vol 2015-July. ACM; 2015:251-260. doi:10.1145/2767386.2767430","ista":"Alistarh D-A, Sauerwald T, Vojnović M. 2015. Lock-Free algorithms under stochastic schedulers. PODC: Principles of Distributed Computing vol. 2015–July, 251–260.","ieee":"D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under stochastic schedulers,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 251–260.","apa":"Alistarh, D.-A., Sauerwald, T., & Vojnović, M. (2015). Lock-Free algorithms under stochastic schedulers (Vol. 2015–July, pp. 251–260). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767430","mla":"Alistarh, Dan-Adrian, et al. Lock-Free Algorithms under Stochastic Schedulers. Vol. 2015–July, ACM, 2015, pp. 251–60, doi:10.1145/2767386.2767430.","short":"D.-A. Alistarh, T. Sauerwald, M. Vojnović, in:, ACM, 2015, pp. 251–260.","chicago":"Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430."}},{"day":"21","month":"07","article_processing_charge":"No","language":[{"iso":"eng"}],"conference":{"name":"PODC: Principles of Distributed Computing"},"date_published":"2015-07-21T00:00:00Z","doi":"10.1145/2767386.2767420","page":"365 - 374","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.1001"}],"citation":{"ama":"Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament. In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420","ieee":"D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.","apa":"Alistarh, D.-A., Gelashvili, R., & Vladu, A. (2015). How to elect a leader faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420","ista":"Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.","short":"D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.","mla":"Alistarh, Dan-Adrian, et al. How to Elect a Leader Faster than a Tournament. Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420."},"extern":"1","abstract":[{"text":"The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper, we answer this question in the affirmative, improving on a decades-old upper bound. We introduce two new algorithmic ideas to reduce the time complexity of electing a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application of our algorithm is a new upper bound for the tight renaming problem, assigning n items to the n participants in expected O(log2 n) time and O(n2) messages. We complement our results with lower bound of Ω(n2) messages for solving these two problems, closing the question of their message complexity.","lang":"eng"}],"publist_id":"6875","type":"conference","date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:55Z","volume":"2015-July","oa_version":"None","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"last_name":"Vladu","first_name":"Adrian","full_name":"Vladu, Adrian"}],"title":"How to elect a leader faster than a tournament","status":"public","publication_status":"published","publisher":"ACM","_id":"783","year":"2015","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926,\r\nand IIS-1447786, the Department of Energy under grant\r\nER26116/DE-SC0008923, and the Oracle and Intel corporations.\r\nThe authors would like to thank Prof. Nir Shavit for ad-\r\nvice and encouragement during this work, and the anonymous reviewers for their very useful suggestions.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"extern":"1","abstract":[{"text":"We demonstrate an optical switch design that can scale up to a thousand ports with high per-port bandwidth (25 Gbps+) and low switching latency (40 ns). Our design uses a broadcast and select architecture, based on a passive star coupler and fast tunable transceivers. In addition we employ time division multiplexing to achieve very low switching latency. Our demo shows the feasibility of the switch data plane using a small testbed, comprising two transmitters and a receiver, connected through a star coupler.","lang":"eng"}],"publist_id":"6872","type":"conference","date_updated":"2023-02-23T13:18:57Z","date_created":"2018-12-11T11:48:29Z","oa_version":"None","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Ballani","first_name":"Hitesh","full_name":"Ballani, Hitesh"},{"full_name":"Costa, Paolo","first_name":"Paolo","last_name":"Costa"},{"full_name":"Funnell, Adam","first_name":"Adam","last_name":"Funnell"},{"full_name":"Benjamin, Joshua","first_name":"Joshua","last_name":"Benjamin"},{"last_name":"Watts","first_name":"Philip","full_name":"Watts, Philip"},{"full_name":"Thomsen, Benn","last_name":"Thomsen","first_name":"Benn"}],"publication_status":"published","title":"A high-radix, low-latency optical switch for data centers","status":"public","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"784","year":"2015","month":"01","day":"01","publication_identifier":{"isbn":["978-1-4503-3542-3"]},"language":[{"iso":"eng"}],"conference":{"name":"SIGCOMM: Special Interest Group on Data Communication","end_date":"2015-08-21","location":"London, United Kindgdom","start_date":"2015-08-17"},"date_published":"2015-01-01T00:00:00Z","doi":"10.1145/2785956.2790035","quality_controlled":"1","page":"367 - 368","citation":{"ama":"Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035","ista":"Alistarh D-A, Ballani H, Costa P, Funnell A, Benjamin J, Watts P, Thomsen B. 2015. A high-radix, low-latency optical switch for data centers. SIGCOMM: Special Interest Group on Data Communication, 367–368.","ieee":"D.-A. Alistarh et al., “A high-radix, low-latency optical switch for data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom, 2015, pp. 367–368.","apa":"Alistarh, D.-A., Ballani, H., Costa, P., Funnell, A., Benjamin, J., Watts, P., & Thomsen, B. (2015). A high-radix, low-latency optical switch for data centers (pp. 367–368). Presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom: ACM. https://doi.org/10.1145/2785956.2790035","mla":"Alistarh, Dan-Adrian, et al. A High-Radix, Low-Latency Optical Switch for Data Centers. ACM, 2015, pp. 367–68, doi:10.1145/2785956.2790035.","short":"D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 2015, pp. 367–368.","chicago":"Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035."}},{"issue":"12","publist_id":"6851","abstract":[{"text":"Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at the plasma membrane of various eukaryotes with the important exception of mammals. In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man) linked at position 2 of the inositol. However, several pathogenic fungi additionally synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC, which is the most abundant GIPC synthesized by this fungus. In this study, we identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted deletion of the gene encoding GntA in A. fumigatus resulted in complete absence of zwitterionic GIPC; a phenotype that could be reverted by episomal expression of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid product resistant to saponification and to digestion by phosphatidylinositol-phospholipase C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.","lang":"eng"}],"type":"journal_article","author":[{"first_name":"Jakob","last_name":"Engel","full_name":"Engel, Jakob"},{"first_name":"Philipp S","last_name":"Schmalhorst","id":"309D50DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5795-0133","full_name":"Schmalhorst, Philipp S"},{"full_name":"Kruger, Anke","last_name":"Kruger","first_name":"Anke"},{"full_name":"Muller, Christina","last_name":"Muller","first_name":"Christina"},{"first_name":"Falk","last_name":"Buettner","full_name":"Buettner, Falk"},{"full_name":"Routier, Françoise","last_name":"Routier","first_name":"Françoise"}],"oa_version":"None","volume":25,"date_created":"2018-12-11T11:48:35Z","date_updated":"2021-01-12T08:16:33Z","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"802","year":"2015","publisher":"Oxford University Press","department":[{"_id":"CaHe"}],"intvolume":" 25","publication_status":"published","status":"public","title":"Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis","day":"01","month":"12","scopus_import":1,"doi":"10.1093/glycob/cwv059","date_published":"2015-12-01T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"pmid":["26306635"]},"citation":{"chicago":"Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059.","short":"J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier, Glycobiology 25 (2015) 1423–1430.","mla":"Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30, doi:10.1093/glycob/cwv059.","apa":"Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., & Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059","ieee":"J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier, “Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology, vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.","ista":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 25(12), 1423–1430.","ama":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430. doi:10.1093/glycob/cwv059"},"publication":"Glycobiology","page":"1423 - 1430","quality_controlled":"1"},{"day":"22","month":"09","doi":"10.1128/JVI.01502-15","date_published":"2015-09-22T00:00:00Z","language":[{"iso":"eng"}],"publication":"Journal of Virology","citation":{"mla":"Schur, Florian KM, et al. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology, vol. 89, no. 20, ASM, 2015, pp. 10294–302, doi:10.1128/JVI.01502-15.","short":"F.K. Schur, R. Dick, W. Hagen, V. Vogt, J. Briggs, Journal of Virology 89 (2015) 10294–10302.","chicago":"Schur, Florian KM, Robert Dick, Wim Hagen, Volker Vogt, and John Briggs. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology. ASM, 2015. https://doi.org/10.1128/JVI.01502-15.","ama":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 2015;89(20):10294-10302. doi:10.1128/JVI.01502-15","ista":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. 2015. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 89(20), 10294–10302.","apa":"Schur, F. K., Dick, R., Hagen, W., Vogt, V., & Briggs, J. (2015). The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. ASM. https://doi.org/10.1128/JVI.01502-15","ieee":"F. K. Schur, R. Dick, W. Hagen, V. Vogt, and J. Briggs, “The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly,” Journal of Virology, vol. 89, no. 20. ASM, pp. 10294–10302, 2015."},"external_id":{"pmid":["26223638"]},"quality_controlled":"1","page":"10294 - 10302","abstract":[{"lang":"eng","text":"The polyprotein Gag is the primary structural component of retroviruses. Gag consists of independently folded domains connected by flexible linkers. Interactions between the conserved capsid (CA) domains of Gag mediate formation of hexameric protein lattices that drive assembly of immature virus particles. Proteolytic cleavage of Gag by the viral protease (PR) is required for maturation of retroviruses from an immature form into an infectious form. Within the assembled Gag lattices of HIV-1 and Mason- Pfizer monkey virus (M-PMV), the C-terminal domain of CA adopts similar quaternary arrangements, while the N-terminal domain of CA is packed in very different manners. Here, we have used cryo-electron tomography and subtomogram averaging to study in vitro-assembled, immature virus-like Rous sarcoma virus (RSV) Gag particles and have determined the structure of CA and the surrounding regions to a resolution of ~8 Å. We found that the C-terminal domain of RSV CA is arranged similarly to HIV-1 and M-PMV, whereas the N-terminal domain of CA adopts a novel arrangement in which the upstream p10 domain folds back into the CA lattice. In this position the cleavage site between CA and p10 appears to be inaccessible to PR. Below CA, an extended density is consistent with the presence of a six-helix bundle formed by the spacer-peptide region. We have also assessed the affect of lattice assembly on proteolytic processing by exogenous PR. The cleavage between p10 and CA is indeed inhibited in the assembled lattice, a finding consistent with structural regulation of proteolytic maturation.\r\n"}],"issue":"20","publist_id":"6837","extern":"1","type":"journal_article","author":[{"full_name":"Schur, Florian","first_name":"Florian","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078"},{"last_name":"Dick","first_name":"Robert","full_name":"Dick, Robert"},{"first_name":"Wim","last_name":"Hagen","full_name":"Hagen, Wim"},{"first_name":"Volker","last_name":"Vogt","full_name":"Vogt, Volker"},{"full_name":"Briggs, John","last_name":"Briggs","first_name":"John"}],"date_created":"2018-12-11T11:48:39Z","date_updated":"2021-01-12T08:17:09Z","oa_version":"None","volume":89,"_id":"815","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","pmid":1,"publication_status":"published","status":"public","title":"The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly","publisher":"ASM","intvolume":" 89"},{"doi":"10.1038/nature13838","date_published":"2015-01-22T00:00:00Z","citation":{"ama":"Schur FK, Hagen W, Rumlová M, et al. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 2015;517(7535):505-508. doi:10.1038/nature13838","ista":"Schur FK, Hagen W, Rumlová M, Ruml T, Müller B, Kraüsslich H, Briggs J. 2015. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 517(7535), 505–508.","ieee":"F. K. Schur et al., “Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution,” Nature, vol. 517, no. 7535. Nature Publishing Group, pp. 505–508, 2015.","apa":"Schur, F. K., Hagen, W., Rumlová, M., Ruml, T., Müller, B., Kraüsslich, H., & Briggs, J. (2015). Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. Nature Publishing Group. https://doi.org/10.1038/nature13838","mla":"Schur, Florian KM, et al. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature, vol. 517, no. 7535, Nature Publishing Group, 2015, pp. 505–08, doi:10.1038/nature13838.","short":"F.K. Schur, W. Hagen, M. Rumlová, T. Ruml, B. Müller, H. Kraüsslich, J. Briggs, Nature 517 (2015) 505–508.","chicago":"Schur, Florian KM, Wim Hagen, Michaela Rumlová, Tomáš Ruml, B Müller, Hans Kraüsslich, and John Briggs. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature13838."},"publication":"Nature","page":"505 - 508","quality_controlled":0,"month":"01","day":"22","author":[{"first_name":"Florian","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","full_name":"Florian Schur"},{"last_name":"Hagen","first_name":"Wim","full_name":"Hagen, Wim J"},{"last_name":"Rumlová","first_name":"Michaela","full_name":"Rumlová, Michaela"},{"last_name":"Ruml","first_name":"Tomáš","full_name":"Ruml, Tomáš"},{"full_name":"Müller B","first_name":"B","last_name":"Müller"},{"first_name":"Hans","last_name":"Kraüsslich","full_name":"Kraüsslich, Hans Georg"},{"last_name":"Briggs","first_name":"John","full_name":"Briggs, John A"}],"volume":517,"date_created":"2018-12-11T11:48:39Z","date_updated":"2021-01-12T08:17:08Z","_id":"814","year":"2015","acknowledgement":"This study was supported by Deutsche Forschungsgemeinschaft grants BR 3635/2-1 to J.A.G.B., KR 906/7-1 to H.-G.K. and by Grant Agency of the Czech Republic 14-15326S to M.R. The Briggs laboratory acknowledges financial support from the European Molecular Biology Laboratory and from the Chica und Heinz Schaller Stiftung. We thank B. Glass, M. Anders and S. Mattei for preparation of samples, and R. Hadravova, K. H. Bui, F. Thommen, M. Schorb, S. Dodonova, S. Glatt, P. Ulbrich and T. Bharat for technical support and/or discussion. This study was technically supported by the European Molecular Biology Laboratory IT services unit.","intvolume":" 517","publisher":"Nature Publishing Group","title":"Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution","publication_status":"published","status":"public","publist_id":"6836","issue":"7535","abstract":[{"lang":"eng","text":"Human immunodeficiency virus type 1 (HIV-1) assembly proceeds in two stages. First, the 55 kilodalton viral Gag polyprotein assembles into a hexameric protein lattice at the plasma membrane of the infected cell, inducing budding and release of an immature particle. Second, Gag is cleaved by the viral protease, leading to internal rearrangement of the virus into the mature, infectious form. Immature and mature HIV-1 particles are heterogeneous in size and morphology, preventing high-resolution analysis of their protein arrangement in situ by conventional structural biology methods. Here we apply cryo-electron tomography and sub-tomogram averaging methods to resolve the structure of the capsid lattice within intact immature HIV-1 particles at subnanometre resolution, allowing unambiguous positioning of all α-helices. The resulting model reveals tertiary and quaternary structural interactions that mediate HIV-1 assembly. Strikingly, these interactions differ from those predicted by the current model based on in vitro-assembled arrays of Gag-derived proteins from Mason-Pfizer monkey virus. To validate this difference, we solve the structure of the capsid lattice within intact immature Mason-Pfizer monkey virus particles. Comparison with the immature HIV-1 structure reveals that retroviral capsid proteins, while having conserved tertiary structures, adopt different quaternary arrangements during virus assembly. The approach demonstrated here should be applicable to determine structures of other proteins at subnanometre resolution within heterogeneous environments."}],"extern":1,"type":"journal_article"},{"_id":"8242","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients","publication_status":"published","intvolume":" 135","publisher":"Elsevier","author":[{"last_name":"Einhorn","first_name":"Lukas","full_name":"Einhorn, Lukas"},{"id":"36432834-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8777-3502","first_name":"Judit","last_name":"Fazekas","full_name":"Fazekas, Judit"},{"last_name":"Muhr","first_name":"Martina","full_name":"Muhr, Martina"},{"last_name":"Schoos","first_name":"Alexandra","full_name":"Schoos, Alexandra"},{"first_name":"Kumiko","last_name":"Oida","full_name":"Oida, Kumiko"},{"full_name":"Singer, Josef","last_name":"Singer","first_name":"Josef"},{"last_name":"Panakova","first_name":"Lucia","full_name":"Panakova, Lucia"},{"first_name":"Krisztina","last_name":"Manzano-Szalai","full_name":"Manzano-Szalai, Krisztina"},{"last_name":"Jensen-Jarolim","first_name":"Erika","full_name":"Jensen-Jarolim, Erika"}],"date_created":"2020-08-10T11:54:09Z","date_updated":"2021-01-12T08:17:42Z","volume":135,"oa_version":"None","article_number":"AB101","type":"journal_article","issue":"2","extern":"1","publication":"Journal of Allergy and Clinical Immunology","citation":{"mla":"Einhorn, Lukas, et al. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology, vol. 135, no. 2, AB101, Elsevier, 2015, doi:10.1016/j.jaci.2014.12.1263.","short":"L. Einhorn, J. Singer, M. Muhr, A. Schoos, K. Oida, J. Singer, L. Panakova, K. Manzano-Szalai, E. Jensen-Jarolim, Journal of Allergy and Clinical Immunology 135 (2015).","chicago":"Einhorn, Lukas, Judit Singer, Martina Muhr, Alexandra Schoos, Kumiko Oida, Josef Singer, Lucia Panakova, Krisztina Manzano-Szalai, and Erika Jensen-Jarolim. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology. Elsevier, 2015. https://doi.org/10.1016/j.jaci.2014.12.1263.","ama":"Einhorn L, Singer J, Muhr M, et al. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 2015;135(2). doi:10.1016/j.jaci.2014.12.1263","ista":"Einhorn L, Singer J, Muhr M, Schoos A, Oida K, Singer J, Panakova L, Manzano-Szalai K, Jensen-Jarolim E. 2015. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 135(2), AB101.","ieee":"L. Einhorn et al., “Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients,” Journal of Allergy and Clinical Immunology, vol. 135, no. 2. Elsevier, 2015.","apa":"Einhorn, L., Singer, J., Muhr, M., Schoos, A., Oida, K., Singer, J., … Jensen-Jarolim, E. (2015). Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. Elsevier. https://doi.org/10.1016/j.jaci.2014.12.1263"},"article_type":"original","quality_controlled":"1","doi":"10.1016/j.jaci.2014.12.1263","date_published":"2015-02-01T00:00:00Z","language":[{"iso":"eng"}],"month":"02","day":"01","article_processing_charge":"No","publication_identifier":{"issn":["0091-6749"]}}]