var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://bercher.net/bibtex/05-Zhang/all.bib&theme=default&fullnames=1&jsonp=1&hidemenu=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://bercher.net/bibtex/05-Zhang/all.bib&theme=default&fullnames=1&jsonp=1&hidemenu=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://bercher.net/bibtex/05-Zhang/all.bib&theme=default&fullnames=1&jsonp=1&hidemenu=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A Counter-Example Based Approach to Probabilistic Conformant Planning.\n \n \n \n\n\n \n Xiaodi Zhang; Alban Grastien; and Charles Gretton.\n\n\n \n\n\n\n In Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024. AAAI Press\n This paper won the ICAPS 2024 Best Student Paper Award\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{Zhang2024ProbabilisticPlanning,\n  author    = {Xiaodi Zhang and Alban Grastien and Charles Gretton},\n  booktitle = {Proceedings of the 34th International Conference on Automated Planning and Scheduling ({ICAPS 2024})},\n  title     = {A Counter-Example Based Approach to Probabilistic Conformant Planning},\n  year      = {2024},\n  publisher = {AAAI Press},\n  note      = {<b><i>This paper won the ICAPS 2024 Best Student Paper Award</i></b>},\n  abstract  = {This paper introduces a counter-example based approach for solving probabilistic conformant planning (PCP) problems. Our algorithm incrementally generates candidate plans and identifies counter-examples until it finds a plan for which the probability of success is above the specified threshold. We prove that the algorithm is sound and complete. We further propose a variation of our algorithm that uses hitting sets to accelerate the generation of candidate plans. Experimental results show that our planner is particularly suited for problems with a high probability threshold.},\n}\n\n
\n
\n\n\n
\n This paper introduces a counter-example based approach for solving probabilistic conformant planning (PCP) problems. Our algorithm incrementally generates candidate plans and identifies counter-examples until it finds a plan for which the probability of success is above the specified threshold. We prove that the algorithm is sound and complete. We further propose a variation of our algorithm that uses hitting sets to accelerate the generation of candidate plans. Experimental results show that our planner is particularly suited for problems with a high probability threshold.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improvements to CPCES.\n \n \n \n \n\n\n \n Xiaodi Zhang; and Alban Grastien.\n\n\n \n\n\n\n In Proceedings of the 16th International Symposium on Combinatorial Search (SoCS 2023), pages 110–118, 2023. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"Improvements paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{Zhang2023ConformantPlanning,\n  author    = {Xiaodi Zhang and Alban Grastien,},\n  booktitle = {Proceedings of the 16th International Symposium on Combinatorial Search (SoCS 2023)},\n  title     = {Improvements to CPCES},\n  year      = {2023},\n  pages     = {110--118},\n  publisher = {AAAI Press},\n  abstract  = {This paper introduces three improvements to the conformant planner CPCES, which continuously searches candidate plans and counter-examples against the current candidate plan until a valid plan (no counter-example exists) is found. First, we identify and merge equivalent PDDL facts to accelerate candidate plan generation. Second, we warm-start CPCES by generating multiple carefully selected counter-examples at the beginning of the procedure, which reduces the number of calls to the classical planner. Third, we investigate the use Fast Downward (FD) as the candidate plan generator; in particular, we propose an incremental procedure to generate the SAS+ file used by FD. Our experimental results show significant improvements for each technique.},\n  doi       = {10.1609/socs.v16i1.27289},\n  url_paper     = {https://ojs.aaai.org/index.php/SOCS/article/view/27289/27062}\n}\n\n
\n
\n\n\n
\n This paper introduces three improvements to the conformant planner CPCES, which continuously searches candidate plans and counter-examples against the current candidate plan until a valid plan (no counter-example exists) is found. First, we identify and merge equivalent PDDL facts to accelerate candidate plan generation. Second, we warm-start CPCES by generating multiple carefully selected counter-examples at the beginning of the procedure, which reduces the number of calls to the classical planner. Third, we investigate the use Fast Downward (FD) as the candidate plan generator; in particular, we propose an incremental procedure to generate the SAS+ file used by FD. Our experimental results show significant improvements for each technique.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Computing Superior Counter-Examples for Conformant Planning.\n \n \n \n \n\n\n \n Xiaodi Zhang; Alban Grastien; and Enrico Scala.\n\n\n \n\n\n\n In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pages 10017–10024, 2020. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"Computing paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{Zhang2020ConformantPlanning,\n  author    = {Xiaodi Zhang and Alban Grastien and Enrico Scala},\n  booktitle = {Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020)},\n  title     = {Computing Superior Counter-Examples for Conformant Planning},\n  year      = {2020},\n  pages     = {10017--10024},\n  publisher = {AAAI Press},\n  abstract  = {In a counter-example based approach to conformant planning, choosing the right counter-example can improve performance. We formalise this observation by introducing the notion of “superiority” of a counter-example over another one, that holds whenever the superior counter-example exhibits more tags than the latter. We provide a theoretical explanation that supports the strategy of searching for maximally superior counter-examples, and we show how this strategy can be implemented. The empirical experiments validate our approach.},\n  doi       = {10.1609/aaai.v34i06.6558},\n  url_paper     = {https://ojs.aaai.org/index.php/AAAI/article/view/6558/6414}\n}\n\n
\n
\n\n\n
\n In a counter-example based approach to conformant planning, choosing the right counter-example can improve performance. We formalise this observation by introducing the notion of “superiority” of a counter-example over another one, that holds whenever the superior counter-example exhibits more tags than the latter. We provide a theoretical explanation that supports the strategy of searching for maximally superior counter-examples, and we show how this strategy can be implemented. The empirical experiments validate our approach.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Microcalorimetric studyof the effect of manganese on the growth and metabolism in a heterogeneouslyexpressing manganese-dependent superoxide dismutase (Mn-SOD) strain.\n \n \n \n \n\n\n \n Jianmei Su; Zhou Li; Bei Liao; Yanhua Zhu; Xiaodi Zhang; Chunhong Wang; and Jin He.\n\n\n \n\n\n\n Journal of Thermal Analysis and Calorimetry Art,1407–1416. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Microcalorimetric paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{Su2017MnSODStudy,\n  author   = {Jianmei Su and Zhou Li and Bei Liao and Yanhua Zhu and Xiaodi Zhang and Chunhong Wang and Jin He},\n  journal  = {Journal of Thermal Analysis and Calorimetry Art},\n  title    = {Microcalorimetric studyof the effect of manganese on the growth and metabolism in a heterogeneouslyexpressing manganese-dependent superoxide dismutase (Mn-SOD) strain},\n  year     = {2017},\n  pages    = {1407--1416},\n  abstract = {In bacteria, manganese (Mn) is best understood for its roles in protection against oxidative stress as a cofactor of manganese-dependent superoxide dismutase (Mn-SOD). There are four SOD enzymes, including two distinct Mn-SOD proteins (SodA1 and SodA2), with an approximately 53% amino sequence identity to each other, one Cu/Zn-SOD and one Fe-SOD in Bacillus thuringiensis. The specific activity of heterogeneously expressed SodA1 enzyme in Escherichia coli was 10,860 U mg−1, which was enhanced with the addition of elevated exogenous Mn(II) levels and reached the highest specific activity (14,519 U mg−1) at 80 μM Mn(II). However, neither the purified SodA1 enzyme nor the E. coli recombinant strain BL21-SOD could oxidize Mn(II) in vitro or in vivo. The growth of BL21-SOD strain was also increased by 2 mM Mn(II), and its intracellular accumulated Mn(II) level reached 41.5 μM. The obtained power–time curves from microcalorimetric assay demonstrated that Q peak of BL21-SOD cultivated with 2 mM Mn(II) was significantly increased, which was 3.55-fold and 3.85-fold higher than the parent strain BL21(DE3) and control strain BL21-pET, respectively, indicating that the exposure of Mn(II) and accompanying oxidative stress might induce and activate the overproduction of SodA1 to eliminate toxic O −2 .},\n  doi      = {s10973-017-6282-8},\n  url_paper    = {https://link.springer.com/content/pdf/10.1007/s10973-017-6282-8.pdf}\n}\n
\n
\n\n\n
\n In bacteria, manganese (Mn) is best understood for its roles in protection against oxidative stress as a cofactor of manganese-dependent superoxide dismutase (Mn-SOD). There are four SOD enzymes, including two distinct Mn-SOD proteins (SodA1 and SodA2), with an approximately 53% amino sequence identity to each other, one Cu/Zn-SOD and one Fe-SOD in Bacillus thuringiensis. The specific activity of heterogeneously expressed SodA1 enzyme in Escherichia coli was 10,860 U mg−1, which was enhanced with the addition of elevated exogenous Mn(II) levels and reached the highest specific activity (14,519 U mg−1) at 80 μM Mn(II). However, neither the purified SodA1 enzyme nor the E. coli recombinant strain BL21-SOD could oxidize Mn(II) in vitro or in vivo. The growth of BL21-SOD strain was also increased by 2 mM Mn(II), and its intracellular accumulated Mn(II) level reached 41.5 μM. The obtained power–time curves from microcalorimetric assay demonstrated that Q peak of BL21-SOD cultivated with 2 mM Mn(II) was significantly increased, which was 3.55-fold and 3.85-fold higher than the parent strain BL21(DE3) and control strain BL21-pET, respectively, indicating that the exposure of Mn(II) and accompanying oxidative stress might induce and activate the overproduction of SodA1 to eliminate toxic O −2 .\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);