[{"author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","full_name":"Klimova, Anna","last_name":"Klimova","first_name":"Anna"},{"last_name":"Uhler","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","first_name":"Caroline"},{"full_name":"Rudas, Tamás","last_name":"Rudas","first_name":"Tamás"}],"isi":1,"external_id":{"isi":["000352661000005"],"arxiv":["1404.6617"]},"_id":"2014","issue":"7","volume":87,"publist_id":"5062","intvolume":"        87","page":"57 - 72","article_processing_charge":"No","date_published":"2015-07-01T00:00:00Z","year":"2015","publisher":"Elsevier","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Faithfulness and learning hypergraphs from discrete distributions","type":"journal_article","date_updated":"2025-09-23T08:45:54Z","publication":"Computational Statistics & Data Analysis","date_created":"2018-12-11T11:55:13Z","abstract":[{"text":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association.","lang":"eng"}],"quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","arxiv":1,"publication_status":"published","department":[{"_id":"CaUh"}],"day":"01","doi":"10.1016/j.csda.2015.01.017","corr_author":"1","month":"07","scopus_import":"1","citation":{"ama":"Klimova A, Uhler C, Rudas T. Faithfulness and learning hypergraphs from discrete distributions. <i>Computational Statistics &#38; Data Analysis</i>. 2015;87(7):57-72. doi:<a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">10.1016/j.csda.2015.01.017</a>","apa":"Klimova, A., Uhler, C., &#38; Rudas, T. (2015). Faithfulness and learning hypergraphs from discrete distributions. <i>Computational Statistics &#38; Data Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">https://doi.org/10.1016/j.csda.2015.01.017</a>","ieee":"A. Klimova, C. Uhler, and T. Rudas, “Faithfulness and learning hypergraphs from discrete distributions,” <i>Computational Statistics &#38; Data Analysis</i>, vol. 87, no. 7. Elsevier, pp. 57–72, 2015.","ista":"Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics &#38; Data Analysis. 87(7), 57–72.","chicago":"Klimova, Anna, Caroline Uhler, and Tamás Rudas. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” <i>Computational Statistics &#38; Data Analysis</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">https://doi.org/10.1016/j.csda.2015.01.017</a>.","short":"A. Klimova, C. Uhler, T. Rudas, Computational Statistics &#38; Data Analysis 87 (2015) 57–72.","mla":"Klimova, Anna, et al. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” <i>Computational Statistics &#38; Data Analysis</i>, vol. 87, no. 7, Elsevier, 2015, pp. 57–72, doi:<a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">10.1016/j.csda.2015.01.017</a>."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.6617"}],"status":"public"},{"file_date_updated":"2020-07-14T12:45:25Z","type":"journal_article","date_updated":"2025-09-23T14:51:55Z","abstract":[{"lang":"eng","text":"Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular trafficking. Among them, the Rab, Arf, and Rho families function in successive steps of vesicle transport, in forming vesicles from donor membranes, directing vesicle trafficking toward target membranes and docking vesicles onto target membranes. These proteins act as molecular switches that are controlled by a cycle of GTP binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs) and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs in the regulation of the endocytic pathway using fluorescently labeled yeast mating pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells show defective α-factor binding to the cell surface. Interestingly, Ste2p, the α-factor receptor, was mis-localized from the plasma membrane to the vacuole in glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent function, as well as the GAP activity, of Glo3p is important for both α-factor binding and Ste2p localization at the cell surface. Additionally, we found that deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi compartments and causes a defect in transport from the TGN to the plasma membrane. Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN transport pathway, but not in the early endosome-to-TGN transport pathway. These findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell surface proteins."}],"publication":"Biochimica et Biophysica Acta - Molecular Cell Research","date_created":"2018-12-11T11:55:17Z","oa":1,"has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins","scopus_import":"1","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:45:25Z","file_size":926685,"creator":"system","file_id":"4936","date_created":"2018-12-12T10:12:18Z","file_name":"IST-2016-615-v1+1_BBAMCR.pdf","content_type":"application/pdf","relation":"main_file","checksum":"5bb328edebb6a91337cadd7d63f961b7","access_level":"open_access"}],"citation":{"chicago":"Kawada, Daiki, Hiromu Kobayashi, Tsuyoshi Tomita, Eisuke Nakata, Makoto Nagano, Daria E Siekhaus, Junko Toshima, and Jiro Toshimaa. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">https://doi.org/10.1016/j.bbamcr.2014.10.009</a>.","mla":"Kawada, Daiki, et al. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 1, Elsevier, 2015, pp. 144–56, doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">10.1016/j.bbamcr.2014.10.009</a>.","short":"D. Kawada, H. Kobayashi, T. Tomita, E. Nakata, M. Nagano, D.E. Siekhaus, J. Toshima, J. Toshimaa, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 144–156.","ista":"Kawada D, Kobayashi H, Tomita T, Nakata E, Nagano M, Siekhaus DE, Toshima J, Toshimaa J. 2015. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(1), 144–156.","ieee":"D. Kawada <i>et al.</i>, “The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins,” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 1. Elsevier, pp. 144–156, 2015.","apa":"Kawada, D., Kobayashi, H., Tomita, T., Nakata, E., Nagano, M., Siekhaus, D. E., … Toshimaa, J. (2015). The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">https://doi.org/10.1016/j.bbamcr.2014.10.009</a>","ama":"Kawada D, Kobayashi H, Tomita T, et al. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. 2015;1853(1):144-156. doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">10.1016/j.bbamcr.2014.10.009</a>"},"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"month":"01","publication_status":"published","department":[{"_id":"DaSi"}],"doi":"10.1016/j.bbamcr.2014.10.009","day":"01","volume":1853,"intvolume":"      1853","publist_id":"5047","isi":1,"author":[{"first_name":"Daiki","full_name":"Kawada, Daiki","last_name":"Kawada"},{"first_name":"Hiromu","full_name":"Kobayashi, Hiromu","last_name":"Kobayashi"},{"last_name":"Tomita","full_name":"Tomita, Tsuyoshi","first_name":"Tsuyoshi"},{"last_name":"Nakata","full_name":"Nakata, Eisuke","first_name":"Eisuke"},{"full_name":"Nagano, Makoto","last_name":"Nagano","first_name":"Makoto"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","full_name":"Siekhaus, Daria E","last_name":"Siekhaus","first_name":"Daria E","orcid":"0000-0001-8323-8353"},{"last_name":"Toshima","full_name":"Toshima, Junko","first_name":"Junko"},{"first_name":"Jiro","last_name":"Toshimaa","full_name":"Toshimaa, Jiro"}],"_id":"2025","issue":"1","external_id":{"isi":["000347598100014"]},"year":"2015","pubrep_id":"615","publisher":"Elsevier","ddc":["570"],"article_processing_charge":"No","page":"144 - 156","date_published":"2015-01-01T00:00:00Z"},{"article_processing_charge":"No","page":"1 - 11","date_published":"2015-01-01T00:00:00Z","year":"2015","publisher":"Elsevier","author":[{"full_name":"Shi, Liang","id":"374A3F1A-F248-11E8-B48F-1D18A9856A87","last_name":"Shi","first_name":"Liang"},{"full_name":"Rampp, Markus","last_name":"Rampp","first_name":"Markus"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"}],"isi":1,"external_id":{"arxiv":["1311.2481"],"isi":["000346213200001"]},"_id":"2030","issue":"1","volume":106,"intvolume":"       106","publist_id":"5042","arxiv":1,"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Preprint","month":"01","day":"01","doi":"10.1016/j.compfluid.2014.09.021","department":[{"_id":"BjHo"}],"publication_status":"published","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1311.2481","open_access":"1"}],"status":"public","citation":{"ama":"Shi L, Rampp M, Hof B, Avila M. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. <i>Computers and Fluids</i>. 2015;106(1):1-11. doi:<a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">10.1016/j.compfluid.2014.09.021</a>","apa":"Shi, L., Rampp, M., Hof, B., &#38; Avila, M. (2015). A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. <i>Computers and Fluids</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">https://doi.org/10.1016/j.compfluid.2014.09.021</a>","ieee":"L. Shi, M. Rampp, B. Hof, and M. Avila, “A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow,” <i>Computers and Fluids</i>, vol. 106, no. 1. Elsevier, pp. 1–11, 2015.","ista":"Shi L, Rampp M, Hof B, Avila M. 2015. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. 106(1), 1–11.","chicago":"Shi, Liang, Markus Rampp, Björn Hof, and Marc Avila. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” <i>Computers and Fluids</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">https://doi.org/10.1016/j.compfluid.2014.09.021</a>.","mla":"Shi, Liang, et al. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” <i>Computers and Fluids</i>, vol. 106, no. 1, Elsevier, 2015, pp. 1–11, doi:<a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">10.1016/j.compfluid.2014.09.021</a>.","short":"L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11."},"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow","date_updated":"2025-09-22T14:31:33Z","type":"journal_article","abstract":[{"text":"A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial and azimuthal directions, and high-order finite differences in the radial direction. Time is advanced by a second-order, semi-implicit projection scheme, which requires the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders very small slip velocities. Nonlinear terms are evaluated with the pseudospectral method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node communications and MPI overhead that become relevant at high processor-core counts, and helps to contain the memory footprint. A strong scaling study shows that the hybrid code maintains scalability up to more than 20,000 processor cores and thus allows to perform simulations at higher resolutions than previously feasible. In particular, it opens up the possibility to simulate turbulent Taylor-Couette flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence in Keplerian flows in experimentally relevant regimes.","lang":"eng"}],"publication":"Computers and Fluids","date_created":"2018-12-11T11:55:18Z"},{"date_published":"2015-01-01T00:00:00Z","article_processing_charge":"No","page":"52 - 59","publisher":"Elsevier","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"year":"2015","external_id":{"isi":["000345478700010"],"arxiv":["1407.4225"]},"_id":"2034","issue":"1","author":[{"first_name":"Béatrice","full_name":"Bérard, Béatrice","last_name":"Bérard"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Sznajder, Nathalie","last_name":"Sznajder","first_name":"Nathalie"}],"isi":1,"intvolume":"       115","publist_id":"5025","volume":115,"month":"01","ec_funded":1,"doi":"10.1016/j.ipl.2014.09.001","day":"01","department":[{"_id":"KrCh"}],"publication_status":"published","arxiv":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"status":"public","citation":{"chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>.","mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>.","short":"B. Bérard, K. Chatterjee, N. Sznajder,  Information Processing Letters 115 (2015) 52–59.","ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes.  Information Processing Letters. 115(1), 52–59.","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” <i> Information Processing Letters</i>, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.","apa":"Bérard, B., Chatterjee, K., &#38; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. <i> Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. <i> Information Processing Letters</i>. 2015;115(1):52-59. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>"},"scopus_import":"1","title":"Probabilistic opacity for Markov decision processes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"abstract":[{"lang":"eng","text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers."}],"publication":" Information Processing Letters","date_created":"2018-12-11T11:55:20Z","date_updated":"2025-09-23T09:54:42Z","type":"journal_article"},{"ddc":["000"],"project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer","year":"2015","pubrep_id":"486","date_published":"2015-10-01T00:00:00Z","page":"1213 - 1244","article_processing_charge":"No","publist_id":"5022","intvolume":"        15","volume":15,"_id":"2035","external_id":{"isi":["000360862900004"]},"issue":"5","author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","full_name":"Jablonski, Grzegorz","last_name":"Jablonski","first_name":"Grzegorz","orcid":"0000-0002-3536-9866"},{"full_name":"Mrozek, Marian","last_name":"Mrozek","first_name":"Marian"}],"isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"file_name":"IST-2016-486-v1+1_s10208-014-9223-y.pdf","date_created":"2018-12-12T10:08:10Z","file_id":"4670","creator":"system","file_size":1317546,"date_updated":"2020-07-14T12:45:26Z","access_level":"open_access","checksum":"3566f3a8b0c1bc550e62914a88c584ff","relation":"main_file","content_type":"application/pdf"}],"citation":{"ieee":"H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of a self-map,” <i>Foundations of Computational Mathematics</i>, vol. 15, no. 5. Springer, pp. 1213–1244, 2015.","apa":"Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2015). The persistent homology of a self-map. <i>Foundations of Computational Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10208-014-9223-y\">https://doi.org/10.1007/s10208-014-9223-y</a>","ama":"Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map. <i>Foundations of Computational Mathematics</i>. 2015;15(5):1213-1244. doi:<a href=\"https://doi.org/10.1007/s10208-014-9223-y\">10.1007/s10208-014-9223-y</a>","short":"H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244.","chicago":"Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” <i>Foundations of Computational Mathematics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s10208-014-9223-y\">https://doi.org/10.1007/s10208-014-9223-y</a>.","mla":"Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” <i>Foundations of Computational Mathematics</i>, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi:<a href=\"https://doi.org/10.1007/s10208-014-9223-y\">10.1007/s10208-014-9223-y</a>.","ista":"Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244."},"status":"public","acknowledgement":"This research is partially supported by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the Polish National Science Center under Grant No. N201 419639.","scopus_import":"1","department":[{"_id":"HeEd"}],"publication_status":"published","ec_funded":1,"doi":"10.1007/s10208-014-9223-y","day":"01","month":"10","language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","publication":"Foundations of Computational Mathematics","date_created":"2018-12-11T11:55:20Z","abstract":[{"lang":"eng","text":"Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.\r\n"}],"type":"journal_article","date_updated":"2025-09-23T14:08:54Z","file_date_updated":"2020-07-14T12:45:26Z","title":"The persistent homology of a self-map","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","oa":1},{"citation":{"ama":"Polshyn H, Zhang C, Naibert T, Eckstein J, Budakian R. Study of Fe (Se, Te) micron-sized rings by magnetic force microscopy. In: <i>APS March Meeting 2015</i>. Vol 60. American Physical Society; 2015.","apa":"Polshyn, H., Zhang, C., Naibert, T., Eckstein, J., &#38; Budakian, R. (2015). Study of Fe (Se, Te) micron-sized rings by magnetic force microscopy. In <i>APS March Meeting 2015</i> (Vol. 60). San Antonio, TX, United States: American Physical Society.","ieee":"H. Polshyn, C. Zhang, T. Naibert, J. Eckstein, and R. Budakian, “Study of Fe (Se, Te) micron-sized rings by magnetic force microscopy,” in <i>APS March Meeting 2015</i>, San Antonio, TX, United States, 2015, vol. 60, no. 1.","ista":"Polshyn H, Zhang C, Naibert T, Eckstein J, Budakian R. 2015. Study of Fe (Se, Te) micron-sized rings by magnetic force microscopy. APS March Meeting 2015. APS: American Physical Society, Bulletin of the American Physical Society, vol. 60, G16.00009.","chicago":"Polshyn, Hryhoriy, Can Zhang, Tyler Naibert, James Eckstein, and Raffi Budakian. “Study of Fe (Se, Te) Micron-Sized Rings by Magnetic Force Microscopy.” In <i>APS March Meeting 2015</i>, Vol. 60. American Physical Society, 2015.","mla":"Polshyn, Hryhoriy, et al. “Study of Fe (Se, Te) Micron-Sized Rings by Magnetic Force Microscopy.” <i>APS March Meeting 2015</i>, vol. 60, no. 1, G16.00009, American Physical Society, 2015.","short":"H. Polshyn, C. Zhang, T. Naibert, J. Eckstein, R. Budakian, in:, APS March Meeting 2015, American Physical Society, 2015."},"status":"public","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR15/Event/238442"}],"day":"01","publication_status":"published","month":"03","quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","publication_identifier":{"issn":["0003-0503"]},"publication":"APS March Meeting 2015","date_created":"2022-02-08T10:17:09Z","abstract":[{"text":"The study of fluxoid states and fluxoid dynamics in mesoscopic iron-based superconducting rings is valuable for characterizing the basic properties of the superconductor, and may also provide important insight into the superconducting paring symmetry. We report the fabrications of micron-sized rings and disks from thin films of Fe(Se, Te) grown by molecular beam epitaxy. In order to study fluxoid states in rings we developed a custom-tailored version of magnetic force microscopy (MFM). This technique has a number of qualitative advantages for working with mesoscopic superconducting samples in comparison to the conventional MFM and other imaging techniques. We observed metastable fluxoid states in rings of different sizes. Thermally activated fluxoid dynamics of these states was studied and modeled. In addition, we found different regimes of interaction between Fe(Se, Te) ring and MFM tip which are explained. Possibilities of the existence of exotic vortex states and proposals for experiments to test the symmetry of the superconducting order parameter in iron based superconductors are analyzed.","lang":"eng"}],"date_updated":"2022-02-08T10:42:53Z","type":"conference","title":"Study of Fe (Se, Te) micron-sized rings by magnetic force microscopy","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"conference":{"start_date":"2015-03-02","name":"APS: American Physical Society","end_date":"2015-03-06","location":"San Antonio, TX, United States"},"publisher":"American Physical Society","article_number":"G16.00009","year":"2015","date_published":"2015-03-01T00:00:00Z","article_processing_charge":"No","intvolume":"        60","volume":60,"_id":"10748","issue":"1","extern":"1","alternative_title":["Bulletin of the American Physical Society"],"author":[{"full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","last_name":"Polshyn","orcid":"0000-0001-8223-8896","first_name":"Hryhoriy"},{"first_name":"Can","full_name":"Zhang, Can","last_name":"Zhang"},{"first_name":"Tyler","full_name":"Naibert, Tyler","last_name":"Naibert"},{"first_name":"James","last_name":"Eckstein","full_name":"Eckstein, James"},{"full_name":"Budakian, Raffi","last_name":"Budakian","first_name":"Raffi"}]},{"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"month":"06","corr_author":"1","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"publication_status":"published","day":"10","doi":"10.3389/fenvs.2015.00042","ec_funded":1,"scopus_import":"1","acknowledgement":"The authors would like to acknowledge contributions from Baptiste Mottet who performed preliminary analysis regarding parameter inference for the considered case study in a student project (Mottet, 2014/2015).\r\nThe research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No. [291734] and from SystemsX under the project SignalX.","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"access_level":"open_access","success":1,"content_type":"application/pdf","checksum":"26c222487564e1be02a11d688d6f769d","relation":"main_file","date_created":"2022-02-25T11:55:26Z","file_id":"10795","file_name":"2015_FrontiersEnvironmScience_Parise.pdf","date_updated":"2022-02-25T11:55:26Z","creator":"dernst","file_size":1371201}],"citation":{"ama":"Parise F, Lygeros J, Ruess J. Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. <i>Frontiers in Environmental Science</i>. 2015;3. doi:<a href=\"https://doi.org/10.3389/fenvs.2015.00042\">10.3389/fenvs.2015.00042</a>","apa":"Parise, F., Lygeros, J., &#38; Ruess, J. (2015). Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. <i>Frontiers in Environmental Science</i>. Frontiers. <a href=\"https://doi.org/10.3389/fenvs.2015.00042\">https://doi.org/10.3389/fenvs.2015.00042</a>","ieee":"F. Parise, J. Lygeros, and J. Ruess, “Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study,” <i>Frontiers in Environmental Science</i>, vol. 3. Frontiers, 2015.","ista":"Parise F, Lygeros J, Ruess J. 2015. Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. Frontiers in Environmental Science. 3, 42.","mla":"Parise, Francesca, et al. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.” <i>Frontiers in Environmental Science</i>, vol. 3, 42, Frontiers, 2015, doi:<a href=\"https://doi.org/10.3389/fenvs.2015.00042\">10.3389/fenvs.2015.00042</a>.","chicago":"Parise, Francesca, John Lygeros, and Jakob Ruess. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.” <i>Frontiers in Environmental Science</i>. Frontiers, 2015. <a href=\"https://doi.org/10.3389/fenvs.2015.00042\">https://doi.org/10.3389/fenvs.2015.00042</a>.","short":"F. Parise, J. Lygeros, J. Ruess, Frontiers in Environmental Science 3 (2015)."},"keyword":["General Environmental Science"],"has_accepted_license":"1","oa":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study","file_date_updated":"2022-02-25T11:55:26Z","type":"journal_article","date_updated":"2025-04-15T06:50:01Z","abstract":[{"lang":"eng","text":"Mathematical models are of fundamental importance in the understanding of complex population dynamics. For instance, they can be used to predict the population evolution starting from different initial conditions or to test how a system responds to external perturbations. For this analysis to be meaningful in real applications, however, it is of paramount importance to choose an appropriate model structure and to infer the model parameters from measured data. While many parameter inference methods are available for models based on deterministic ordinary differential equations, the same does not hold for more detailed individual-based models. Here we consider, in particular, stochastic models in which the time evolution of the species abundances is described by a continuous-time Markov chain. These models are governed by a master equation that is typically difficult to solve. Consequently, traditional inference methods that rely on iterative evaluation of parameter likelihoods are computationally intractable. The aim of this paper is to present recent advances in parameter inference for continuous-time Markov chain models, based on a moment closure approximation of the parameter likelihood, and to investigate how these results can help in understanding, and ultimately controlling, complex systems in ecology. Specifically, we illustrate through an agricultural pest case study how parameters of a stochastic individual-based model can be identified from measured data and how the resulting model can be used to solve an optimal control problem in a stochastic setting. In particular, we show how the matter of determining the optimal combination of two different pest control methods can be formulated as a chance constrained optimization problem where the control action is modeled as a state reset, leading to a hybrid system formulation."}],"date_created":"2022-02-25T11:42:25Z","publication":"Frontiers in Environmental Science","publication_identifier":{"issn":["2296-665X"]},"article_processing_charge":"No","date_published":"2015-06-10T00:00:00Z","year":"2015","article_number":"42","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"publisher":"Frontiers","ddc":["000","570"],"author":[{"first_name":"Francesca","full_name":"Parise, Francesca","last_name":"Parise"},{"full_name":"Lygeros, John","last_name":"Lygeros","first_name":"John"},{"first_name":"Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","full_name":"Ruess, Jakob","last_name":"Ruess"}],"_id":"10794","volume":3,"intvolume":"         3"},{"OA_place":"publisher","OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The value 1 problem under finite-memory strategies for concurrent mean-payoff games","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2015-01-04","location":"San Diego, CA, United States","end_date":"2015-01-06"},"oa":1,"abstract":[{"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).","lang":"eng"}],"publication_identifier":{"isbn":["978-161197374-7"]},"date_created":"2022-02-25T12:18:43Z","publication":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","date_updated":"2025-06-26T06:54:08Z","type":"conference","month":"01","corr_author":"1","ec_funded":1,"day":"01","doi":"10.1137/1.9781611973730.69","department":[{"_id":"KrCh"}],"publication_status":"published","arxiv":1,"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Preprint","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1409.6690","open_access":"1"}],"citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2015. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2015, 1018–1029.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2015:1018–29. SIAM, 2015. <a href=\"https://doi.org/10.1137/1.9781611973730.69\">https://doi.org/10.1137/1.9781611973730.69</a>.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 2015, no. 1, SIAM, 2015, pp. 1018–29, doi:<a href=\"https://doi.org/10.1137/1.9781611973730.69\">10.1137/1.9781611973730.69</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.","ama":"Chatterjee K, Ibsen-Jensen R. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In: <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 2015. SIAM; 2015:1018-1029. doi:<a href=\"https://doi.org/10.1137/1.9781611973730.69\">10.1137/1.9781611973730.69</a>","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973730.69\">https://doi.org/10.1137/1.9781611973730.69</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029."},"acknowledgement":"The research was partly supported by FWF Grant No P 23499-N23, FWF NFN Grant\r\nNo S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","scopus_import":"1","issue":"1","_id":"10796","external_id":{"arxiv":["1409.6690"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389"}],"intvolume":"      2015","volume":2015,"date_published":"2015-01-01T00:00:00Z","article_processing_charge":"No","page":"1018-1029","publisher":"SIAM","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"year":"2015"},{"publication_status":"published","doi":"10.1021/acs.chemmater.5b03531","day":"16","month":"10","date_published":"2015-10-16T00:00:00Z","oa_version":"None","page":"7452 - 7458","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","citation":{"apa":"Walter, M., Kravchyk, K., Ibáñez, M., &#38; Kovalenko, M. (2015). Efficient and inexpensive sodium magnesium hybrid battery. <i>Chemistry of Materials</i>. ACS. <a href=\"https://doi.org/10.1021/acs.chemmater.5b03531\">https://doi.org/10.1021/acs.chemmater.5b03531</a>","ama":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. Efficient and inexpensive sodium magnesium hybrid battery. <i>Chemistry of Materials</i>. 2015;27(21):7452-7458. doi:<a href=\"https://doi.org/10.1021/acs.chemmater.5b03531\">10.1021/acs.chemmater.5b03531</a>","ieee":"M. Walter, K. Kravchyk, M. Ibáñez, and M. Kovalenko, “Efficient and inexpensive sodium magnesium hybrid battery,” <i>Chemistry of Materials</i>, vol. 27, no. 21. ACS, pp. 7452–7458, 2015.","ista":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. 2015. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 27(21), 7452–7458.","short":"M. Walter, K. Kravchyk, M. Ibáñez, M. Kovalenko, Chemistry of Materials 27 (2015) 7452–7458.","mla":"Walter, Marc, et al. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” <i>Chemistry of Materials</i>, vol. 27, no. 21, ACS, 2015, pp. 7452–58, doi:<a href=\"https://doi.org/10.1021/acs.chemmater.5b03531\">10.1021/acs.chemmater.5b03531</a>.","chicago":"Walter, Marc, Kostiantyn Kravchyk, Maria Ibáñez, and Maksym Kovalenko. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” <i>Chemistry of Materials</i>. ACS, 2015. <a href=\"https://doi.org/10.1021/acs.chemmater.5b03531\">https://doi.org/10.1021/acs.chemmater.5b03531</a>."},"status":"public","publisher":"ACS","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Efficient and inexpensive sodium magnesium hybrid battery","extern":"1","_id":"333","issue":"21","article_type":"original","author":[{"last_name":"Walter","full_name":"Walter, Marc","first_name":"Marc"},{"first_name":"Kostiantyn","full_name":"Kravchyk, Kostiantyn","last_name":"Kravchyk"},{"last_name":"Ibáñez","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria"},{"first_name":"Maksym","last_name":"Kovalenko","full_name":"Kovalenko, Maksym"}],"date_created":"2018-12-11T11:45:52Z","publication":"Chemistry of Materials","publist_id":"7507","intvolume":"        27","abstract":[{"text":"We present a hybrid intercalation battery based on a sodium/magnesium (Na/Mg) dual salt electrolyte, metallic magnesium anode, and a cathode based on FeS2 nanocrystals (NCs). Compared to lithium or sodium, metallic magnesium anode is safer due to dendrite-free electroplating and offers extremely high volumetric (3833 mAh cm-3) and gravimetric capacities (2205 mAh g-1). Na-ion cathodes, FeS2 NCs in the present study, may serve as attractive alternatives to Mg-ion cathodes due to the higher voltage of operation and fast, highly reversible insertion of Na-ions. In this proof-of-concept study, electrochemical cycling of the Na/Mg hybrid battery was characterized by high rate capability, high Coulombic efficiency of 99.8%, and high energy density. In particular, with an average discharge voltage of ∼1.1 V and a cathodic capacity of 189 mAh g-1 at a current of 200 mA g-1, the presented Mg/FeS2 hybrid battery delivers energy densities of up to 210 Wh kg-1, comparable to commercial Li-ion batteries and approximately twice as high as state-of-the-art Mg-ion batteries based on Mo6S8 cathodes. Further significant gains in the energy density are expected from the development of Na/Mg electrolytes with a broader electrochemical stability window. Fully based on Earth-abundant elements, hybrid Na-Mg batteries are highly promising for large-scale stationary energy storage. ","lang":"eng"}],"type":"journal_article","date_updated":"2021-01-12T07:42:42Z","volume":27},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting","_id":"334","issue":"38","extern":"1","article_type":"original","author":[{"full_name":"Yu, Xuelian","last_name":"Yu","first_name":"Xuelian"},{"last_name":"Liu","full_name":"Liu, Jingjing","first_name":"Jingjing"},{"first_name":"Aziz","full_name":"Genç, Aziz","last_name":"Genç"},{"last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","first_name":"Maria","orcid":"0000-0001-5013-2843"},{"last_name":"Luo","full_name":"Luo, Zhishan","first_name":"Zhishan"},{"last_name":"Shavel","full_name":"Shavel, Alexey","first_name":"Alexey"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"first_name":"Guangjin","last_name":"Zhang","full_name":"Zhang, Guangjin"},{"last_name":"Zhang","full_name":"Zhang, Yihe","first_name":"Yihe"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"publication":"Langmuir","date_created":"2018-12-11T11:45:52Z","publist_id":"7508","abstract":[{"lang":"eng","text":"A cation exchange-based route was used to produce Cu2ZnSnS4 (CZTS)-Ag2S nanoparticles with controlled composition. We report a detailed study of the formation of such CZTS-Ag2S nanoheterostructures and of their photocatalytic properties. When compared to pure CZTS, the use of nanoscale p-n heterostructures as light absorbers for photocatalytic water splitting provides superior photocurrents. We associate this experimental fact to a higher separation efficiency of the photogenerated electron-hole pairs. We believe this and other type-II nanoheterostructures will open the door to the use of CZTS, with excellent light absorption properties and made of abundant and environmental friendly elements, to the field of photocatalysis."}],"intvolume":"        31","type":"journal_article","date_updated":"2021-01-12T07:42:46Z","volume":31,"publication_status":"published","day":"07","doi":"10.1021/acs.langmuir.5b02490","month":"09","date_published":"2015-09-07T00:00:00Z","language":[{"iso":"eng"}],"page":"10555 - 10561","quality_controlled":"1","oa_version":"None","article_processing_charge":"No","citation":{"ieee":"X. Yu <i>et al.</i>, “Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting,” <i>Langmuir</i>, vol. 31, no. 38. American Chemical Society, pp. 10555–10561, 2015.","apa":"Yu, X., Liu, J., Genç, A., Ibáñez, M., Luo, Z., Shavel, A., … Cabot, A. (2015). Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. <i>Langmuir</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.langmuir.5b02490\">https://doi.org/10.1021/acs.langmuir.5b02490</a>","ama":"Yu X, Liu J, Genç A, et al. Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. <i>Langmuir</i>. 2015;31(38):10555-10561. doi:<a href=\"https://doi.org/10.1021/acs.langmuir.5b02490\">10.1021/acs.langmuir.5b02490</a>","short":"X. Yu, J. Liu, A. Genç, M. Ibáñez, Z. Luo, A. Shavel, J. Arbiol, G. Zhang, Y. Zhang, A. Cabot, Langmuir 31 (2015) 10555–10561.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4–Ag2S Nanoscale p–n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” <i>Langmuir</i>, vol. 31, no. 38, American Chemical Society, 2015, pp. 10555–61, doi:<a href=\"https://doi.org/10.1021/acs.langmuir.5b02490\">10.1021/acs.langmuir.5b02490</a>.","chicago":"Yu, Xuelian, Jingjing Liu, Aziz Genç, Maria Ibáñez, Zhishan Luo, Alexey Shavel, Jordi Arbiol, Guangjin Zhang, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4–Ag2S Nanoscale p–n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” <i>Langmuir</i>. American Chemical Society, 2015. <a href=\"https://doi.org/10.1021/acs.langmuir.5b02490\">https://doi.org/10.1021/acs.langmuir.5b02490</a>.","ista":"Yu X, Liu J, Genç A, Ibáñez M, Luo Z, Shavel A, Arbiol J, Zhang G, Zhang Y, Cabot A. 2015. Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 31(38), 10555–10561."},"status":"public","publisher":"American Chemical Society","acknowledgement":"This work was supported by the European Regional Development Funds, the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486), the Spanish MINECO under Contract ENE2013-46624-C4-3-R and Fundamental Research Funds for the Central Universities (2652015086). Authors acknowledge the funding from Generalitat de Catalunya 2014 SGR 1638.","year":"2015"},{"author":[{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843"},{"first_name":"Rachel","full_name":"Korkosz, Rachel","last_name":"Korkosz"},{"first_name":"Zhishan","full_name":"Luo, Zhishan","last_name":"Luo"},{"last_name":"Riba","full_name":"Riba, Pau","first_name":"Pau"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"first_name":"Silvia","full_name":"Ortega, Silvia","last_name":"Ortega"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"},{"first_name":"Mercouri","full_name":"Kanatzidis, Mercouri","last_name":"Kanatzidis"}],"_id":"354","issue":"12","extern":"1","title":"Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","date_updated":"2021-01-12T07:44:10Z","type":"journal_article","volume":137,"publist_id":"7470","date_created":"2018-12-11T11:45:59Z","publication":"Journal of the American Chemical Society","intvolume":"       137","abstract":[{"lang":"eng","text":"A simple and effective method to introduce precise amounts of doping in nanomaterials produced from the bottom-up assembly of colloidal nanoparticles (NPs) is described. The procedure takes advantage of a ligand displacement step to incorporate controlled concentrations of halide ions while removing carboxylic acids from the NP surface. Upon consolidation of the NPs into dense pellets, halide ions diffuse within the crystal structure, doping the anion sublattice and achieving n-type electrical doping. Through the characterization of the thermoelectric properties of nanocrystalline PbS, we demonstrate this strategy to be effective to control charge transport properties on thermoelectric nanomaterials assembled from NP building blocks. This approach is subsequently extended to PbTexSe1-x@PbS core-shell NPs, where a significant enhancement of the thermoelectric figure of merit is achieved. "}],"quality_controlled":"1","language":[{"iso":"eng"}],"page":"4046 - 4049","oa_version":"None","article_processing_charge":"No","doi":"10.1021/jacs.5b00091","day":"11","publication_status":"published","month":"03","date_published":"2015-03-11T00:00:00Z","acknowledgement":"At IREC, work was supported by European Regional Development Funds and the Framework 7 program under project UNION (FP7-NMP 310250). M.I. and S.O. thank AGAUR for their Beatriu i Pinós postdoctoral grant and the PhD grant, respectively. At Northwestern, work was supported by the Revolutionary Materials for Solid State Energy Conversion, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, and Office of Basic Energy Sciences under Award Number DE-SC0001054.","year":"2015","citation":{"ista":"Ibáñez M, Korkosz R, Luo Z, Riba P, Cadavid D, Ortega S, Cabot A, Kanatzidis M. 2015. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 137(12), 4046–4049.","mla":"Ibáñez, Maria, et al. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” <i>Journal of the American Chemical Society</i>, vol. 137, no. 12, American Chemical Society, 2015, pp. 4046–49, doi:<a href=\"https://doi.org/10.1021/jacs.5b00091\">10.1021/jacs.5b00091</a>.","chicago":"Ibáñez, Maria, Rachel Korkosz, Zhishan Luo, Pau Riba, Doris Cadavid, Silvia Ortega, Andreu Cabot, and Mercouri Kanatzidis. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2015. <a href=\"https://doi.org/10.1021/jacs.5b00091\">https://doi.org/10.1021/jacs.5b00091</a>.","short":"M. Ibáñez, R. Korkosz, Z. Luo, P. Riba, D. Cadavid, S. Ortega, A. Cabot, M. Kanatzidis, Journal of the American Chemical Society 137 (2015) 4046–4049.","apa":"Ibáñez, M., Korkosz, R., Luo, Z., Riba, P., Cadavid, D., Ortega, S., … Kanatzidis, M. (2015). Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacs.5b00091\">https://doi.org/10.1021/jacs.5b00091</a>","ama":"Ibáñez M, Korkosz R, Luo Z, et al. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. <i>Journal of the American Chemical Society</i>. 2015;137(12):4046-4049. doi:<a href=\"https://doi.org/10.1021/jacs.5b00091\">10.1021/jacs.5b00091</a>","ieee":"M. Ibáñez <i>et al.</i>, “Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement,” <i>Journal of the American Chemical Society</i>, vol. 137, no. 12. American Chemical Society, pp. 4046–4049, 2015."},"publisher":"American Chemical Society","status":"public"},{"author":[{"full_name":"Yu, Xuelian","last_name":"Yu","first_name":"Xuelian"},{"last_name":"An","full_name":"An, Xiaoqiang","first_name":"Xiaoqiang"},{"first_name":"Aziz","full_name":"Genç, Aziz","last_name":"Genç"},{"first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Zhang, Yihe","last_name":"Zhang","first_name":"Yihe"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"extern":"1","_id":"361","issue":"38","title":"Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":119,"date_updated":"2021-01-12T07:44:38Z","type":"journal_article","intvolume":"       119","abstract":[{"text":"We report the synthesis and photocatalytic and magnetic characterization of colloidal nanoheterostructures formed by combining a Pt-based magnetic metal alloy (PtCo, PtNi) with Cu2ZnSnS4 (CZTS). While CZTS is one of the main candidate materials for solar energy conversion, the introduction of a Pt-based alloy on its surface strongly influences its chemical and electronic properties, ultimately determining its functionality. In this regard, up to a 15-fold increase of the photocatalytic hydrogen evolution activity was obtained with CZTS–PtCo when compared with CZTS. Furthermore, two times higher hydrogen evolution rates were obtained for CZTS–PtCo when compared with CZTS–Pt, in spite of the lower precious metal loading of the former. Besides, the magnetic properties of the PtCo nanoparticles attached to the CZTS nanocrystals were retained in the heterostructures, which could facilitate catalyst purification and recovery for its posterior recycling and/or reutilization.","lang":"eng"}],"publist_id":"7468","publication":"Journal of Physical Chemistry C","date_created":"2018-12-11T11:46:01Z","article_processing_charge":"No","oa_version":"None","page":"21882 - 21888","language":[{"iso":"eng"}],"date_published":"2015-08-26T00:00:00Z","month":"08","day":"26","doi":"10.1021/acs.jpcc.5b06199","publication_status":"published","acknowledgement":"This work was supported by the National Natural Science Foundation of China (Grant 21401212), Fundamental Research Funds for the Central Universities (2652015086), the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486), and the MICINN project ENE2013-46624-C4-3-R. Authors acknowledge the funding from Generalitat de Catalunya 2014 SGR 1638.","year":"2015","publisher":"American Chemical Society","status":"public","citation":{"ama":"Yu X, An X, Genç A, et al. Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. <i>Journal of Physical Chemistry C</i>. 2015;119(38):21882-21888. doi:<a href=\"https://doi.org/10.1021/acs.jpcc.5b06199\">10.1021/acs.jpcc.5b06199</a>","apa":"Yu, X., An, X., Genç, A., Ibáñez, M., Arbiol, J., Zhang, Y., &#38; Cabot, A. (2015). Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. <i>Journal of Physical Chemistry C</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.jpcc.5b06199\">https://doi.org/10.1021/acs.jpcc.5b06199</a>","ieee":"X. Yu <i>et al.</i>, “Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution,” <i>Journal of Physical Chemistry C</i>, vol. 119, no. 38. American Chemical Society, pp. 21882–21888, 2015.","ista":"Yu X, An X, Genç A, Ibáñez M, Arbiol J, Zhang Y, Cabot A. 2015. Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. 119(38), 21882–21888.","chicago":"Yu, Xuelian, Xiaoqiang An, Aziz Genç, Maria Ibáñez, Jordi Arbiol, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4–PtM (M = Co, Ni) Nanoheterostructures for Photocatalytic Hydrogen Evolution.” <i>Journal of Physical Chemistry C</i>. American Chemical Society, 2015. <a href=\"https://doi.org/10.1021/acs.jpcc.5b06199\">https://doi.org/10.1021/acs.jpcc.5b06199</a>.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4–PtM (M = Co, Ni) Nanoheterostructures for Photocatalytic Hydrogen Evolution.” <i>Journal of Physical Chemistry C</i>, vol. 119, no. 38, American Chemical Society, 2015, pp. 21882–88, doi:<a href=\"https://doi.org/10.1021/acs.jpcc.5b06199\">10.1021/acs.jpcc.5b06199</a>.","short":"X. Yu, X. An, A. Genç, M. Ibáñez, J. Arbiol, Y. Zhang, A. Cabot, Journal of Physical Chemistry C 119 (2015) 21882–21888."}},{"publist_id":"7469","intvolume":"        31","volume":31,"_id":"362","external_id":{"pmid":["25751745"]},"extern":"1","issue":"13","author":[{"first_name":"Zhishan","last_name":"Lu","full_name":"Lu, Zhishan"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez"},{"first_name":"Ana","full_name":"Antolín, Ana","last_name":"Antolín"},{"last_name":"Genç","full_name":"Genç, Aziz","first_name":"Aziz"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"first_name":"Sandra","last_name":"Contreras","full_name":"Contreras, Sandra"},{"first_name":"Francesc","last_name":"Medina","full_name":"Medina, Francesc"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"publisher":"American Chemical Society","year":"2015","date_published":"2015-04-07T00:00:00Z","pmid":1,"page":"3952 - 3957","article_processing_charge":"No","publication_identifier":{"issn":["0743-7463"],"eissn":["1520-5827"]},"publication":"Langmuir","date_created":"2018-12-11T11:46:02Z","abstract":[{"lang":"eng","text":"Monodisperse Pd2Sn nanorods with tuned size and aspect ratio were prepared by co-reduction of metal salts in the presence of trioctylphosphine, amine, and chloride ions. Asymmetric Pd2Sn nanostructures were achieved by the selective desorption of a surfactant mediated by chlorine ions. A preliminary evaluation of the geometry influence on catalytic properties evidenced Pd2Sn nanorods to have improved catalytic performance. In view of these results, Pd2Sn nanorods were also evaluated for water denitration. "}],"date_updated":"2026-05-19T08:52:57Z","type":"journal_article","OA_type":"closed access","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties","article_type":"original","citation":{"ama":"Lu Z, Ibáñez M, Antolín A, et al. Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. <i>Langmuir</i>. 2015;31(13):3952-3957. doi:<a href=\"https://doi.org/10.1021/la504906q\">10.1021/la504906q</a>","apa":"Lu, Z., Ibáñez, M., Antolín, A., Genç, A., Shavel, A., Contreras, S., … Cabot, A. (2015). Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. <i>Langmuir</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/la504906q\">https://doi.org/10.1021/la504906q</a>","ieee":"Z. Lu <i>et al.</i>, “Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties,” <i>Langmuir</i>, vol. 31, no. 13. American Chemical Society, pp. 3952–3957, 2015.","ista":"Lu Z, Ibáñez M, Antolín A, Genç A, Shavel A, Contreras S, Medina F, Arbiol J, Cabot A. 2015. Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. 31(13), 3952–3957.","chicago":"Lu, Zhishan, Maria Ibáñez, Ana Antolín, Aziz Genç, Alexey Shavel, Sandra Contreras, Francesc Medina, Jordi Arbiol, and Andreu Cabot. “Size and Aspect Ratio Control of Pd Inf 2 Inf Sn Nanorods and Their Water Denitration Properties.” <i>Langmuir</i>. American Chemical Society, 2015. <a href=\"https://doi.org/10.1021/la504906q\">https://doi.org/10.1021/la504906q</a>.","mla":"Lu, Zhishan, et al. “Size and Aspect Ratio Control of Pd Inf 2 Inf Sn Nanorods and Their Water Denitration Properties.” <i>Langmuir</i>, vol. 31, no. 13, American Chemical Society, 2015, pp. 3952–57, doi:<a href=\"https://doi.org/10.1021/la504906q\">10.1021/la504906q</a>.","short":"Z. Lu, M. Ibáñez, A. Antolín, A. Genç, A. Shavel, S. Contreras, F. Medina, J. Arbiol, A. Cabot, Langmuir 31 (2015) 3952–3957."},"status":"public","scopus_import":"1","doi":"10.1021/la504906q","day":"07","publication_status":"published","month":"04","language":[{"iso":"eng"}],"oa_version":"None","quality_controlled":"1"},{"publication_status":"published","day":"07","doi":"10.1103/PhysRevLett.114.017203","month":"07","date_published":"2015-07-07T00:00:00Z","oa_version":"Published Version","quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","citation":{"ieee":"Z. Alpichshev, F. Mahmood, G. Cao, and N. Gedik, “Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3,” <i>Physical Review Letters</i>, vol. 114, no. 1. American Physical Society, 2015.","apa":"Alpichshev, Z., Mahmood, F., Cao, G., &#38; Gedik, N. (2015). Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">https://doi.org/10.1103/PhysRevLett.114.017203</a>","ama":"Alpichshev Z, Mahmood F, Cao G, Gedik N. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. <i>Physical Review Letters</i>. 2015;114(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">10.1103/PhysRevLett.114.017203</a>","chicago":"Alpichshev, Zhanybek, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” <i>Physical Review Letters</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">https://doi.org/10.1103/PhysRevLett.114.017203</a>.","mla":"Alpichshev, Zhanybek, et al. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” <i>Physical Review Letters</i>, vol. 114, no. 1, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.114.017203\">10.1103/PhysRevLett.114.017203</a>.","short":"Z. Alpichshev, F. Mahmood, G. Cao, N. Gedik, Physical Review Letters 114 (2015).","ista":"Alpichshev Z, Mahmood F, Cao G, Gedik N. 2015. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 114(1)."},"main_file_link":[{"open_access":"1","url":"https://dspace.mit.edu/handle/1721.1/92979"}],"status":"public","publisher":"American Physical Society","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3","_id":"388","extern":"1","issue":"1","article_type":"original","oa":1,"author":[{"orcid":"0000-0002-7183-5203","first_name":"Zhanybek","last_name":"Alpichshev","full_name":"Alpichshev, Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mahmood, Fahad","last_name":"Mahmood","first_name":"Fahad"},{"full_name":"Cao, Gang","last_name":"Cao","first_name":"Gang"},{"first_name":"Nuh","last_name":"Gedik","full_name":"Gedik, Nuh"}],"publication":"Physical Review Letters","date_created":"2018-12-11T11:46:11Z","publist_id":"7441","intvolume":"       114","abstract":[{"text":"We use ultrafast optical spectroscopy to observe binding of charged single-particle excitations (SE) in the magnetically frustrated Mott insulator Na2IrO3. Above the antiferromagnetic ordering temperature (TN) the system response is due to both Hubbard excitons (HE) and their constituent unpaired SE. The SE response becomes strongly suppressed immediately below TN. We argue that this increase in binding energy is due to a unique interplay between the frustrated Kitaev and the weak Heisenberg-type ordering term in the Hamiltonian, mediating an effective interaction between the spin-singlet SE. This interaction grows with distance causing the SE to become trapped in the HE, similar to quark confinement inside hadrons. This binding of charged particles, induced by magnetic ordering, is a result of a confinement-deconfinement transition of spin excitations. This observation provides evidence for spin liquid type behavior which is expected in Na2IrO3.","lang":"eng"}],"type":"journal_article","date_updated":"2021-01-12T07:52:54Z","volume":114},{"_id":"1728","extern":"1","external_id":{"pmid":["25833741"]},"author":[{"first_name":"Michael","last_name":"Cohen","full_name":"Cohen, Michael"},{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","last_name":"Kicheva","first_name":"Anna","orcid":"0000-0003-4509-4998"},{"last_name":"Ribeiro","full_name":"Ribeiro, Ana","first_name":"Ana"},{"last_name":"Blassberg","full_name":"Blassberg, Robert","first_name":"Robert"},{"full_name":"Page, Karen","last_name":"Page","first_name":"Karen"},{"full_name":"Barnes, Chris","last_name":"Barnes","first_name":"Chris"},{"last_name":"Briscoe","full_name":"Briscoe, James","first_name":"James"}],"publist_id":"5399","intvolume":"         6","volume":6,"date_published":"2015-04-02T00:00:00Z","pmid":1,"article_processing_charge":"No","publisher":"Springer Nature","year":"2015","article_number":"6709","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms","OA_type":"gold","article_type":"original","OA_place":"publisher","oa":1,"publication":"Nature Communications","date_created":"2018-12-11T11:53:42Z","publication_identifier":{"eissn":["2041-1723"]},"abstract":[{"text":"In the vertebrate neural tube, the morphogen Sonic Hedgehog (Shh) establishes a characteristic pattern of gene expression. Here we quantify the Shh gradient in the developing mouse neural tube and show that while the amplitude of the gradient increases over time, the activity of the pathway transcriptional effectors, Gli proteins, initially increases but later decreases. Computational analysis of the pathway suggests three mechanisms that could contribute to this adaptation: transcriptional upregulation of the inhibitory receptor Ptch1, transcriptional downregulation of Gli and the differential stability of active and inactive Gli isoforms. Consistent with this, Gli2 protein expression is downregulated during neural tube patterning and adaptation continues when the pathway is stimulated downstream of Ptch1. Moreover, the Shh-induced upregulation of Gli2 transcription prevents Gli activity levels from adapting in a different cell type, NIH3T3 fibroblasts, despite the upregulation of Ptch1. Multiple mechanisms therefore contribute to the intracellular dynamics of Shh signalling, resulting in different signalling dynamics in different cell types.","lang":"eng"}],"DOAJ_listed":"1","type":"journal_article","date_updated":"2026-05-19T09:52:55Z","publication_status":"published","doi":"10.1038/ncomms7709","day":"02","month":"04","language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"citation":{"ieee":"M. Cohen <i>et al.</i>, “Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms,” <i>Nature Communications</i>, vol. 6. Springer Nature, 2015.","apa":"Cohen, M., Kicheva, A., Ribeiro, A., Blassberg, R., Page, K., Barnes, C., &#38; Briscoe, J. (2015). Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/ncomms7709\">https://doi.org/10.1038/ncomms7709</a>","ama":"Cohen M, Kicheva A, Ribeiro A, et al. Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. <i>Nature Communications</i>. 2015;6. doi:<a href=\"https://doi.org/10.1038/ncomms7709\">10.1038/ncomms7709</a>","chicago":"Cohen, Michael, Anna Kicheva, Ana Ribeiro, Robert Blassberg, Karen Page, Chris Barnes, and James Briscoe. “Ptch1 and Gli Regulate Shh Signalling Dynamics via Multiple Mechanisms.” <i>Nature Communications</i>. Springer Nature, 2015. <a href=\"https://doi.org/10.1038/ncomms7709\">https://doi.org/10.1038/ncomms7709</a>.","mla":"Cohen, Michael, et al. “Ptch1 and Gli Regulate Shh Signalling Dynamics via Multiple Mechanisms.” <i>Nature Communications</i>, vol. 6, 6709, Springer Nature, 2015, doi:<a href=\"https://doi.org/10.1038/ncomms7709\">10.1038/ncomms7709</a>.","short":"M. Cohen, A. Kicheva, A. Ribeiro, R. Blassberg, K. Page, C. Barnes, J. Briscoe, Nature Communications 6 (2015).","ista":"Cohen M, Kicheva A, Ribeiro A, Blassberg R, Page K, Barnes C, Briscoe J. 2015. Ptch1 and Gli regulate Shh signalling dynamics via multiple mechanisms. Nature Communications. 6, 6709."},"status":"public","main_file_link":[{"url":"https://doi.org/10.1038/ncomms7709","open_access":"1"}],"acknowledgement":"C.P.B. gratefully acknowledges funding from the Wellcome Trust through a Research Career Development Fellowship (097319/Z/11/Z). This work was supported by the Medical Research Council (U117560541) and Wellcome Trust (WT098326MA, WT098325MA).","scopus_import":"1"},{"oa_version":"Submitted Version","language":[{"iso":"eng"}],"quality_controlled":"1","month":"07","related_material":{"record":[{"id":"1338","relation":"later_version","status":"public"},{"status":"public","id":"1130","relation":"dissertation_contains"}]},"day":"01","ec_funded":1,"doi":"10.1007/978-3-319-21668-3_11","department":[{"_id":"ToHe"}],"publication_status":"published","scopus_import":"1","status":"public","file":[{"access_level":"open_access","relation":"main_file","checksum":"6ff58ac220e2f20cb001ba35d4924495","content_type":"application/pdf","file_name":"IST-2015-336-v1+1_long_version.pdf","file_id":"4715","date_created":"2018-12-12T10:08:53Z","file_size":481922,"creator":"system","date_updated":"2025-06-26T07:12:35Z"}],"citation":{"apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &#38; Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">https://doi.org/10.1007/978-3-319-21668-3_11</a>","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. 2015;9207:180-197. doi:<a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">10.1007/978-3-319-21668-3_11</a>","ieee":"P. Cerny <i>et al.</i>, “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197.","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197.","chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">https://doi.org/10.1007/978-3-319-21668-3_11</a>.","mla":"Cerny, Pavol, et al. <i>From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis</i>. Vol. 9207, Springer, 2015, pp. 180–97, doi:<a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">10.1007/978-3-319-21668-3_11</a>."},"conference":{"start_date":"2015-07-18","name":"CAV: Computer Aided Verification","end_date":"2015-07-24","location":"San Francisco, CA, United States"},"has_accepted_license":"1","oa":1,"OA_place":"repository","OA_type":"green","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"From non-preemptive to preemptive scheduling using synchronization synthesis","file_date_updated":"2025-06-26T07:12:35Z","date_updated":"2026-04-09T10:54:00Z","type":"conference","abstract":[{"lang":"eng","text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions."}],"series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:53:42Z","article_processing_charge":"No","page":"180 - 197","date_published":"2015-07-01T00:00:00Z","pubrep_id":"336","year":"2015","publisher":"Springer","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"ddc":["000"],"isi":1,"author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"first_name":"Edmund","full_name":"Clarke, Edmund","last_name":"Clarke"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"first_name":"Leonid","full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","full_name":"Samanta, Roopsha","last_name":"Samanta","first_name":"Roopsha"},{"first_name":"Thorsten","orcid":"0000-0003-4409-8487","last_name":"Tarrach","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tarrach, Thorsten"}],"external_id":{"isi":["000491470400011"]},"_id":"1729","alternative_title":["LNCS"],"volume":9207,"intvolume":"      9207","publist_id":"5398"},{"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Discrete systolic inequalities and decompositions of triangulated surfaces","date_updated":"2025-09-23T08:27:38Z","type":"journal_article","abstract":[{"text":"How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart). Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discrete setting, and vice-versa. This implies a conjecture by Przytycka and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993), a number of new systolic inequalities in the discrete setting, and the fact that a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s systolic inequality for surfaces are essentially equivalent. We also discuss how these proofs generalize to higher dimensions. Then we focus on topological decompositions of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition. Finally, we consider the problem of embedding a cut graph (or more generally a cellular graph) with a given combinatorial map on a given surface. Using random triangulations, we prove (essentially) that, for any choice of a combinatorial map, there are some surfaces on which any cellular embedding with that combinatorial map has length superlinear in the number of triangles of the triangulated combinatorial surface. There is also a similar result for graphs embedded on polyhedral triangulations.","lang":"eng"}],"publication":"Discrete & Computational Geometry","date_created":"2018-12-11T11:53:42Z","arxiv":1,"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Preprint","month":"04","doi":"10.1007/s00454-015-9679-9","day":"02","department":[{"_id":"UlWa"}],"publication_status":"published","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1408.4036","open_access":"1"}],"status":"public","citation":{"ieee":"É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities and decompositions of triangulated surfaces,” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 3. Springer, pp. 587–620, 2015.","apa":"Colin De Verdière, É., Hubard, A., &#38; de Mesmay, A. N. (2015). Discrete systolic inequalities and decompositions of triangulated surfaces. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9679-9\">https://doi.org/10.1007/s00454-015-9679-9</a>","ama":"Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities and decompositions of triangulated surfaces. <i>Discrete &#38; Computational Geometry</i>. 2015;53(3):587-620. doi:<a href=\"https://doi.org/10.1007/s00454-015-9679-9\">10.1007/s00454-015-9679-9</a>","short":"É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete &#38; Computational Geometry 53 (2015) 587–620.","chicago":"Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00454-015-9679-9\">https://doi.org/10.1007/s00454-015-9679-9</a>.","mla":"Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 3, Springer, 2015, pp. 587–620, doi:<a href=\"https://doi.org/10.1007/s00454-015-9679-9\">10.1007/s00454-015-9679-9</a>.","ista":"Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &#38; Computational Geometry. 53(3), 587–620."},"author":[{"first_name":"Éric","full_name":"Colin De Verdière, Éric","last_name":"Colin De Verdière"},{"last_name":"Hubard","full_name":"Hubard, Alfredo","first_name":"Alfredo"},{"last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N"}],"isi":1,"_id":"1730","external_id":{"isi":["000353895200006"],"arxiv":["1408.4036"]},"issue":"3","volume":53,"intvolume":"        53","publist_id":"5397","article_processing_charge":"No","page":"587 - 620","date_published":"2015-04-02T00:00:00Z","year":"2015","publisher":"Springer"},{"date_published":"2015-12-01T00:00:00Z","page":"3 - 16","article_processing_charge":"No","publisher":"Elsevier","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"year":"2015","_id":"1731","issue":"12","external_id":{"arxiv":["1006.0673"],"isi":["000368899100002"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"isi":1,"publist_id":"5395","intvolume":"       245","volume":245,"ec_funded":1,"doi":"10.1016/j.ic.2015.06.003","day":"01","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"12","corr_author":"1","related_material":{"record":[{"id":"3856","relation":"earlier_version","status":"public"}]},"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"arxiv":1,"citation":{"ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” <i>Information and Computation</i>, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2015). Randomness for free. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. <i>Information and Computation</i>. 2015;245(12):3-16. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” <i>Information and Computation</i>, vol. 245, no. 12. Elsevier, pp. 3–16, 2015."},"status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1006.0673","open_access":"1"}],"scopus_import":"1","title":"Randomness for free","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"publication":"Information and Computation","date_created":"2018-12-11T11:53:42Z","abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"date_updated":"2025-09-23T10:32:00Z","type":"journal_article"},{"date_published":"2015-01-01T00:00:00Z","page":"325 - 330","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"publisher":"IEEE","year":"2015","external_id":{"arxiv":["1409.3360"]},"_id":"1732","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin"},{"last_name":"Gupta","full_name":"Gupta, Raghav","first_name":"Raghav"},{"last_name":"Kanodia","full_name":"Kanodia, Ayush","first_name":"Ayush"}],"publist_id":"5394","department":[{"_id":"KrCh"}],"publication_status":"published","day":"01","doi":"10.1109/ICRA.2015.7139019","ec_funded":1,"related_material":{"record":[{"id":"5424","relation":"earlier_version","status":"public"},{"relation":"earlier_version","id":"5426","status":"public"}]},"month":"01","quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","arxiv":1,"citation":{"short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IEEE, 2015, pp. 325–30, doi:<a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">10.1109/ICRA.2015.7139019</a>.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. <a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">https://doi.org/10.1109/ICRA.2015.7139019</a>.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. doi:<a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">10.1109/ICRA.2015.7139019</a>","apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. <a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">https://doi.org/10.1109/ICRA.2015.7139019</a>"},"status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1409.3360","open_access":"1"}],"scopus_import":1,"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"conference":{"end_date":"2015-05-30","location":"Seattle, WA, United States","start_date":"2015-05-26","name":"ICRA: International Conference on Robotics and Automation"},"date_created":"2018-12-11T11:53:43Z","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty."}],"type":"conference","date_updated":"2023-02-23T12:25:52Z"},{"scopus_import":"1","citation":{"ieee":"O. Klehm <i>et al.</i>, “Recent advances in facial appearance capture,” <i>Computer Graphics Forum</i>, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.","ama":"Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance capture. <i>Computer Graphics Forum</i>. 2015;34(2):709-733. doi:<a href=\"https://doi.org/10.1111/cgf.12594\">10.1111/cgf.12594</a>","apa":"Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler, T. (2015). Recent advances in facial appearance capture. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12594\">https://doi.org/10.1111/cgf.12594</a>","chicago":"Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial Appearance Capture.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2015. <a href=\"https://doi.org/10.1111/cgf.12594\">https://doi.org/10.1111/cgf.12594</a>.","mla":"Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” <i>Computer Graphics Forum</i>, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:<a href=\"https://doi.org/10.1111/cgf.12594\">10.1111/cgf.12594</a>.","short":"O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz, T. Beeler, Computer Graphics Forum 34 (2015) 709–733.","ista":"Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum. 34(2), 709–733."},"main_file_link":[{"url":"https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf"}],"status":"public","quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"None","publication_status":"published","department":[{"_id":"BeBi"}],"doi":"10.1111/cgf.12594","day":"01","month":"05","type":"journal_article","date_updated":"2025-09-23T10:32:38Z","publication":"Computer Graphics Forum","date_created":"2018-12-11T11:53:43Z","abstract":[{"lang":"eng","text":"Facial appearance capture is now firmly established within academic research and used extensively across various application domains, perhaps most prominently in the entertainment industry through the design of virtual characters in video games and films. While significant progress has occurred over the last two decades, no single survey currently exists that discusses the similarities, differences, and practical considerations of the available appearance capture techniques as applied to human faces. A central difficulty of facial appearance capture is the way light interacts with skin-which has a complex multi-layered structure-and the interactions that occur below the skin surface can, by definition, only be observed indirectly. In this report, we distinguish between two broad strategies for dealing with this complexity. &quot;Image-based methods&quot; try to exhaustively capture the exact face appearance under different lighting and viewing conditions, and then render the face through weighted image combinations. &quot;Parametric methods&quot; instead fit the captured reflectance data to some parametric appearance model used during rendering, allowing for a more lightweight and flexible representation but at the cost of potentially increased rendering complexity or inexact reproduction. The goal of this report is to provide an overview that can guide practitioners and researchers in assessing the tradeoffs between current approaches and identifying directions for future advances in facial appearance capture."}],"title":"Recent advances in facial appearance capture","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","publisher":"Wiley-Blackwell","page":"709 - 733","article_processing_charge":"No","date_published":"2015-05-01T00:00:00Z","volume":34,"publist_id":"5391","intvolume":"        34","isi":1,"author":[{"first_name":"Oliver","full_name":"Klehm, Oliver","last_name":"Klehm"},{"first_name":"Fabrice","full_name":"Rousselle, Fabrice","last_name":"Rousselle"},{"first_name":"Marios","full_name":"Papas, Marios","last_name":"Papas"},{"first_name":"Derek","last_name":"Bradley","full_name":"Bradley, Derek"},{"first_name":"Christophe","full_name":"Hery, Christophe","last_name":"Hery"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"first_name":"Wojciech","full_name":"Jarosz, Wojciech","last_name":"Jarosz"},{"first_name":"Thabo","full_name":"Beeler, Thabo","last_name":"Beeler"}],"external_id":{"isi":["000358326600063"]},"_id":"1734","issue":"2"}]