[{"acknowledgement":" We also thank Philipp Maier and the IST Austria workshop for theirdedicated technical support","year":"2018","publisher":"Cambridge University Press","department":[{"_id":"BjHo"}],"publication_status":"published","author":[{"full_name":"Vasudevan, Mukund","first_name":"Mukund","last_name":"Vasudevan","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn"}],"volume":839,"date_updated":"2023-09-19T14:37:49Z","date_created":"2019-02-14T12:50:50Z","ec_funded":1,"oa":1,"external_id":{"isi":["000437858300003"],"arxiv":["1709.06372"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.06372"}],"project":[{"grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"doi":"10.1017/jfm.2017.923","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"month":"03","_id":"5996","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 839","title":"The critical point of the transition to turbulence in pipe flow","status":"public","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion."}],"citation":{"ama":"Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 2018;839:76-94. doi:10.1017/jfm.2017.923","ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94.","ieee":"M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” Journal of Fluid Mechanics, vol. 839. Cambridge University Press, pp. 76–94, 2018.","apa":"Vasudevan, M., & Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.923","mla":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:10.1017/jfm.2017.923.","short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","chicago":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2018. https://doi.org/10.1017/jfm.2017.923."},"publication":"Journal of Fluid Mechanics","page":"76-94","article_type":"original","date_published":"2018-03-25T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"25"},{"citation":{"chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800.","apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800"},"publication":"ACM Transactions on Programming Languages and Systems","date_published":"2018-06-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","_id":"5993","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 40","status":"public","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","oa_version":"Submitted Version","type":"journal_article","issue":"2","abstract":[{"text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism.","lang":"eng"}],"external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"main_file_link":[{"url":"https://arxiv.org/abs/1510.08517","open_access":"1"}],"oa":1,"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","isi":1,"doi":"10.1145/3174800","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0164-0925"]},"month":"06","year":"2018","department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery (ACM)","publication_status":"published","related_material":{"record":[{"id":"1438","status":"public","relation":"earlier_version"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Fu","first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei"},{"full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hasheminezhad, Rouzbeh","last_name":"Hasheminezhad","first_name":"Rouzbeh"}],"volume":40,"date_updated":"2023-09-19T14:38:42Z","date_created":"2019-02-14T12:29:10Z","article_number":"7","ec_funded":1},{"language":[{"iso":"eng"}],"doi":"10.1112/plms.12111","isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1407.7994","open_access":"1"}],"oa":1,"external_id":{"isi":["000431506400001"],"arxiv":["1407.7994"]},"publication_identifier":{"issn":["0024-6115"]},"month":"05","volume":116,"date_created":"2019-02-14T13:14:22Z","date_updated":"2023-09-19T14:37:19Z","author":[{"full_name":"Yang, Yaping","last_name":"Yang","first_name":"Yaping"},{"full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao","first_name":"Gufang"}],"department":[{"_id":"TaHa"}],"publisher":"Oxford University Press","publication_status":"published","year":"2018","date_published":"2018-05-01T00:00:00Z","page":"1029-1074","citation":{"short":"Y. Yang, G. Zhao, Proceedings of the London Mathematical Society 116 (2018) 1029–1074.","mla":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” Proceedings of the London Mathematical Society, vol. 116, no. 5, Oxford University Press, 2018, pp. 1029–74, doi:10.1112/plms.12111.","chicago":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” Proceedings of the London Mathematical Society. Oxford University Press, 2018. https://doi.org/10.1112/plms.12111.","ama":"Yang Y, Zhao G. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 2018;116(5):1029-1074. doi:10.1112/plms.12111","apa":"Yang, Y., & Zhao, G. (2018). The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. Oxford University Press. https://doi.org/10.1112/plms.12111","ieee":"Y. Yang and G. Zhao, “The cohomological Hall algebra of a preprojective algebra,” Proceedings of the London Mathematical Society, vol. 116, no. 5. Oxford University Press, pp. 1029–1074, 2018.","ista":"Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 116(5), 1029–1074."},"publication":"Proceedings of the London Mathematical Society","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","intvolume":" 116","title":"The cohomological Hall algebra of a preprojective algebra","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5999","issue":"5","abstract":[{"lang":"eng","text":"We introduce for each quiver Q and each algebraic oriented cohomology theory A, the cohomological Hall algebra (CoHA) of Q, as the A-homology of the moduli of representations of the preprojective algebra of Q. This generalizes the K-theoretic Hall algebra of commuting varieties defined by Schiffmann-Vasserot. When A is the Morava K-theory, we show evidence that this algebra is a candidate for Lusztig's reformulated conjecture on modular representations of algebraic groups.\r\nWe construct an action of the preprojective CoHA on the A-homology of Nakajima quiver varieties. We compare this with the action of the Borel subalgebra of Yangian when A is the intersection theory. We also give a shuffle algebra description of this CoHA in terms of the underlying formal group law of A. As applications, we obtain a shuffle description of the Yangian. "}],"type":"journal_article"},{"publisher":"Oxford University Press","department":[{"_id":"BeVi"}],"publication_status":"published","year":"2018","volume":10,"date_updated":"2023-09-19T14:39:08Z","date_created":"2019-02-14T12:13:52Z","author":[{"full_name":"Kincaid-Smith, Julien","first_name":"Julien","last_name":"Kincaid-Smith"},{"first_name":"Marion A L","last_name":"Picard","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8101-2518","full_name":"Picard, Marion A L"},{"full_name":"Cosseau, Céline","last_name":"Cosseau","first_name":"Céline"},{"last_name":"Boissier","first_name":"Jérôme","full_name":"Boissier, Jérôme"},{"first_name":"Dany","last_name":"Severac","full_name":"Severac, Dany"},{"last_name":"Grunau","first_name":"Christoph","full_name":"Grunau, Christoph"},{"first_name":"Eve","last_name":"Toulza","full_name":"Toulza, Eve"}],"file_date_updated":"2020-07-14T12:47:15Z","isi":1,"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"isi":["000429483700013"]},"language":[{"iso":"eng"}],"doi":"10.1093/gbe/evy037","publication_identifier":{"issn":["1759-6653"]},"month":"03","intvolume":" 10","ddc":["570"],"title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","status":"public","_id":"5989","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"creator":"dernst","file_size":529755,"content_type":"application/pdf","file_name":"2018_GBE_Kincaid_Smith.pdf","access_level":"open_access","date_created":"2019-02-14T12:20:01Z","date_updated":"2020-07-14T12:47:15Z","checksum":"736a459cb77de5824354466bb0331caf","file_id":"5991","relation":"main_file"}],"type":"journal_article","issue":"3","abstract":[{"text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds.","lang":"eng"}],"page":"840-856","citation":{"short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037.","chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037.","ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 2018;10(3):840-856. doi:10.1093/gbe/evy037","apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evy037","ieee":"J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” Genome Biology and Evolution, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.","ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856."},"publication":"Genome Biology and Evolution","date_published":"2018-03-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01"},{"status":"public","title":"Fast quantized arithmetic on x86: Trading compute for data movement","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"IEEE","_id":"6031","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-19T14:41:51Z","date_created":"2019-02-17T22:59:25Z","volume":"2018-October","oa_version":"None","author":[{"first_name":"Alen","last_name":"Stojanov","full_name":"Stojanov, Alen"},{"last_name":"Smith","first_name":"Tyler Michael","full_name":"Smith, Tyler Michael"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Puschel, Markus","first_name":"Markus","last_name":"Puschel"}],"article_number":"8598402","type":"conference","abstract":[{"text":"We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved.","lang":"eng"}],"isi":1,"quality_controlled":"1","publication":"2018 IEEE International Workshop on Signal Processing Systems","external_id":{"isi":["000465106800060"]},"citation":{"ama":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: 2018 IEEE International Workshop on Signal Processing Systems. Vol 2018-October. IEEE; 2018. doi:10.1109/SiPS.2018.8598402","ista":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402.","apa":"Stojanov, A., Smith, T. M., Alistarh, D.-A., & Puschel, M. (2018). Fast quantized arithmetic on x86: Trading compute for data movement. In 2018 IEEE International Workshop on Signal Processing Systems (Vol. 2018–October). Cape Town, South Africa: IEEE. https://doi.org/10.1109/SiPS.2018.8598402","ieee":"A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in 2018 IEEE International Workshop on Signal Processing Systems, Cape Town, South Africa, 2018, vol. 2018–October.","mla":"Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” 2018 IEEE International Workshop on Signal Processing Systems, vol. 2018–October, 8598402, IEEE, 2018, doi:10.1109/SiPS.2018.8598402.","short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","chicago":"Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In 2018 IEEE International Workshop on Signal Processing Systems, Vol. 2018–October. IEEE, 2018. https://doi.org/10.1109/SiPS.2018.8598402."},"language":[{"iso":"eng"}],"conference":{"name":"SiPS: Workshop on Signal Processing Systems","end_date":"2018-10-24","location":"Cape Town, South Africa","start_date":"2018-10-21"},"date_published":"2018-12-31T00:00:00Z","doi":"10.1109/SiPS.2018.8598402","scopus_import":"1","month":"12","day":"31","article_processing_charge":"No"},{"volume":"2018-July","date_created":"2018-12-11T11:44:13Z","date_updated":"2023-09-19T14:44:59Z","author":[{"full_name":"Horák, Karel","last_name":"Horák","first_name":"Karel"},{"first_name":"Branislav","last_name":"Bošanský","full_name":"Bošanský, Branislav"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"publisher":"IJCAI","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2018","acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","publist_id":"8030","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.24963/ijcai.2018/662","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13","location":"Stockholm, Sweden"},"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000764175404127"]},"main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2018/662","open_access":"1"}],"oa":1,"month":"07","oa_version":"Published Version","status":"public","title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","_id":"25","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples.","lang":"eng"}],"type":"conference","date_published":"2018-07-01T00:00:00Z","page":"4764 - 4770","citation":{"mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.","short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662","ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.","apa":"Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770."},"publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","article_processing_charge":"No","day":"01","scopus_import":"1"},{"doi":"10.24963/ijcai.2018/652","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"language":[{"iso":"eng"}],"external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","month":"07","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Elgyütt, Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","last_name":"Elgyütt","first_name":"Adrian"},{"full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Owen","last_name":"Rouillé","full_name":"Rouillé, Owen"}],"volume":2018,"date_created":"2018-12-11T11:44:13Z","date_updated":"2023-09-19T14:45:48Z","year":"2018","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","publisher":"IJCAI","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","ec_funded":1,"publist_id":"8031","date_published":"2018-07-01T00:00:00Z","citation":{"ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652."},"page":"4692 - 4699","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","_id":"24","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2018","status":"public","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"type":"conference"},{"publist_id":"8021","ec_funded":1,"year":"2018","publication_status":"published","publisher":"AAAI Press","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Chemlík","first_name":"Martin","full_name":"Chemlík, Martin"},{"full_name":"Topcu, Ufuk","first_name":"Ufuk","last_name":"Topcu"}],"date_created":"2018-12-11T11:44:16Z","date_updated":"2023-09-19T14:44:14Z","volume":2018,"month":"06","external_id":{"arxiv":["1710.00675"],"isi":["000492986200006"]},"main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"oa":1,"quality_controlled":"1","isi":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"conference":{"end_date":"2018-06-29","start_date":"2018-06-24","location":"Delft, Netherlands","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["ICAPS"],"abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"34","status":"public","title":"Sensor synthesis for POMDPs with reachability objectives","intvolume":" 2018","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","citation":{"ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","apa":"Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.","mla":"Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.","chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018."},"page":"47 - 55","date_published":"2018-06-01T00:00:00Z"},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-10-01T00:00:00Z","page":"269 - 304","publication":"Ars Combinatoria","citation":{"ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.","apa":"Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3. Ars Combinatoria. Charles Babbage Research Centre.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018."},"abstract":[{"lang":"eng","text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17]."}],"issue":"10","type":"journal_article","oa_version":"Preprint","status":"public","title":"Superconcentrators of density 25.3","intvolume":" 141","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"18","month":"10","publication_identifier":{"issn":["0381-7032"]},"language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"external_id":{"arxiv":["1405.7828"],"isi":["000446809500022"]},"oa":1,"publist_id":"8037","date_updated":"2023-09-19T14:46:18Z","date_created":"2018-12-11T11:44:11Z","volume":141,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"full_name":"Rolinek, Michal","last_name":"Rolinek","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Charles Babbage Research Centre","department":[{"_id":"VlKo"}],"year":"2018"},{"publication_identifier":{"issn":["2050-5094"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.1017/fms.2018.7","project":[{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000433915500001"],"arxiv":["1712.10205"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"ec_funded":1,"file_date_updated":"2020-07-14T12:47:28Z","article_number":"e7","volume":6,"date_created":"2019-04-30T06:09:57Z","date_updated":"2023-09-19T14:50:12Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8156"}]},"author":[{"full_name":"Akopyan, Arseniy","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X"},{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"publisher":"Cambridge University Press","publication_status":"published","year":"2018","has_accepted_license":"1","article_processing_charge":"No","day":"31","date_published":"2018-05-31T00:00:00Z","citation":{"ama":"Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7","ieee":"A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge University Press, 2018.","apa":"Akopyan, A., & Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2018.7","ista":"Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7.","short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).","mla":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.","chicago":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma. Cambridge University Press, 2018. https://doi.org/10.1017/fms.2018.7."},"publication":"Forum of Mathematics, Sigma","abstract":[{"text":"We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"checksum":"5a71b24ba712a3eb2e46165a38fbc30a","date_updated":"2020-07-14T12:47:28Z","date_created":"2019-04-30T06:14:58Z","file_id":"6356","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":249246,"access_level":"open_access","file_name":"2018_ForumMahtematics_Akopyan.pdf"}],"intvolume":" 6","status":"public","title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","ddc":["510"],"_id":"6355","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"}]