[{"date_published":"2018-05-01T00:00:00Z","publication":"Proceedings of the London Mathematical Society","citation":{"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","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.","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","ista":"Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 116(5), 1029–1074.","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."},"page":"1029-1074","day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","_id":"5999","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"The cohomological Hall algebra of a preprojective algebra","status":"public","intvolume":" 116","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. "}],"issue":"5","type":"journal_article","doi":"10.1112/plms.12111","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1407.7994","open_access":"1"}],"external_id":{"arxiv":["1407.7994"],"isi":["000431506400001"]},"oa":1,"isi":1,"quality_controlled":"1","month":"05","publication_identifier":{"issn":["0024-6115"]},"author":[{"full_name":"Yang, Yaping","last_name":"Yang","first_name":"Yaping"},{"id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao","first_name":"Gufang","full_name":"Zhao, Gufang"}],"date_updated":"2023-09-19T14:37:19Z","date_created":"2019-02-14T13:14:22Z","volume":116,"year":"2018","publication_status":"published","department":[{"_id":"TaHa"}],"publisher":"Oxford University Press"},{"year":"2018","publication_status":"published","department":[{"_id":"BeVi"}],"publisher":"Oxford University Press","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"},{"first_name":"Céline","last_name":"Cosseau","full_name":"Cosseau, Céline"},{"full_name":"Boissier, Jérôme","last_name":"Boissier","first_name":"Jérôme"},{"full_name":"Severac, Dany","last_name":"Severac","first_name":"Dany"},{"full_name":"Grunau, Christoph","first_name":"Christoph","last_name":"Grunau"},{"full_name":"Toulza, Eve","last_name":"Toulza","first_name":"Eve"}],"date_updated":"2023-09-19T14:39:08Z","date_created":"2019-02-14T12:13:52Z","volume":10,"file_date_updated":"2020-07-14T12:47:15Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","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"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1093/gbe/evy037","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"issn":["1759-6653"]},"_id":"5989","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["570"],"status":"public","title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","intvolume":" 10","file":[{"relation":"main_file","file_id":"5991","checksum":"736a459cb77de5824354466bb0331caf","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T12:20:01Z","access_level":"open_access","file_name":"2018_GBE_Kincaid_Smith.pdf","file_size":529755,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","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"}],"issue":"3","publication":"Genome Biology and Evolution","citation":{"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.","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.","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","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","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.","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.","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."},"page":"840-856","date_published":"2018-03-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1"},{"month":"07","language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13"},"doi":"10.24963/ijcai.2018/662","quality_controlled":"1","isi":1,"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"external_id":{"isi":["000764175404127"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2018/662"}],"oa":1,"ec_funded":1,"publist_id":"8030","date_created":"2018-12-11T11:44:13Z","date_updated":"2023-09-19T14:44:59Z","volume":"2018-July","author":[{"full_name":"Horák, Karel","last_name":"Horák","first_name":"Karel"},{"full_name":"Bošanský, Branislav","last_name":"Bošanský","first_name":"Branislav"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"IJCAI","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). ","year":"2018","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-07-01T00:00:00Z","page":"4764 - 4770","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","citation":{"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.","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.","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.","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.","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.","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"},"abstract":[{"lang":"eng","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."}],"type":"conference","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"},{"month":"07","quality_controlled":"1","isi":1,"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"oa":1,"external_id":{"arxiv":["1804.10601"],"isi":["000764175404117"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"language":[{"iso":"eng"}],"conference":{"location":"Stockholm, Sweden","start_date":"2018-07-13","end_date":"2018-07-19","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"doi":"10.24963/ijcai.2018/652","ec_funded":1,"publist_id":"8031","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IJCAI","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","date_updated":"2023-09-19T14:45:48Z","date_created":"2018-12-11T11:44:13Z","volume":2018,"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Elgyütt, Adrian","last_name":"Elgyütt","first_name":"Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"},{"full_name":"Rouillé, Owen","last_name":"Rouillé","first_name":"Owen"}],"scopus_import":"1","day":"01","article_processing_charge":"No","page":"4692 - 4699","citation":{"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.","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","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.","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"},"date_published":"2018-07-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","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."}],"status":"public","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","intvolume":" 2018","_id":"24","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint"},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-06-01T00:00:00Z","citation":{"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.","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.","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.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55.","chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.","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."},"page":"47 - 55","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"}],"type":"conference","alternative_title":["ICAPS"],"oa_version":"Preprint","_id":"34","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2018","status":"public","title":"Sensor synthesis for POMDPs with reachability objectives","month":"06","conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2018-06-24","location":"Delft, Netherlands","end_date":"2018-06-29"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1710.00675"}],"oa":1,"external_id":{"isi":["000492986200006"],"arxiv":["1710.00675"]},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"isi":1,"quality_controlled":"1","ec_funded":1,"publist_id":"8021","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Chemlík","first_name":"Martin","full_name":"Chemlík, Martin"},{"first_name":"Ufuk","last_name":"Topcu","full_name":"Topcu, Ufuk"}],"volume":2018,"date_created":"2018-12-11T11:44:16Z","date_updated":"2023-09-19T14:44:14Z","year":"2018","publisher":"AAAI Press","department":[{"_id":"KrCh"}],"publication_status":"published"}]