--- _id: '2261' abstract: - lang: eng text: To reveal the full potential of human pluripotent stem cells, new methods for rapid, site-specific genomic engineering are needed. Here, we describe a system for precise genetic modification of human embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located in a safe, intergenic, transcriptionally active region of chromosome 22, as the recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient cell lines were established by site-specific placement of a ‘landing pad’ cassette carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE) mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This system provided complete control over content, direction and copy number of inserted genes, with a specificity of 100%. A series of genes, including mCherry and various combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from a Parkinson’s disease patient and a normal sibling control. The DICE system offers rapid, efficient and precise gene insertion in ESC and iPSC and is particularly well suited for repeated modifications of the same locus. acknowledgement: "California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]. Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]\r\nCC BY 3,0" article_number: e34 author: - first_name: Fangfang full_name: Zhu, Fangfang last_name: Zhu - first_name: Matthew full_name: Gamboa, Matthew last_name: Gamboa - first_name: Alfonso full_name: Farruggio, Alfonso last_name: Farruggio - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Bosiljka full_name: Tasic, Bosiljka last_name: Tasic - first_name: Birgitt full_name: Schüle, Birgitt last_name: Schüle - first_name: Yanru full_name: Chen Tsai, Yanru last_name: Chen Tsai - first_name: Michele full_name: Calos, Michele last_name: Calos citation: ama: Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 2014;42(5). doi:10.1093/nar/gkt1290 apa: Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B., … Calos, M. (2014). DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gkt1290 chicago: Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic Acids Research. Oxford University Press, 2014. https://doi.org/10.1093/nar/gkt1290. ieee: F. Zhu et al., “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” Nucleic Acids Research, vol. 42, no. 5. Oxford University Press, 2014. ista: Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 42(5), e34. mla: Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic Acids Research, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:10.1093/nar/gkt1290. short: F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014). date_created: 2018-12-11T11:56:38Z date_published: 2014-03-05T00:00:00Z date_updated: 2021-01-12T06:56:22Z day: '05' ddc: - '571' - '610' department: - _id: SiHi doi: 10.1093/nar/gkt1290 file: - access_level: open_access checksum: e9268f5f96a820f04d7ebbf85927c3cb content_type: application/pdf creator: system date_created: 2018-12-12T10:09:15Z date_updated: 2020-07-14T12:45:35Z file_id: '4738' file_name: IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf file_size: 11044478 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 42' issue: '5' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '03' oa: 1 oa_version: Preprint publication: Nucleic Acids Research publication_status: published publisher: Oxford University Press publist_id: '4684' pubrep_id: '961' quality_controlled: '1' scopus_import: 1 status: public title: DICE, an efficient system for iterative genomic editing in human pluripotent stem cells 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: 42 year: '2014' ... --- _id: '2265' abstract: - lang: eng text: Coordinated migration of newly-born neurons to their target territories is essential for correct neuronal circuit assembly in the developing brain. Although a cohort of signaling pathways has been implicated in the regulation of cortical projection neuron migration, the precise molecular mechanisms and how a balanced interplay of cell-autonomous and non-autonomous functions of candidate signaling molecules controls the discrete steps in the migration process, are just being revealed. In this chapter, I will focally review recent advances that improved our understanding of the cell-autonomous and possible cell-nonautonomous functions of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential steps of cortical projection neuron migration. I will then elaborate on the emerging concept that the Reelin signaling pathway, acts exactly at precise stages in the course of cortical projection neuron migration. Lastly, I will discuss how finely tuned transcriptional programs and downstream effectors govern particular aspects in driving radial migration at discrete stages and how they regulate the precise positioning of cortical projection neurons in the developing cerebral cortex. alternative_title: - Advances in Experimental Medicine and Biology author: - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: 'Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1' apa: Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1 chicago: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” In Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014. https://doi.org/10.1007/978-94-007-7687-6_1. ieee: S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical projection neuron migration,” in Cellular and Molecular Control of Neuronal Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24. ista: 'Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.' mla: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1. short: S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24. date_created: 2018-12-11T11:56:39Z date_published: 2014-01-01T00:00:00Z date_updated: 2021-01-12T06:56:23Z day: '01' department: - _id: SiHi doi: 10.1007/978-94-007-7687-6_1 editor: - first_name: Laurent full_name: Nguyen, Laurent last_name: Nguyen intvolume: ' 800' language: - iso: eng month: '01' oa_version: None page: 1 - 24 publication: ' Cellular and Molecular Control of Neuronal Migration' publication_status: published publisher: Springer publist_id: '4679' quality_controlled: '1' scopus_import: 1 status: public title: Molecular pathways controlling the sequential steps of cortical projection neuron migration type: book_chapter user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 800 year: '2014' ... --- _id: '2275' abstract: - lang: eng text: "Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. \r\nThis partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary costs (uCSP), which can be efficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. \r\nOur main application of interest is curvature regularization. In the context of segmentation, our partial enumeration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.\r\n" author: - first_name: Carl full_name: Olsson, Carl last_name: Olsson - first_name: Johannes full_name: Ulen, Johannes last_name: Ulen - first_name: Yuri full_name: Boykov, Yuri last_name: Boykov - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:10.1109/ICCV.2013.365' apa: 'Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365' chicago: Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365. ieee: 'C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.' ista: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943.' mla: Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365. short: C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943. conference: end_date: 2013-12-08 location: Sydney, Australia name: 'ICCV: International Conference on Computer Vision' start_date: 2013-12-01 date_created: 2018-12-11T11:56:42Z date_published: 2014-03-03T00:00:00Z date_updated: 2021-01-12T06:56:28Z day: '03' ddc: - '000' department: - _id: VlKo doi: 10.1109/ICCV.2013.365 file: - access_level: open_access checksum: 4a74b5c92d6dcd2348c2c10ec8dd18bf content_type: application/pdf creator: system date_created: 2018-12-12T10:09:30Z date_updated: 2020-07-14T12:45:36Z file_id: '4754' file_name: IST-2016-566-v1+1_iccv13_part_enumeration.pdf file_size: 378601 relation: main_file file_date_updated: 2020-07-14T12:45:36Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 2936 - 2943 publication_status: published publisher: IEEE publist_id: '4669' pubrep_id: '566' quality_controlled: '1' scopus_import: 1 status: public title: Partial enumeration and curvature regularization type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2285' abstract: - lang: eng text: GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity. acknowledgement: 'Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505, SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation); Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript. They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical assistance.' author: - first_name: Jonas full_name: Hosp, Jonas last_name: Hosp - first_name: Michael full_name: Strüber, Michael last_name: Strüber - first_name: Yuchio full_name: Yanagawa, Yuchio last_name: Yanagawa - first_name: Kunihiko full_name: Obata, Kunihiko last_name: Obata - first_name: Imre full_name: Vida, Imre last_name: Vida - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 - first_name: Marlene full_name: Bartos, Marlene last_name: Bartos citation: ama: Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 2014;23(2):189-203. doi:10.1002/hipo.22214 apa: Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., & Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.22214 chicago: Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida, Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” Hippocampus. Wiley-Blackwell, 2014. https://doi.org/10.1002/hipo.22214. ieee: J. Hosp et al., “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” Hippocampus, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014. ista: Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 23(2), 189–203. mla: Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” Hippocampus, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:10.1002/hipo.22214. short: J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203. date_created: 2018-12-11T11:56:46Z date_published: 2014-02-01T00:00:00Z date_updated: 2021-01-12T06:56:32Z day: '01' ddc: - '570' department: - _id: PeJo doi: 10.1002/hipo.22214 file: - access_level: open_access checksum: ff6bc75a79dbc985a2e31b79253e6444 content_type: application/pdf creator: system date_created: 2018-12-12T10:15:54Z date_updated: 2020-07-14T12:45:37Z file_id: '5178' file_name: IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf file_size: 801589 relation: main_file file_date_updated: 2020-07-14T12:45:37Z has_accepted_license: '1' intvolume: ' 23' issue: '2' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '02' oa: 1 oa_version: Published Version page: 189 - 203 publication: Hippocampus publication_status: published publisher: Wiley-Blackwell publist_id: '4646' pubrep_id: '461' quality_controlled: '1' scopus_import: 1 status: public title: Morpho-physiological criteria divide dentate gyrus interneurons into classes tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2014' ... --- _id: '2407' abstract: - lang: eng text: 'Two definitions of the effective mass of a particle interacting with a quantum field, such as a polaron, are considered and shown to be equal in models similar to the Fröhlich polaron model. These are: 1. the mass defined by the low momentum energy E(P)≈E(0)+P2/2 M of the translation invariant system constrained to have momentum P and 2. the mass M of a simple particle in an arbitrary slowly varying external potential, V, described by the nonrelativistic Schrödinger equation, whose ground state energy equals that of the combined particle/field system in a bound state in the same V.' author: - first_name: Élliott full_name: Lieb, Élliott last_name: Lieb - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Lieb É, Seiringer R. Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. 2014;154(1-2):51-57. doi:10.1007/s10955-013-0791-z apa: Lieb, É., & Seiringer, R. (2014). Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-013-0791-z chicago: Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the Effective Mass of a Polaron.” Journal of Statistical Physics. Springer, 2014. https://doi.org/10.1007/s10955-013-0791-z. ieee: É. Lieb and R. Seiringer, “Equivalence of two definitions of the effective mass of a polaron,” Journal of Statistical Physics, vol. 154, no. 1–2. Springer, pp. 51–57, 2014. ista: Lieb É, Seiringer R. 2014. Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. 154(1–2), 51–57. mla: Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the Effective Mass of a Polaron.” Journal of Statistical Physics, vol. 154, no. 1–2, Springer, 2014, pp. 51–57, doi:10.1007/s10955-013-0791-z. short: É. Lieb, R. Seiringer, Journal of Statistical Physics 154 (2014) 51–57. date_created: 2018-12-11T11:57:29Z date_published: 2014-01-01T00:00:00Z date_updated: 2021-01-12T06:57:18Z day: '01' doi: 10.1007/s10955-013-0791-z extern: '1' intvolume: ' 154' issue: 1-2 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1304.1780 month: '01' oa: 1 oa_version: Submitted Version page: 51 - 57 project: - _id: 26450934-B435-11E9-9278-68D0E5697425 name: NSERC Postdoctoral fellowship publication: Journal of Statistical Physics publication_status: published publisher: Springer publist_id: '4519' quality_controlled: '1' status: public title: Equivalence of two definitions of the effective mass of a polaron type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 154 year: '2014' ... --- _id: '248' abstract: - lang: eng text: For any pencil of conics or higher-dimensional quadrics over ℚ, with all degenerate fibres defined over ℚ, we show that the Brauer–Manin obstruction controls weak approximation. The proof is based on the Hasse principle and weak approximation for some special intersections of quadrics over ℚ, which is a consequence of recent advances in additive combinatorics. acknowledgement: While working on this paper the first two authors were supported by EPSRC grant EP/E053262/1, and the first author was further supported by ERC grant 306457. 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: Lilian full_name: Matthiesen, Lilian last_name: Matthiesen - first_name: Alexei full_name: Skorobogatov, Alexei N last_name: Skorobogatov citation: ama: Browning TD, Matthiesen L, Skorobogatov A. Rational points on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics. 2014;180(1):381-402. doi:https://doi.org/10.4007/annals.2014.180.1.8 apa: Browning, T. D., Matthiesen, L., & Skorobogatov, A. (2014). Rational points on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics. John Hopkins University Press. https://doi.org/10.4007/annals.2014.180.1.8 chicago: Browning, Timothy D, Lilian Matthiesen, and Alexei Skorobogatov. “Rational Points on Pencils of Conics and Quadrics with Many Degenerate Fibres.” Annals of Mathematics. John Hopkins University Press, 2014. https://doi.org/10.4007/annals.2014.180.1.8. ieee: T. D. Browning, L. Matthiesen, and A. Skorobogatov, “Rational points on pencils of conics and quadrics with many degenerate fibres,” Annals of Mathematics, vol. 180, no. 1. John Hopkins University Press, pp. 381–402, 2014. ista: Browning TD, Matthiesen L, Skorobogatov A. 2014. Rational points on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics. 180(1), 381–402. mla: Browning, Timothy D., et al. “Rational Points on Pencils of Conics and Quadrics with Many Degenerate Fibres.” Annals of Mathematics, vol. 180, no. 1, John Hopkins University Press, 2014, pp. 381–402, doi:https://doi.org/10.4007/annals.2014.180.1.8. short: T.D. Browning, L. Matthiesen, A. Skorobogatov, Annals of Mathematics 180 (2014) 381–402. date_created: 2018-12-11T11:45:25Z date_published: 2014-07-01T00:00:00Z date_updated: 2021-01-12T06:57:44Z day: '01' doi: https://doi.org/10.4007/annals.2014.180.1.8 extern: 1 intvolume: ' 180' issue: '1' main_file_link: - open_access: '1' url: https://arxiv.org/abs/1209.0207 month: '07' oa: 1 page: 381 - 402 publication: Annals of Mathematics publication_status: published publisher: John Hopkins University Press publist_id: '7655' quality_controlled: 0 status: public title: Rational points on pencils of conics and quadrics with many degenerate fibres type: journal_article volume: 180 year: '2014' ... --- _id: '249' abstract: - lang: eng text: 'A version of the Hardy-Littlewood circle method is developed for number fields K/ℚ and is used to show that nonsingular projective cubic hypersurfaces over K always have a K-rational point when they have dimension at least 8. ' 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. Cubic hypersurfaces and a version of the circle method for number fields. Duke Mathematical Journal. 2014;163(10):1825-1883. doi:10.1215/00127094-2738530 apa: Browning, T. D., & Vishe, P. (2014). Cubic hypersurfaces and a version of the circle method for number fields. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2738530 chicago: Browning, Timothy D, and Pankaj Vishe. “Cubic Hypersurfaces and a Version of the Circle Method for Number Fields.” Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2738530. ieee: T. D. Browning and P. Vishe, “Cubic hypersurfaces and a version of the circle method for number fields,” Duke Mathematical Journal, vol. 163, no. 10. Duke University Press, pp. 1825–1883, 2014. ista: Browning TD, Vishe P. 2014. Cubic hypersurfaces and a version of the circle method for number fields. Duke Mathematical Journal. 163(10), 1825–1883. mla: Browning, Timothy D., and Pankaj Vishe. “Cubic Hypersurfaces and a Version of the Circle Method for Number Fields.” Duke Mathematical Journal, vol. 163, no. 10, Duke University Press, 2014, pp. 1825–83, doi:10.1215/00127094-2738530. short: T.D. Browning, P. Vishe, Duke Mathematical Journal 163 (2014) 1825–1883. date_created: 2018-12-11T11:45:26Z date_published: 2014-07-01T00:00:00Z date_updated: 2021-01-12T06:57:47Z day: '01' doi: 10.1215/00127094-2738530 extern: 1 intvolume: ' 163' issue: '10' month: '07' page: 1825 - 1883 publication: Duke Mathematical Journal publication_status: published publisher: Duke University Press publist_id: '7653' quality_controlled: 0 status: public title: Cubic hypersurfaces and a version of the circle method for number fields type: journal_article volume: 163 year: '2014' ... --- _id: '252' abstract: - lang: eng text: For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k. 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: Michael full_name: Jones, Michael S last_name: Jones citation: ama: Browning TD, Jones M. Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. 2014;163(3):271-298. doi:10.4064/aa163-3-6 apa: Browning, T. D., & Jones, M. (2014). Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. Instytut Matematyczny. https://doi.org/10.4064/aa163-3-6 chicago: Browning, Timothy D, and Michael Jones. “Counting Rational Points on Del Pezzo Surfaces with a Conic Bundle Structure.” Acta Arithmetica. Instytut Matematyczny, 2014. https://doi.org/10.4064/aa163-3-6. ieee: T. D. Browning and M. Jones, “Counting rational points on del Pezzo surfaces with a conic bundle structure,” Acta Arithmetica, vol. 163, no. 3. Instytut Matematyczny, pp. 271–298, 2014. ista: Browning TD, Jones M. 2014. Counting rational points on del Pezzo surfaces with a conic bundle structure. Acta Arithmetica. 163(3), 271–298. mla: Browning, Timothy D., and Michael Jones. “Counting Rational Points on Del Pezzo Surfaces with a Conic Bundle Structure.” Acta Arithmetica, vol. 163, no. 3, Instytut Matematyczny, 2014, pp. 271–98, doi:10.4064/aa163-3-6. short: T.D. Browning, M. Jones, Acta Arithmetica 163 (2014) 271–298. date_created: 2018-12-11T11:45:26Z date_published: 2014-01-01T00:00:00Z date_updated: 2021-01-12T06:57:59Z day: '01' doi: 10.4064/aa163-3-6 extern: 1 intvolume: ' 163' issue: '3' month: '01' page: 271 - 298 publication: Acta Arithmetica publication_status: published publisher: Instytut Matematyczny publist_id: '7650' quality_controlled: 0 status: public title: Counting rational points on del Pezzo surfaces with a conic bundle structure type: journal_article volume: 163 year: '2014' ... --- _id: '254' abstract: - lang: eng text: A new "polynomial sieve" is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3. acknowledgement: While working on this paper, the author was supported by ERC grant 306457 and a Philip Leverhulme Prize. author: - first_name: Timothy D full_name: Timothy Browning id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 citation: ama: Browning TD. The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. 2014;2015(7):1987-2019. doi:10.1093/imrn/rnt350 apa: Browning, T. D. (2014). The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnt350 chicago: Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” International Mathematics Research Notices. Oxford University Press, 2014. https://doi.org/10.1093/imrn/rnt350. ieee: T. D. Browning, “The polynomial sieve and equal sums of like polynomials,” International Mathematics Research Notices, vol. 2015, no. 7. Oxford University Press, pp. 1987–2019, 2014. ista: Browning TD. 2014. The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. 2015(7), 1987–2019. mla: Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” International Mathematics Research Notices, vol. 2015, no. 7, Oxford University Press, 2014, pp. 1987–2019, doi:10.1093/imrn/rnt350. short: T.D. Browning, International Mathematics Research Notices 2015 (2014) 1987–2019. date_created: 2018-12-11T11:45:27Z date_published: 2014-01-31T00:00:00Z date_updated: 2021-01-12T06:58:07Z day: '31' doi: 10.1093/imrn/rnt350 extern: 1 intvolume: ' 2015' issue: '7' month: '01' page: 1987 - 2019 publication: International Mathematics Research Notices publication_status: published publisher: Oxford University Press publist_id: '7648' quality_controlled: 0 status: public title: The polynomial sieve and equal sums of like polynomials type: journal_article volume: 2015 year: '2014' ... --- _id: '255' abstract: - lang: eng text: We investigate the Hasse principle for complete intersections cut out by a quadric hypersurface and a cubic hypersurface defined over the rational numbers. article_processing_charge: No author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Rainer full_name: Dietmann, Rainer last_name: Dietmann - first_name: Roger full_name: Heath Brown, Roger last_name: Heath Brown citation: ama: Browning TD, Dietmann R, Heath Brown R. Rational points on intersections of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of Jussieu. 2014;14(4):703-749. doi:10.1017/S1474748014000127 apa: Browning, T. D., Dietmann, R., & Heath Brown, R. (2014). Rational points on intersections of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of Jussieu. Cambridge University Press. https://doi.org/10.1017/S1474748014000127 chicago: Browning, Timothy D, Rainer Dietmann, and Roger Heath Brown. “Rational Points on Intersections of Cubic and Quadric Hypersurfaces.” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2014. https://doi.org/10.1017/S1474748014000127. ieee: T. D. Browning, R. Dietmann, and R. Heath Brown, “Rational points on intersections of cubic and quadric hypersurfaces,” Journal of the Institute of Mathematics of Jussieu, vol. 14, no. 4. Cambridge University Press, pp. 703–749, 2014. ista: Browning TD, Dietmann R, Heath Brown R. 2014. Rational points on intersections of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of Jussieu. 14(4), 703–749. mla: Browning, Timothy D., et al. “Rational Points on Intersections of Cubic and Quadric Hypersurfaces.” Journal of the Institute of Mathematics of Jussieu, vol. 14, no. 4, Cambridge University Press, 2014, pp. 703–49, doi:10.1017/S1474748014000127. short: T.D. Browning, R. Dietmann, R. Heath Brown, Journal of the Institute of Mathematics of Jussieu 14 (2014) 703–749. date_created: 2018-12-11T11:45:27Z date_published: 2014-01-05T00:00:00Z date_updated: 2021-11-16T08:07:06Z day: '05' doi: 10.1017/S1474748014000127 extern: '1' intvolume: ' 14' issue: '4' language: - iso: eng month: '01' oa_version: None page: 703 - 749 publication: Journal of the Institute of Mathematics of Jussieu publication_status: published publisher: Cambridge University Press publist_id: '7647' related_material: link: - relation: erratum url: https://doi.org/10.1017/S1474748014000279 status: public title: Rational points on intersections of cubic and quadric hypersurfaces type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 14 year: '2014' ... --- _id: '2699' abstract: - lang: eng text: "We prove the universality of the β-ensembles with convex analytic potentials and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles." 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: Paul full_name: Bourgade, Paul last_name: Bourgade - first_name: Horng full_name: Yau, Horng last_name: Yau citation: ama: Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752 apa: Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752 chicago: Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752. ieee: L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014. ista: Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190. mla: Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752. short: L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190. date_created: 2018-12-11T11:59:08Z date_published: 2014-04-01T00:00:00Z date_updated: 2021-01-12T06:59:07Z day: '01' department: - _id: LaEr doi: 10.1215/00127094-2649752 intvolume: ' 163' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.2272 month: '04' oa: 1 oa_version: Preprint page: 1127 - 1190 publication: Duke Mathematical Journal publication_status: published publisher: Duke University Press publist_id: '4197' quality_controlled: '1' scopus_import: 1 status: public title: Universality of general β-ensembles type: journal_article user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87 volume: 163 year: '2014' ... --- _id: '2716' abstract: - lang: eng text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts. acknowledgement: "Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. " article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Mickael full_name: Randour, Mickael last_name: Randour - first_name: Jean full_name: Raskin, Jean last_name: Raskin citation: ama: Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6 apa: Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0182-6 chicago: Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6. ieee: K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014. ista: Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163. mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6. short: K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163. date_created: 2018-12-11T11:59:14Z date_published: 2014-06-01T00:00:00Z date_updated: 2023-02-21T16:06:56Z day: '01' department: - _id: KrCh doi: 10.1007/s00236-013-0182-6 external_id: arxiv: - '1201.5073' intvolume: ' 51' issue: 3-4 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1201.5073 month: '06' oa: 1 oa_version: Preprint page: 129 - 163 project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Acta Informatica publication_status: published publisher: Springer publist_id: '4176' quality_controlled: '1' related_material: record: - id: '10904' relation: earlier_version status: public scopus_import: '1' status: public title: Strategy synthesis for multi-dimensional quantitative objectives type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 51 year: '2014' ... --- _id: '2905' abstract: - lang: eng text: "Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions." acknowledgement: This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053. article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Dmitriy full_name: Morozovy, Dmitriy last_name: Morozovy citation: ama: 'Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3' apa: 'Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3' chicago: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.' ieee: 'H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.' ista: 'Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.' mla: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.' short: H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50. conference: end_date: 2012-07-07 location: Kraków, Poland name: 'ECM: European Congress of Mathematics' start_date: 2012-07-02 date_created: 2018-12-11T12:00:16Z date_published: 2014-01-01T00:00:00Z date_updated: 2021-01-12T07:00:36Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.4171/120-1/3 file: - access_level: open_access checksum: 1d4a046f1af945c407c5c4d411d4c5e4 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:43Z date_updated: 2020-07-14T12:45:52Z file_id: '5232' file_name: IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf file_size: 435320 relation: main_file file_date_updated: 2020-07-14T12:45:52Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 31 - 50 publication_status: published publisher: European Mathematical Society Publishing House publist_id: '3842' pubrep_id: '544' quality_controlled: '1' status: public title: 'Persistent homology: Theory and practice' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '1733' abstract: - lang: eng text: The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies. author: - first_name: Pavol full_name: Cerny, Pavol last_name: Cerny - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik - 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 citation: ama: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019 apa: Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019 chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019. ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014. ista: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363. mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019. short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363. date_created: 2018-12-11T11:53:43Z date_published: 2014-12-04T00:00:00Z date_updated: 2023-02-23T11:04:00Z day: '04' department: - _id: ToHe - _id: KrCh doi: 10.1016/j.tcs.2014.08.019 ec_funded: 1 intvolume: ' 560' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1210.2450 month: '12' oa: 1 oa_version: Submitted Version page: 348 - 363 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _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: '5392' quality_controlled: '1' related_material: record: - id: '2916' relation: earlier_version status: public scopus_import: 1 status: public title: Interface simulation distances type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 560 year: '2014' ... --- _id: '2141' abstract: - lang: eng text: The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m>n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem. article_number: a15 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 citation: ama: Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 2014;61(3). doi:10.1145/2597631 apa: Chatterjee, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. https://doi.org/10.1145/2597631 chicago: Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631. ieee: K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014. ista: Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15. mla: Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631. short: K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014). date_created: 2018-12-11T11:55:57Z date_published: 2014-05-01T00:00:00Z date_updated: 2023-02-23T11:15:12Z day: '01' department: - _id: KrCh doi: 10.1145/2597631 ec_funded: 1 intvolume: ' 61' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://eprints.cs.univie.ac.at/3933/ month: '05' 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: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided 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: '4883' quality_controlled: '1' related_material: record: - id: '3165' relation: earlier_version status: public scopus_import: '1' status: public title: Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition type: journal_article user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 61 year: '2014' ... --- _id: '3263' abstract: - lang: eng text: Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution. acknowledgement: "This work was supported by The Israel Science Foundation and The Human Frontiers Science Program.\r\nWe thank the referees for helping significantly improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason Prentice for stimulating discussions. GT wishes to thank the faculty and students of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory, Woods Hole.\r\n" article_number: e85841 author: - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Anandamohan full_name: Ghosh, Anandamohan last_name: Ghosh - first_name: Elad full_name: Schneidman, Elad last_name: Schneidman - first_name: Ronen full_name: Segev, Ronen last_name: Segev citation: ama: Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841 apa: Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841 chicago: Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841. ieee: G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014. ista: Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 9(1), e85841. mla: Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:10.1371/journal.pone.0085841. short: G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014). date_created: 2018-12-11T12:02:20Z date_published: 2014-01-21T00:00:00Z date_updated: 2021-01-12T07:42:14Z day: '21' ddc: - '570' department: - _id: GaTk doi: 10.1371/journal.pone.0085841 file: - access_level: open_access checksum: 1d5816b343abe5eadc3eb419bcece971 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:28Z date_updated: 2020-07-14T12:46:06Z file_id: '5011' file_name: IST-2016-432-v1+1_journal.pone.0085841.pdf file_size: 1568524 relation: main_file file_date_updated: 2020-07-14T12:46:06Z has_accepted_license: '1' intvolume: ' 9' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '3385' pubrep_id: '432' quality_controlled: '1' scopus_import: 1 status: public title: Adaptation to changes in higher-order stimulus statistics in the salamander retina 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: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2014' ... --- _id: '332' abstract: - lang: eng text: 'Cu2ZnSnS4, based on abundant and environmental friendly elements and with a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion through both photovoltaics and photocatalysis. We detail here the synthesis of quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions. We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured nanoparticles. Such heterostructured nanoparticles are shown to have excellent photocatalytic properties toward degradation of Rhodamine B and hydrogen generation by water splitting. ' article_processing_charge: No article_type: original author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Xiaoqiang full_name: An, Xiaoqiang last_name: An - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - 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: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239. doi:10.1021/ja502076b apa: Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja502076b chicago: Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society. ACS, 2014. https://doi.org/10.1021/ja502076b. ieee: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation,” Journal of the American Chemical Society, vol. 136, no. 26. ACS, pp. 9236–9239, 2014. ista: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 136(26), 9236–9239. mla: Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society, vol. 136, no. 26, ACS, 2014, pp. 9236–39, doi:10.1021/ja502076b. short: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American Chemical Society 136 (2014) 9236–9239. date_created: 2018-12-11T11:45:52Z date_published: 2014-06-11T00:00:00Z date_updated: 2021-01-12T07:42:37Z day: '11' doi: 10.1021/ja502076b extern: '1' intvolume: ' 136' issue: '26' language: - iso: eng month: '06' oa_version: None page: 9236 - 9239 publication: Journal of the American Chemical Society publication_status: published publisher: ACS publist_id: '7513' quality_controlled: '1' status: public title: Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 136 year: '2014' ... --- _id: '2054' abstract: - lang: eng text: 'We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37' apa: 'Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37' chicago: 'Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.' ieee: 'K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.' ista: 'Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.' mla: 'Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37.' short: K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559. conference: end_date: 2014-09-05 location: Rome, Italy name: 'CONCUR: Concurrency Theory' start_date: 2014-09-02 date_created: 2018-12-11T11:55:27Z date_published: 2014-09-01T00:00:00Z date_updated: 2023-02-23T11:23:36Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-662-44584-6_37 ec_funded: 1 editor: - first_name: Paolo full_name: Baldan, Paolo last_name: Baldan - first_name: Daniele full_name: Gorla, Daniele last_name: Gorla intvolume: ' 8704' language: - iso: eng month: '09' oa_version: None page: 544 - 559 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: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '4992' quality_controlled: '1' related_material: record: - id: '3354' relation: earlier_version status: public status: public title: 'Qualitative concurrent parity games: Bounded rationality' type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 8704 year: '2014' ... --- _id: '349' abstract: - lang: eng text: 'Thermoelectricity is a key technology with the potential to improve the efficiency of energy conversion processes, which may strongly benefit from advances in the field of nanotechnology. Nanostructured materials are very appealing for thermoelectric applications, but the full development of their potential requires precise control of their properties at the nanoscale. Bottom-up assembly of nanoparticles provides access to a three-dimensional composition control at the nanoscale not attainable in any other technology. In particular, colloidal nanoheterostructures are especially interesting building blocks for the bottom-up production of functional nanomaterials. In the present work, we use PbTe@PbS core-shell nanoparticles as building blocks for the bottom-up production of PbTe-PbS nanocomposites. We used a ligand exchange strategy and a hot press process to promote the electrical conductivity of the nanocomposite and to increase its density. These two approaches allowed us to improve the performance of bottom-up assembled PbTe-PbS bulk nanostructured materials. ' article_processing_charge: No article_type: original author: - first_name: Silvia full_name: Ortega, Silvia last_name: Ortega - 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: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Ortega S, Ibáñez M, Cadavid D, Cabot A. Bottom up processing of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology. 2014;11(9-11):955-970. doi:10.1504/IJNT.2014.063802 apa: Ortega, S., Ibáñez, M., Cadavid, D., & Cabot, A. (2014). Bottom up processing of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology. Inderscience Enterprises Limited . https://doi.org/10.1504/IJNT.2014.063802 chicago: Ortega, Silvia, Maria Ibáñez, Doris Cadavid, and Andreu Cabot. “Bottom up Processing of PbTe PbS Thermoelectric Nanocomposites.” International Journal of Nanotechnology. Inderscience Enterprises Limited , 2014. https://doi.org/10.1504/IJNT.2014.063802. ieee: S. Ortega, M. Ibáñez, D. Cadavid, and A. Cabot, “Bottom up processing of PbTe PbS thermoelectric nanocomposites,” International Journal of Nanotechnology, vol. 11, no. 9–11. Inderscience Enterprises Limited , pp. 955–970, 2014. ista: Ortega S, Ibáñez M, Cadavid D, Cabot A. 2014. Bottom up processing of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology. 11(9–11), 955–970. mla: Ortega, Silvia, et al. “Bottom up Processing of PbTe PbS Thermoelectric Nanocomposites.” International Journal of Nanotechnology, vol. 11, no. 9–11, Inderscience Enterprises Limited , 2014, pp. 955–70, doi:10.1504/IJNT.2014.063802. short: S. Ortega, M. Ibáñez, D. Cadavid, A. Cabot, International Journal of Nanotechnology 11 (2014) 955–970. date_created: 2018-12-11T11:45:57Z date_published: 2014-07-21T00:00:00Z date_updated: 2021-01-12T07:43:48Z day: '21' doi: 10.1504/IJNT.2014.063802 extern: '1' intvolume: ' 11' issue: 9-11 language: - iso: eng month: '07' oa_version: None page: 955 - 970 publication: International Journal of Nanotechnology publication_status: published publisher: 'Inderscience Enterprises Limited ' publist_id: '7477' quality_controlled: '1' status: public title: Bottom up processing of PbTe PbS thermoelectric nanocomposites type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2014' ... --- _id: '355' abstract: - lang: eng text: 'We report on the photocatalytic hydrogen evolution under full-arc light irradiation of CuIn1-xGaxS2 wurtzite nanocrystals in the presence of SO3 2- and S2- as sacrificial reagents. We analyzed the hydrogen generation rate as a function of the Ga content and associated it with the energy band positions. For photocatalytic water splitting, the CuInS2 bandgap is slightly too low to efficiently overcome the reaction over-potential. The presence of Ga shifts up the CuInS2 conduction band edge providing a larger driving force for photogenerated carriers to activate the water splitting reduction reaction. The larger the Ga content, the more energetically favorable the electron injection, and thus a more efficient use of the photogenerated carriers is reached. However, the band gap increase associated with the Ga incorporation reduces the concentration of photogenerated carriers available for water splitting, and consequently a lower hydrogen conversion rate is obtained for very high Ga contents. The optimum Ga concentration was experimentally found at CuIn0.3Ga0.7S2. ' acknowledgement: "The research was supported by the European Regional Development\r\nFunds (ERDF, “FEDER Programa Competitivitat de\r\nCatalunya 2007-2013”) and the Framework 7 program under\r\nproject SCALENANO (FP7-NMP-ENERGY-2011-284486)." article_processing_charge: No article_type: original author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Xiaoqiang full_name: An, Xiaoqiang last_name: An - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - 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: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Yu X, An X, Shavel A, Ibáñez M, Cabot A. The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal of Materials Chemistry A. 2014;2(31):12317-12322. doi:10.1039/c4ta01315h apa: Yu, X., An, X., Shavel, A., Ibáñez, M., & Cabot, A. (2014). The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal of Materials Chemistry A. Royal Society of Chemistry. https://doi.org/10.1039/c4ta01315h chicago: Yu, Xuelian, Xiaoqiang An, Alexey Shavel, Maria Ibáñez, and Andreu Cabot. “The Effect of the Ga Content on the Photocatalytic Hydrogen Evolution of CuIn1-XGaxS2 Nanocrystals.” Journal of Materials Chemistry A. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c4ta01315h. ieee: X. Yu, X. An, A. Shavel, M. Ibáñez, and A. Cabot, “The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals,” Journal of Materials Chemistry A, vol. 2, no. 31. Royal Society of Chemistry, pp. 12317–12322, 2014. ista: Yu X, An X, Shavel A, Ibáñez M, Cabot A. 2014. The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal of Materials Chemistry A. 2(31), 12317–12322. mla: Yu, Xuelian, et al. “The Effect of the Ga Content on the Photocatalytic Hydrogen Evolution of CuIn1-XGaxS2 Nanocrystals.” Journal of Materials Chemistry A, vol. 2, no. 31, Royal Society of Chemistry, 2014, pp. 12317–22, doi:10.1039/c4ta01315h. short: X. Yu, X. An, A. Shavel, M. Ibáñez, A. Cabot, Journal of Materials Chemistry A 2 (2014) 12317–12322. date_created: 2018-12-11T11:45:59Z date_published: 2014-08-21T00:00:00Z date_updated: 2021-01-12T07:44:14Z day: '21' doi: 10.1039/c4ta01315h extern: '1' intvolume: ' 2' issue: '31' language: - iso: eng month: '08' oa_version: None page: 12317 - 12322 publication: Journal of Materials Chemistry A publication_status: published publisher: Royal Society of Chemistry publist_id: '7471' quality_controlled: '1' status: public title: The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2014' ... --- _id: '357' abstract: - lang: eng text: 'Near-resonant Raman scattering measurements of zinc sulfide nanoparticles and thin films have been made and correlated to grain and particle size, respectively, using a 325 nm wavelength excitation source. The area ratios between the first, second, and third order peaks of ZnS identified as the T 2(LO) mode decrease with increasing ZnS grain size. This is an effect attributed to changes in the bandgap energy from quantum confinement due to the varying grain size between the films/particles, as noted by a shift in the room temperature photoluminescence emission corresponding to the free exciton emission energy. While Raman scattering spectroscopy is typically limited to identification of phases and their crystalline properties, it is possible to attain more than such straightforward information by calibrating the spectral features to variations between sets of samples. These results open the possibility of making a quantitative grain size estimation in ZnS thin films and nanostructures, as well as in other material systems where ZnS may be expected as a secondary phase, such as Cu2ZnSnS4. Additionally, more commonly used excitation wavelengths for Raman scattering, such as 514 and 532 nm, are shown to be of limited use in characterizing ZnS thin films due to the extremely low Raman scattering efficiency of ZnS in films with sub-micron thicknesses. ' acknowledgement: "This research was supported by the People Programme\r\n(Marie Curie Actions) of the European Union's Seventh Framework\r\nProgramme under REA grant agreement number 269167\r\n(PVICOKEST) and the Spanish Ministerio de Economía y\r\nCompetividad (MINECO) under KEST-PV (ref. ENE2010-\r\n121541-C03-01/02). Authors from IREC belong to the M-2E\r\n(Electronic Materials for Energy) Consolidated Research\r\nGroup and the XaRMAE Network of Excellence on Materials\r\nfor Energy of the “Generalitat de Catalunya”. A. Fairbrother\r\nthanks the MINECO for support via the FPU program\r\n(FPU12/05508), V. Izquierdo for the Juan de la Cierva program\r\n(JCI-2011-10782), and E. Saucedo for the Ramón y Cajal\r\nprogram (RYC-2011-09212)." article_processing_charge: No article_type: original author: - first_name: Andrew full_name: Fairbrother, Andrew last_name: Fairbrother - first_name: Victor full_name: Izquierdo Roca, Victor last_name: Izquierdo Roca - first_name: Xavier full_name: Fontané, Xavier last_name: Fontané - 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: Andreu full_name: Cabot, Andreu last_name: Cabot - first_name: Edgardo full_name: Saucedo, Edgardo last_name: Saucedo - first_name: Alejandro full_name: Pérez Rodríguez, Alejandro last_name: Pérez Rodríguez citation: ama: 'Fairbrother A, Izquierdo Roca V, Fontané X, et al. ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive grain size estimation. CrystEngComm. 2014;16(20):4120-4125. doi:10.1039/c3ce42578a' apa: 'Fairbrother, A., Izquierdo Roca, V., Fontané, X., Ibáñez, M., Cabot, A., Saucedo, E., & Pérez Rodríguez, A. (2014). ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive grain size estimation. CrystEngComm. Royal Society of Chemistry. https://doi.org/10.1039/c3ce42578a' chicago: 'Fairbrother, Andrew, Victor Izquierdo Roca, Xavier Fontané, Maria Ibáñez, Andreu Cabot, Edgardo Saucedo, and Alejandro Pérez Rodríguez. “ZnS Grain Size Effects on Near-Resonant Raman Scattering: Optical Non-Destructive Grain Size Estimation.” CrystEngComm. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c3ce42578a.' ieee: 'A. Fairbrother et al., “ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive grain size estimation,” CrystEngComm, vol. 16, no. 20. Royal Society of Chemistry, pp. 4120–4125, 2014.' ista: 'Fairbrother A, Izquierdo Roca V, Fontané X, Ibáñez M, Cabot A, Saucedo E, Pérez Rodríguez A. 2014. ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive grain size estimation. CrystEngComm. 16(20), 4120–4125.' mla: 'Fairbrother, Andrew, et al. “ZnS Grain Size Effects on Near-Resonant Raman Scattering: Optical Non-Destructive Grain Size Estimation.” CrystEngComm, vol. 16, no. 20, Royal Society of Chemistry, 2014, pp. 4120–25, doi:10.1039/c3ce42578a.' short: A. Fairbrother, V. Izquierdo Roca, X. Fontané, M. Ibáñez, A. Cabot, E. Saucedo, A. Pérez Rodríguez, CrystEngComm 16 (2014) 4120–4125. date_created: 2018-12-11T11:46:00Z date_published: 2014-05-28T00:00:00Z date_updated: 2021-01-12T07:44:22Z day: '28' doi: 10.1039/c3ce42578a extern: '1' intvolume: ' 16' issue: '20' language: - iso: eng month: '05' oa_version: None page: 4120 - 4125 publication: CrystEngComm publication_status: published publisher: Royal Society of Chemistry publist_id: '7473' quality_controlled: '1' status: public title: 'ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive grain size estimation' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2014' ... --- _id: '359' abstract: - lang: eng text: An appropriate way of realizing property nanoengineering in complex quaternary chalcogenide nanocrystals is presented for Cu2Cd xSnSey(CCTSe) polypods. The pivotal role of the polarity in determining morphology, growth, and the polytypic branching mechanism is demonstrated. Polarity is considered to be responsible for the formation of an initial seed that takes the form of a tetrahedron with four cation-polar facets. Size and shape confinement of the intermediate pentatetrahedral seed is also attributed to polarity, as their external facets are anion-polar. The final polypod extensions also branch out as a result of a cation-polarity-driven mechanism. Aberration-corrected scanning transmission electron microscopy is used to identify stannite cation ordering, while ab initio studies are used to show the influence of cation ordering/distortion, stoichiometry, and polytypic structural change on the electronic band structure. acknowledgement: The research leading to these results has received funding from the European Union Seventh Framework Programme under grant agreement 312483-ESTEEM2 (Integrated Infrastructure InitiativeI3) for using advance electron microscopes at ER-C Jülich. J.A. acknowledges the funding from the Spanish MICINN project MAT2010-15138 (COPEON) and Generalitat de Catalunya 2009 SGR 770. R.R.Z. acknowledges the former. The authors would also like to thank the TEM facilities in Serveis Cientificotecnics from Universitat de Barcelona. N.G.-C. acknowledges the Spanish MECD for her Ph.D. grant in the FPU program. JR and RZ acknowledge funding from MULTICAT and NANOENESTO projects. article_processing_charge: No article_type: original author: - first_name: Reza full_name: Zamani, Reza last_name: Zamani - 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: Martina full_name: Luysberg, Martina last_name: Luysberg - first_name: Nuria full_name: García Castelló, Nuria last_name: García Castelló - first_name: Lothar full_name: Houben, Lothar last_name: Houben - first_name: Joan full_name: Prades, Joan last_name: Prades - first_name: Vincenzo full_name: Grillo, Vincenzo last_name: Grillo - first_name: Rafal full_name: Dunin Borkowski, Rafal last_name: Dunin Borkowski - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol citation: ama: Zamani R, Ibáñez M, Luysberg M, et al. Polarity-driven polytypic branching in Cu-based quaternary chalcogenide nanostructures. ACS Nano. 2014;8(3):2290-2301. doi:10.1021/nn405747h apa: Zamani, R., Ibáñez, M., Luysberg, M., García Castelló, N., Houben, L., Prades, J., … Arbiol, J. (2014). Polarity-driven polytypic branching in Cu-based quaternary chalcogenide nanostructures. ACS Nano. American Chemical Society. https://doi.org/10.1021/nn405747h chicago: Zamani, Reza, Maria Ibáñez, Martina Luysberg, Nuria García Castelló, Lothar Houben, Joan Prades, Vincenzo Grillo, et al. “Polarity-Driven Polytypic Branching in Cu-Based Quaternary Chalcogenide Nanostructures.” ACS Nano. American Chemical Society, 2014. https://doi.org/10.1021/nn405747h. ieee: R. Zamani et al., “Polarity-driven polytypic branching in Cu-based quaternary chalcogenide nanostructures,” ACS Nano, vol. 8, no. 3. American Chemical Society, pp. 2290–2301, 2014. ista: Zamani R, Ibáñez M, Luysberg M, García Castelló N, Houben L, Prades J, Grillo V, Dunin Borkowski R, Morante J, Cabot A, Arbiol J. 2014. Polarity-driven polytypic branching in Cu-based quaternary chalcogenide nanostructures. ACS Nano. 8(3), 2290–2301. mla: Zamani, Reza, et al. “Polarity-Driven Polytypic Branching in Cu-Based Quaternary Chalcogenide Nanostructures.” ACS Nano, vol. 8, no. 3, American Chemical Society, 2014, pp. 2290–301, doi:10.1021/nn405747h. short: R. Zamani, M. Ibáñez, M. Luysberg, N. García Castelló, L. Houben, J. Prades, V. Grillo, R. Dunin Borkowski, J. Morante, A. Cabot, J. Arbiol, ACS Nano 8 (2014) 2290–2301. date_created: 2018-12-11T11:46:01Z date_published: 2014-03-25T00:00:00Z date_updated: 2021-01-12T07:44:30Z day: '25' doi: 10.1021/nn405747h extern: '1' intvolume: ' 8' issue: '3' language: - iso: eng month: '03' oa_version: None page: 2290 - 2301 publication: ACS Nano publication_status: published publisher: American Chemical Society publist_id: '7475' quality_controlled: '1' status: public title: Polarity-driven polytypic branching in Cu-based quaternary chalcogenide nanostructures type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2014' ... --- _id: '2852' abstract: - lang: eng text: A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length. author: - first_name: Marc full_name: Fischlin, Marc last_name: Fischlin - first_name: Anja full_name: Lehmann, Anja last_name: Lehmann - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. Journal of Cryptology. 2014;27(3):397-428. doi:10.1007/s00145-013-9148-7 apa: Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-013-9148-7 chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology. Springer, 2014. https://doi.org/10.1007/s00145-013-9148-7. ieee: M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp. 397–428, 2014. ista: Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428. mla: Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7. short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428. date_created: 2018-12-11T11:59:56Z date_published: 2014-07-01T00:00:00Z date_updated: 2023-02-23T11:17:53Z day: '01' department: - _id: KrPi doi: 10.1007/s00145-013-9148-7 intvolume: ' 27' issue: '3' language: - iso: eng month: '07' oa_version: None page: 397 - 428 publication: Journal of Cryptology publication_status: published publisher: Springer publist_id: '3940' quality_controlled: '1' related_material: record: - id: '3225' relation: earlier_version status: public scopus_import: 1 status: public title: Robust multi-property combiners for hash functions type: journal_article user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2014' ... --- _id: '348' abstract: - lang: eng text: "Bi2S3-xTex bulk nanocomposites with crystal domain sizes in the range from 50 nm to 100 nm were obtained from the reaction of Bi2S3 nanorods with Te powder. The thermoelectric properties of the obtained nanocomposites were analysed in the temperature range from 0°C to 300°C. We observed how the thermoelectric properties of the material improved with the annealing temperature, being a spark plasma sintering process needed to maintain the material nanostructuration while maximising its electrical properties. Finally thermoelectric dimensionless figures of merit ZT up to 0.42 were obtained before any charge carrier concentration optimisation. Copyright © 2014 Inderscience Enterprises Ltd.\r\n\r\n" article_processing_charge: No article_type: original author: - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - 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: Umberto full_name: Anselmi Tamburini, Umberto last_name: Anselmi Tamburini - first_name: Oscar full_name: Durá, Oscar last_name: Durá - first_name: Marco full_name: De La Torre, Marco last_name: De La Torre - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A. Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. International Journal of Nanotechnology. 2014;11(9-11):773-784. doi:10.1504/IJNT.2014.063787 apa: Cadavid, D., Ibáñez, M., Anselmi Tamburini, U., Durá, O., De La Torre, M., & Cabot, A. (2014). Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. International Journal of Nanotechnology. Inderscience Enterprises Limited . https://doi.org/10.1504/IJNT.2014.063787 chicago: Cadavid, Doris, Maria Ibáñez, Umberto Anselmi Tamburini, Oscar Durá, Marco De La Torre, and Andreu Cabot. “Thermoelectric Properties of Bottom up Assembled Bi2S 3-XTex Nanocomposites.” International Journal of Nanotechnology. Inderscience Enterprises Limited , 2014. https://doi.org/10.1504/IJNT.2014.063787. ieee: D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, and A. Cabot, “Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites,” International Journal of Nanotechnology, vol. 11, no. 9–11. Inderscience Enterprises Limited , pp. 773–784, 2014. ista: Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A. 2014. Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites. International Journal of Nanotechnology. 11(9–11), 773–784. mla: Cadavid, Doris, et al. “Thermoelectric Properties of Bottom up Assembled Bi2S 3-XTex Nanocomposites.” International Journal of Nanotechnology, vol. 11, no. 9–11, Inderscience Enterprises Limited , 2014, pp. 773–84, doi:10.1504/IJNT.2014.063787. short: D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, A. Cabot, International Journal of Nanotechnology 11 (2014) 773–784. date_created: 2018-12-11T11:45:57Z date_published: 2014-01-01T00:00:00Z date_updated: 2021-01-12T07:43:44Z day: '01' doi: 10.1504/IJNT.2014.063787 extern: '1' intvolume: ' 11' issue: 9-11 language: - iso: eng month: '01' oa_version: None page: 773 - 784 publication: International Journal of Nanotechnology publication_status: published publisher: 'Inderscience Enterprises Limited ' publist_id: '7476' quality_controlled: '1' status: public title: Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2014' ... --- _id: '350' abstract: - lang: eng text: Herein, a colloidal synthetic route to produce highly monodisperse Cu2HgGeSe4 (CHGSe) nanoparticles (NPs) is presented in detail. The high yield of the developed procedure allowed the production of CHGSe NPs at the gram scale. A thorough analysis of their structural and optical properties is shown. CHGSe NPs displayed poly-tetrahedral morphology and narrow size distributions with average size in the range of 10–40 nm and size dispersions below 10 %. A 1.6 eV optical band gap was measured by mean of UV–Vis. By adjusting the cation ratio, an effective control of their electrical conductivity is achieved. The prepared NPs are used as building blocks for the production of CHGSe bulk nanostructured materials. The thermoelectric properties of CHGSe nanomaterials are studied in the temperature range from 300 to 730 K. CHGSe nanomaterials reached electrical conductivities up to 5 × 104 S m−1, Seebeck coefficients above 100 μV K−1, and thermal conductivities below 1.0 W m−1 K−1 which translated into thermoelectric figures of merit up to 0.34 at 730 K. acknowledgement: The research was supported by the European Regional Development Funds (ERDF, ‘‘FEDER Programa Competitivitat de Catalunya 2007–2013’’). article_processing_charge: No article_type: original author: - first_name: Wenhua full_name: Li, Wenhua last_name: Li - 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: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Reza full_name: Zamani, Reza last_name: Zamani - first_name: Javier full_name: Rubio Garcia, Javier last_name: Rubio Garcia - first_name: Stéphane full_name: Gorsse, Stéphane last_name: Gorsse - first_name: Joan full_name: Morante, Joan last_name: Morante - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: 'Li W, Ibáñez M, Cadavid D, et al. Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. 2014;16(3). doi:10.1007/s11051-014-2297-2' apa: 'Li, W., Ibáñez, M., Cadavid, D., Zamani, R., Rubio Garcia, J., Gorsse, S., … Cabot, A. (2014). Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. Kluwer. https://doi.org/10.1007/s11051-014-2297-2' chicago: 'Li, Wenhua, Maria Ibáñez, Doris Cadavid, Reza Zamani, Javier Rubio Garcia, Stéphane Gorsse, Joan Morante, Jordi Arbiol, and Andreu Cabot. “Colloidal Synthesis and Functional Properties of Quaternary Cu Based Semiconductors: Cu2HgGeSe4.” Journal of Nanoparticle Research. Kluwer, 2014. https://doi.org/10.1007/s11051-014-2297-2.' ieee: 'W. Li et al., “Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4,” Journal of Nanoparticle Research, vol. 16, no. 3. Kluwer, 2014.' ista: 'Li W, Ibáñez M, Cadavid D, Zamani R, Rubio Garcia J, Gorsse S, Morante J, Arbiol J, Cabot A. 2014. Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. 16(3).' mla: 'Li, Wenhua, et al. “Colloidal Synthesis and Functional Properties of Quaternary Cu Based Semiconductors: Cu2HgGeSe4.” Journal of Nanoparticle Research, vol. 16, no. 3, Kluwer, 2014, doi:10.1007/s11051-014-2297-2.' short: W. Li, M. Ibáñez, D. Cadavid, R. Zamani, J. Rubio Garcia, S. Gorsse, J. Morante, J. Arbiol, A. Cabot, Journal of Nanoparticle Research 16 (2014). date_created: 2018-12-11T11:45:58Z date_published: 2014-02-18T00:00:00Z date_updated: 2021-01-12T07:43:53Z day: '18' doi: 10.1007/s11051-014-2297-2 extern: '1' intvolume: ' 16' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://hal.archives-ouvertes.fr/hal-00959322/ month: '02' oa: 1 oa_version: Submitted Version publication: Journal of Nanoparticle Research publication_status: published publisher: Kluwer publist_id: '7478' quality_controlled: '1' status: public title: 'Colloidal synthesis and functional properties of quaternary Cu based semiconductors: Cu2HgGeSe4' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2014' ... --- _id: '356' abstract: - lang: eng text: Cu2ZnSnS4, based on abundant and environmental friendly elements and with a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion through both photovoltaics and photocatalysis. We detail here the synthesis of quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions. We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured nanoparticles. Such heterostructured nanoparticles are shown to have excellent photocatalytic properties toward degradation of Rhodamine B and hydrogen generation by water splitting. acknowledgement: This work was supported by the European Regional Development Funds and the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486). article_processing_charge: No article_type: original author: - first_name: Xuelian full_name: Yu, Xuelian last_name: Yu - first_name: Alexey full_name: Shavel, Alexey last_name: Shavel - first_name: Xiaoqiang full_name: An, Xiaoqiang last_name: An - first_name: Zhishan full_name: Luo, Zhishan last_name: Luo - 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: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239. doi:10.1021/ja502076b apa: Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/ja502076b chicago: Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society. American Chemical Society, 2014. https://doi.org/10.1021/ja502076b. ieee: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation,” Journal of the American Chemical Society, vol. 136, no. 26. American Chemical Society, pp. 9236–9239, 2014. ista: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 136(26), 9236–9239. mla: Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society, vol. 136, no. 26, American Chemical Society, 2014, pp. 9236–39, doi:10.1021/ja502076b. short: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American Chemical Society 136 (2014) 9236–9239. date_created: 2018-12-11T11:46:00Z date_published: 2014-07-02T00:00:00Z date_updated: 2021-01-12T07:44:18Z day: '02' doi: 10.1021/ja502076b extern: '1' intvolume: ' 136' issue: '26' language: - iso: eng month: '07' oa_version: None page: 9236 - 9239 publication: Journal of the American Chemical Society publication_status: published publisher: American Chemical Society publist_id: '7472' quality_controlled: '1' status: public title: Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 136 year: '2014' ... --- _id: '358' abstract: - lang: eng text: Monodispersed Pt3Sn nanoparticles were prepared through a mild thermal synthesis in the presence of surfactants. The performance of Pt3Sn for the electrooxidation of ethanol and adsorbed carbon monoxide (COad) in acid medium was studied by a combination of electrochemical and insitu spectroscopic methods, namely, infrared reflection absorption spectroscopy and differential electrochemical mass spectrometry (DEMS), and the results were compared to those obtained with the use of Pt black. The formation of the Pt3Sn solid solution promoted the oxidation of COad at less-positive potentials than those required for Pt black. Also, the electrooxidation of ethanol, especially at lower potentials, was more favorable with Pt3Sn, as deduced from the higher faradaic currents recorded during the ethanol oxidation reaction (EOR). However, the distribution of products as deduced by DEMS analysis suggested that the formation of C1 products, CO2 inclusive, is less significant on Pt3Sn than on Pt. In fact, the higher faradaic current recorded with the former catalyst can be attributed to the greater amounts of acetaldehyde and acetic acid formed. After the EOR, the surface of both Pt and Pt3Sn remained covered by ethanol adsorbates. Whereas C2 fragments were the main adsorbates at the surface of Pt3Sn after the EOR, both C1 and C2 species remained adsorbed at Pt black. acknowledgement: The Spanish Ministry of Science and Innovation (Project ENE2010–15381) and the CSIC (Project 201080E116) are acknowledged for financial support. article_processing_charge: No article_type: original author: - first_name: Tirma full_name: Herranz, Tirma last_name: Herranz - 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: José full_name: Gómez De La Fuente, José last_name: Gómez De La Fuente - first_name: Francisco full_name: Pérez Alonso, Francisco last_name: Pérez Alonso - first_name: Miguel full_name: Peña, Miguel last_name: Peña - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot - first_name: Sergio full_name: Rojas, Sergio last_name: Rojas citation: ama: Herranz T, Ibáñez M, Gómez De La Fuente J, et al. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. 2014;1(5):885-895. doi:10.1002/celc.201300254 apa: Herranz, T., Ibáñez, M., Gómez De La Fuente, J., Pérez Alonso, F., Peña, M., Cabot, A., & Rojas, S. (2014). In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. Wiley-Blackwell. https://doi.org/10.1002/celc.201300254 chicago: Herranz, Tirma, Maria Ibáñez, José Gómez De La Fuente, Francisco Pérez Alonso, Miguel Peña, Andreu Cabot, and Sergio Rojas. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem. Wiley-Blackwell, 2014. https://doi.org/10.1002/celc.201300254. ieee: T. Herranz et al., “In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles,” ChemElectroChem, vol. 1, no. 5. Wiley-Blackwell, pp. 885–895, 2014. ista: Herranz T, Ibáñez M, Gómez De La Fuente J, Pérez Alonso F, Peña M, Cabot A, Rojas S. 2014. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. 1(5), 885–895. mla: Herranz, Tirma, et al. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem, vol. 1, no. 5, Wiley-Blackwell, 2014, pp. 885–95, doi:10.1002/celc.201300254. short: T. Herranz, M. Ibáñez, J. Gómez De La Fuente, F. Pérez Alonso, M. Peña, A. Cabot, S. Rojas, ChemElectroChem 1 (2014) 885–895. date_created: 2018-12-11T11:46:00Z date_published: 2014-03-03T00:00:00Z date_updated: 2021-01-12T07:44:26Z day: '03' doi: 10.1002/celc.201300254 extern: '1' intvolume: ' 1' issue: '5' language: - iso: eng month: '03' oa_version: None page: 885 - 895 publication: ChemElectroChem publication_status: published publisher: Wiley-Blackwell publist_id: '7474' quality_controlled: '1' status: public title: In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1 year: '2014' ... --- _id: '451' abstract: - lang: eng text: We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, using the technique based on a chain contraction from the original chain complex to a reduced one that represents its homology. This work is based on previous results for simplicial complexes, and uses Serre’s diagonalization for cubical cells. An implementation in C++ of the introduced algorithms is available at http://www.pawelpilarczyk.com/chaincon/ together with some examples. The paper is self-contained as much as possible, and is written at a very elementary level, so that basic knowledge of algebraic topology should be sufficient to follow it. acknowledgement: 'This research was partially supported from Fundo Europeu de Desenvolvimento Regional (FEDER) through COMPETE – Programa Operacional Factores de Compe titividade (POFC) and from the Portuguese national funds through Fundacaoparaa Ciencia e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645(ref. FCT PTDC/MAT/098871/2008), as well as from the funds distributed through the European Science Foundation (ESF) Research Networking Programme on “Applied and Computational Algebraic Topology” (ACAT). P.Real was additionally supported by the Spanish Ministry of Science and Innovation, project no. MTM2009-12716. ' author: - first_name: Pawel full_name: Pawel Pilarczyk id: 3768D56A-F248-11E8-B48F-1D18A9856A87 last_name: Pilarczyk - first_name: Pedro full_name: Real, Pedro last_name: Real citation: ama: Pilarczyk P, Real P. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. 2014;41(1):253-275. doi:10.1007/s10444-014-9356-1 apa: Pilarczyk, P., & Real, P. (2014). Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. Kluwer. https://doi.org/10.1007/s10444-014-9356-1 chicago: Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology, and (Co)Homological Operations via Chain Contraction.” Advances in Computational Mathematics. Kluwer, 2014. https://doi.org/10.1007/s10444-014-9356-1. ieee: P. Pilarczyk and P. Real, “Computation of cubical homology, cohomology, and (co)homological operations via chain contraction,” Advances in Computational Mathematics, vol. 41, no. 1. Kluwer, pp. 253–275, 2014. ista: Pilarczyk P, Real P. 2014. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. 41(1), 253–275. mla: Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology, and (Co)Homological Operations via Chain Contraction.” Advances in Computational Mathematics, vol. 41, no. 1, Kluwer, 2014, pp. 253–75, doi:10.1007/s10444-014-9356-1. short: P. Pilarczyk, P. Real, Advances in Computational Mathematics 41 (2014) 253–275. date_created: 2018-12-11T11:46:33Z date_published: 2014-01-01T00:00:00Z date_updated: 2021-01-12T07:59:20Z day: '01' doi: 10.1007/s10444-014-9356-1 extern: 1 intvolume: ' 41' issue: '1' main_file_link: - open_access: '1' url: https://idus.us.es/xmlui/handle/11441/38719 month: '01' oa: 1 page: 253 - 275 publication: Advances in Computational Mathematics publication_status: published publisher: Kluwer publist_id: '7371' quality_controlled: 0 status: public title: Computation of cubical homology, cohomology, and (co)homological operations via chain contraction type: journal_article volume: 41 year: '2014' ... --- _id: '468' abstract: - lang: eng text: Invasive alien parasites and pathogens are a growing threat to biodiversity worldwide, which can contribute to the extinction of endemic species. On the Galápagos Islands, the invasive parasitic fly Philornis downsi poses a major threat to the endemic avifauna. Here, we investigated the influence of this parasite on the breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea) and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island in 2010 and 2012. While the population of the small tree finch appeared to be stable, the warbler finch has experienced a dramatic decline in population size on Santa Cruz Island since 1997. We aimed to identify whether warbler finches are particularly vulnerable during different stages of the breeding cycle. Contrary to our prediction, breeding success was lower in the small tree finch than in the warbler finch. In both species P. downsi had a strong negative impact on breeding success and our data suggest that heavy rain events also lowered the fledging success. On the one hand parents might be less efficient in compensating their chicks' energy loss due to parasitism as they might be less efficient in foraging on days of heavy rain. On the other hand, intense rainfalls might lead to increased humidity and more rapid cooling of the nests. In the case of the warbler finch we found that the control of invasive plant species with herbicides had a significant additive negative impact on the breeding success. It is very likely that the availability of insects (i.e. food abundance) is lower in such controlled areas, as herbicide usage led to the removal of the entire understory. Predation seems to be a minor factor in brood loss. acknowledgement: The study was funded by the University of Vienna (Focus of Excellence grant), the Galápagos Conservation Trust, and the Ethologische Gesellschaft e.V. article_number: '0107518' author: - first_name: Arno full_name: Cimadom, Arno last_name: Cimadom - first_name: Angel full_name: Ulloa, Angel last_name: Ulloa - first_name: Patrick full_name: Meidl, Patrick id: 4709BCE6-F248-11E8-B48F-1D18A9856A87 last_name: Meidl - first_name: Markus full_name: Zöttl, Markus last_name: Zöttl - first_name: Elisabet full_name: Zöttl, Elisabet last_name: Zöttl - first_name: Birgit full_name: Fessl, Birgit last_name: Fessl - first_name: Erwin full_name: Nemeth, Erwin last_name: Nemeth - first_name: Michael full_name: Dvorak, Michael last_name: Dvorak - first_name: Francesca full_name: Cunninghame, Francesca last_name: Cunninghame - first_name: Sabine full_name: Tebbich, Sabine last_name: Tebbich citation: ama: Cimadom A, Ulloa A, Meidl P, et al. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 2014;9(9). doi:10.1371/journal.pone.0107518 apa: Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B., … Tebbich, S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0107518 chicago: Cimadom, Arno, Angel Ulloa, Patrick Meidl, Markus Zöttl, Elisabet Zöttl, Birgit Fessl, Erwin Nemeth, Michael Dvorak, Francesca Cunninghame, and Sabine Tebbich. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0107518. ieee: A. Cimadom et al., “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” PLoS One, vol. 9, no. 9. Public Library of Science, 2014. ista: Cimadom A, Ulloa A, Meidl P, Zöttl M, Zöttl E, Fessl B, Nemeth E, Dvorak M, Cunninghame F, Tebbich S. 2014. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 9(9), 0107518. mla: Cimadom, Arno, et al. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” PLoS One, vol. 9, no. 9, 0107518, Public Library of Science, 2014, doi:10.1371/journal.pone.0107518. short: A. Cimadom, A. Ulloa, P. Meidl, M. Zöttl, E. Zöttl, B. Fessl, E. Nemeth, M. Dvorak, F. Cunninghame, S. Tebbich, PLoS One 9 (2014). date_created: 2018-12-11T11:46:38Z date_published: 2014-09-23T00:00:00Z date_updated: 2021-01-12T08:00:48Z day: '23' ddc: - '576' department: - _id: CampIT doi: 10.1371/journal.pone.0107518 file: - access_level: open_access checksum: b24e7518ccd41effed0d7d9e2498f67f content_type: application/pdf creator: system date_created: 2018-12-12T10:14:48Z date_updated: 2020-07-14T12:46:34Z file_id: '5103' file_name: IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF file_size: 489387 relation: main_file file_date_updated: 2020-07-14T12:46:34Z has_accepted_license: '1' intvolume: ' 9' issue: '9' language: - iso: eng month: '09' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '7352' pubrep_id: '954' quality_controlled: '1' scopus_import: 1 status: public title: Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches 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: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2014' ... --- _id: '475' abstract: - lang: eng text: 'First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. ' alternative_title: - EPTCS author: - first_name: Benjamin full_name: Aminof, Benjamin id: 4A55BD00-F248-11E8-B48F-1D18A9856A87 last_name: Aminof - first_name: Sasha full_name: Rubin, Sasha id: 2EC51194-F248-11E8-B48F-1D18A9856A87 last_name: Rubin citation: ama: 'Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90. doi:10.4204/EPTCS.146.11' apa: 'Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11' chicago: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing Association, 2014. https://doi.org/10.4204/EPTCS.146.11. ieee: B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90. ista: 'Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.' mla: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:10.4204/EPTCS.146.11. short: B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90. conference: end_date: 2014-04-06 location: Grenoble, France name: 'SR: Strategic Reasoning' start_date: 2014-04-05 date_created: 2018-12-11T11:46:41Z date_published: 2014-04-01T00:00:00Z date_updated: 2021-01-12T08:00:53Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4204/EPTCS.146.11 ec_funded: 1 file: - access_level: open_access checksum: 4d7b4ab82980cca2b96ac7703992a8c8 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:08Z date_updated: 2020-07-14T12:46:35Z file_id: '5260' file_name: IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf file_size: 100115 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 146' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 83 - 90 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _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: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Electronic Proceedings in Theoretical Computer Science, EPTCS publication_status: published publisher: Open Publishing Association publist_id: '7345' pubrep_id: '952' quality_controlled: '1' scopus_import: 1 status: public title: First cycle games 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: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 146 year: '2014' ... --- _id: '10892' abstract: - lang: eng text: "In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings." acknowledgement: 'T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Therese full_name: Biedl, Therese last_name: Biedl - first_name: Stefan full_name: Huber, Stefan id: 4700A070-F248-11E8-B48F-1D18A9856A87 last_name: Huber orcid: 0000-0002-8871-5814 - first_name: Peter full_name: Palfrader, Peter last_name: Palfrader citation: ama: 'Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10' apa: 'Biedl, T., Huber, S., & Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. https://doi.org/10.1007/978-3-319-13075-0_10' chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10. ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127. ista: 'Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.' mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10. short: T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127. conference: end_date: 2014-12-17 location: Jeonju, Korea name: 'ISAAC: International Symposium on Algorithms and Computation' start_date: 2014-12-15 date_created: 2022-03-21T07:09:03Z date_published: 2014-11-08T00:00:00Z date_updated: 2023-02-23T12:20:55Z day: '08' department: - _id: HeEd doi: 10.1007/978-3-319-13075-0_10 intvolume: ' 8889' language: - iso: eng month: '11' oa_version: None page: 117-127 publication: 25th International Symposium, ISAAC 2014 publication_identifier: eisbn: - '9783319130750' eissn: - 1611-3349 isbn: - '9783319130743' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '481' relation: later_version status: public scopus_import: '1' status: public title: Planar matchings for weighted straight skeletons type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8889 year: '2014' ... --- _id: '537' abstract: - lang: eng text: Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring. author: - first_name: Roshan full_name: Prizak, Roshan id: 4456104E-F248-11E8-B48F-1D18A9856A87 last_name: Prizak - first_name: Thomas full_name: Ezard, Thomas last_name: Ezard - first_name: Rebecca full_name: Hoyle, Rebecca last_name: Hoyle citation: ama: Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 2014;4(15):3139-3145. doi:10.1002/ece3.1150 apa: Prizak, R., Ezard, T., & Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1150 chicago: Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences of Maternal and Grandmaternal Effects.” Ecology and Evolution. Wiley-Blackwell, 2014. https://doi.org/10.1002/ece3.1150. ieee: R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014. ista: Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 4(15), 3139–3145. mla: Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal Effects.” Ecology and Evolution, vol. 4, no. 15, Wiley-Blackwell, 2014, pp. 3139–45, doi:10.1002/ece3.1150. short: R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145. date_created: 2018-12-11T11:47:02Z date_published: 2014-07-19T00:00:00Z date_updated: 2021-01-12T08:01:30Z day: '19' ddc: - '530' - '571' department: - _id: NiBa - _id: GaTk doi: 10.1002/ece3.1150 file: - access_level: open_access checksum: e32abf75a248e7a11811fd7f60858769 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:31Z date_updated: 2020-07-14T12:46:38Z file_id: '4886' file_name: IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf file_size: 621582 relation: main_file file_date_updated: 2020-07-14T12:46:38Z has_accepted_license: '1' intvolume: ' 4' issue: '15' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 3139 - 3145 publication: Ecology and Evolution publication_status: published publisher: Wiley-Blackwell publist_id: '7280' pubrep_id: '934' scopus_import: 1 status: public title: Fitness consequences of maternal and grandmaternal effects 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: 4 year: '2014' ... --- _id: '1903' abstract: - lang: eng text: 'We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:10.1007/978-3-662-44522-8_1' apa: 'Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1' chicago: Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1. ieee: 'K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.' ista: 'Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.' mla: Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1. short: K. Chatterjee, in:, Springer, 2014, pp. 1–4. conference: end_date: 2014-08-29 location: Budapest, Hungary name: 'MFCS: Mathematical Foundations of Computer Science' start_date: 2014-08-25 date_created: 2018-12-11T11:54:38Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-02-23T12:23:43Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-662-44522-8_1 ec_funded: 1 intvolume: ' 8634' issue: PART 1 language: - iso: eng month: '01' oa_version: None page: 1 - 4 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_status: published publisher: Springer publist_id: '5192' pubrep_id: '141' quality_controlled: '1' related_material: record: - id: '2211' relation: later_version status: public - id: '5381' relation: earlier_version status: public scopus_import: 1 status: public title: Partial-observation stochastic reachability and parity games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8634 year: '2014' ... --- _id: '2211' abstract: - lang: eng text: 'In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Our main results for pure strategies are as follows: (1) For one-sided games with player 2 having perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 having perfect observation we show that nonelementarymemory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least nonelementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibit serious flaws in previous results of the literature: we show a nonelementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.' article_number: '16' 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 citation: ama: 'Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 2014;15(2). doi:10.1145/2579821' apa: 'Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2579821' chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.' ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.' ista: 'Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.' mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.' short: K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014). date_created: 2018-12-11T11:56:21Z date_published: 2014-04-01T00:00:00Z date_updated: 2023-02-23T12:23:43Z day: '01' department: - _id: KrCh doi: 10.1145/2579821 external_id: arxiv: - '1107.2141' intvolume: ' 15' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1107.2141 month: '04' oa: 1 oa_version: Preprint publication: ACM Transactions on Computational Logic (TOCL) publication_status: published publisher: ACM publist_id: '4759' quality_controlled: '1' related_material: record: - id: '1903' relation: earlier_version status: public - id: '2955' relation: earlier_version status: public - id: '5381' relation: earlier_version status: public scopus_import: 1 status: public title: 'Partial-observation stochastic games: How to win when belief fails' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2014' ... --- _id: '2038' abstract: - lang: eng text: Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with "controlled accumulation," allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable. acknowledgement: The research was supported in part by ERC Starting grant 278410 (QUALITY). article_number: '27' article_processing_charge: No article_type: original author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - 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: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 2014;15(4). doi:10.1145/2629686 apa: Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686 chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686. ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014. ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27. mla: Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686. short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014). date_created: 2018-12-11T11:55:21Z date_published: 2014-09-16T00:00:00Z date_updated: 2023-02-23T12:23:54Z day: '16' ddc: - '000' - '004' department: - _id: ToHe - _id: KrCh doi: 10.1145/2629686 ec_funded: 1 file: - access_level: open_access checksum: 354c41d37500b56320afce94cf9a99c2 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:59Z date_updated: 2020-07-14T12:45:26Z file_id: '4851' file_name: IST-2014-192-v1+1_AccumulativeValues.pdf file_size: 346184 relation: main_file file_date_updated: 2020-07-14T12:45:26Z has_accepted_license: '1' intvolume: ' 15' issue: '4' language: - iso: eng month: '09' 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: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _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: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: ACM Transactions on Computational Logic (TOCL) publication_status: published publisher: ACM publist_id: '5013' pubrep_id: '192' quality_controlled: '1' related_material: record: - id: '3356' relation: earlier_version status: public - id: '5385' relation: earlier_version status: public scopus_import: 1 status: public title: Temporal specifications with accumulative values type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2014' ... --- _id: '2162' abstract: - lang: eng text: 'We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lies in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP ∩ coNP is the long-standing best known bound). We present a variant of the strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existential theory of the reals, and establish square-root sum hardness for a related class of games.' alternative_title: - LNCS 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. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. doi:10.1007/978-3-662-43951-7_11' apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_11' chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11. ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.' ista: 'Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.' mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11. short: K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133. conference: end_date: 2014-07-11 location: Copenhagen, Denmark name: 'ICST: International Conference on Software Testing, Verification and Validation' start_date: 2014-07-08 date_created: 2018-12-11T11:56:04Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-02-23T12:24:48Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-662-43951-7_11 ec_funded: 1 external_id: arxiv: - '1404.5734' intvolume: ' 8573' issue: Part 2 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1404.5734 month: '01' oa: 1 oa_version: Preprint page: 122 - 133 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_status: published publisher: Springer publist_id: '4822' quality_controlled: '1' related_material: record: - id: '5404' relation: earlier_version status: public status: public title: The complexity of ergodic mean payoff games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8573 year: '2014' ... --- _id: '2213' abstract: - lang: eng text: We consider two-player partial-observation stochastic games on finitestate graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are ε-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). These qualitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME.We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis. acknowledgement: 'This research was supported by European project Cassting (FP7-601148), NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.' alternative_title: - LNCS 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: Sumit full_name: Nain, Sumit last_name: Nain - first_name: Moshe full_name: Vardi, Moshe last_name: Vardi citation: ama: 'Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Vol 8412. Springer; 2014:242-257. doi:10.1007/978-3-642-54830-7_16' apa: 'Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16' chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_16. ieee: 'K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.' ista: 'Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.' mla: Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp. 242–57, doi:10.1007/978-3-642-54830-7_16. short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257. conference: end_date: 2014-04-13 location: Grenoble, France name: 'FoSSaCS: Foundations of Software Science and Computation Structures' start_date: 2014-04-05 date_created: 2018-12-11T11:56:21Z date_published: 2014-04-01T00:00:00Z date_updated: 2023-02-23T12:24:58Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-54830-7_16 ec_funded: 1 external_id: arxiv: - '1401.3289' intvolume: ' 8412' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1401.3289 month: '04' oa: 1 oa_version: Preprint page: 242 - 257 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_status: published publisher: Springer publist_id: '4757' quality_controlled: '1' related_material: record: - id: '5408' relation: earlier_version status: public scopus_import: 1 status: public title: The complexity of partial-observation stochastic parity games with finite-memory strategies type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8412 year: '2014' ... --- _id: '2212' abstract: - lang: eng text: 'The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2 1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic). We present an algorithm running in time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which the objective can be ensured with probability 1, where n is the number of states of the game, d the number of priorities of the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states in 2 1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). ' acknowledgement: "This research was supported by European project Cassting (FP7-601148).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128." alternative_title: - LNCS 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: Youssouf full_name: Oualhadj, Youssouf last_name: Oualhadj citation: ama: 'Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:10.1007/978-3-642-54830-7_14' apa: 'Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_14' chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14. ieee: 'K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.' ista: 'Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.' mla: Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14. short: K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225. conference: end_date: 2014-04-13 location: Grenoble, France name: 'FoSSaCS: Foundations of Software Science and Computation Structures' start_date: 2014-04-05 date_created: 2018-12-11T11:56:21Z date_published: 2014-04-01T00:00:00Z date_updated: 2023-02-23T12:24:50Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-54830-7_14 ec_funded: 1 intvolume: ' 8412' language: - iso: eng month: '04' oa_version: None page: 210 - 225 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_status: published publisher: Springer publist_id: '4758' quality_controlled: '1' related_material: record: - id: '5405' relation: earlier_version status: public scopus_import: 1 status: public title: Perfect-information stochastic mean-payoff parity games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8412 year: '2014' ... --- _id: '2216' abstract: - lang: eng text: The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory, parsing, and speech recognition. In this paper, we lift the study of edit distances from untimed languages to the timed setting. We define an edit distance between timed words which incorporates both the edit distance between the untimed words and the absolute difference in time stamps. Our edit distance between two timed words is computable in polynomial time. Further, we show that the edit distance between a timed word and a timed language generated by a timed automaton, defined as the edit distance between the word and the closest word in the language, is PSPACE-complete. While computing the edit distance between two timed automata is undecidable, we show that the approximate version, where we decide if the edit distance between two timed automata is either less than a given parameter or more than δ away from the parameter, for δ > 0, can be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques can be generalized to the setting of hybrid systems, and analogous decidability results hold for rectangular automata. 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: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: 'Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata. In: Springer; 2014:303-312. doi:10.1145/2562059.2562141' apa: 'Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141' chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141. ieee: 'K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.' ista: 'Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.' mla: Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer, 2014, pp. 303–12, doi:10.1145/2562059.2562141. short: K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312. conference: end_date: 2017-04-17 location: Berlin, Germany name: 'HSCC: Hybrid Systems - Computation and Control' start_date: 2017-04-15 date_created: 2018-12-11T11:56:22Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-02-23T12:25:01Z day: '01' department: - _id: KrCh doi: 10.1145/2562059.2562141 language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/citation.cfm?doid=2562059.2562141 month: '01' oa: 1 oa_version: Submitted Version page: 303 - 312 publication_status: published publisher: Springer publist_id: '4752' quality_controlled: '1' related_material: record: - id: '5409' relation: earlier_version status: public status: public title: Edit distance for timed automata type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5411' abstract: - lang: eng text: "Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.\r\nIn this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems." alternative_title: - IST Austria Technical Report author: - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - 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: Willibald full_name: Krenn, Willibald last_name: Krenn - first_name: Dejan full_name: Nickovic, Dejan id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87 last_name: Nickovic citation: ama: Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional Specifications for IOCO Testing. IST Austria; 2014. doi:10.15479/AT:IST-2014-148-v2-1 apa: Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional specifications for IOCO testing. IST Austria. https://doi.org/10.15479/AT:IST-2014-148-v2-1 chicago: Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. Compositional Specifications for IOCO Testing. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-148-v2-1. ieee: P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, Compositional specifications for IOCO testing. IST Austria, 2014. ista: Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p. mla: Daca, Przemyslaw, et al. Compositional Specifications for IOCO Testing. IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1. short: P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014. date_created: 2018-12-12T11:39:11Z date_published: 2014-01-28T00:00:00Z date_updated: 2023-02-23T10:31:07Z day: '28' ddc: - '000' department: - _id: ToHe doi: 10.15479/AT:IST-2014-148-v2-1 file: - access_level: open_access checksum: 0e03aba625cc334141a3148432aa5760 content_type: application/pdf creator: system date_created: 2018-12-12T11:54:21Z date_updated: 2020-07-14T12:46:46Z file_id: '5543' file_name: IST-2014-148-v2+1_main_tr.pdf file_size: 534732 relation: main_file file_date_updated: 2020-07-14T12:46:46Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '20' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '152' related_material: record: - id: '2167' relation: later_version status: public status: public title: Compositional specifications for IOCO testing type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5413' abstract: - lang: eng text: "We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. " 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: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik citation: ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v2-2 apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2 chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2. ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014. ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p. mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v2-2. short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014. date_created: 2018-12-12T11:39:11Z date_published: 2014-02-06T00:00:00Z date_updated: 2023-02-23T12:25:18Z day: '06' ddc: - '000' department: - _id: KrCh doi: 10.15479/AT:IST-2014-153-v2-2 file: - access_level: open_access checksum: ce4967a184d84863eec76c66cbac1614 content_type: application/pdf creator: system date_created: 2018-12-12T11:54:17Z date_updated: 2020-07-14T12:46:47Z file_id: '5539' file_name: IST-2014-153-v2+2_main.pdf file_size: 606049 relation: main_file file_date_updated: 2020-07-14T12:46:47Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '33' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '164' related_material: record: - id: '2063' relation: later_version status: public - id: '5412' relation: earlier_version status: public - id: '5414' relation: later_version status: public status: public title: CEGAR for qualitative analysis of probabilistic systems type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5414' abstract: - lang: eng text: "We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. \r\nWe have implemented our algorithms and show that the compositional analysis leads to significant improvements. " 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: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik citation: ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v3-1 apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1 chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1. ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014. ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p. mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v3-1. short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014. date_created: 2018-12-12T11:39:12Z date_published: 2014-02-07T00:00:00Z date_updated: 2023-02-23T12:25:15Z day: '07' ddc: - '000' department: - _id: KrCh doi: 10.15479/AT:IST-2014-153-v3-1 file: - access_level: open_access checksum: 87b93fe9af71fc5c94b0eb6151537e11 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:03Z date_updated: 2020-07-14T12:46:48Z file_id: '5464' file_name: IST-2014-153-v3+1_main.pdf file_size: 606227 relation: main_file file_date_updated: 2020-07-14T12:46:48Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '33' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '165' related_material: record: - id: '2063' relation: later_version status: public - id: '5412' relation: earlier_version status: public - id: '5413' relation: earlier_version status: public status: public title: CEGAR for qualitative analysis of probabilistic systems type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5412' abstract: - lang: eng text: "We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. " 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: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik citation: ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v1-1 apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1 chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1. ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014. ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p. mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1. short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014. date_created: 2018-12-12T11:39:11Z date_published: 2014-01-29T00:00:00Z date_updated: 2023-02-23T12:25:18Z day: '29' ddc: - '000' department: - _id: KrCh doi: 10.15479/AT:IST-2014-153-v1-1 file: - access_level: open_access checksum: 4d6cda4bebed970926403ad6ad8c745f content_type: application/pdf creator: system date_created: 2018-12-12T11:53:39Z date_updated: 2020-07-14T12:46:47Z file_id: '5500' file_name: IST-2014-153-v1+1_main.pdf file_size: 423322 relation: main_file file_date_updated: 2020-07-14T12:46:47Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '31' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '153' related_material: record: - id: '2063' relation: later_version status: public - id: '5413' relation: later_version status: public - id: '5414' relation: later_version status: public status: public title: CEGAR for qualitative analysis of probabilistic systems type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2163' abstract: - lang: eng text: We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. From our results we derive new complexity results for partial-observation stochastic games. acknowledgement: "This research was partly supported by European project Cassting (FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n" alternative_title: - LNCS 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 citation: ama: 'Chatterjee K, Doyen L. Games with a weak adversary. In: Lecture Notes in Computer Science. Vol 8573. Springer; 2014:110-121. doi:10.1007/978-3-662-43951-7_10' apa: 'Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10' chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10. ieee: K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121. ista: 'Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.' mla: Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:10.1007/978-3-662-43951-7_10. short: K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121. conference: end_date: 2014-07-11 location: Copenhagen, Denmark name: 'ICALP: Automata, Languages and Programming' start_date: 2014-07-08 date_created: 2018-12-11T11:56:04Z date_published: 2014-01-01T00:00:00Z date_updated: 2023-02-23T12:25:29Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-662-43951-7_10 ec_funded: 1 external_id: arxiv: - '1404.5453' intvolume: ' 8573' issue: Part 2 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1404.5453 month: '01' oa: 1 oa_version: Preprint page: 110 - 121 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: Lecture Notes in Computer Science publication_status: published publisher: Springer publist_id: '4821' quality_controlled: '1' related_material: record: - id: '5418' relation: earlier_version status: public status: public title: Games with a weak adversary type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8573 year: '2014' ... --- _id: '5419' abstract: - lang: eng text: "We consider the reachability and shortest path problems on low tree-width graphs, with n nodes, m edges, and tree-width t, on a standard RAM with wordsize W. We use O to hide polynomial factors of the inverse of the Ackermann function. Our main contributions are three fold:\r\n1. For reachability, we present an algorithm that requires O(n·t2·log(n/t)) preprocessing time, O(n·(t·log(n/t))/W) space, and O(t/W) time for pair queries and O((n·t)/W) time for single-source queries. Note that for constant t our algorithm uses O(n·logn) time for preprocessing; and O(n/W) time for single-source queries, which is faster than depth first search/breath first search (after the preprocessing).\r\n2. We present an algorithm for shortest path that requires O(n·t2) preprocessing time, O(n·t) space, and O(t2) time for pair queries and O(n·t) time single-source queries.\r\n3. We give a space versus query time trade-off algorithm for shortest path that, given any constant >0, requires O(n·t2) preprocessing time, O(n·t2) space, and O(n1−·t2) time for pair queries.\r\nOur algorithms improve all existing results, and use very simple data structures." 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: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-187-v1-1 apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1 chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1. ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014. ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p. mla: Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1. short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014. date_created: 2018-12-12T11:39:13Z date_published: 2014-04-14T00:00:00Z date_updated: 2021-01-12T08:02:03Z day: '14' ddc: - '000' department: - _id: KrCh doi: 10.15479/AT:IST-2014-187-v1-1 file: - access_level: open_access checksum: c608e66030a4bf51d2d99b451f539b99 content_type: application/pdf creator: system date_created: 2018-12-12T11:54:25Z date_updated: 2020-07-14T12:46:50Z file_id: '5548' file_name: IST-2014-187-v1+1_main_full_tech.pdf file_size: 670031 relation: main_file file_date_updated: 2020-07-14T12:46:50Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '34' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '187' status: public title: Improved algorithms for reachability and shortest path on low tree-width graphs type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '2217' abstract: - lang: eng text: "As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem." acknowledgement: "This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/171" article_processing_charge: No 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: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: 'Henzinger TA, Otop J. Model measuring for hybrid systems. In: Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control. Springer; 2014:213-222. doi:10.1145/2562059.2562130' apa: 'Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. In Proceedings of the 17th international conference on Hybrid systems: computation and control (pp. 213–222). Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562130' chicago: 'Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.” In Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, 213–22. Springer, 2014. https://doi.org/10.1145/2562059.2562130.' ieee: 'T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings of the 17th international conference on Hybrid systems: computation and control, Berlin, Germany, 2014, pp. 213–222.' ista: 'Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222.' mla: 'Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.' short: 'T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.' conference: end_date: 2014-04-17 location: Berlin, Germany name: 'HSCC: Hybrid Systems - Computation and Control' start_date: 2014-04-15 date_created: 2018-12-11T11:56:23Z date_published: 2014-04-01T00:00:00Z date_updated: 2023-02-23T12:25:23Z day: '01' department: - _id: ToHe doi: 10.1145/2562059.2562130 ec_funded: 1 language: - iso: eng month: '04' oa_version: None page: 213 - 222 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: 'Proceedings of the 17th international conference on Hybrid systems: computation and control' publication_status: published publisher: Springer publist_id: '4751' quality_controlled: '1' related_material: record: - id: '5416' relation: earlier_version status: public scopus_import: 1 status: public title: Model measuring for hybrid systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5417' abstract: - lang: eng text: "We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M'within distance ρ from M satisfy (or violate)φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata.\r\nThe model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification.\r\nWe show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved.\r\nWe use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. \r\nWe give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications." alternative_title: - IST Austria Technical Report 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: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: Henzinger TA, Otop J. From Model Checking to Model Measuring. IST Austria; 2014. doi:10.15479/AT:IST-2014-172-v1-1 apa: Henzinger, T. A., & Otop, J. (2014). From model checking to model measuring. IST Austria. https://doi.org/10.15479/AT:IST-2014-172-v1-1 chicago: Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-172-v1-1. ieee: T. A. Henzinger and J. Otop, From model checking to model measuring. IST Austria, 2014. ista: Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p. mla: Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1. short: T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014. date_created: 2018-12-12T11:39:13Z date_published: 2014-02-19T00:00:00Z date_updated: 2023-02-23T10:38:10Z day: '19' ddc: - '000' department: - _id: ToHe doi: 10.15479/AT:IST-2014-172-v1-1 file: - access_level: open_access checksum: fcc3eab903cfcd3778b338d2d0d44d18 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:20Z date_updated: 2020-07-14T12:46:49Z file_id: '5481' file_name: IST-2014-172-v1+1_report.pdf file_size: 383052 relation: main_file file_date_updated: 2020-07-14T12:46:49Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '14' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '175' related_material: record: - id: '2327' relation: later_version status: public status: public title: From model checking to model measuring type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5416' abstract: - lang: eng text: As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.The contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem. alternative_title: - IST Austria Technical Report 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: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: Henzinger TA, Otop J. Model Measuring for Hybrid Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-171-v1-1 apa: Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-171-v1-1 chicago: Henzinger, Thomas A, and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-171-v1-1. ieee: T. A. Henzinger and J. Otop, Model measuring for hybrid systems. IST Austria, 2014. ista: Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p. mla: Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1. short: T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014. date_created: 2018-12-12T11:39:12Z date_published: 2014-02-19T00:00:00Z date_updated: 2023-02-23T10:33:21Z day: '19' ddc: - '005' department: - _id: ToHe doi: 10.15479/AT:IST-2014-171-v1-1 file: - access_level: open_access checksum: 445456d22371e4e49aad2b9a0c13bf80 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:32Z date_updated: 2020-07-14T12:46:49Z file_id: '5492' file_name: IST-2014-171-v1+1_report.pdf file_size: 712077 relation: main_file file_date_updated: 2020-07-14T12:46:49Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '22' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '171' related_material: record: - id: '2217' relation: later_version status: public status: public title: Model measuring for hybrid systems type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5418' abstract: - lang: eng text: We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. Our results have tight connections with partial-observation stochastic games for which we derive new complexity results. 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: Laurent full_name: Doyen, Laurent last_name: Doyen citation: ama: Chatterjee K, Doyen L. Games with a Weak Adversary. IST Austria; 2014. doi:10.15479/AT:IST-2014-176-v1-1 apa: Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1 chicago: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1. ieee: K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014. ista: Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p. mla: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1. short: K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014. date_created: 2018-12-12T11:39:13Z date_published: 2014-03-22T00:00:00Z date_updated: 2023-02-23T10:30:58Z day: '22' ddc: - '000' - '005' department: - _id: KrCh doi: 10.15479/AT:IST-2014-176-v1-1 file: - access_level: open_access checksum: 1d6958aa60050e1c3e932c6e5f34c39f content_type: application/pdf creator: system date_created: 2018-12-12T11:53:07Z date_updated: 2020-07-14T12:46:49Z file_id: '5468' file_name: IST-2014-176-v1+1_icalp_14.pdf file_size: 328253 relation: main_file file_date_updated: 2020-07-14T12:46:49Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '18' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '176' related_material: record: - id: '2163' relation: later_version status: public status: public title: Games with a weak adversary type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ... --- _id: '5420' abstract: - lang: eng text: 'We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy).' 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 citation: ama: Chatterjee K, Ibsen-Jensen R. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-191-v1-1 apa: Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1 chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1. ieee: K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014. ista: Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p. mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1. short: K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014. date_created: 2018-12-12T11:39:14Z date_published: 2014-04-14T00:00:00Z date_updated: 2021-01-12T08:02:05Z day: '14' ddc: - '000' - '005' department: - _id: KrCh doi: 10.15479/AT:IST-2014-191-v1-1 file: - access_level: open_access checksum: 49e0fd3e62650346daf7dc04604f7a0a content_type: application/pdf creator: system date_created: 2018-12-12T11:53:58Z date_updated: 2020-07-14T12:46:50Z file_id: '5520' file_name: IST-2014-191-v1+1_main_full.pdf file_size: 584368 relation: main_file file_date_updated: 2020-07-14T12:46:50Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '49' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '191' status: public title: The value 1 problem for concurrent mean-payoff games type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2014' ...