--- _id: '1861' 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. acknowledgement: "HYCON2; EC; European Commission\r\n" article_number: '8' author: - first_name: Jakob full_name: Ruess, Jakob id: 4A245D00-F248-11E8-B48F-1D18A9856A87 last_name: Ruess orcid: 0000-0003-1615-3282 - first_name: John full_name: Lygeros, John last_name: Lygeros 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 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 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. 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. 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. 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). date_created: 2018-12-11T11:54:25Z date_published: 2015-02-01T00:00:00Z date_updated: 2021-01-12T06:53:41Z day: '01' department: - _id: ToHe - _id: GaTk doi: 10.1145/2688906 intvolume: ' 25' issue: '2' language: - iso: eng month: '02' oa_version: None publication: ACM Transactions on Modeling and Computer Simulation publication_status: published publisher: ACM publist_id: '5238' quality_controlled: '1' scopus_import: 1 status: public title: Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 25 year: '2015' ... --- _id: '1866' author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jean full_name: Raskin, Jean last_name: Raskin citation: 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' 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' 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.' 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.' ista: 'Henzinger TA, Raskin J. 2015. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 58(2), 86–86.' 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. date_created: 2018-12-11T11:54:26Z date_published: 2015-01-28T00:00:00Z date_updated: 2021-01-12T06:53:43Z day: '28' department: - _id: ToHe doi: 10.1145/2701001 intvolume: ' 58' issue: '2' language: - iso: eng month: '01' oa_version: None page: 86-86 publication: Communications of the ACM publication_status: published publisher: ACM publist_id: '5232' scopus_import: 1 status: public title: 'The equivalence problem for finite automata: Technical perspective' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 58 year: '2015' ... --- _id: '1871' 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. 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] author: - first_name: Peter full_name: Grones, Peter id: 399876EC-F248-11E8-B48F-1D18A9856A87 last_name: Grones - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. ista: Grones P, Friml J. 2015. Auxin transporters and binding proteins at a glance. Journal of Cell Science. 128(1), 1–7. 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. date_created: 2018-12-11T11:54:28Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T06:53:45Z day: '01' ddc: - '570' department: - _id: JiFr doi: 10.1242/jcs.159418 file: - access_level: open_access checksum: 24c779f4cd9d549ca6833e26f486be27 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:00Z date_updated: 2020-07-14T12:45:19Z file_id: '4852' file_name: IST-2016-563-v1+1_1.full.pdf file_size: 1688844 relation: main_file file_date_updated: 2020-07-14T12:45:19Z has_accepted_license: '1' intvolume: ' 128' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 1 - 7 publication: Journal of Cell Science publication_status: published publisher: Company of Biologists publist_id: '5225' pubrep_id: '563' quality_controlled: '1' scopus_import: 1 status: public title: Auxin transporters and binding proteins at a glance type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 128 year: '2015' ... --- _id: '1874' 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.' author: - first_name: Charlotte full_name: Boccara, Charlotte id: 3FC06552-F248-11E8-B48F-1D18A9856A87 last_name: Boccara orcid: 0000-0001-7237-5109 - first_name: Lisa full_name: Kjønigsen, Lisa last_name: Kjønigsen - first_name: Ingvild full_name: Hammer, Ingvild last_name: Hammer - first_name: Jan full_name: Bjaalie, Jan last_name: Bjaalie - first_name: Trygve full_name: Leergaard, Trygve last_name: Leergaard - first_name: Menno full_name: Witter, Menno last_name: Witter citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:54:29Z date_published: 2015-07-01T00:00:00Z date_updated: 2021-01-12T06:53:46Z day: '01' department: - _id: JoCs doi: 10.1002/hipo.22407 intvolume: ' 25' issue: '7' language: - iso: eng month: '07' oa_version: None page: 838 - 857 publication: Hippocampus publication_status: published publisher: Wiley publist_id: '5222' quality_controlled: '1' scopus_import: 1 status: public title: A three-plane architectonic atlas of the rat hippocampal region type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 25 year: '2015' ... --- _id: '1873' 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.' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik citation: ama: Chatterjee K, Chmelik M. POMDPs under probabilistic semantics. Artificial Intelligence. 2015;221:46-72. doi:10.1016/j.artint.2014.12.009 apa: Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2014.12.009 chicago: Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. 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. ista: Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72. 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. date_created: 2018-12-11T11:54:28Z date_published: 2015-04-01T00:00:00Z date_updated: 2021-01-12T06:53:46Z day: '01' department: - _id: KrCh doi: 10.1016/j.artint.2014.12.009 external_id: arxiv: - '1408.2058' intvolume: ' 221' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1408.2058 month: '04' oa: 1 oa_version: Preprint page: 46 - 72 publication: Artificial Intelligence publication_status: published publisher: Elsevier publist_id: '5224' quality_controlled: '1' scopus_import: 1 status: public title: POMDPs under probabilistic semantics type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 221 year: '2015' ... --- _id: '1879' abstract: - lang: eng 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. 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. author: - first_name: A full_name: Kremer, A last_name: Kremer - first_name: Stefaan full_name: Lippens, Stefaan last_name: Lippens - first_name: Sonia full_name: Bartunkova, Sonia last_name: Bartunkova - first_name: Bob full_name: Asselbergh, Bob last_name: Asselbergh - first_name: Cendric full_name: Blanpain, Cendric last_name: Blanpain - first_name: Matyas full_name: Fendrych, Matyas id: 43905548-F248-11E8-B48F-1D18A9856A87 last_name: Fendrych orcid: 0000-0002-9767-8699 - first_name: A full_name: Goossens, A last_name: Goossens - first_name: Matthew full_name: Holt, Matthew last_name: Holt - first_name: Sophie full_name: Janssens, Sophie last_name: Janssens - first_name: Michiel full_name: Krols, Michiel last_name: Krols - first_name: Jean full_name: Larsimont, Jean last_name: Larsimont - first_name: Conor full_name: Mc Guire, Conor last_name: Mc Guire - first_name: Moritz full_name: Nowack, Moritz last_name: Nowack - first_name: Xavier full_name: Saelens, Xavier last_name: Saelens - first_name: Andreas full_name: Schertel, Andreas last_name: Schertel - first_name: B full_name: Schepens, B last_name: Schepens - first_name: M full_name: Slezak, M last_name: Slezak - first_name: Vincent full_name: Timmerman, Vincent last_name: Timmerman - first_name: Clara full_name: Theunis, Clara last_name: Theunis - first_name: Ronald full_name: Van Brempt, Ronald last_name: Van Brempt - first_name: Y full_name: Visser, Y last_name: Visser - first_name: Christophe full_name: Guérin, Christophe last_name: Guérin citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:54:30Z date_published: 2015-08-01T00:00:00Z date_updated: 2021-01-12T06:53:48Z day: '01' ddc: - '570' department: - _id: JiFr doi: 10.1111/jmi.12211 file: - access_level: open_access checksum: 3649c5372d1644062d728ea9287e367f content_type: application/pdf creator: system date_created: 2018-12-12T10:11:19Z date_updated: 2020-07-14T12:45:19Z file_id: '4872' file_name: IST-2016-459-v1+1_KREMER_et_al-2015-Journal_of_Microscopy.pdf file_size: 2899898 relation: main_file file_date_updated: 2020-07-14T12:45:19Z has_accepted_license: '1' intvolume: ' 259' issue: '2' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 80 - 96 publication: Journal of Microscopy publication_status: published publisher: Wiley-Blackwell publist_id: '5218' pubrep_id: '459' quality_controlled: '1' scopus_import: 1 status: public title: Developing 3D SEM in a broad biological context tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 259 year: '2015' ... --- _id: '1880' 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 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 article_number: '013022' author: - first_name: Martin full_name: Könenberg, Martin last_name: Könenberg - first_name: Thomas full_name: Moser, Thomas id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87 last_name: Moser - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 - first_name: Jakob full_name: Yngvason, Jakob last_name: Yngvason citation: 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 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 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. 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. 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. 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). date_created: 2018-12-11T11:54:30Z date_published: 2015-01-15T00:00:00Z date_updated: 2021-01-12T06:53:48Z day: '15' ddc: - '530' department: - _id: RoSe doi: 10.1088/1367-2630/17/1/013022 file: - access_level: open_access checksum: 38fdf2b5ac30445e26a5d613abd84b16 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:44Z date_updated: 2020-07-14T12:45:20Z file_id: '4963' file_name: IST-2016-447-v1+1_document_1_.pdf file_size: 768108 relation: main_file file_date_updated: 2020-07-14T12:45:20Z has_accepted_license: '1' intvolume: ' 17' language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 26450934-B435-11E9-9278-68D0E5697425 name: NSERC Postdoctoral fellowship publication: New Journal of Physics publication_status: published publisher: IOP Publishing Ltd. publist_id: '5214' pubrep_id: '447' quality_controlled: '1' scopus_import: 1 status: public title: Superfluid behavior of a Bose-Einstein condensate in a random potential tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2015' ... --- _id: '1882' 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. 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. alternative_title: - LNCS author: - first_name: Uli full_name: Fahrenberg, Uli last_name: Fahrenberg - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Axel full_name: Legay, Axel last_name: Legay - first_name: Louis full_name: Traonouez, Louis last_name: Traonouez citation: 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' 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' 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. 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.' 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.' 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. conference: end_date: 2014-09-12 location: Bertinoro, Italy name: 'FACS: Formal Aspects of Component Software' start_date: 2014-09-10 date_created: 2018-12-11T11:54:31Z date_published: 2015-01-30T00:00:00Z date_updated: 2021-01-12T06:53:49Z day: '30' department: - _id: ToHe - _id: KrCh doi: 10.1007/978-3-319-15317-9_19 ec_funded: 1 intvolume: ' 8997' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1408.1256 month: '01' oa: 1 oa_version: Preprint page: 306 - 324 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '5216' quality_controlled: '1' scopus_import: 1 status: public title: Compositionality for quantitative specifications type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8997 year: '2015' ... --- _id: '1883' 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" article_number: '022803' article_processing_charge: No article_type: original author: - first_name: Stephanie full_name: Keller-Schmidt, Stephanie last_name: Keller-Schmidt - first_name: Murat full_name: Tugrul, Murat id: 37C323C6-F248-11E8-B48F-1D18A9856A87 last_name: Tugrul orcid: 0000-0002-8523-0758 - first_name: Víctor full_name: Eguíluz, Víctor last_name: Eguíluz - first_name: Emilio full_name: Hernandez Garcia, Emilio last_name: Hernandez Garcia - first_name: Konstantin full_name: Klemm, Konstantin last_name: Klemm citation: 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 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 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. 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. 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. 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). date_created: 2018-12-11T11:54:31Z date_published: 2015-02-02T00:00:00Z date_updated: 2021-01-12T06:53:49Z day: '02' department: - _id: NiBa doi: 10.1103/PhysRevE.91.022803 external_id: arxiv: - '1012.3298' intvolume: ' 91' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1012.3298 month: '02' oa: 1 oa_version: Preprint publication: Physical Review E Statistical Nonlinear and Soft Matter Physics publication_status: published publisher: American Institute of Physics publist_id: '5213' quality_controlled: '1' scopus_import: 1 status: public title: Anomalous scaling in an age-dependent branching model type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 91 year: '2015' ... --- _id: '1878' abstract: - lang: eng 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). author: - first_name: Eduardo full_name: Cires Rodriguez, Eduardo id: 2AD56A7A-F248-11E8-B48F-1D18A9856A87 last_name: Cires Rodriguez - first_name: José full_name: Prieto, José last_name: Prieto citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:54:30Z date_published: 2015-01-24T00:00:00Z date_updated: 2021-01-12T06:53:47Z day: '24' department: - _id: JiFr doi: 10.1007/s10265-014-0691-6 intvolume: ' 128' issue: '2' language: - iso: eng month: '01' oa_version: None page: 223 - 238 publication: Journal of Plant Research publication_status: published publisher: Springer publist_id: '5217' quality_controlled: '1' scopus_import: 1 status: public title: Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 128 year: '2015' ... --- _id: '1885' 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. ' author: - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Julien full_name: Dubuis, Julien last_name: Dubuis - first_name: Mariela full_name: Petkova, Mariela last_name: Petkova - first_name: Thomas full_name: Gregor, Thomas last_name: Gregor citation: 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' 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' 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.' 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.' 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.' short: G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59. date_created: 2018-12-11T11:54:32Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T06:53:50Z day: '01' department: - _id: GaTk doi: 10.1534/genetics.114.171850 intvolume: ' 199' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1404.5599 month: '01' oa: 1 oa_version: Preprint page: 39 - 59 publication: Genetics publication_status: published publisher: Genetics Society of America publist_id: '5210' quality_controlled: '1' scopus_import: 1 status: public title: 'Positional information, positional error, and readout precision in morphogenesis: A mathematical framework' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 199 year: '2015' ... --- _id: '1940' 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. article_number: '062710' author: - first_name: Thomas R full_name: Sokolowski, Thomas R id: 3E999752-F248-11E8-B48F-1D18A9856A87 last_name: Sokolowski orcid: 0000-0002-1287-3779 - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 citation: 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 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 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. 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. 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. short: T.R. Sokolowski, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015). date_created: 2018-12-11T11:54:49Z date_published: 2015-06-15T00:00:00Z date_updated: 2021-01-12T06:54:13Z day: '15' department: - _id: GaTk doi: 10.1103/PhysRevE.91.062710 intvolume: ' 91' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1501.04015 month: '06' oa: 1 oa_version: Preprint publication: Physical Review E Statistical Nonlinear and Soft Matter Physics publication_status: published publisher: American Institute of Physics publist_id: '5145' quality_controlled: '1' scopus_import: 1 status: public title: Optimizing information flow in small genetic networks. IV. Spatial coupling type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 91 year: '2015' ... --- _id: '1938' abstract: - lang: eng 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.' 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. " author: - first_name: Florian full_name: Pausinger, Florian id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87 last_name: Pausinger orcid: 0000-0002-8379-3768 - first_name: Stefan full_name: Steinerberger, Stefan last_name: Steinerberger 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 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. 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. 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. short: F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541. date_created: 2018-12-11T11:54:49Z date_published: 2015-03-06T00:00:00Z date_updated: 2021-01-12T06:54:12Z day: '06' department: - _id: HeEd doi: 10.1016/j.physleta.2014.12.010 intvolume: ' 379' issue: '6' language: - iso: eng month: '03' oa_version: None page: 535 - 541 publication: Physics Letters, Section A publication_status: published publisher: Elsevier publist_id: '5152' quality_controlled: '1' scopus_import: 1 status: public title: On the distribution of local extrema in quantum chaos type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 379 year: '2015' ... --- _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 author: - first_name: Hana full_name: Rakusová, Hana last_name: Rakusová - first_name: Matyas full_name: Fendrych, Matyas id: 43905548-F248-11E8-B48F-1D18A9856A87 last_name: Fendrych orcid: 0000-0002-9767-8699 - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:54:51Z date_published: 2015-02-01T00:00:00Z date_updated: 2021-01-12T06:54:15Z day: '01' department: - _id: JiFr doi: 10.1016/j.pbi.2014.12.002 ec_funded: 1 intvolume: ' 23' issue: '2' language: - iso: eng month: '02' oa_version: None page: 116 - 123 project: - _id: 25716A02-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '282300' name: Polarity and subcellular dynamics in plants - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Current Opinion in Plant Biology publication_status: published publisher: Elsevier publist_id: '5140' quality_controlled: '1' scopus_import: 1 status: public title: Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2015' ... --- _id: '1992' abstract: - lang: eng 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." author: - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Arjun full_name: Radhakrishna, Arjun id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87 last_name: Radhakrishna - first_name: Roopsha full_name: Samanta, Roopsha id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87 last_name: Samanta - first_name: Thorsten full_name: Tarrach, Thorsten id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87 last_name: Tarrach orcid: 0000-0003-4409-8487 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' 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' 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. 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.' 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.' 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. conference: end_date: 2015-01-17 location: Mumbai, India name: 'POPL: Principles of Programming Languages' start_date: 2015-01-15 date_created: 2018-12-11T11:55:05Z date_published: 2015-01-15T00:00:00Z date_updated: 2021-01-12T06:54:33Z day: '15' ddc: - '005' department: - _id: ToHe doi: 10.1145/2676726.2677008 file: - access_level: open_access checksum: f0d4395b600f410a191256ac0b73af32 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:56Z date_updated: 2020-07-14T12:45:22Z file_id: '5314' file_name: IST-2015-317-v1+1_author_version.pdf file_size: 399462 relation: main_file file_date_updated: 2020-07-14T12:45:22Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 433 - 444 publication_identifier: isbn: - 978-1-4503-3300-9 publication_status: published publisher: ACM publist_id: '5091' pubrep_id: '317' quality_controlled: '1' scopus_import: 1 status: public title: Succinct representation of concurrent trace sets type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2015' ... --- _id: '1997' 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. author: - first_name: Patrik full_name: Noren, Patrik id: 46870C74-F248-11E8-B48F-1D18A9856A87 last_name: Noren citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:55:07Z date_published: 2015-05-01T00:00:00Z date_updated: 2021-01-12T06:54:35Z day: '01' department: - _id: CaUh doi: 10.1016/j.jsc.2014.09.014 issue: May-June language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1207.0077 month: '05' oa: 1 oa_version: Preprint page: 285 - 296 publication: Journal of Symbolic Computation publication_status: published publisher: Elsevier publist_id: '5082' quality_controlled: '1' scopus_import: 1 status: public title: The three-state toric homogeneous Markov chain model has Markov degree two type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 68/Part 2 year: '2015' ... --- _id: '2008' 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. 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). author: - first_name: Anna full_name: Klimova, Anna id: 31934120-F248-11E8-B48F-1D18A9856A87 last_name: Klimova - first_name: Tamás full_name: Rudas, Tamás last_name: Rudas citation: 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 apa: Klimova, A., & Rudas, T. (2015). Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. Wiley. https://doi.org/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. 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. 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. short: A. Klimova, T. Rudas, Scandinavian Journal of Statistics 42 (2015) 832–847. date_created: 2018-12-11T11:55:11Z date_published: 2015-09-01T00:00:00Z date_updated: 2021-01-12T06:54:41Z day: '01' department: - _id: CaUh doi: 10.1111/sjos.12139 intvolume: ' 42' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1307.3282 month: '09' oa: 1 oa_version: Preprint page: 832 - 847 publication: Scandinavian Journal of Statistics publication_status: published publisher: Wiley publist_id: '5068' quality_controlled: '1' scopus_import: 1 status: public title: Iterative scaling in curved exponential families type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 42 year: '2015' ... --- _id: '2006' 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. ' article_processing_charge: No author: - first_name: Nicolas full_name: Hein, Nicolas last_name: Hein - first_name: Christopher full_name: Hillar, Christopher last_name: Hillar - first_name: Abraham full_name: Martin Del Campo Sanchez, Abraham id: 4CF47F6A-F248-11E8-B48F-1D18A9856A87 last_name: Martin Del Campo Sanchez - first_name: Frank full_name: Sottile, Frank last_name: Sottile - first_name: Zach full_name: Teitler, Zach last_name: Teitler citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:55:10Z date_published: 2015-06-23T00:00:00Z date_updated: 2021-01-12T06:54:40Z day: '23' department: - _id: CaUh doi: 10.1080/10586458.2014.980044 intvolume: ' 24' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1109.3436 month: '06' oa: 1 oa_version: Preprint page: 261 - 269 publication: Experimental Mathematics publication_status: published publisher: Taylor & Francis publist_id: '5070' quality_controlled: '1' scopus_import: 1 status: public title: The monotone secant conjecture in the real Schubert calculus type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2015' ... --- _id: '2014' 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. author: - first_name: Anna full_name: Klimova, Anna id: 31934120-F248-11E8-B48F-1D18A9856A87 last_name: Klimova - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Tamás full_name: Rudas, Tamás last_name: Rudas 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 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 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. 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. ista: Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 87(7), 57–72. 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. date_created: 2018-12-11T11:55:13Z date_published: 2015-07-01T00:00:00Z date_updated: 2021-01-12T06:54:43Z day: '01' department: - _id: CaUh doi: 10.1016/j.csda.2015.01.017 intvolume: ' 87' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1404.6617 month: '07' oa: 1 oa_version: Preprint page: 57 - 72 publication: Computational Statistics & Data Analysis publication_status: published publisher: Elsevier publist_id: '5062' quality_controlled: '1' scopus_import: 1 status: public title: Faithfulness and learning hypergraphs from discrete distributions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 87 year: '2015' ... --- _id: '2025' abstract: - lang: eng 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. author: - first_name: Daiki full_name: Kawada, Daiki last_name: Kawada - first_name: Hiromu full_name: Kobayashi, Hiromu last_name: Kobayashi - first_name: Tsuyoshi full_name: Tomita, Tsuyoshi last_name: Tomita - first_name: Eisuke full_name: Nakata, Eisuke last_name: Nakata - first_name: Makoto full_name: Nagano, Makoto last_name: Nagano - first_name: Daria E full_name: Siekhaus, Daria E id: 3D224B9E-F248-11E8-B48F-1D18A9856A87 last_name: Siekhaus orcid: 0000-0001-8323-8353 - first_name: Junko full_name: Toshima, Junko last_name: Toshima - first_name: Jiro full_name: Toshimaa, Jiro last_name: Toshimaa 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 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 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. 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. 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. 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. 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. date_created: 2018-12-11T11:55:17Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T06:54:48Z day: '01' ddc: - '570' department: - _id: DaSi doi: 10.1016/j.bbamcr.2014.10.009 file: - access_level: open_access checksum: 5bb328edebb6a91337cadd7d63f961b7 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:18Z date_updated: 2020-07-14T12:45:25Z file_id: '4936' file_name: IST-2016-615-v1+1_BBAMCR.pdf file_size: 926685 relation: main_file file_date_updated: 2020-07-14T12:45:25Z has_accepted_license: '1' intvolume: ' 1853' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 144 - 156 publication: Biochimica et Biophysica Acta - Molecular Cell Research publication_status: published publisher: Elsevier publist_id: '5047' pubrep_id: '615' quality_controlled: '1' scopus_import: 1 status: public title: The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1853 year: '2015' ... --- _id: '2030' 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. author: - first_name: Liang full_name: Shi, Liang id: 374A3F1A-F248-11E8-B48F-1D18A9856A87 last_name: Shi - first_name: Markus full_name: Rampp, Markus last_name: Rampp - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 - first_name: Marc full_name: Avila, Marc last_name: Avila citation: 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 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 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. 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. 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. 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. short: L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11. date_created: 2018-12-11T11:55:18Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T06:54:51Z day: '01' department: - _id: BjHo doi: 10.1016/j.compfluid.2014.09.021 intvolume: ' 106' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1311.2481 month: '01' oa: 1 oa_version: Preprint page: 1 - 11 publication: Computers and Fluids publication_status: published publisher: Elsevier publist_id: '5042' quality_controlled: '1' scopus_import: 1 status: public title: A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 106 year: '2015' ... --- _id: '2035' 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" 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. author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Grzegorz full_name: Jablonski, Grzegorz id: 4483EF78-F248-11E8-B48F-1D18A9856A87 last_name: Jablonski orcid: 0000-0002-3536-9866 - first_name: Marian full_name: Mrozek, Marian last_name: Mrozek citation: 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 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. 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. 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. short: H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244. date_created: 2018-12-11T11:55:20Z date_published: 2015-10-01T00:00:00Z date_updated: 2021-01-12T06:54:53Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s10208-014-9223-y ec_funded: 1 file: - access_level: open_access checksum: 3566f3a8b0c1bc550e62914a88c584ff content_type: application/pdf creator: system date_created: 2018-12-12T10:08:10Z date_updated: 2020-07-14T12:45:26Z file_id: '4670' file_name: IST-2016-486-v1+1_s10208-014-9223-y.pdf file_size: 1317546 relation: main_file file_date_updated: 2020-07-14T12:45:26Z has_accepted_license: '1' intvolume: ' 15' issue: '5' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 1213 - 1244 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: Foundations of Computational Mathematics publication_status: published publisher: Springer publist_id: '5022' pubrep_id: '486' quality_controlled: '1' scopus_import: 1 status: public title: The persistent homology of a self-map tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2015' ... --- _id: '2034' 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. author: - first_name: Béatrice full_name: Bérard, Béatrice last_name: Bérard - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nathalie full_name: Sznajder, Nathalie last_name: Sznajder citation: 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 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 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. 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. ista: Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 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. short: B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59. date_created: 2018-12-11T11:55:20Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T06:54:52Z day: '01' department: - _id: KrCh doi: 10.1016/j.ipl.2014.09.001 ec_funded: 1 intvolume: ' 115' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1407.4225 month: '01' oa: 1 oa_version: Preprint page: 52 - 59 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: ' Information Processing Letters' publication_status: published publisher: Elsevier publist_id: '5025' quality_controlled: '1' scopus_import: 1 status: public title: Probabilistic opacity for Markov decision processes type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 115 year: '2015' ... --- _id: '2085' abstract: - lang: eng 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. ' author: - first_name: Phan full_name: Nam, Phan id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Nam - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 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 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. 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. 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. short: P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417. date_created: 2018-12-11T11:55:37Z date_published: 2015-02-01T00:00:00Z date_updated: 2021-01-12T06:55:13Z day: '01' department: - _id: RoSe doi: 10.1007/s00205-014-0781-6 intvolume: ' 215' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1402.1153 month: '02' oa: 1 oa_version: Preprint page: 381 - 417 publication: Archive for Rational Mechanics and Analysis publication_status: published publisher: Springer publist_id: '4951' quality_controlled: '1' scopus_import: 1 status: public title: Collective excitations of Bose gases in the mean-field regime type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 215 year: '2015' ... --- _id: '2166' 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). ' author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Antti full_name: Knowles, Antti last_name: Knowles citation: 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' 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' 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.' 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.' 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.' 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. date_created: 2018-12-11T11:56:05Z date_published: 2015-02-01T00:00:00Z date_updated: 2021-01-12T06:55:43Z day: '01' department: - _id: LaEr doi: 10.1007/s00220-014-2119-5 intvolume: ' 333' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1309.5106 month: '02' oa: 1 oa_version: Preprint page: 1365 - 1416 publication: Communications in Mathematical Physics publication_status: published publisher: Springer publist_id: '4818' quality_controlled: '1' scopus_import: 1 status: public title: 'The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 333 year: '2015' ... --- _id: '1832' 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. ' article_number: '20' article_processing_charge: No article_type: original author: - first_name: Soham full_name: Chakraborty, Soham last_name: Chakraborty - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Ali full_name: Sezgin, Ali last_name: Sezgin - first_name: Viktor full_name: Vafeiadis, Viktor last_name: Vafeiadis citation: 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 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 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. 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. ista: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20. 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). date_created: 2018-12-11T11:54:15Z date_published: 2015-04-01T00:00:00Z date_updated: 2023-02-23T10:38:13Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.2168/LMCS-11(1:20)2015 ec_funded: 1 file: - access_level: open_access checksum: 7370e164d0a731f442424a92669efc34 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:27Z date_updated: 2020-07-14T12:45:17Z file_id: '4881' file_name: IST-2015-390-v1+1_1502.07639.pdf file_size: 380203 relation: main_file file_date_updated: 2020-07-14T12:45:17Z has_accepted_license: '1' intvolume: ' 11' issue: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: Logical Methods in Computer Science publication_status: published publisher: International Federation of Computational Logic publist_id: '5271' pubrep_id: '390' quality_controlled: '1' related_material: record: - id: '2328' relation: earlier_version status: public scopus_import: 1 status: public title: Aspect-oriented linearizability proofs tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2015' ... --- _id: '2271' abstract: - lang: eng 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. " author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Johan full_name: Thapper, Johan last_name: Thapper - first_name: Stanislav full_name: Živný, Stanislav last_name: Živný citation: 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 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 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. 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. 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. 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. short: V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36. date_created: 2018-12-11T11:56:41Z date_published: 2015-02-01T00:00:00Z date_updated: 2023-02-23T10:46:30Z day: '01' department: - _id: VlKo doi: 10.1137/130945648 external_id: arxiv: - '1311.4219' intvolume: ' 44' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1311.4219 month: '02' oa: 1 oa_version: Preprint page: 1 - 36 publication: SIAM Journal on Computing publication_status: published publisher: SIAM publist_id: '4673' quality_controlled: '1' related_material: record: - id: '2518' relation: earlier_version status: public scopus_import: 1 status: public title: The power of linear programming for general-valued CSPs type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 44 year: '2015' ... --- _id: '257' abstract: - lang: eng 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. 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. author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Ritabrata full_name: Munshi, Ritabrata last_name: Munshi citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:45:28Z date_published: 2015-07-10T00:00:00Z date_updated: 2021-01-12T06:58:18Z day: '10' doi: 10.1515/forum-2013-6024 extern: 1 intvolume: ' 27' issue: '4' main_file_link: - open_access: '1' url: https://arxiv.org/abs/1302.2434 month: '07' oa: 1 page: 2025 - 2050 publication: Forum Mathematicum publication_status: published publisher: Walter de Gruyter GmbH publist_id: '7645' quality_controlled: 0 status: public title: Pairs of diagonal quadratic forms and linear correlations among sums of two squares type: journal_article volume: 27 year: '2015' ... --- _id: '258' 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. author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 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' 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 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. 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. ista: 'Browning TD. 2015.A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. , 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. date_created: 2018-12-11T11:45:28Z date_published: 2015-08-01T00:00:00Z date_updated: 2021-01-12T06:58:22Z day: '01' doi: 10.1017/CBO9781316106877.009 extern: '1' language: - iso: eng month: '08' oa_version: None page: 89 - 113 publication: Arithmetic and Geometry publication_status: published publisher: Cambridge University Press publist_id: '7644' quality_controlled: '1' status: public title: A survey of applications of the circle method to rational points type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2015' ... --- _id: '259' abstract: - lang: eng text: 'The Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field ' acknowledgement: "EP/J018260/1\tEngineering and Physical Sciences Research Council EPSRC" author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Pankaj full_name: Vishe, Pankaj last_name: Vishe citation: 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 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 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. 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. ista: Browning TD, Vishe P. 2015. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 25(3), 671–732. 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. date_created: 2018-12-11T11:45:29Z date_published: 2015-06-11T00:00:00Z date_updated: 2021-01-12T06:58:25Z day: '11' doi: 10.1007/s00039-015-0328-5 extern: 1 intvolume: ' 25' issue: '3' month: '06' page: 671 - 732 publication: Geometric and Functional Analysis publication_status: published publisher: Birkhäuser publist_id: '7643' quality_controlled: 0 status: public title: 'Rational points on cubic hypersurfaces over F_q(t) ' type: journal_article volume: 25 year: '2015' ... --- _id: '1598' abstract: - lang: eng 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.' 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" article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Manas full_name: Joglekar, Manas last_name: Joglekar - first_name: Nisarg full_name: Shah, Nisarg last_name: Shah citation: 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 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 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. 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. 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. 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. short: K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89. date_created: 2018-12-11T11:52:56Z date_published: 2015-03-30T00:00:00Z date_updated: 2023-02-23T10:55:03Z day: '30' department: - _id: KrCh doi: 10.1016/j.tcs.2015.01.050 ec_funded: 1 external_id: arxiv: - '1202.4175' intvolume: ' 573' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1202.4175 month: '03' oa: 1 oa_version: Preprint page: 71 - 89 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Theoretical Computer Science publication_status: published publisher: Elsevier publist_id: '5571' quality_controlled: '1' related_material: record: - id: '2715' relation: earlier_version status: public scopus_import: 1 status: public title: Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 573 year: '2015' ... --- _id: '1805' 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.' author: - first_name: Dominique full_name: Attali, Dominique last_name: Attali - first_name: Ulrich full_name: Bauer, Ulrich id: 2ADD483A-F248-11E8-B48F-1D18A9856A87 last_name: Bauer orcid: 0000-0002-9683-0724 - first_name: Olivier full_name: Devillers, Olivier last_name: Devillers - first_name: Marc full_name: Glisse, Marc last_name: Glisse - first_name: André full_name: Lieutier, André last_name: Lieutier citation: 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' 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' 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.' 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.' 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.' 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_created: 2018-12-11T11:54:06Z date_published: 2015-06-03T00:00:00Z date_updated: 2023-02-23T10:59:19Z day: '03' department: - _id: HeEd doi: 10.1016/j.comgeo.2014.08.010 ec_funded: 1 intvolume: ' 48' issue: '8' language: - iso: eng month: '06' oa_version: None page: 606 - 621 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: 'Computational Geometry: Theory and Applications' publication_status: published publisher: Elsevier publist_id: '5305' quality_controlled: '1' related_material: record: - id: '2812' relation: earlier_version status: public scopus_import: 1 status: public title: Homological reconstruction and simplification in R3 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2015' ... --- _id: '333' 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. ' article_processing_charge: No article_type: original author: - first_name: Marc full_name: Walter, Marc last_name: Walter - first_name: Kostiantyn full_name: Kravchyk, Kostiantyn last_name: Kravchyk - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Maksym full_name: Kovalenko, Maksym last_name: Kovalenko 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:45:52Z date_published: 2015-10-16T00:00:00Z date_updated: 2021-01-12T07:42:42Z day: '16' doi: 10.1021/acs.chemmater.5b03531 extern: '1' intvolume: ' 27' issue: '21' language: - iso: eng month: '10' oa_version: None page: 7452 - 7458 publication: Chemistry of Materials publication_status: published publisher: ACS publist_id: '7507' quality_controlled: '1' status: public title: Efficient and inexpensive sodium magnesium hybrid battery type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2015' ... --- _id: '354' 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. ' 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. article_processing_charge: No article_type: original author: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Rachel full_name: Korkosz, Rachel last_name: Korkosz - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - first_name: Pau full_name: Riba, Pau last_name: Riba - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Silvia full_name: Ortega, Silvia last_name: Ortega - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot - first_name: Mercouri full_name: Kanatzidis, Mercouri last_name: Kanatzidis citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:45:59Z date_published: 2015-03-11T00:00:00Z date_updated: 2021-01-12T07:44:10Z day: '11' doi: 10.1021/jacs.5b00091 extern: '1' intvolume: ' 137' issue: '12' language: - iso: eng month: '03' oa_version: None page: 4046 - 4049 publication: Journal of the American Chemical Society publication_status: published publisher: American Chemical Society publist_id: '7470' quality_controlled: '1' status: public title: Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 137 year: '2015' ... --- _id: '360' 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. ' article_processing_charge: No author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Jingjing full_name: Liu, Jingjing last_name: Liu - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Guangjin full_name: Zhang, Guangjin last_name: Zhang - first_name: Yihe full_name: Zhang, Yihe last_name: Zhang - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot 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 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. 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. 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. date_created: 2018-12-11T11:46:01Z date_published: 2015-09-29T00:00:00Z date_updated: 2021-01-12T07:44:34Z day: '29' doi: 10.1021/acs.langmuir.5b02490 extern: '1' intvolume: ' 31' issue: '38' language: - iso: eng month: '09' oa_version: None page: 10555 - 10561 publication: Langmuir publication_status: published publisher: American Chemical Society publist_id: '7467' status: public title: Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2015' ... --- _id: '362' abstract: - lang: eng 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. ' article_processing_charge: No author: - first_name: Zhishan full_name: Lu, Zhishan last_name: Lu - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Ana full_name: Antolín, Ana last_name: Antolín - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Sandra full_name: Contreras, Sandra last_name: Contreras - first_name: Francesc full_name: Medina, Francesc last_name: Medina - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: 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 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 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. 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. 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. 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. 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. date_created: 2018-12-11T11:46:02Z date_published: 2015-04-07T00:00:00Z date_updated: 2021-01-12T07:44:42Z day: '07' doi: 10.1021/la504906q extern: '1' intvolume: ' 31' issue: '13' language: - iso: eng month: '04' oa_version: None page: 3952 - 3957 publication: Langmuir publication_status: published publisher: American Chemical Society publist_id: '7469' status: public title: Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2015' ... --- _id: '1731' abstract: - lang: eng 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. ' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Hugo full_name: Gimbert, Hugo last_name: Gimbert - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: 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 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 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. 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. ista: Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16. 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. date_created: 2018-12-11T11:53:42Z date_published: 2015-12-01T00:00:00Z date_updated: 2023-02-23T11:45:42Z day: '01' department: - _id: KrCh - _id: ToHe doi: 10.1016/j.ic.2015.06.003 ec_funded: 1 intvolume: ' 245' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1006.0673 month: '12' oa: 1 oa_version: Preprint page: 3 - 16 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25EFB36C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '215543' name: COMponent-Based Embedded Systems design Techniques - _id: 25F1337C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '214373' name: Design for Embedded Systems - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Information and Computation publication_status: published publisher: Elsevier publist_id: '5395' quality_controlled: '1' related_material: record: - id: '3856' relation: earlier_version status: public scopus_import: 1 status: public title: Randomness for free type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 245 year: '2015' ... --- _id: '334' 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. 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. article_processing_charge: No article_type: original author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Jingjing full_name: Liu, Jingjing last_name: Liu - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Guangjin full_name: Zhang, Guangjin last_name: Zhang - first_name: Yihe full_name: Zhang, Yihe last_name: Zhang - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot 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 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. 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. 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. date_created: 2018-12-11T11:45:52Z date_published: 2015-09-07T00:00:00Z date_updated: 2021-01-12T07:42:46Z day: '07' doi: 10.1021/acs.langmuir.5b02490 extern: '1' intvolume: ' 31' issue: '38' language: - iso: eng month: '09' oa_version: None page: 10555 - 10561 publication: Langmuir publication_status: published publisher: American Chemical Society publist_id: '7508' quality_controlled: '1' status: public title: Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2015' ... --- _id: '361' abstract: - lang: eng 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. 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. article_processing_charge: No author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Xiaoqiang full_name: An, Xiaoqiang last_name: An - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Yihe full_name: Zhang, Yihe last_name: Zhang - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:46:01Z date_published: 2015-08-26T00:00:00Z date_updated: 2021-01-12T07:44:38Z day: '26' doi: 10.1021/acs.jpcc.5b06199 extern: '1' intvolume: ' 119' issue: '38' language: - iso: eng month: '08' oa_version: None page: 21882 - 21888 publication: Journal of Physical Chemistry C publication_status: published publisher: American Chemical Society publist_id: '7468' status: public title: Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2015' ... --- _id: '1856' 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.' article_number: '9' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Barbara full_name: Jobstmann, Barbara last_name: Jobstmann - first_name: Rohit full_name: Singh, Rohit last_name: Singh 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 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. 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. 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. short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015). date_created: 2018-12-11T11:54:23Z date_published: 2015-02-01T00:00:00Z date_updated: 2023-02-23T11:46:04Z day: '01' department: - _id: KrCh - _id: ToHe doi: 10.1145/2699430 ec_funded: 1 intvolume: ' 62' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1004.0739 month: '02' oa: 1 oa_version: Preprint project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Journal of the ACM publication_status: published publisher: ACM publist_id: '5244' quality_controlled: '1' related_material: record: - id: '3864' relation: earlier_version status: public scopus_import: 1 status: public title: Measuring and synthesizing systems in probabilistic environments type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 62 year: '2015' ... --- _id: '388' 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. article_processing_charge: No article_type: original author: - first_name: Zhanybek full_name: Alpichshev, Zhanybek id: 45E67A2A-F248-11E8-B48F-1D18A9856A87 last_name: Alpichshev orcid: 0000-0002-7183-5203 - first_name: Fahad full_name: Mahmood, Fahad last_name: Mahmood - first_name: Gang full_name: Cao, Gang last_name: Cao - first_name: Nuh full_name: Gedik, Nuh last_name: Gedik citation: 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 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 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. 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). 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. short: Z. Alpichshev, F. Mahmood, G. Cao, N. Gedik, Physical Review Letters 114 (2015). date_created: 2018-12-11T11:46:11Z date_published: 2015-07-07T00:00:00Z date_updated: 2021-01-12T07:52:54Z day: '07' doi: 10.1103/PhysRevLett.114.017203 extern: '1' intvolume: ' 114' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://dspace.mit.edu/handle/1721.1/92979 month: '07' oa: 1 oa_version: Published Version publication: Physical Review Letters publication_status: published publisher: American Physical Society publist_id: '7441' quality_controlled: '1' status: public title: Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2015' ... --- _id: '1661' abstract: - lang: eng 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. 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.' article_number: '7174888' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer 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' 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' 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. 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. 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.' 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. short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015. conference: end_date: 2015-07-10 location: Kyoto, Japan name: 'LICS: Logic in Computer Science' start_date: 2015-07-06 date_created: 2018-12-11T11:53:19Z date_published: 2015-07-01T00:00:00Z date_updated: 2023-02-23T12:20:05Z day: '01' department: - _id: KrCh doi: 10.1109/LICS.2015.34 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprints.cs.univie.ac.at/4368/ month: '07' oa: 1 oa_version: Submitted Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Proceedings - Symposium on Logic in Computer Science publication_status: published publisher: IEEE publist_id: '5489' quality_controlled: '1' related_material: record: - id: '464' relation: later_version status: public scopus_import: '1' status: public title: Improved algorithms for one-pair and k-pair Streett objectives type: conference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 2015-July year: '2015' ... --- _id: '473' abstract: - lang: eng 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. author: - first_name: Mathieu full_name: Lewin, Mathieu last_name: Lewin - first_name: Nam full_name: Phan Thanh, Nam id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Phan Thanh - first_name: Nicolas full_name: Rougerie, Nicolas last_name: Rougerie citation: 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 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 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. 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. 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. short: M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115. date_created: 2018-12-11T11:46:40Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T08:00:52Z day: '01' ddc: - '539' department: - _id: RoSe doi: 10.5802/jep.18 ec_funded: 1 file: - access_level: open_access checksum: a40eb4016717ddc9927154798a4c164a content_type: application/pdf creator: system date_created: 2018-12-12T10:12:53Z date_updated: 2020-07-14T12:46:35Z file_id: '4974' file_name: IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf file_size: 1084254 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 2' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 65 - 115 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Journal de l'Ecole Polytechnique - Mathematiques publication_status: published publisher: Ecole Polytechnique publist_id: '7344' pubrep_id: '951' quality_controlled: '1' scopus_import: 1 status: public title: Derivation of nonlinear gibbs measures from many-body quantum mechanics tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2015' ... --- _id: '477' 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. author: - first_name: Katrin full_name: Holst, Katrin last_name: Holst - first_name: Daria full_name: Guseva, Daria last_name: Guseva - first_name: Susann full_name: Schindler, Susann last_name: Schindler - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Armin full_name: Braun, Armin last_name: Braun - first_name: Himpriya full_name: Chopra, Himpriya last_name: Chopra - first_name: Oliver full_name: Pabst, Oliver last_name: Pabst - first_name: Evgeni full_name: Ponimaskin, Evgeni last_name: Ponimaskin 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:46:41Z date_published: 2015-06-15T00:00:00Z date_updated: 2021-01-12T08:00:54Z day: '15' department: - _id: MiSi doi: 10.1242/jcs.167999 intvolume: ' 128' issue: '15' language: - iso: eng month: '06' oa_version: None page: 2866 - 2880 publication: Journal of Cell Science publication_status: published publisher: Company of Biologists publist_id: '7343' quality_controlled: '1' scopus_import: 1 status: public title: The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 128 year: '2015' ... --- _id: '523' 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. author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Mickael full_name: Randour, Mickael last_name: Randour - first_name: Jean full_name: Raskin, Jean last_name: Raskin 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:46:57Z date_published: 2015-03-24T00:00:00Z date_updated: 2023-02-23T10:36:02Z day: '24' department: - _id: KrCh doi: 10.1016/j.ic.2015.03.010 ec_funded: 1 intvolume: ' 242' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1302.4248 month: '03' oa: 1 oa_version: Preprint page: 25 - 52 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Information and Computation publication_status: published publisher: Elsevier publist_id: '7296' quality_controlled: '1' related_material: record: - id: '2279' relation: earlier_version status: public scopus_import: 1 status: public title: Looking at mean-payoff and total-payoff through windows type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 242 year: '2015' ... --- _id: '532' abstract: - lang: eng 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. author: - first_name: Wenyang full_name: Li, Wenyang last_name: Li - first_name: Mengdi full_name: Ma, Mengdi last_name: Ma - first_name: Ying full_name: Feng, Ying last_name: Feng - first_name: Hongjiang full_name: Li, Hongjiang id: 33CA54A6-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0001-5039-9660 - first_name: Yichuan full_name: Wang, Yichuan last_name: Wang - first_name: Yutong full_name: Ma, Yutong last_name: Ma - first_name: Mingzhe full_name: Li, Mingzhe last_name: Li - first_name: Fengying full_name: An, Fengying last_name: An - first_name: Hongwei full_name: Guo, Hongwei last_name: Guo citation: 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 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 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. 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. 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. 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. date_created: 2018-12-11T11:47:00Z date_published: 2015-10-22T00:00:00Z date_updated: 2021-01-12T08:01:27Z day: '22' department: - _id: JiFr doi: 10.1016/j.cell.2015.09.037 intvolume: ' 163' issue: '3' language: - iso: eng month: '10' oa_version: None page: 670 - 683 publication: Cell publication_status: published publisher: Cell Press publist_id: '7285' quality_controlled: '1' scopus_import: 1 status: public title: EIN2-directed translational regulation of ethylene signaling in arabidopsis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 163 year: '2015' ... --- _id: '524' abstract: - lang: eng 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.' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 citation: 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 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 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. 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. ista: Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 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. short: K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24. date_created: 2018-12-11T11:46:57Z date_published: 2015-10-11T00:00:00Z date_updated: 2023-02-23T12:24:45Z day: '11' department: - _id: KrCh doi: 10.1016/j.ic.2015.03.009 external_id: arxiv: - '1409.5306' intvolume: ' 242' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1409.5306 month: '10' oa: 1 oa_version: Preprint page: 2 - 24 publication: Information and Computation publication_status: published publisher: Elsevier publist_id: '7295' quality_controlled: '1' related_material: record: - id: '5403' relation: earlier_version status: public scopus_import: 1 status: public title: Qualitative analysis of concurrent mean payoff games type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 242 year: '2015' ... --- _id: '1481' 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. ' acknowledgement: "A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n" article_processing_charge: No author: - first_name: Umair full_name: Ahmed, Umair last_name: Ahmed - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Sumit full_name: Gulwani, Sumit last_name: Gulwani citation: 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.' 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.' 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. 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. 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.' 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. conference: end_date: 2015-01-30 location: Austin, TX, USA name: 'AAAI: Conference on Artificial Intelligence' start_date: 2015-01-25 date_created: 2018-12-11T11:52:16Z date_published: 2015-01-01T00:00:00Z date_updated: 2023-02-23T12:25:07Z day: '01' department: - _id: KrCh ec_funded: 1 intvolume: ' 2' language: - iso: eng main_file_link: - open_access: '1' url: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300 month: '01' oa: 1 oa_version: None page: 745 - 752 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence publication_status: published publisher: AAAI Press publist_id: '5713' quality_controlled: '1' related_material: record: - id: '5410' relation: earlier_version status: public scopus_import: 1 status: public title: Automatic generation of alternative starting positions for simple traditional board games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2015' ... --- _id: '1732' 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. author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik - first_name: Raghav full_name: Gupta, Raghav last_name: Gupta - first_name: Ayush full_name: Kanodia, Ayush last_name: Kanodia 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' 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. 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.' 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. short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330. conference: end_date: 2015-05-30 location: Seattle, WA, United States name: 'ICRA: International Conference on Robotics and Automation' start_date: 2015-05-26 date_created: 2018-12-11T11:53:43Z date_published: 2015-01-01T00:00:00Z date_updated: 2023-02-23T12:25:52Z day: '01' department: - _id: KrCh doi: 10.1109/ICRA.2015.7139019 ec_funded: 1 external_id: arxiv: - '1409.3360' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1409.3360 month: '01' oa: 1 oa_version: Preprint page: 325 - 330 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication_status: published publisher: IEEE publist_id: '5394' quality_controlled: '1' related_material: record: - id: '5424' relation: earlier_version status: public - id: '5426' relation: earlier_version status: public scopus_import: 1 status: public title: Qualitative analysis of POMDPs with temporal logic specifications for robotics applications type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2015' ... --- _id: '5431' 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." alternative_title: - IST Austria Technical Report author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Kristoffer full_name: Hansen, Kristoffer last_name: Hansen citation: 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 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 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. ieee: K. Chatterjee, R. Ibsen-Jensen, and 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. 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. date_created: 2018-12-12T11:39:17Z date_published: 2015-02-19T00:00:00Z date_updated: 2021-01-12T08:02:13Z day: '19' ddc: - '005' - '519' department: - _id: KrCh doi: 10.15479/AT:IST-2015-322-v1-1 file: - access_level: open_access checksum: bfb858262c30445b8e472c40069178a2 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:31Z date_updated: 2020-07-14T12:46:53Z file_id: '5491' file_name: IST-2015-322-v1+1_safetygames.pdf file_size: 661015 relation: main_file file_date_updated: 2020-07-14T12:46:53Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '25' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '322' status: public title: The patience of concurrent stochastic games with safety and reachability objectives type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2015' ...