[{"_id":"356","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the European Regional Development Funds and the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486).","year":"2014","intvolume":" 136","publisher":"American Chemical Society","status":"public","title":"Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation","publication_status":"published","author":[{"last_name":"Yu","first_name":"Xuelian","full_name":"Yu, Xuelian"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"An, Xiaoqiang","first_name":"Xiaoqiang","last_name":"An"},{"last_name":"Luo","first_name":"Zhishan","full_name":"Luo, Zhishan"},{"full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"oa_version":"None","volume":136,"date_updated":"2021-01-12T07:44:18Z","date_created":"2018-12-11T11:46:00Z","type":"journal_article","publist_id":"7472","issue":"26","abstract":[{"text":"Cu2ZnSnS4, based on abundant and environmental friendly elements and with a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion through both photovoltaics and photocatalysis. We detail here the synthesis of quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions. We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured nanoparticles. Such heterostructured nanoparticles are shown to have excellent photocatalytic properties toward degradation of Rhodamine B and hydrogen generation by water splitting.","lang":"eng"}],"extern":"1","citation":{"chicago":"Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society. American Chemical Society, 2014. https://doi.org/10.1021/ja502076b.","short":"X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American Chemical Society 136 (2014) 9236–9239.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American Chemical Society, vol. 136, no. 26, American Chemical Society, 2014, pp. 9236–39, doi:10.1021/ja502076b.","apa":"Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/ja502076b","ieee":"X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation,” Journal of the American Chemical Society, vol. 136, no. 26. American Chemical Society, pp. 9236–9239, 2014.","ista":"Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 136(26), 9236–9239.","ama":"Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239. doi:10.1021/ja502076b"},"publication":"Journal of the American Chemical Society","page":"9236 - 9239","article_type":"original","quality_controlled":"1","date_published":"2014-07-02T00:00:00Z","doi":"10.1021/ja502076b","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"02","month":"07"},{"page":"885 - 895","article_type":"original","quality_controlled":"1","citation":{"mla":"Herranz, Tirma, et al. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem, vol. 1, no. 5, Wiley-Blackwell, 2014, pp. 885–95, doi:10.1002/celc.201300254.","short":"T. Herranz, M. Ibáñez, J. Gómez De La Fuente, F. Pérez Alonso, M. Peña, A. Cabot, S. Rojas, ChemElectroChem 1 (2014) 885–895.","chicago":"Herranz, Tirma, Maria Ibáñez, José Gómez De La Fuente, Francisco Pérez Alonso, Miguel Peña, Andreu Cabot, and Sergio Rojas. “In Situ Study of Ethanol Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem. Wiley-Blackwell, 2014. https://doi.org/10.1002/celc.201300254.","ama":"Herranz T, Ibáñez M, Gómez De La Fuente J, et al. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. 2014;1(5):885-895. doi:10.1002/celc.201300254","ista":"Herranz T, Ibáñez M, Gómez De La Fuente J, Pérez Alonso F, Peña M, Cabot A, Rojas S. 2014. In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. 1(5), 885–895.","ieee":"T. Herranz et al., “In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles,” ChemElectroChem, vol. 1, no. 5. Wiley-Blackwell, pp. 885–895, 2014.","apa":"Herranz, T., Ibáñez, M., Gómez De La Fuente, J., Pérez Alonso, F., Peña, M., Cabot, A., & Rojas, S. (2014). In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. Wiley-Blackwell. https://doi.org/10.1002/celc.201300254"},"publication":"ChemElectroChem","language":[{"iso":"eng"}],"date_published":"2014-03-03T00:00:00Z","doi":"10.1002/celc.201300254","article_processing_charge":"No","month":"03","day":"03","intvolume":" 1","publisher":"Wiley-Blackwell","title":"In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles","status":"public","publication_status":"published","_id":"358","acknowledgement":"The Spanish Ministry of Science and Innovation (Project ENE2010–15381) and the CSIC (Project 201080E116) are acknowledged for financial support.","year":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":1,"date_created":"2018-12-11T11:46:00Z","date_updated":"2021-01-12T07:44:26Z","author":[{"full_name":"Herranz, Tirma","last_name":"Herranz","first_name":"Tirma"},{"last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"last_name":"Gómez De La Fuente","first_name":"José","full_name":"Gómez De La Fuente, José"},{"first_name":"Francisco","last_name":"Pérez Alonso","full_name":"Pérez Alonso, Francisco"},{"full_name":"Peña, Miguel","first_name":"Miguel","last_name":"Peña"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"},{"full_name":"Rojas, Sergio","last_name":"Rojas","first_name":"Sergio"}],"type":"journal_article","extern":"1","publist_id":"7474","issue":"5","abstract":[{"text":"Monodispersed Pt3Sn nanoparticles were prepared through a mild thermal synthesis in the presence of surfactants. The performance of Pt3Sn for the electrooxidation of ethanol and adsorbed carbon monoxide (COad) in acid medium was studied by a combination of electrochemical and insitu spectroscopic methods, namely, infrared reflection absorption spectroscopy and differential electrochemical mass spectrometry (DEMS), and the results were compared to those obtained with the use of Pt black. The formation of the Pt3Sn solid solution promoted the oxidation of COad at less-positive potentials than those required for Pt black. Also, the electrooxidation of ethanol, especially at lower potentials, was more favorable with Pt3Sn, as deduced from the higher faradaic currents recorded during the ethanol oxidation reaction (EOR). However, the distribution of products as deduced by DEMS analysis suggested that the formation of C1 products, CO2 inclusive, is less significant on Pt3Sn than on Pt. In fact, the higher faradaic current recorded with the former catalyst can be attributed to the greater amounts of acetaldehyde and acetic acid formed. After the EOR, the surface of both Pt and Pt3Sn remained covered by ethanol adsorbates. Whereas C2 fragments were the main adsorbates at the surface of Pt3Sn after the EOR, both C1 and C2 species remained adsorbed at Pt black.","lang":"eng"}]},{"publication":"Advances in Computational Mathematics","oa":1,"citation":{"mla":"Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology, and (Co)Homological Operations via Chain Contraction.” Advances in Computational Mathematics, vol. 41, no. 1, Kluwer, 2014, pp. 253–75, doi:10.1007/s10444-014-9356-1.","short":"P. Pilarczyk, P. Real, Advances in Computational Mathematics 41 (2014) 253–275.","chicago":"Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology, and (Co)Homological Operations via Chain Contraction.” Advances in Computational Mathematics. Kluwer, 2014. https://doi.org/10.1007/s10444-014-9356-1.","ama":"Pilarczyk P, Real P. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. 2014;41(1):253-275. doi:10.1007/s10444-014-9356-1","ista":"Pilarczyk P, Real P. 2014. Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. 41(1), 253–275.","ieee":"P. Pilarczyk and P. Real, “Computation of cubical homology, cohomology, and (co)homological operations via chain contraction,” Advances in Computational Mathematics, vol. 41, no. 1. Kluwer, pp. 253–275, 2014.","apa":"Pilarczyk, P., & Real, P. (2014). Computation of cubical homology, cohomology, and (co)homological operations via chain contraction. Advances in Computational Mathematics. Kluwer. https://doi.org/10.1007/s10444-014-9356-1"},"main_file_link":[{"url":"https://idus.us.es/xmlui/handle/11441/38719","open_access":"1"}],"quality_controlled":0,"page":"253 - 275","doi":"10.1007/s10444-014-9356-1","date_published":"2014-01-01T00:00:00Z","day":"01","month":"01","_id":"451","acknowledgement":"This research was partially supported from Fundo Europeu de Desenvolvimento Regional (FEDER) through COMPETE – Programa Operacional Factores de Compe titividade (POFC) and from the Portuguese national funds through Fundacaoparaa Ciencia e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645(ref. FCT PTDC/MAT/098871/2008), as well as from the funds distributed through the European Science Foundation (ESF) Research Networking Programme on “Applied and Computational Algebraic Topology” (ACAT). P.Real was additionally supported by the Spanish Ministry of Science and Innovation, project no. MTM2009-12716. ","year":"2014","publication_status":"published","status":"public","title":"Computation of cubical homology, cohomology, and (co)homological operations via chain contraction","intvolume":" 41","publisher":"Kluwer","author":[{"full_name":"Pawel Pilarczyk","last_name":"Pilarczyk","first_name":"Pawel","id":"3768D56A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Real, Pedro","last_name":"Real","first_name":"Pedro"}],"date_created":"2018-12-11T11:46:33Z","date_updated":"2021-01-12T07:59:20Z","volume":41,"type":"journal_article","abstract":[{"lang":"eng","text":"We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, using the technique based on a chain contraction from the original chain complex to a reduced one that represents its homology. This work is based on previous results for simplicial complexes, and uses Serre’s diagonalization for cubical cells. An implementation in C++ of the introduced algorithms is available at http://www.pawelpilarczyk.com/chaincon/ together with some examples. The paper is self-contained as much as possible, and is written at a very elementary level, so that basic knowledge of algebraic topology should be sufficient to follow it."}],"issue":"1","publist_id":"7371","extern":1},{"_id":"468","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 9","ddc":["576"],"title":"Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches","status":"public","pubrep_id":"954","file":[{"file_id":"5103","relation":"main_file","date_created":"2018-12-12T10:14:48Z","date_updated":"2020-07-14T12:46:34Z","checksum":"b24e7518ccd41effed0d7d9e2498f67f","file_name":"IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":489387}],"oa_version":"Published Version","type":"journal_article","issue":"9","abstract":[{"text":"Invasive alien parasites and pathogens are a growing threat to biodiversity worldwide, which can contribute to the extinction of endemic species. On the Galápagos Islands, the invasive parasitic fly Philornis downsi poses a major threat to the endemic avifauna. Here, we investigated the influence of this parasite on the breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea) and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island in 2010 and 2012. While the population of the small tree finch appeared to be stable, the warbler finch has experienced a dramatic decline in population size on Santa Cruz Island since 1997. We aimed to identify whether warbler finches are particularly vulnerable during different stages of the breeding cycle. Contrary to our prediction, breeding success was lower in the small tree finch than in the warbler finch. In both species P. downsi had a strong negative impact on breeding success and our data suggest that heavy rain events also lowered the fledging success. On the one hand parents might be less efficient in compensating their chicks' energy loss due to parasitism as they might be less efficient in foraging on days of heavy rain. On the other hand, intense rainfalls might lead to increased humidity and more rapid cooling of the nests. In the case of the warbler finch we found that the control of invasive plant species with herbicides had a significant additive negative impact on the breeding success. It is very likely that the availability of insects (i.e. food abundance) is lower in such controlled areas, as herbicide usage led to the removal of the entire understory. Predation seems to be a minor factor in brood loss.","lang":"eng"}],"citation":{"chicago":"Cimadom, Arno, Angel Ulloa, Patrick Meidl, Markus Zöttl, Elisabet Zöttl, Birgit Fessl, Erwin Nemeth, Michael Dvorak, Francesca Cunninghame, and Sabine Tebbich. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0107518.","short":"A. Cimadom, A. Ulloa, P. Meidl, M. Zöttl, E. Zöttl, B. Fessl, E. Nemeth, M. Dvorak, F. Cunninghame, S. Tebbich, PLoS One 9 (2014).","mla":"Cimadom, Arno, et al. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” PLoS One, vol. 9, no. 9, 0107518, Public Library of Science, 2014, doi:10.1371/journal.pone.0107518.","apa":"Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B., … Tebbich, S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0107518","ieee":"A. Cimadom et al., “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” PLoS One, vol. 9, no. 9. Public Library of Science, 2014.","ista":"Cimadom A, Ulloa A, Meidl P, Zöttl M, Zöttl E, Fessl B, Nemeth E, Dvorak M, Cunninghame F, Tebbich S. 2014. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 9(9), 0107518.","ama":"Cimadom A, Ulloa A, Meidl P, et al. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 2014;9(9). doi:10.1371/journal.pone.0107518"},"publication":"PLoS One","date_published":"2014-09-23T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"23","year":"2014","acknowledgement":"The study was funded by the University of Vienna (Focus of Excellence grant), the Galápagos Conservation Trust, and the Ethologische Gesellschaft e.V.","department":[{"_id":"CampIT"}],"publisher":"Public Library of Science","publication_status":"published","author":[{"first_name":"Arno","last_name":"Cimadom","full_name":"Cimadom, Arno"},{"first_name":"Angel","last_name":"Ulloa","full_name":"Ulloa, Angel"},{"full_name":"Meidl, Patrick","first_name":"Patrick","last_name":"Meidl","id":"4709BCE6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Markus","last_name":"Zöttl","full_name":"Zöttl, Markus"},{"last_name":"Zöttl","first_name":"Elisabet","full_name":"Zöttl, Elisabet"},{"last_name":"Fessl","first_name":"Birgit","full_name":"Fessl, Birgit"},{"last_name":"Nemeth","first_name":"Erwin","full_name":"Nemeth, Erwin"},{"first_name":"Michael","last_name":"Dvorak","full_name":"Dvorak, Michael"},{"last_name":"Cunninghame","first_name":"Francesca","full_name":"Cunninghame, Francesca"},{"full_name":"Tebbich, Sabine","first_name":"Sabine","last_name":"Tebbich"}],"volume":9,"date_updated":"2021-01-12T08:00:48Z","date_created":"2018-12-11T11:46:38Z","article_number":"0107518","publist_id":"7352","file_date_updated":"2020-07-14T12:46:34Z","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1371/journal.pone.0107518","language":[{"iso":"eng"}],"month":"09"},{"publist_id":"7345","ec_funded":1,"file_date_updated":"2020-07-14T12:46:35Z","author":[{"first_name":"Benjamin","last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","full_name":"Aminof, Benjamin"},{"full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","last_name":"Rubin"}],"volume":146,"date_updated":"2021-01-12T08:00:53Z","date_created":"2018-12-11T11:46:41Z","year":"2014","publisher":"Open Publishing Association","department":[{"_id":"KrCh"}],"publication_status":"published","month":"04","doi":"10.4204/EPTCS.146.11","conference":{"name":"SR: Strategic Reasoning","end_date":"2014-04-06","location":"Grenoble, France","start_date":"2014-04-05"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"quality_controlled":"1","abstract":[{"text":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. ","lang":"eng"}],"type":"conference","alternative_title":["EPTCS"],"pubrep_id":"952","file":[{"relation":"main_file","file_id":"5260","date_created":"2018-12-12T10:17:08Z","date_updated":"2020-07-14T12:46:35Z","checksum":"4d7b4ab82980cca2b96ac7703992a8c8","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","access_level":"open_access","content_type":"application/pdf","file_size":100115,"creator":"system"}],"oa_version":"Published Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"475","intvolume":" 146","status":"public","ddc":["004"],"title":"First cycle games","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2014-04-01T00:00:00Z","citation":{"ama":"Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90. doi:10.4204/EPTCS.146.11","ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.","apa":"Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11","ieee":"B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.","mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:10.4204/EPTCS.146.11.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing Association, 2014. https://doi.org/10.4204/EPTCS.146.11."},"publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","page":"83 - 90"},{"department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","acknowledgement":"T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.","year":"2014","volume":8889,"date_updated":"2023-02-23T12:20:55Z","date_created":"2022-03-21T07:09:03Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"481"}]},"author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"last_name":"Huber","first_name":"Stefan","orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87","full_name":"Huber, Stefan"},{"last_name":"Palfrader","first_name":"Peter","full_name":"Palfrader, Peter"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-13075-0_10","conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","start_date":"2014-12-15","location":"Jeonju, Korea","end_date":"2014-12-17"},"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783319130743"],"issn":["0302-9743"],"eisbn":["9783319130750"]},"month":"11","intvolume":" 8889","title":"Planar matchings for weighted straight skeletons","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10892","oa_version":"None","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"page":"117-127","citation":{"chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.","ista":"Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. https://doi.org/10.1007/978-3-319-13075-0_10","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10"},"publication":"25th International Symposium, ISAAC 2014","date_published":"2014-11-08T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"08"},{"page":"3139 - 3145","citation":{"ama":"Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 2014;4(15):3139-3145. doi:10.1002/ece3.1150","ista":"Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 4(15), 3139–3145.","ieee":"R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.","apa":"Prizak, R., Ezard, T., & Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1150","mla":"Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal Effects.” Ecology and Evolution, vol. 4, no. 15, Wiley-Blackwell, 2014, pp. 3139–45, doi:10.1002/ece3.1150.","short":"R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.","chicago":"Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences of Maternal and Grandmaternal Effects.” Ecology and Evolution. Wiley-Blackwell, 2014. https://doi.org/10.1002/ece3.1150."},"publication":"Ecology and Evolution","date_published":"2014-07-19T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"19","intvolume":" 4","title":"Fitness consequences of maternal and grandmaternal effects","ddc":["530","571"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"537","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:46:38Z","date_created":"2018-12-12T10:11:31Z","checksum":"e32abf75a248e7a11811fd7f60858769","relation":"main_file","file_id":"4886","file_size":621582,"content_type":"application/pdf","creator":"system","file_name":"IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf","access_level":"open_access"}],"pubrep_id":"934","type":"journal_article","issue":"15","abstract":[{"text":"Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring.","lang":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1002/ece3.1150","month":"07","publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"publication_status":"published","year":"2014","volume":4,"date_updated":"2021-01-12T08:01:30Z","date_created":"2018-12-11T11:47:02Z","author":[{"full_name":"Prizak, Roshan","id":"4456104E-F248-11E8-B48F-1D18A9856A87","last_name":"Prizak","first_name":"Roshan"},{"first_name":"Thomas","last_name":"Ezard","full_name":"Ezard, Thomas"},{"first_name":"Rebecca","last_name":"Hoyle","full_name":"Hoyle, Rebecca"}],"publist_id":"7280","file_date_updated":"2020-07-14T12:46:38Z"},{"ec_funded":1,"publist_id":"5192","year":"2014","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"record":[{"relation":"later_version","status":"public","id":"2211"},{"id":"5381","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"}],"volume":8634,"date_updated":"2023-02-23T12:23:43Z","date_created":"2018-12-11T11:54:38Z","month":"01","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-662-44522-8_1","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2014-08-25","location":"Budapest, Hungary","end_date":"2014-08-29"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"issue":"PART 1","abstract":[{"lang":"eng","text":"We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games."}],"_id":"1903","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 8634","status":"public","title":"Partial-observation stochastic reachability and parity games","pubrep_id":"141","oa_version":"None","scopus_import":1,"day":"01","citation":{"ama":"Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:10.1007/978-3-662-44522-8_1","apa":"Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1","ieee":"K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.","ista":"Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.","short":"K. Chatterjee, in:, Springer, 2014, pp. 1–4.","mla":"Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1.","chicago":"Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1."},"page":"1 - 4","date_published":"2014-01-01T00:00:00Z"},{"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2211","status":"public","title":"Partial-observation stochastic games: How to win when belief fails","intvolume":" 15","abstract":[{"text":"In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Our main results for pure strategies are as follows: (1) For one-sided games with player 2 having perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 having perfect observation we show that nonelementarymemory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least nonelementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibit serious flaws in previous results of the literature: we show a nonelementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"issue":"2","type":"journal_article","date_published":"2014-04-01T00:00:00Z","publication":"ACM Transactions on Computational Logic (TOCL)","citation":{"ista":"Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.","apa":"Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2579821","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 2014;15(2). doi:10.1145/2579821","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.","short":"K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014)."},"day":"01","scopus_import":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1903"},{"id":"2955","status":"public","relation":"earlier_version"},{"id":"5381","status":"public","relation":"earlier_version"}]},"date_updated":"2023-02-23T12:23:43Z","date_created":"2018-12-11T11:56:21Z","volume":15,"year":"2014","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"ACM","publist_id":"4759","article_number":"16","doi":"10.1145/2579821","language":[{"iso":"eng"}],"external_id":{"arxiv":["1107.2141"]},"main_file_link":[{"url":"http://arxiv.org/abs/1107.2141","open_access":"1"}],"oa":1,"quality_controlled":"1","month":"04"},{"issue":"4","abstract":[{"text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with "controlled accumulation," allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable.","lang":"eng"}],"type":"journal_article","file":[{"content_type":"application/pdf","file_size":346184,"creator":"system","access_level":"open_access","file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","checksum":"354c41d37500b56320afce94cf9a99c2","date_created":"2018-12-12T10:10:59Z","date_updated":"2020-07-14T12:45:26Z","relation":"main_file","file_id":"4851"}],"oa_version":"Submitted Version","pubrep_id":"192","intvolume":" 15","status":"public","ddc":["000","004"],"title":"Temporal specifications with accumulative values","_id":"2038","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"No","day":"16","scopus_import":1,"date_published":"2014-09-16T00:00:00Z","article_type":"original","citation":{"ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 2014;15(4). doi:10.1145/2629686","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686."},"publication":"ACM Transactions on Computational Logic (TOCL)","publist_id":"5013","ec_funded":1,"file_date_updated":"2020-07-14T12:45:26Z","article_number":"27","volume":15,"date_created":"2018-12-11T11:55:21Z","date_updated":"2023-02-23T12:23:54Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3356"},{"status":"public","relation":"earlier_version","id":"5385"}]},"author":[{"first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"publisher":"ACM","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","year":"2014","month":"09","language":[{"iso":"eng"}],"doi":"10.1145/2629686","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1}]