[{"year":"2012","volume":45,"type":"journal_article","article_type":"original","month":"10","language":[{"iso":"eng"}],"citation":{"chicago":"Fan, Jiandong, Reza Zamani, Cristina Fábrega, Alexey Shavel, Cristina Flox, Maria Ibáñez, Teresa Andreu, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” <i>Journal of Physics D: Applied Physics</i>. IOP Publishing Ltd., 2012. <a href=\"https://doi.org/10.1088/0022-3727/45/41/415301\">https://doi.org/10.1088/0022-3727/45/41/415301</a>.","ista":"Fan J, Zamani R, Fábrega C, Shavel A, Flox C, Ibáñez M, Andreu T, López A, Arbiol J, Morante J, Cabot A. 2012. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 45(41).","ieee":"J. Fan <i>et al.</i>, “Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness,” <i>Journal of Physics D: Applied Physics</i>, vol. 45, no. 41. IOP Publishing Ltd., 2012.","mla":"Fan, Jiandong, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” <i>Journal of Physics D: Applied Physics</i>, vol. 45, no. 41, IOP Publishing Ltd., 2012, doi:<a href=\"https://doi.org/10.1088/0022-3727/45/41/415301\">10.1088/0022-3727/45/41/415301</a>.","short":"J. Fan, R. Zamani, C. Fábrega, A. Shavel, C. Flox, M. Ibáñez, T. Andreu, A. López, J. Arbiol, J. Morante, A. Cabot, Journal of Physics D: Applied Physics 45 (2012).","apa":"Fan, J., Zamani, R., Fábrega, C., Shavel, A., Flox, C., Ibáñez, M., … Cabot, A. (2012). Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. <i>Journal of Physics D: Applied Physics</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/0022-3727/45/41/415301\">https://doi.org/10.1088/0022-3727/45/41/415301</a>","ama":"Fan J, Zamani R, Fábrega C, et al. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. <i>Journal of Physics D: Applied Physics</i>. 2012;45(41). doi:<a href=\"https://doi.org/10.1088/0022-3727/45/41/415301\">10.1088/0022-3727/45/41/415301</a>"},"oa_version":"None","status":"public","date_updated":"2021-01-12T07:43:36Z","date_published":"2012-10-17T00:00:00Z","date_created":"2018-12-11T11:45:56Z","issue":"41","day":"17","abstract":[{"lang":"eng","text":"Arrays of vertically aligned ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires (NWs) were prepared by means of the combination of two solution-growth processes. First, single-crystal ZnO NWs with controlled n-type doping were grown on conducting substrates by a low-cost, high-yield and seed-free electrochemical route. These NWs were covered by a titanium oxide shell of tunable thickness mediating successive adsorption-hydrolysis-condensation steps. Using this atomic-layer growth procedure, titania shells with controlled thickness and the anatase TiO2 phase were obtained after sintering at 450 °C. Higher sintering temperatures resulted in the formation of ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs by the interdiffusion of Zn and Ti ions at the ZnO–TiO2 interface. The performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs towards photoelectrochemical (PEC) water splitting was investigated as a function of the titania shell thickness. Furthermore, the performance of such core–shell NWs as photoelectrodes in dye-sensitized solar cells was also characterized. The TiO2 presence at the ZnO : Cl surface promoted a two-fold increase on the produced photocurrent densities, probing their potential for PEC and optoelectronic applications. Electrochemical impedance spectroscopy was used to corroborate the lower resistance for charge transfer between the NWs and the electrolyte in the presence of the TiO2 shell."}],"title":"Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness","publication":"Journal of Physics D: Applied Physics","intvolume":"        45","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The research was supported by the European Regional Development Funds and the Spanish MICINN projects MAT2010-15138, MAT2010-21510 and CSD2009-00050. JF and AS thank the FI-DGR and BP grants from the Agència de Gestió d'Ajuts Universitaris i de Recerca (AGAUR) from the Catalan Government. MI and AC thank the Spanish MICINN for the PhD grant and the financial support through the Ramóny Cajal program.","quality_controlled":"1","_id":"346","article_processing_charge":"No","author":[{"first_name":"Jiandong","last_name":"Fan","full_name":"Fan, Jiandong"},{"full_name":"Zamani, Reza","first_name":"Reza","last_name":"Zamani"},{"first_name":"Cristina","last_name":"Fábrega","full_name":"Fábrega, Cristina"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"first_name":"Cristina","last_name":"Flox","full_name":"Flox, Cristina"},{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"last_name":"Andreu","first_name":"Teresa","full_name":"Andreu, Teresa"},{"last_name":"López","first_name":"Amtonio","full_name":"López, Amtonio"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Morante, Joan","first_name":"Joan","last_name":"Morante"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"publication_status":"published","doi":"10.1088/0022-3727/45/41/415301","publist_id":"7486","publisher":"IOP Publishing Ltd."},{"volume":134,"year":"2012","type":"journal_article","citation":{"ista":"Ibáñez M, Zamani R, Lalonde A, Cadavid D, Li W, Shavel A, Arbiol J, Morante J, Gorsse S, Snyder GJ, Cabot A. 2012. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. 134(9), 4060–4063.","chicago":"Ibáñez, Maria, Reza Zamani, Aaron Lalonde, Doris Cadavid, Wenhua Li, Alexey Shavel, Jordi Arbiol, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja211952z\">https://doi.org/10.1021/ja211952z</a>.","ama":"Ibáñez M, Zamani R, Lalonde A, et al. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. <i>Journal of the American Chemical Society</i>. 2012;134(9):4060-4063. doi:<a href=\"https://doi.org/10.1021/ja211952z\">10.1021/ja211952z</a>","apa":"Ibáñez, M., Zamani, R., Lalonde, A., Cadavid, D., Li, W., Shavel, A., … Cabot, A. (2012). Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja211952z\">https://doi.org/10.1021/ja211952z</a>","mla":"Ibáñez, Maria, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 9, ACS, 2012, pp. 4060–63, doi:<a href=\"https://doi.org/10.1021/ja211952z\">10.1021/ja211952z</a>.","ieee":"M. Ibáñez <i>et al.</i>, “Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 9. ACS, pp. 4060–4063, 2012.","short":"M. Ibáñez, R. Zamani, A. Lalonde, D. Cadavid, W. Li, A. Shavel, J. Arbiol, J. Morante, S. Gorsse, G.J. Snyder, A. Cabot, Journal of the American Chemical Society 134 (2012) 4060–4063."},"oa_version":"None","date_updated":"2021-01-12T07:43:40Z","main_file_link":[{"open_access":"1","url":"https://authors.library.caltech.edu/30261/"}],"date_published":"2012-03-07T00:00:00Z","issue":"9","abstract":[{"text":"A synthetic route for producing Cu 2ZnGeSe 4 nanocrystals with narrow size distributions and controlled composition is presented. These nanocrystals were used to produce densely packed nanomaterials by hot-pressing. From the characterization of the thermoelectric properties of these nanomaterials, Cu 2ZnGeSe 4 is demonstrated to show excellent thermoelectric properties. A very preliminary adjustment of the nanocrystal composition has already resulted in a figure of merit of up to 0.55 at 450°C. ","lang":"eng"}],"title":"Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"347","publication_status":"published","author":[{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"first_name":"Aaron","last_name":"Lalonde","full_name":"Lalonde, Aaron"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"last_name":"Li","first_name":"Wenhua","full_name":"Li, Wenhua"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"last_name":"Morante","first_name":"Joan","full_name":"Morante, Joan"},{"last_name":"Gorsse","first_name":"Stéphane","full_name":"Gorsse, Stéphane"},{"full_name":"Snyder, G Jeffrey","first_name":"G Jeffrey","last_name":"Snyder"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"doi":"10.1021/ja211952z","publisher":"ACS","month":"03","article_type":"original","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:45:57Z","day":"07","publication":"Journal of the American Chemical Society","page":"4060 - 4063","intvolume":"       134","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050, and CSD2009-00013. M.I. thanks the Spanish MICINN for her Ph.D. Grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is thankful for financial support through the Ramon y Cajal Program of the Spanish MICINN.","article_processing_charge":"No","quality_controlled":"1","oa":1,"publist_id":"7487"},{"citation":{"short":"M. Ibáñez, R. Zamani, W. Li, D. Cadavid, S. Gorse, N. Katchoi, A. Shavel, A. López, J. Morante, J. Arbiol, A. Cabot, Chemistry of Materials 24 (2012) 4615–4622.","mla":"Ibáñez, Maria, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” <i>Chemistry of Materials</i>, vol. 24, no. 23, American Chemical Society, 2012, pp. 4615–22, doi:<a href=\"https://doi.org/10.1021/cm303252q\">10.1021/cm303252q</a>.","ieee":"M. Ibáñez <i>et al.</i>, “Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials,” <i>Chemistry of Materials</i>, vol. 24, no. 23. American Chemical Society, pp. 4615–4622, 2012.","ama":"Ibáñez M, Zamani R, Li W, et al. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. <i>Chemistry of Materials</i>. 2012;24(23):4615-4622. doi:<a href=\"https://doi.org/10.1021/cm303252q\">10.1021/cm303252q</a>","apa":"Ibáñez, M., Zamani, R., Li, W., Cadavid, D., Gorse, S., Katchoi, N., … Cabot, A. (2012). Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. <i>Chemistry of Materials</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/cm303252q\">https://doi.org/10.1021/cm303252q</a>","chicago":"Ibáñez, Maria, Reza Zamani, Wenhua Li, Doris Cadavid, Stéphane Gorse, Nebll Katchoi, Alexey Shavel, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” <i>Chemistry of Materials</i>. American Chemical Society, 2012. <a href=\"https://doi.org/10.1021/cm303252q\">https://doi.org/10.1021/cm303252q</a>.","ista":"Ibáñez M, Zamani R, Li W, Cadavid D, Gorse S, Katchoi N, Shavel A, López A, Morante J, Arbiol J, Cabot A. 2012. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 24(23), 4615–4622."},"oa_version":"None","language":[{"iso":"eng"}],"type":"journal_article","month":"11","volume":24,"year":"2012","publication":"Chemistry of Materials","title":"Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials","page":"4615 - 4622","day":"14","abstract":[{"text":"The potential to control the composition and crystal phase at the nanometer scale enable the production of nanocrystalline materials with enhanced functionalities and new applications. In the present work, we detail a novel colloidal synthesis route to prepare nanoparticles of the ternary semiconductor Cu2GeSe3 (CGSe) with nanometer-scale control over their crystal phases. We also demonstrate the structural effect on the thermoelectric properties of bottom-up-prepared CGSe nanomaterials. By careful adjustment of the nucleation and growth temperatures, pure orthorhombic CGSe nanoparticles with cationic order or polytypic CGSe nanoparticles with disordered cation positions can be produced. In this second type of nanoparticle, a high density of twins can be created to periodically change the atomic plane stacking, forming a hexagonal wurtzite CGSe phase. The high yield of the synthetic routes reported here allows the production of single-phase and multiphase CGSe nanoparticles in the gram scale, which permits characterization of the thermoelectric properties of these materials. Reduced thermal conductivities and a related 2.5-fold increase of the thermoelectric figure of merit for multiphase nanomaterials compared to pure-phase CGSe are systematically obtained. These results are discussed in terms of the density and efficiency of phonon scattering centers in both types of materials.","lang":"eng"}],"date_published":"2012-11-14T00:00:00Z","date_created":"2018-12-11T11:46:07Z","issue":"23","date_updated":"2021-01-12T07:52:04Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","_id":"377","intvolume":"        24","extern":"1","publisher":"American Chemical Society","doi":"10.1021/cm303252q","publist_id":"7452","author":[{"first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Reza","last_name":"Zamani","full_name":"Zamani, Reza"},{"full_name":"Li, Wenhua","first_name":"Wenhua","last_name":"Li"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"full_name":"Gorse, Stéphane","last_name":"Gorse","first_name":"Stéphane"},{"full_name":"Katchoi, Nebll","last_name":"Katchoi","first_name":"Nebll"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"first_name":"Antonioo","last_name":"López","full_name":"López, Antonioo"},{"last_name":"Morante","first_name":"Joan","full_name":"Morante, Joan"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"publication_status":"published"},{"status":"public","date_updated":"2021-01-12T07:52:32Z","date_published":"2012-02-01T00:00:00Z","issue":"2","date_created":"2018-12-11T12:05:26Z","day":"01","abstract":[{"text":"Hierarchical Timing Language (HTL) is a coordination language for distributed, hard real-time applications. HTL is a hierarchical extension of Giotto and, like its predecessor, based on the logical execution time (LET) paradigm of real-time programming. Giotto is compiled into code for a virtual machine, called the EmbeddedMachine (or E machine). If HTL is targeted to the E machine, then the hierarchicalprogram structure needs to be flattened; the flattening makes separatecompilation difficult, and may result in E machinecode of exponential size. In this paper, we propose a generalization of the E machine, which supports a hierarchicalprogram structure at runtime through real-time trigger mechanisms that are arranged in a tree. We present the generalized E machine, and a modular compiler for HTL that generates code of linear size. The compiler may generate code for any part of a given HTL program separately in any order.","lang":"eng"}],"publication":"Science of Computer Programming","title":"Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code","page":"96 - 112","scopus_import":1,"year":"2012","volume":77,"type":"journal_article","month":"02","language":[{"iso":"eng"}],"oa_version":"None","citation":{"ista":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112.","chicago":"Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” <i>Science of Computer Programming</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">https://doi.org/10.1016/j.scico.2010.06.004</a>.","apa":"Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., &#38; Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. <i>Science of Computer Programming</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">https://doi.org/10.1016/j.scico.2010.06.004</a>","ama":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. <i>Science of Computer Programming</i>. 2012;77(2):96-112. doi:<a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">10.1016/j.scico.2010.06.004</a>","short":"A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.","mla":"Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” <i>Science of Computer Programming</i>, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:<a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">10.1016/j.scico.2010.06.004</a>.","ieee":"A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code,” <i>Science of Computer Programming</i>, vol. 77, no. 2. Elsevier, pp. 96–112, 2012."},"department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Ghosal, Arkadeb","first_name":"Arkadeb","last_name":"Ghosal"},{"first_name":"Daniel","last_name":"Iercan","full_name":"Iercan, Daniel"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Alberto","last_name":"Sangiovanni Vincentelli","full_name":"Sangiovanni Vincentelli, Alberto"}],"doi":"10.1016/j.scico.2010.06.004","publist_id":"2370","publisher":"Elsevier","intvolume":"        77","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3836","quality_controlled":"1"},{"file":[{"relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":336450,"date_created":"2019-01-29T10:54:28Z","access_level":"open_access","file_name":"a_survey_of_stochastic_omega-regular_games.pdf","file_id":"5897","checksum":"241b939deb4517cdd4426d49c67e3fa2","date_updated":"2020-07-14T12:46:17Z"}],"publist_id":"2341","has_accepted_license":"1","oa":1,"quality_controlled":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:17Z","acknowledgement":"This research was supported in part by the ONR grant N00014-02-1-0671, by the AFOSR MURI grant F49620-00-1-0327, and by the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610.","intvolume":"        78","page":"394 - 413","publication":"Journal of Computer and System Sciences","day":"02","date_created":"2018-12-11T12:05:29Z","status":"public","language":[{"iso":"eng"}],"article_type":"original","month":"03","publisher":"Elsevier","doi":"10.1016/j.jcss.2011.05.002","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3846","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A survey of stochastic ω regular games","abstract":[{"lang":"eng","text":"We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications."}],"ddc":["000"],"issue":"2","date_published":"2012-03-02T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jcss.2011.05.002"}],"date_updated":"2022-05-24T08:00:54Z","oa_version":"Submitted Version","citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” <i>Journal of Computer and System Sciences</i>, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:<a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">10.1016/j.jcss.2011.05.002</a>.","ieee":"K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” <i>Journal of Computer and System Sciences</i>, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.","short":"K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2012). A survey of stochastic ω regular games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">https://doi.org/10.1016/j.jcss.2011.05.002</a>","ama":"Chatterjee K, Henzinger TA. A survey of stochastic ω regular games. <i>Journal of Computer and System Sciences</i>. 2012;78(2):394-413. doi:<a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">10.1016/j.jcss.2011.05.002</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">https://doi.org/10.1016/j.jcss.2011.05.002</a>.","ista":"Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413."},"type":"journal_article","year":"2012","volume":78,"scopus_import":"1"},{"publisher":"American Physical Society","doi":"10.1103/PhysRevLett.108.206402","publist_id":"7442","publication_status":"published","author":[{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev","first_name":"Zhanybek"},{"first_name":"Rudro","last_name":"Biswas","full_name":"Biswas, Rudro"},{"first_name":"Alexander","last_name":"Balatsky","full_name":"Balatsky, Alexander"},{"full_name":"Analytis, James","first_name":"James","last_name":"Analytis"},{"full_name":"Chu, Jiunhaw","first_name":"Jiunhaw","last_name":"Chu"},{"first_name":"Ian","last_name":"Fisher","full_name":"Fisher, Ian"},{"full_name":"Kapitulnik, Aharon","first_name":"Aharon","last_name":"Kapitulnik"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"387","intvolume":"       108","extern":"1","title":"STM imaging of impurity resonances on Bi 2Se 3","publication":"Physical Review Letters","day":"01","abstract":[{"text":"In this Letter we present detailed study of the density of states near defects in Bi 2Se 3. In particular, we present data on the commonly found triangular defects in this system. While we do not find any measurable quasiparticle scattering interference effects, we do find localized resonances, which can be well fitted by theory once the potential is taken to be extended to properly account for the observed defects. The data together with the fits confirm that while the local density of states around the Dirac point of the electronic spectrum at the surface is significantly disrupted near the impurity by the creation of low-energy resonance state, the Dirac point is not locally destroyed. We discuss our results in terms of the expected protected surface state of topological insulators. © 2012 American Physical Society.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1108.0022"}],"date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T11:46:11Z","issue":"20","status":"public","date_updated":"2021-01-12T07:52:49Z","citation":{"ista":"Alpichshev Z, Biswas R, Balatsky A, Analytis J, Chu J, Fisher I, Kapitulnik A. 2012. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 108(20).","chicago":"Alpichshev, Zhanybek, Rudro Biswas, Alexander Balatsky, James Analytis, Jiunhaw Chu, Ian Fisher, and Aharon Kapitulnik. “STM Imaging of Impurity Resonances on Bi 2Se 3.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">https://doi.org/10.1103/PhysRevLett.108.206402</a>.","ama":"Alpichshev Z, Biswas R, Balatsky A, et al. STM imaging of impurity resonances on Bi 2Se 3. <i>Physical Review Letters</i>. 2012;108(20). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">10.1103/PhysRevLett.108.206402</a>","apa":"Alpichshev, Z., Biswas, R., Balatsky, A., Analytis, J., Chu, J., Fisher, I., &#38; Kapitulnik, A. (2012). STM imaging of impurity resonances on Bi 2Se 3. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">https://doi.org/10.1103/PhysRevLett.108.206402</a>","mla":"Alpichshev, Zhanybek, et al. “STM Imaging of Impurity Resonances on Bi 2Se 3.” <i>Physical Review Letters</i>, vol. 108, no. 20, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">10.1103/PhysRevLett.108.206402</a>.","ieee":"Z. Alpichshev <i>et al.</i>, “STM imaging of impurity resonances on Bi 2Se 3,” <i>Physical Review Letters</i>, vol. 108, no. 20. American Physical Society, 2012.","short":"Z. Alpichshev, R. Biswas, A. Balatsky, J. Analytis, J. Chu, I. Fisher, A. Kapitulnik, Physical Review Letters 108 (2012)."},"oa_version":"None","language":[{"iso":"eng"}],"type":"journal_article","month":"01","volume":108,"year":"2012"},{"file":[{"content_type":"application/pdf","creator":"system","checksum":"0c629e36acd5f2878ff7dd088d67d494","date_updated":"2020-07-14T12:46:35Z","file_id":"4953","date_created":"2018-12-12T10:12:35Z","access_level":"open_access","file_name":"IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf","file_size":1691436,"relation":"main_file"}],"publist_id":"7328","has_accepted_license":"1","oa":1,"article_processing_charge":"No","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","intvolume":"        12","publication":"BMC Plant Biology","day":"26","date_created":"2018-12-11T11:46:46Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"month":"07","pubrep_id":"946","publisher":"BioMed Central","doi":"10.1186/1471-2229-12-116","publication_status":"published","author":[{"full_name":"Galkovskyi, Taras","first_name":"Taras","last_name":"Galkovskyi"},{"full_name":"Mileyko, Yuriy","first_name":"Yuriy","last_name":"Mileyko"},{"last_name":"Bucksch","first_name":"Alexander","full_name":"Bucksch, Alexander"},{"last_name":"Moore","first_name":"Brad","full_name":"Moore, Brad"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","last_name":"Symonova","first_name":"Olga"},{"full_name":"Price, Charles","last_name":"Price","first_name":"Charles"},{"first_name":"Chrostopher","last_name":"Topp","full_name":"Topp, Chrostopher"},{"full_name":"Iyer Pascuzzi, Anjali","last_name":"Iyer Pascuzzi","first_name":"Anjali"},{"last_name":"Zurek","first_name":"Paul","full_name":"Zurek, Paul"},{"full_name":"Fang, Suqin","last_name":"Fang","first_name":"Suqin"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"last_name":"Benfey","first_name":"Philip","full_name":"Benfey, Philip"},{"first_name":"Joshua","last_name":"Weitz","full_name":"Weitz, Joshua"}],"_id":"492","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","title":"GiA Roots: Software for the high throughput analysis of plant root system architecture","article_number":"116","abstract":[{"lang":"eng","text":"Background: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Results: We have developed GiA Roots (General Image Analysis of Roots), a semi-automated software tool designed specifically for the high-throughput analysis of root system images. GiA Roots includes user-assisted algorithms to distinguish root from background and a fully automated pipeline that extracts dozens of root system phenotypes. Quantitative information on each phenotype, along with intermediate steps for full reproducibility, is returned to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line interface for interweaving the software into large-scale workflows. GiA Roots can also be extended to estimate novel phenotypes specified by the end-user.Conclusions: We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing 12 genotypes from the species Oryza sativa. We validate trait measurements against prior analyses of this image set that demonstrated that RSA traits are likely heritable and associated with genotypic differences. Moreover, we demonstrate that GiA Roots is extensible and an end-user can add functionality so that GiA Roots can estimate novel RSA traits. In summary, we show that the software can function as an efficient tool as part of a workflow to move from large numbers of root images to downstream analysis."}],"ddc":["005","514","516"],"date_published":"2012-07-26T00:00:00Z","date_updated":"2022-08-25T14:59:17Z","oa_version":"Published Version","citation":{"ama":"Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>. 2012;12. doi:<a href=\"https://doi.org/10.1186/1471-2229-12-116\">10.1186/1471-2229-12-116</a>","apa":"Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price, C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2229-12-116\">https://doi.org/10.1186/1471-2229-12-116</a>","short":"T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C. Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC Plant Biology 12 (2012).","ieee":"T. Galkovskyi <i>et al.</i>, “GiA Roots: Software for the high throughput analysis of plant root system architecture,” <i>BMC Plant Biology</i>, vol. 12. BioMed Central, 2012.","mla":"Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>, vol. 12, 116, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1471-2229-12-116\">10.1186/1471-2229-12-116</a>.","ista":"Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C, Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 12, 116.","chicago":"Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1471-2229-12-116\">https://doi.org/10.1186/1471-2229-12-116</a>."},"type":"journal_article","year":"2012","volume":12,"scopus_import":"1"},{"day":"13","publication":"Frontiers in Neuroscience","status":"public","date_created":"2018-12-11T11:46:46Z","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"pubrep_id":"945","month":"07","has_accepted_license":"1","publist_id":"7327","file":[{"date_created":"2018-12-12T10:18:34Z","file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","access_level":"open_access","file_size":2693701,"date_updated":"2020-07-14T12:46:35Z","checksum":"195238221c4b0b0f4035f6f6c16ea17c","file_id":"5356","content_type":"application/pdf","creator":"system","relation":"main_file"}],"oa":1,"intvolume":"         6","file_date_updated":"2020-07-14T12:46:35Z","acknowledgement":"The studies were in part or completely supported by the Bundesministerium für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631 and 216886, the World Class University Program through the National Research Foundation of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008), the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415 (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk), the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830, German Research Foundation grants 550/B5 and C6, and by a scholarship from the German National Academic Foundation. This paper only reflects the authors’ views and funding agencies are not liable for any use that may be made of the information contained herein.\r\n","quality_controlled":"1","abstract":[{"text":"The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs.","lang":"eng"}],"article_number":"55","title":"Review of the BCI competition IV","date_updated":"2021-01-12T08:01:03Z","date_published":"2012-07-13T00:00:00Z","ddc":["004"],"citation":{"ista":"Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation, 2012. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>.","ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. 2012;6. doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>","apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>","mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>, vol. 6, 55, Frontiers Research Foundation, 2012, doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>.","ieee":"M. Tangermann <i>et al.</i>, “Review of the BCI competition IV,” <i>Frontiers in Neuroscience</i>, vol. 6. Frontiers Research Foundation, 2012.","short":"M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012)."},"oa_version":"Published Version","scopus_import":1,"year":"2012","volume":6,"type":"journal_article","doi":"10.3389/fnins.2012.00055","publisher":"Frontiers Research Foundation","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"publication_status":"published","author":[{"first_name":"Michael","last_name":"Tangermann","full_name":"Tangermann, Michael"},{"last_name":"Müller","first_name":"Klaus","full_name":"Müller, Klaus"},{"full_name":"Aertsen, Ad","last_name":"Aertsen","first_name":"Ad"},{"full_name":"Birbaumer, Niels","first_name":"Niels","last_name":"Birbaumer"},{"full_name":"Braun, Christoph","first_name":"Christoph","last_name":"Braun"},{"full_name":"Brunner, Clemens","last_name":"Brunner","first_name":"Clemens"},{"full_name":"Leeb, Robert","last_name":"Leeb","first_name":"Robert"},{"full_name":"Mehring, Carsten","last_name":"Mehring","first_name":"Carsten"},{"full_name":"Miller, Kai","last_name":"Miller","first_name":"Kai"},{"full_name":"Müller Putz, Gernot","last_name":"Müller Putz","first_name":"Gernot"},{"first_name":"Guido","last_name":"Nolte","full_name":"Nolte, Guido"},{"full_name":"Pfurtscheller, Gert","first_name":"Gert","last_name":"Pfurtscheller"},{"first_name":"Hubert","last_name":"Preissl","full_name":"Preissl, Hubert"},{"first_name":"Gerwin","last_name":"Schalk","full_name":"Schalk, Gerwin"},{"first_name":"Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vidaurre, Carmen","first_name":"Carmen","last_name":"Vidaurre"},{"full_name":"Waldert, Stephan","first_name":"Stephan","last_name":"Waldert"},{"full_name":"Blankertz, Benjamin","last_name":"Blankertz","first_name":"Benjamin"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"493"},{"article_number":"29","publication":"ACM Transactions on Computational Logic (TOCL)","title":"Translating to Co-Büchi made tight, unified, and useful","day":"01","abstract":[{"lang":"eng","text":"We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2o(nlog n) and the lower bound is 1.5n. We improve the upper bound to n2n and describe a matching lower bound of 2ω(n). For the NBW to DCW translation, the currently known upper bound is 2o(nlog n). We improve it to 2 o(n), which is asymptotically tight. Both of our upper-bound constructions are based on a simple subset construction, do not involve intermediate automata with richer acceptance conditions, and can be implemented symbolically. We continue and solve the open problems of translating nondeterministic Streett, Rabin, Muller, and parity word automata to NCW and to DCW. Going via an intermediate NBW is not optimal and we describe direct, simple, and asymptotically tight constructions, involving a 2o(n) blow-up. The constructions are variants of the subset construction, providing a unified approach for translating all common classes of automata to NCW and DCW. Beyond the theoretical importance of the results, we point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata."}],"date_published":"2012-10-01T00:00:00Z","issue":"4","date_created":"2018-12-11T11:46:47Z","status":"public","date_updated":"2021-01-12T08:01:03Z","citation":{"mla":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 4, 29, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>.","ieee":"U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 4. ACM, 2012.","short":"U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).","ama":"Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2012;13(4). doi:<a href=\"https://doi.org/10.1145/2362355.2362357\">10.1145/2362355.2362357</a>","apa":"Boker, U., &#38; Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>","chicago":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2362355.2362357\">https://doi.org/10.1145/2362355.2362357</a>.","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29."},"oa_version":"None","language":[{"iso":"eng"}],"type":"journal_article","month":"10","scopus_import":1,"year":"2012","volume":13,"publisher":"ACM","doi":"10.1145/2362355.2362357","publist_id":"7326","author":[{"last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"publication_status":"published","department":[{"_id":"ToHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"494","intvolume":"        13"},{"publist_id":"7325","has_accepted_license":"1","file":[{"file_size":97736,"date_created":"2018-12-12T10:15:31Z","access_level":"open_access","file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","file_id":"5152","date_updated":"2020-07-14T12:46:35Z","checksum":"56277f95edc9d531fa3bdc5f9579fda8","creator":"system","content_type":"application/pdf","relation":"main_file"}],"oa":1,"intvolume":"        96","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","day":"07","page":"238 - 246","conference":{"end_date":"2012-09-08","name":"GandALF: Games, Automata, Logics and Formal Verification","location":"Napoli, Italy","start_date":"2012-09-06"},"publication":"Proceedings GandALF 2012","status":"public","date_created":"2018-12-11T11:46:47Z","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"pubrep_id":"944","month":"10","doi":"10.4204/EPTCS.96.18","publisher":"Open Publishing Association","alternative_title":["EPTCS"],"ec_funded":1,"department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"last_name":"Kruckman","first_name":"Alex","full_name":"Kruckman, Alex"},{"first_name":"Sasha","last_name":"Rubin","full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sheridan, John","last_name":"Sheridan","first_name":"John"},{"first_name":"Ben","last_name":"Zax","full_name":"Zax, Ben"}],"_id":"495","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"abstract":[{"text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.","lang":"eng"}],"title":"A Myhill Nerode theorem for automata with advice","date_updated":"2021-01-12T08:01:04Z","ddc":["004"],"date_published":"2012-10-07T00:00:00Z","citation":{"chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46. Open Publishing Association, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>.","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012, vol. 96, pp. 238–246.","mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","apa":"Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>","ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association; 2012:238-246. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>"},"oa_version":"Published Version","volume":96,"year":"2012","scopus_import":1,"type":"conference"},{"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"496","department":[{"_id":"KrCh"}],"oa":1,"publication_status":"published","author":[{"full_name":"Rabinovich, Alexander","last_name":"Rabinovich","first_name":"Alexander"},{"full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","last_name":"Rubin"}],"doi":"10.1109/LICS.2012.65","publist_id":"7324","alternative_title":["LICS"],"ec_funded":1,"publisher":"IEEE","scopus_import":1,"year":"2012","type":"conference","month":"01","language":[{"iso":"eng"}],"citation":{"apa":"Rabinovich, A., &#38; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.","mla":"Rabinovich, Alexander, and Sasha Rubin. <i>Interpretations in Trees with Countably Many Branches</i>. 6280474, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>.","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.","chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>."},"oa_version":"Preprint","date_updated":"2021-01-12T08:01:05Z","status":"public","main_file_link":[{"url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf","open_access":"1"}],"date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T11:46:47Z","day":"01","abstract":[{"lang":"eng","text":"We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations."}],"article_number":"6280474","conference":{"end_date":"2012-06-28","name":"LICS: Symposium on Logic in Computer Science","location":"Dubrovnik, Croatia","start_date":"2012-06-25"},"title":"Interpretations in trees with countably many branches"},{"_id":"497","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"ec_funded":1,"doi":"10.4230/LIPIcs.CSL.2012.167","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chaubal, Siddhesh","first_name":"Siddhesh","last_name":"Chaubal"},{"first_name":"Pritish","last_name":"Kamath","full_name":"Kamath, Pritish"}],"publication_status":"published","department":[{"_id":"KrCh"}],"oa_version":"Published Version","citation":{"chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>.","ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>"},"type":"conference","year":"2012","volume":16,"scopus_import":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","title":"Faster algorithms for alternating refinement relations","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath."}],"ddc":["004"],"date_published":"2012-09-01T00:00:00Z","date_updated":"2023-02-23T12:23:32Z","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","intvolume":"        16","file":[{"relation":"main_file","creator":"system","content_type":"application/pdf","file_size":471236,"date_created":"2018-12-12T10:08:50Z","file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf","access_level":"open_access","file_id":"4712","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e","date_updated":"2020-07-14T12:46:35Z"}],"publist_id":"7323","has_accepted_license":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","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"},"language":[{"iso":"eng"}],"month":"09","pubrep_id":"943","page":"167 - 182","conference":{"start_date":"2012-09-03","location":"Fontainebleau, France","name":"EACSL: European Association for Computer Science Logic","end_date":"2012-09-06"},"related_material":{"record":[{"id":"5378","relation":"earlier_version","status":"public"}]},"day":"01","date_created":"2018-12-11T11:46:48Z","status":"public"},{"doi":"10.1111/j.1752-4571.2012.00284.x","publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"}],"author":[{"full_name":"Pickup, Melinda","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","last_name":"Pickup"},{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","full_name":"Field, David","last_name":"Field","first_name":"David"},{"last_name":"Rowell","first_name":"David","full_name":"Rowell, David"},{"last_name":"Young","first_name":"Andrew","full_name":"Young, Andrew"}],"publication_status":"published","_id":"498","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics","date_updated":"2021-01-12T08:01:06Z","issue":"8","ddc":["576"],"date_published":"2012-12-01T00:00:00Z","oa_version":"Published Version","citation":{"mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>.","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” <i>Evolutionary Applications</i>, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.","apa":"Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>","ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. 2012;5(8):913-924. doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>.","ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924."},"volume":5,"year":"2012","type":"journal_article","publist_id":"7322","has_accepted_license":"1","file":[{"file_size":396136,"access_level":"open_access","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf","date_created":"2018-12-12T10:10:33Z","file_id":"4821","checksum":"233007138606aca5a2f75f7ae1742f43","date_updated":"2020-07-14T12:46:35Z","creator":"system","content_type":"application/pdf","relation":"main_file"}],"oa":1,"intvolume":"         5","quality_controlled":"1","acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n","file_date_updated":"2020-07-14T12:46:35Z","day":"01","page":"913 - 924","publication":"Evolutionary Applications","status":"public","date_created":"2018-12-11T11:46:48Z","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"pubrep_id":"942","month":"12"},{"oa":1,"has_accepted_license":"1","publist_id":"7314","file":[{"relation":"main_file","date_created":"2019-02-12T09:03:09Z","access_level":"open_access","file_name":"2012_CellBiology_Sixt.pdf","file_size":986566,"date_updated":"2020-07-14T12:46:36Z","checksum":"45c02be33ebd99fc3077d60b9c90bdfa","file_id":"5957","content_type":"application/pdf","creator":"kschuh"}],"intvolume":"       197","file_date_updated":"2020-07-14T12:46:36Z","quality_controlled":"1","article_processing_charge":"No","status":"public","date_created":"2018-12-11T11:46:51Z","day":"30","publication":"Journal of Cell Biology","page":"347 - 349","month":"04","article_type":"original","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"department":[{"_id":"MiSi"}],"publication_status":"published","author":[{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"}],"doi":"10.1083/jcb.201204039","publisher":"Rockefeller University Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"506","date_updated":"2021-01-12T08:01:11Z","date_published":"2012-04-30T00:00:00Z","ddc":["570"],"issue":"3","title":"Cell migration: Fibroblasts find a new way to get ahead","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","scopus_import":1,"volume":197,"year":"2012","type":"journal_article","citation":{"ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. 2012;197(3):347-349. doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>.","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012."},"oa_version":"Published Version"},{"file_date_updated":"2020-07-14T12:46:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5377","doi":"10.15479/AT:IST-2012-0002","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:38Z","checksum":"a03c08c1589dbb0c96183a8bcf3ab240","file_id":"5522","date_created":"2018-12-12T11:54:00Z","access_level":"open_access","file_name":"IST-2012-002_IST-2012-0002.pdf","file_size":592098,"content_type":"application/pdf","creator":"system"}],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"publication_status":"published","oa":1,"language":[{"iso":"eng"}],"citation":{"short":"K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.","mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>.","ieee":"K. Chatterjee and Y. Velner, <i>Mean-payoff pushdown games</i>. IST Austria, 2012.","ama":"Chatterjee K, Velner Y. <i>Mean-Payoff Pushdown Games</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>","apa":"Chatterjee, K., &#38; Velner, Y. (2012). <i>Mean-payoff pushdown games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>","chicago":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>.","ista":"Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p."},"oa_version":"Published Version","pubrep_id":"10","year":"2012","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"month":"07","day":"02","abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.","lang":"eng"}],"related_material":{"record":[{"relation":"later_version","id":"2956","status":"public"}]},"title":"Mean-payoff pushdown games","page":"33","status":"public","date_updated":"2023-02-23T11:05:50Z","date_published":"2012-07-02T00:00:00Z","date_created":"2018-12-12T11:38:59Z","ddc":["000","005"]},{"doi":"10.15479/AT:IST-2012-0001","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"file":[{"relation":"main_file","creator":"system","content_type":"application/pdf","file_size":394256,"file_name":"IST-2012-0001_IST-2012-0001.pdf","access_level":"open_access","date_created":"2018-12-12T11:53:28Z","file_id":"5489","checksum":"ec8d1857cc7095d3de5107a0162ced37","date_updated":"2020-07-14T12:46:39Z"}],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"oa":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Siddhesh","last_name":"Chaubal","full_name":"Chaubal, Siddhesh"},{"full_name":"Kamath, Pritish","first_name":"Pritish","last_name":"Kamath"}],"publication_status":"published","file_date_updated":"2020-07-14T12:46:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5378","day":"04","abstract":[{"text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"497"}]},"title":"Faster algorithms for alternating refinement relations","page":"21","status":"public","date_updated":"2023-02-23T12:21:38Z","date_published":"2012-07-04T00:00:00Z","ddc":["000","005"],"date_created":"2018-12-12T11:38:59Z","language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, <i>Faster algorithms for alternating refinement relations</i>. IST Austria, 2012.","ama":"Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). <i>Faster algorithms for alternating refinement relations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>"},"oa_version":"Published Version","year":"2012","pubrep_id":"14","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"month":"07"},{"type":"journal_article","publication_identifier":{"issn":["0043-1397"]},"scopus_import":"1","volume":47,"year":"2011","oa_version":"Published Version","citation":{"chicago":"Finger, David, Francesca Pellicciotti, Markus Konz, Stefan Rimkus, and Paolo Burlando. “The Value of Glacier Mass Balance, Satellite Snow Cover Images, and Hourly Discharge for Improving the Performance of a Physically Based Distributed Hydrological Model.” <i>Water Resources Research</i>. American Geophysical Union, 2011. <a href=\"https://doi.org/10.1029/2010wr009824\">https://doi.org/10.1029/2010wr009824</a>.","ista":"Finger D, Pellicciotti F, Konz M, Rimkus S, Burlando P. 2011. The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model. Water Resources Research. 47(7), W07519.","ieee":"D. Finger, F. Pellicciotti, M. Konz, S. Rimkus, and P. Burlando, “The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model,” <i>Water Resources Research</i>, vol. 47, no. 7. American Geophysical Union, 2011.","mla":"Finger, David, et al. “The Value of Glacier Mass Balance, Satellite Snow Cover Images, and Hourly Discharge for Improving the Performance of a Physically Based Distributed Hydrological Model.” <i>Water Resources Research</i>, vol. 47, no. 7, W07519, American Geophysical Union, 2011, doi:<a href=\"https://doi.org/10.1029/2010wr009824\">10.1029/2010wr009824</a>.","short":"D. Finger, F. Pellicciotti, M. Konz, S. Rimkus, P. Burlando, Water Resources Research 47 (2011).","apa":"Finger, D., Pellicciotti, F., Konz, M., Rimkus, S., &#38; Burlando, P. (2011). The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model. <i>Water Resources Research</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2010wr009824\">https://doi.org/10.1029/2010wr009824</a>","ama":"Finger D, Pellicciotti F, Konz M, Rimkus S, Burlando P. The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model. <i>Water Resources Research</i>. 2011;47(7). doi:<a href=\"https://doi.org/10.1029/2010wr009824\">10.1029/2010wr009824</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2010WR009824"}],"date_published":"2011-07-01T00:00:00Z","issue":"7","date_updated":"2023-02-20T10:39:57Z","title":"The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model","article_number":"W07519","abstract":[{"lang":"eng","text":"Physically based hydrological models describe natural processes more accurately than conceptual models but require extensive data sets to produce accurate results. To identify the value of different data sets for improving the performance of the distributed hydrological model TOPKAPI we combine a multivariable validation technique with Monte Carlo simulations. The study is carried out in the snow and ice-dominated Rhonegletscher basin, as these types of mountainous basins are generally the most critical with respect to data availability and sensitivity to climate fluctuations. Each observational data set is used individually and in combination with the other data sets to determine a subset of best parameter combinations out of 10,000 Monte Carlos runs performed with randomly generated parameter sets. We validate model results against discharge, glacier mass balance, and satellite snow cover images for a 14 year time period (1994–2007). While the use of all data sets combined provides the best overall model performance (defined by the concurrent best agreement of simulated discharge, snow cover and mass balance with their respective measurements), the use of one or two variables for constraining the model results in poorer performance. Using only one data set for constraining the model glacier mass balance proved to be the most efficient observation leading to the best overall model performance. Our main result is that a combination of discharge and satellite snow cover images is best for improving model performance, since the volumetric information of discharge data and the spatial information of snow cover images are complementary."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12649","extern":"1","author":[{"first_name":"David","last_name":"Finger","full_name":"Finger, David"},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti"},{"first_name":"Markus","last_name":"Konz","full_name":"Konz, Markus"},{"first_name":"Stefan","last_name":"Rimkus","full_name":"Rimkus, Stefan"},{"first_name":"Paolo","last_name":"Burlando","full_name":"Burlando, Paolo"}],"publication_status":"published","publisher":"American Geophysical Union","doi":"10.1029/2010wr009824","month":"07","article_type":"original","language":[{"iso":"eng"}],"date_created":"2023-02-20T08:18:03Z","status":"public","publication":"Water Resources Research","day":"01","article_processing_charge":"No","quality_controlled":"1","intvolume":"        47","oa":1},{"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","_id":"12650","quality_controlled":"1","doi":"10.1007/978-90-481-2642-2_543","alternative_title":["Encyclopedia of Earth Sciences Series"],"publisher":"Springer Nature","publication_status":"published","author":[{"last_name":"Molnar","first_name":"Peter","full_name":"Molnar, Peter"},{"last_name":"Burlando","first_name":"Paolo","full_name":"Burlando, Paolo"},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti"}],"language":[{"iso":"eng"}],"citation":{"ista":"Molnar P, Burlando P, Pellicciotti F. 2011.Streamflow Trends in Mountainous Regions. In: Encyclopedia of Snow, Ice and Glaciers. Encyclopedia of Earth Sciences Series, , 1084–1089.","chicago":"Molnar, Peter, Paolo Burlando, and Francesca Pellicciotti. “Streamflow Trends in Mountainous Regions.” In <i>Encyclopedia of Snow, Ice and Glaciers</i>, edited by Vijay Singh, Pratap Singh, and Umesh Haritashya, 1st ed., 1084–89. Dordrecht: Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">https://doi.org/10.1007/978-90-481-2642-2_543</a>.","ama":"Molnar P, Burlando P, Pellicciotti F. Streamflow Trends in Mountainous Regions. In: Singh V, Singh P, Haritashya U, eds. <i>Encyclopedia of Snow, Ice and Glaciers</i>. 1st ed. Dordrecht: Springer Nature; 2011:1084-1089. doi:<a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">10.1007/978-90-481-2642-2_543</a>","apa":"Molnar, P., Burlando, P., &#38; Pellicciotti, F. (2011). Streamflow Trends in Mountainous Regions. In V. Singh, P. Singh, &#38; U. Haritashya (Eds.), <i>Encyclopedia of Snow, Ice and Glaciers</i> (1st ed., pp. 1084–1089). Dordrecht: Springer Nature. <a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">https://doi.org/10.1007/978-90-481-2642-2_543</a>","mla":"Molnar, Peter, et al. “Streamflow Trends in Mountainous Regions.” <i>Encyclopedia of Snow, Ice and Glaciers</i>, edited by Vijay Singh et al., 1st ed., Springer Nature, 2011, pp. 1084–89, doi:<a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">10.1007/978-90-481-2642-2_543</a>.","ieee":"P. Molnar, P. Burlando, and F. Pellicciotti, “Streamflow Trends in Mountainous Regions,” in <i>Encyclopedia of Snow, Ice and Glaciers</i>, 1st ed., V. Singh, P. Singh, and U. Haritashya, Eds. Dordrecht: Springer Nature, 2011, pp. 1084–1089.","short":"P. Molnar, P. Burlando, F. Pellicciotti, in:, V. Singh, P. Singh, U. Haritashya (Eds.), Encyclopedia of Snow, Ice and Glaciers, 1st ed., Springer Nature, Dordrecht, 2011, pp. 1084–1089."},"oa_version":"None","scopus_import":"1","year":"2011","type":"book_chapter","month":"07","publication_identifier":{"eisbn":["978-90-481-2642-2"],"issn":["1388-4360"],"isbn":["978-90-481-2641-5"],"eissn":["1871-756X"]},"day":"01","abstract":[{"lang":"eng","text":"Streamflow is a hydrological variable measured at a defined river cross-section; it spatially integrates the runoff generating processes in the contributing watershed, including precipitation and air temperature. Trends in streamflow are progressive changes in the time series of streamflow that can be detected with statistical methods and their statistical significance can be assessed. Mountainous regions are particularly vulnerable to streamflow change because of their high specific runoff and the sensitivity to the distribution of precipitation and air temperature, and the processes of snow accumulation and melt."}],"title":"Streamflow Trends in Mountainous Regions","publication":"Encyclopedia of Snow, Ice and Glaciers","page":"1084-1089","status":"public","date_updated":"2023-02-20T10:35:28Z","editor":[{"first_name":"Vijay","last_name":"Singh","full_name":"Singh, Vijay"},{"first_name":"Pratap","last_name":"Singh","full_name":"Singh, Pratap"},{"last_name":"Haritashya","first_name":"Umesh","full_name":"Haritashya, Umesh"}],"date_published":"2011-07-01T00:00:00Z","place":"Dordrecht","edition":"1","date_created":"2023-02-20T08:18:07Z"},{"abstract":[{"text":"Temperature data from three Automatic Weather Stations and twelve Temperature Loggers are used to investigate the spatiotemporal variability of temperature over a glacier, its main atmospheric controls, the suitability of extrapolation techniques and their effect on melt modeling. We use data collected on Juncal Norte Glacier, central Chile, during one ablation season. We examine temporal and spatial variability in lapse rates (LRs), together with alternative statistical interpolation methods. The main control over the glacier thermal regime is the development of a katabatic boundary layer (KBL). Katabatic wind occurs at night and in the morning and is eroded in the afternoon. LRs reveal strong diurnal variability, with steeper LRs during the day when the katabatic wind weakens and shallower LRs during the night and morning. We suggest that temporally variable LRs should be used to account for the observed change. They tend to be steeper than equivalent constant LRs, and therefore result in a reduction in simulated melt compared to use of constant LRs when extrapolating from lower to higher elevations. In addition to the temporal variability, the temperature-elevation relationship varies also in space. Differences are evident between local LRs and including such variability in melt modeling affects melt simulations. Extrapolation methods based on the spatial variability of the observations after removal of the elevation trend, such as Inverse Distance Weighting or Kriging, do not seem necessary for simulations of gridded temperature data over a glacier.","lang":"eng"}],"article_number":"D23109","title":"Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile","date_updated":"2023-02-20T10:29:44Z","issue":"D23","date_published":"2011-12-16T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2011JD01584"}],"citation":{"chicago":"Petersen, L., and Francesca Pellicciotti. “Spatial and Temporal Variability of Air Temperature on a Melting Glacier: Atmospheric Controls, Extrapolation Methods and Their Effect on Melt Modeling, Juncal Norte Glacier, Chile.” <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union, 2011. <a href=\"https://doi.org/10.1029/2011jd015842\">https://doi.org/10.1029/2011jd015842</a>.","ista":"Petersen L, Pellicciotti F. 2011. Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile. Journal of Geophysical Research: Atmospheres. 116(D23), D23109.","short":"L. Petersen, F. Pellicciotti, Journal of Geophysical Research: Atmospheres 116 (2011).","mla":"Petersen, L., and Francesca Pellicciotti. “Spatial and Temporal Variability of Air Temperature on a Melting Glacier: Atmospheric Controls, Extrapolation Methods and Their Effect on Melt Modeling, Juncal Norte Glacier, Chile.” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 116, no. D23, D23109, American Geophysical Union, 2011, doi:<a href=\"https://doi.org/10.1029/2011jd015842\">10.1029/2011jd015842</a>.","ieee":"L. Petersen and F. Pellicciotti, “Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile,” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 116, no. D23. American Geophysical Union, 2011.","ama":"Petersen L, Pellicciotti F. Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile. <i>Journal of Geophysical Research: Atmospheres</i>. 2011;116(D23). doi:<a href=\"https://doi.org/10.1029/2011jd015842\">10.1029/2011jd015842</a>","apa":"Petersen, L., &#38; Pellicciotti, F. (2011). Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile. <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2011jd015842\">https://doi.org/10.1029/2011jd015842</a>"},"keyword":["Paleontology","Space and Planetary Science","Earth and Planetary Sciences (miscellaneous)","Atmospheric Science","Earth-Surface Processes","Geochemistry and Petrology","Soil Science","Water Science and Technology","Ecology","Aquatic Science","Forestry","Oceanography","Geophysics"],"oa_version":"Published Version","volume":116,"year":"2011","scopus_import":"1","publication_identifier":{"issn":["0148-0227"]},"type":"journal_article","doi":"10.1029/2011jd015842","publisher":"American Geophysical Union","author":[{"last_name":"Petersen","first_name":"L.","full_name":"Petersen, L."},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti"}],"publication_status":"published","extern":"1","_id":"12651","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","publication":"Journal of Geophysical Research: Atmospheres","status":"public","date_created":"2023-02-20T08:18:14Z","language":[{"iso":"eng"}],"article_type":"original","month":"12","oa":1,"intvolume":"       116","quality_controlled":"1","article_processing_charge":"No"},{"intvolume":"        57","article_processing_charge":"No","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"article_type":"original","month":"03","day":"01","page":"367-381","publication":"Journal of Glaciology","status":"public","date_created":"2023-02-20T08:18:21Z","extern":"1","_id":"12652","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.3189/002214311796406013","publisher":"Cambridge University Press","publication_status":"published","author":[{"first_name":"Francesca","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"},{"full_name":"Raschle, Thomas","last_name":"Raschle","first_name":"Thomas"},{"first_name":"Thomas","last_name":"Huerlimann","full_name":"Huerlimann, Thomas"},{"full_name":"Carenzo, Marco","first_name":"Marco","last_name":"Carenzo"},{"full_name":"Burlando, Paolo","first_name":"Paolo","last_name":"Burlando"}],"citation":{"mla":"Pellicciotti, Francesca, et al. “Transmission of Solar Radiation through Clouds on Melting Glaciers: A Comparison of Parameterizations and Their Impact on Melt Modelling.” <i>Journal of Glaciology</i>, vol. 57, no. 202, Cambridge University Press, 2011, pp. 367–81, doi:<a href=\"https://doi.org/10.3189/002214311796406013\">10.3189/002214311796406013</a>.","ieee":"F. Pellicciotti, T. Raschle, T. Huerlimann, M. Carenzo, and P. Burlando, “Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling,” <i>Journal of Glaciology</i>, vol. 57, no. 202. Cambridge University Press, pp. 367–381, 2011.","short":"F. Pellicciotti, T. Raschle, T. Huerlimann, M. Carenzo, P. Burlando, Journal of Glaciology 57 (2011) 367–381.","ama":"Pellicciotti F, Raschle T, Huerlimann T, Carenzo M, Burlando P. Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling. <i>Journal of Glaciology</i>. 2011;57(202):367-381. doi:<a href=\"https://doi.org/10.3189/002214311796406013\">10.3189/002214311796406013</a>","apa":"Pellicciotti, F., Raschle, T., Huerlimann, T., Carenzo, M., &#38; Burlando, P. (2011). Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling. <i>Journal of Glaciology</i>. Cambridge University Press. <a href=\"https://doi.org/10.3189/002214311796406013\">https://doi.org/10.3189/002214311796406013</a>","chicago":"Pellicciotti, Francesca, Thomas Raschle, Thomas Huerlimann, Marco Carenzo, and Paolo Burlando. “Transmission of Solar Radiation through Clouds on Melting Glaciers: A Comparison of Parameterizations and Their Impact on Melt Modelling.” <i>Journal of Glaciology</i>. Cambridge University Press, 2011. <a href=\"https://doi.org/10.3189/002214311796406013\">https://doi.org/10.3189/002214311796406013</a>.","ista":"Pellicciotti F, Raschle T, Huerlimann T, Carenzo M, Burlando P. 2011. Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling. Journal of Glaciology. 57(202), 367–381."},"oa_version":"Published Version","year":"2011","volume":57,"scopus_import":"1","publication_identifier":{"issn":["0022-1430"],"eissn":["1727-5652"]},"type":"journal_article","abstract":[{"lang":"eng","text":"We explore the robustness and transferability of parameterizations of cloud radiative forcing used in glacier melt models at two sites in the Swiss Alps. We also look at the rationale behind some of the most commonly used approaches, and explore the relationship between cloud transmittance and several standard meteorological variables. The 2 m air-temperature diurnal range is the best predictor of variations in cloud transmittance. However, linear and exponential parameterizations can only explain 30–50% of the observed variance in computed cloud transmittance factors. We examine the impact of modelled cloud transmittance factors on both solar radiation and ablation rates computed with an enhanced temperature-index model. The melt model performance decreases when modelled radiation is used, the reduction being due to an underestimation of incoming solar radiation on clear-sky days. The model works well under overcast conditions. We also seek alternatives to the use of in situ ground data. However, outputs from an atmospheric model (2.2 km horizontal resolution) do not seem to provide an alternative to the parameterizations of cloud radiative forcing based on observations of air temperature at glacier automatic weather stations. Conversely, the correct definition of overcast conditions is important."}],"title":"Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling","date_updated":"2023-02-20T09:47:00Z","issue":"202","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3189/002214311796406013"}],"date_published":"2011-03-01T00:00:00Z"}]