[{"department":[{"_id":"NiBa"}],"status":"public","title":"Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. ","external_id":{"isi":["000314220900008"]},"citation":{"apa":"Aeschbacher, S., Futschik, A., &#38; Beaumont, M. (2013). Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.12165\">https://doi.org/10.1111/mec.12165</a>","chicago":"Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates. .” <i>Molecular Ecology</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1111/mec.12165\">https://doi.org/10.1111/mec.12165</a>.","mla":"Aeschbacher, Simon, et al. “Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates. .” <i>Molecular Ecology</i>, vol. 22, no. 4, Wiley-Blackwell, 2013, pp. 987–1002, doi:<a href=\"https://doi.org/10.1111/mec.12165\">10.1111/mec.12165</a>.","short":"S. Aeschbacher, A. Futschik, M. Beaumont, Molecular Ecology 22 (2013) 987–1002.","ieee":"S. Aeschbacher, A. Futschik, and M. Beaumont, “Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. ,” <i>Molecular Ecology</i>, vol. 22, no. 4. Wiley-Blackwell, pp. 987–1002, 2013.","ama":"Aeschbacher S, Futschik A, Beaumont M. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . <i>Molecular Ecology</i>. 2013;22(4):987-1002. doi:<a href=\"https://doi.org/10.1111/mec.12165\">10.1111/mec.12165</a>","ista":"Aeschbacher S, Futschik A, Beaumont M. 2013. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . Molecular Ecology. 22(4), 987–1002."},"doi":"10.1111/mec.12165","publication":"Molecular Ecology","date_updated":"2025-09-29T13:25:36Z","publist_id":"3788","volume":22,"intvolume":"        22","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"02","year":"2013","publication_status":"published","corr_author":"1","quality_controlled":"1","day":"01","type":"journal_article","abstract":[{"text":"We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction.","lang":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"related_material":{"record":[{"status":"public","relation":"research_data","id":"9758"}]},"oa_version":"None","scopus_import":"1","_id":"2944","language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"Wiley-Blackwell","author":[{"last_name":"Aeschbacher","id":"2D35326E-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Aeschbacher, Simon"},{"last_name":"Futschik","full_name":"Futschik, Andreas","first_name":"Andreas"},{"last_name":"Beaumont","full_name":"Beaumont, Mark","first_name":"Mark"}],"page":"987 - 1002","date_published":"2013-02-01T00:00:00Z","isi":1,"acknowledgement":"This study has made use of the computational resources provided by IST Austria and the Edinburgh Compute and Data Facility (ECDF; http://www.ecdf.ed.ac.uk). The ECDF is partially supported by the eDIKT initiative (http://www.edikt.org.uk). S.A. acknowledges financial support by IST Austria, the Janggen-Pöhn Foundation, St. Gallen, the Roche Research Foundation, Basel, the University of Edinburgh in the form of a Torrance Studentship, and the Austrian Science Fund (FWF P21305-N13).","issue":"4","date_created":"2018-12-11T12:00:28Z"},{"oa_version":"Submitted Version","month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publication_status":"published","type":"conference","abstract":[{"text":"Many visual datasets are traditionally used to analyze the performance of different learning techniques. The evaluation is usually done within each dataset, therefore it is questionable if such results are a reliable indicator of true generalization ability. We propose here an algorithm to exploit the existing data resources when learning on a new multiclass problem. Our main idea is to identify an image representation that decomposes orthogonally into two subspaces: a part specific to each dataset, and a part generic to, and therefore shared between, all the considered source sets. This allows us to use the generic representation as un-biased reference knowledge for a novel classification task. By casting the method in the multi-view setting, we also make it possible to use different features for different databases. We call the algorithm MUST, Multitask Unaligned Shared knowledge Transfer. Through extensive experiments on five public datasets, we show that MUST consistently improves the cross-datasets generalization performance.","lang":"eng"}],"quality_controlled":"1","day":"04","date_updated":"2020-08-11T10:09:54Z","publist_id":"3784","volume":7724,"oa":1,"file":[{"relation":"main_file","checksum":"a0a7234a89e2192af655b0d0ae3bf445","file_id":"5874","file_name":"2012_ACCV_Tommasi.pdf","date_updated":"2020-07-14T12:45:55Z","content_type":"application/pdf","date_created":"2019-01-22T14:03:11Z","access_level":"open_access","file_size":1513620,"creator":"dernst"}],"intvolume":"      7724","status":"public","title":"Beyond dataset bias: Multi-task unaligned shared knowledge transfer","department":[{"_id":"ChLa"}],"doi":"10.1007/978-3-642-37331-2_1","citation":{"apa":"Tommasi, T., Quadrianto, N., Caputo, B., &#38; Lampert, C. (2013). Beyond dataset bias: Multi-task unaligned shared knowledge transfer. Presented at the ACCV: Asian Conference on Computer Vision, Daejeon, Korea: Springer. <a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">https://doi.org/10.1007/978-3-642-37331-2_1</a>","mla":"Tommasi, Tatiana, et al. <i>Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer</i>. Vol. 7724, Springer, 2013, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">10.1007/978-3-642-37331-2_1</a>.","chicago":"Tommasi, Tatiana, Novi Quadrianto, Barbara Caputo, and Christoph Lampert. “Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">https://doi.org/10.1007/978-3-642-37331-2_1</a>.","ama":"Tommasi T, Quadrianto N, Caputo B, Lampert C. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 2013;7724:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">10.1007/978-3-642-37331-2_1</a>","ista":"Tommasi T, Quadrianto N, Caputo B, Lampert C. 2013. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 7724, 1–15.","short":"T. Tommasi, N. Quadrianto, B. Caputo, C. Lampert, 7724 (2013) 1–15.","ieee":"T. Tommasi, N. Quadrianto, B. Caputo, and C. Lampert, “Beyond dataset bias: Multi-task unaligned shared knowledge transfer,” vol. 7724. Springer, pp. 1–15, 2013."},"file_date_updated":"2020-07-14T12:45:55Z","date_created":"2018-12-11T12:00:30Z","ddc":["000"],"acknowledgement":"This work was supported by the PASCAL 2 Network of Excellence (TT) and by the Newton International Fellowship (NQ)","language":[{"iso":"eng"}],"publisher":"Springer","has_accepted_license":"1","series_title":"Lecture Notes in Computer Science","conference":{"location":"Daejeon, Korea","start_date":"2012-11-05","end_date":"2012-11-09","name":"ACCV: Asian Conference on Computer Vision"},"author":[{"full_name":"Tommasi, Tatiana","first_name":"Tatiana","last_name":"Tommasi"},{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"first_name":"Barbara","full_name":"Caputo, Barbara","last_name":"Caputo"},{"first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"page":"1 - 15","date_published":"2013-04-04T00:00:00Z","alternative_title":["LNCS"],"scopus_import":1,"_id":"2948"},{"editor":[{"last_name":"Christianson","full_name":"Christianson, Bruce","first_name":"Bruce"},{"last_name":"Malcolm","first_name":"James","full_name":"Malcolm, James A."},{"last_name":"Matyas","full_name":"Matyas, Vashek","first_name":"Vashek"},{"full_name":"Roe, Michael","first_name":"Michael","last_name":"Roe"}],"_id":"2973","citation":{"chicago":"Bangerter, Endre, Stefania Barzan, Stephan Krenn, Ahmad Sadeghi, Thomas Schneider, and Joe Tsay. “Bringing Zero-Knowledge Proofs of Knowledge to Practice.” edited by Bruce Christianson, James Malcolm, Vashek Matyas, and Michael Roe, 7028:51–62. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">https://doi.org/10.1007/978-3-642-36213-2_9</a>.","mla":"Bangerter, Endre, et al. <i>Bringing Zero-Knowledge Proofs of Knowledge to Practice</i>. Edited by Bruce Christianson et al., vol. 7028, Springer, 2013, pp. 51–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">10.1007/978-3-642-36213-2_9</a>.","apa":"Bangerter, E., Barzan, S., Krenn, S., Sadeghi, A., Schneider, T., &#38; Tsay, J. (2013). Bringing Zero-Knowledge Proofs of Knowledge to Practice. In B. Christianson, J. Malcolm, V. Matyas, &#38; M. Roe (Eds.) (Vol. 7028, pp. 51–62). Presented at the SPW: Security Protocols Workshop, Springer. <a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">https://doi.org/10.1007/978-3-642-36213-2_9</a>","ista":"Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. 2013. Bringing Zero-Knowledge Proofs of Knowledge to Practice. SPW: Security Protocols Workshop, LNCS, vol. 7028, 51–62.","ama":"Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. Bringing Zero-Knowledge Proofs of Knowledge to Practice. In: Christianson B, Malcolm J, Matyas V, Roe M, eds. Vol 7028. Springer; 2013:51-62. doi:<a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">10.1007/978-3-642-36213-2_9</a>","ieee":"E. Bangerter, S. Barzan, S. Krenn, A. Sadeghi, T. Schneider, and J. Tsay, “Bringing Zero-Knowledge Proofs of Knowledge to Practice,” presented at the SPW: Security Protocols Workshop, 2013, vol. 7028, pp. 51–62.","short":"E. Bangerter, S. Barzan, S. Krenn, A. Sadeghi, T. Schneider, J. Tsay, in:, B. Christianson, J. Malcolm, V. Matyas, M. Roe (Eds.), Springer, 2013, pp. 51–62."},"doi":"10.1007/978-3-642-36213-2_9","title":"Bringing Zero-Knowledge Proofs of Knowledge to Practice","status":"public","alternative_title":["LNCS"],"date_published":"2013-01-08T00:00:00Z","conference":{"name":"SPW: Security Protocols Workshop"},"author":[{"last_name":"Bangerter","first_name":"Endre","full_name":"Bangerter, Endre"},{"last_name":"Barzan","first_name":"Stefania","full_name":"Barzan, Stefania"},{"id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","last_name":"Krenn","orcid":"0000-0003-2835-9093","full_name":"Stephan Krenn","first_name":"Stephan"},{"full_name":"Sadeghi, Ahmad-Reza","first_name":"Ahmad","last_name":"Sadeghi"},{"full_name":"Schneider, Thomas","first_name":"Thomas","last_name":"Schneider"},{"full_name":"Tsay, Joe-Kai","first_name":"Joe","last_name":"Tsay"}],"page":"51 - 62","intvolume":"      7028","volume":7028,"publist_id":"3732","oa":1,"date_updated":"2021-01-12T07:40:10Z","publisher":"Springer","day":"08","quality_controlled":0,"acknowledgement":"This work is being performed within the FP7 EU project CACE (Computer Aided Cryptography Engineering).","abstract":[{"lang":"eng","text":"Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that critically rely on ZK-PoKs are being deployed in the real world. The most prominent example is Direct Anonymous Attestation (DAA), which was adopted by the Trusted Computing Group (TCG) and implemented as one of the functionalities of the cryptographic Trusted Platform Module (TPM) chip.\n\nImplementing systems using ZK-PoK turns out to be challenging, since ZK-PoK are, loosely speaking, significantly more complex than standard crypto primitives, such as encryption and signature schemes. As a result, implementation cycles of ZK-PoK are time-consuming and error-prone, in particular for developers with minor or no cryptographic skills. \n\nIn this paper we report on our ongoing and future research vision with the goal to bring ZK-PoK to practice by making them accessible to crypto and security engineers. To this end we are developing compilers and related tools that support and partially automate the design, implementation, verification and secure implementation of ZK-PoK protocols."}],"type":"conference","main_file_link":[{"url":"http://eprint.iacr.org/2009/211.pdf","open_access":"1"}],"publication_status":"published","year":"2013","month":"01","date_created":"2018-12-11T12:00:38Z","extern":1},{"language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"Springer","page":"142 - 174","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Faella","full_name":"Faella, Marco","first_name":"Marco"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"},{"last_name":"Raman","full_name":"Raman, Vishwanath","first_name":"Vishwanath"}],"date_published":"2013-04-01T00:00:00Z","scopus_import":"1","_id":"3116","issue":"2","date_created":"2018-12-11T12:01:29Z","isi":1,"acknowledgement":"This research was supported in part by the National Science Foundation CAREER award CCR-0132780, by the ONR grant N00014-02-1-0671, by the National Science Foundation grants CCR-0427202 and CCR-0234690, and by the ARP award TO.030.MM.D.","date_updated":"2025-09-29T13:24:54Z","volume":42,"publist_id":"3583","intvolume":"        42","department":[{"_id":"KrCh"}],"status":"public","title":"Code aware resource management","external_id":{"isi":["000316677500002"]},"doi":"10.1007/s10703-012-0170-4","citation":{"ieee":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” <i>Formal Methods in System Design</i>, vol. 42, no. 2. Springer, pp. 142–174, 2013.","short":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.","ista":"Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.","ama":"Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. Code aware resource management. <i>Formal Methods in System Design</i>. 2013;42(2):142-174. doi:<a href=\"https://doi.org/10.1007/s10703-012-0170-4\">10.1007/s10703-012-0170-4</a>","mla":"Chatterjee, Krishnendu, et al. “Code Aware Resource Management.” <i>Formal Methods in System Design</i>, vol. 42, no. 2, Springer, 2013, pp. 142–74, doi:<a href=\"https://doi.org/10.1007/s10703-012-0170-4\">10.1007/s10703-012-0170-4</a>.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar, and Vishwanath Raman. “Code Aware Resource Management.” <i>Formal Methods in System Design</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10703-012-0170-4\">https://doi.org/10.1007/s10703-012-0170-4</a>.","apa":"Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., &#38; Raman, V. (2013). Code aware resource management. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-012-0170-4\">https://doi.org/10.1007/s10703-012-0170-4</a>"},"publication":"Formal Methods in System Design","oa_version":"None","year":"2013","month":"04","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","quality_controlled":"1","day":"01","type":"journal_article","abstract":[{"lang":"eng","text":"Multithreaded programs coordinate their interaction through synchronization primitives like mutexes and semaphores, which are managed by an OS-provided resource manager. We propose algorithms for the automatic construction of code-aware resource managers for multithreaded embedded applications. Such managers use knowledge about the structure and resource usage (mutex and semaphore usage) of the threads to guarantee deadlock freedom and progress while managing resources in an efficient way. Our algorithms compute managers as winning strategies in certain infinite games, and produce a compact code description of these strategies. We have implemented the algorithms in the tool Cynthesis. Given a multithreaded program in C, the tool produces C code implementing a code-aware resource manager. We show in experiments that Cynthesis produces compact resource managers within a few minutes on a set of embedded benchmarks with up to 6 threads. © 2012 Springer Science+Business Media, LLC."}]},{"abstract":[{"text":"Cells in a developing embryo have no direct way of &quot;measuring&quot; their physical position. Through a variety of processes, however, the expression levels of multiple genes come to be correlated with position, and these expression levels thus form a code for &quot;positional information.&quot; We show how to measure this information, in bits, using the gap genes in the Drosophila embryo as an example. Individual genes carry nearly two bits of information, twice as much as expected if the expression patterns consisted only of on/off domains separated by sharp boundaries. Taken together, four gap genes carry enough information to define a cell's location with an error bar of ~1% along the anterior-posterior axis of the embryo. This precision is nearly enough for each cell to have a unique identity, which is the maximum information the system can use, and is nearly constant along the length of the embryo. We argue that this constancy is a signature of optimality in the transmission of information from primary morphogen inputs to the output of the gap gene network.","lang":"eng"}],"type":"journal_article","day":"08","quality_controlled":"1","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"10","year":"2013","pmid":1,"oa_version":"Published Version","publication":"PNAS","doi":"10.1073/pnas.1315642110","citation":{"apa":"Dubuis, J., Tkačik, G., Wieschaus, E., Gregor, T., &#38; Bialek, W. (2013). Positional information, in bits. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1315642110\">https://doi.org/10.1073/pnas.1315642110</a>","mla":"Dubuis, Julien, et al. “Positional Information, in Bits.” <i>PNAS</i>, vol. 110, no. 41, National Academy of Sciences, 2013, pp. 16301–08, doi:<a href=\"https://doi.org/10.1073/pnas.1315642110\">10.1073/pnas.1315642110</a>.","chicago":"Dubuis, Julien, Gašper Tkačik, Eric Wieschaus, Thomas Gregor, and William Bialek. “Positional Information, in Bits.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1315642110\">https://doi.org/10.1073/pnas.1315642110</a>.","short":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, W. Bialek, PNAS 110 (2013) 16301–16308.","ieee":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, and W. Bialek, “Positional information, in bits,” <i>PNAS</i>, vol. 110, no. 41. National Academy of Sciences, pp. 16301–16308, 2013.","ama":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. Positional information, in bits. <i>PNAS</i>. 2013;110(41):16301-16308. doi:<a href=\"https://doi.org/10.1073/pnas.1315642110\">10.1073/pnas.1315642110</a>","ista":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. 2013. Positional information, in bits. PNAS. 110(41), 16301–16308."},"external_id":{"isi":["000325395600021"],"pmid":["24089448"]},"title":"Positional information, in bits","status":"public","department":[{"_id":"GaTk"}],"file":[{"checksum":"ecd859fe52a562193027d428b5524a8d","file_id":"5873","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2019-01-22T13:53:23Z","file_size":1670548,"creator":"dernst","file_name":"2013_PNAS_Dubuis.pdf","date_updated":"2020-07-14T12:46:06Z"}],"intvolume":"       110","oa":1,"publist_id":"3387","volume":110,"date_updated":"2025-09-29T13:24:21Z","isi":1,"file_date_updated":"2020-07-14T12:46:06Z","ddc":["570"],"date_created":"2018-12-11T12:02:19Z","issue":"41","_id":"3261","scopus_import":"1","date_published":"2013-10-08T00:00:00Z","author":[{"last_name":"Dubuis","first_name":"Julien","full_name":"Dubuis, Julien"},{"first_name":"Gasper","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wieschaus","full_name":"Wieschaus, Eric","first_name":"Eric"},{"full_name":"Gregor, Thomas","first_name":"Thomas","last_name":"Gregor"},{"last_name":"Bialek","full_name":"Bialek, William","first_name":"William"}],"page":"16301 - 16308","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"article_processing_charge":"No","has_accepted_license":"1"},{"title":"CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents","status":"public","_id":"331","publication":"Journal of the American Chemical Society","doi":"10.1021/ja401428e","citation":{"short":"W. Li, R. Zamani, P. Rivera Gil, B. Pelaz, M. Ibáñez, D. Cadavid, A. Shavel, R. Alvarez Puebla, W. Parak, J. Arbiol, A. Cabot, Journal of the American Chemical Society 135 (2013) 7098–7101.","ieee":"W. Li <i>et al.</i>, “CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents,” <i>Journal of the American Chemical Society</i>, vol. 135, no. 19. ACS, pp. 7098–7101, 2013.","ama":"Li W, Zamani R, Rivera Gil P, et al. CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents. <i>Journal of the American Chemical Society</i>. 2013;135(19):7098-7101. doi:<a href=\"https://doi.org/10.1021/ja401428e\">10.1021/ja401428e</a>","ista":"Li W, Zamani R, Rivera Gil P, Pelaz B, Ibáñez M, Cadavid D, Shavel A, Alvarez Puebla R, Parak W, Arbiol J, Cabot A. 2013. CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents. Journal of the American Chemical Society. 135(19), 7098–7101.","apa":"Li, W., Zamani, R., Rivera Gil, P., Pelaz, B., Ibáñez, M., Cadavid, D., … Cabot, A. (2013). CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja401428e\">https://doi.org/10.1021/ja401428e</a>","mla":"Li, Wenhua, et al. “CuTe Nanocrystals: Shape and Size Control, Plasmonic Properties, and Use as SERS Probes and Photothermal Agents.” <i>Journal of the American Chemical Society</i>, vol. 135, no. 19, ACS, 2013, pp. 7098–101, doi:<a href=\"https://doi.org/10.1021/ja401428e\">10.1021/ja401428e</a>.","chicago":"Li, Wenhua, Reza Zamani, Pilar Rivera Gil, Beatriz Pelaz, Maria Ibáñez, Doris Cadavid, Alexey Shavel, et al. “CuTe Nanocrystals: Shape and Size Control, Plasmonic Properties, and Use as SERS Probes and Photothermal Agents.” <i>Journal of the American Chemical Society</i>. ACS, 2013. <a href=\"https://doi.org/10.1021/ja401428e\">https://doi.org/10.1021/ja401428e</a>."},"article_type":"original","publisher":"ACS","article_processing_charge":"No","language":[{"iso":"eng"}],"publist_id":"7521","volume":135,"date_updated":"2021-01-12T07:42:33Z","intvolume":"       135","date_published":"2013-04-30T00:00:00Z","author":[{"full_name":"Li, Wenhua","first_name":"Wenhua","last_name":"Li"},{"last_name":"Zamani","full_name":"Zamani, Reza","first_name":"Reza"},{"last_name":"Rivera Gil","first_name":"Pilar","full_name":"Rivera Gil, Pilar"},{"last_name":"Pelaz","first_name":"Beatriz","full_name":"Pelaz, Beatriz"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"last_name":"Shavel","first_name":"Alexey","full_name":"Shavel, Alexey"},{"last_name":"Alvarez Puebla","first_name":"Ramon","full_name":"Alvarez Puebla, Ramon"},{"last_name":"Parak","first_name":"Wolfgang","full_name":"Parak, Wolfgang"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"page":"7098 - 7101","publication_status":"published","month":"04","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We report a procedure to prepare highly monodisperse copper telluride nanocubes, nanoplates, and nanorods. The procedure is based on the reaction of a copper salt with trioctylphosphine telluride in the presence of lithium bis(trimethylsilyl)amide and oleylamine. CuTe nanocrystals display a strong near-infrared optical absorption associated with localized surface plasmon resonances. We exploit this plasmon resonance for the design of surface-enhanced Raman scattering sensors for unconventional optical probes. Furthermore, we also report here our preliminary analysis of the use of CuTe nanocrystals as cytotoxic and photothermal agents."}],"type":"journal_article","day":"30","quality_controlled":"1","extern":"1","oa_version":"None","issue":"19","date_created":"2018-12-11T11:45:51Z"},{"department":[{"_id":"ChLa"}],"title":"Kernel based learning","status":"public","editor":[{"last_name":"Dubitzky","first_name":"Werner","full_name":"Dubitzky, Werner"},{"last_name":"Wolkenhauer","first_name":"Olaf","full_name":"Wolkenhauer, Olaf"},{"last_name":"Cho","full_name":"Cho, Kwang","first_name":"Kwang"},{"last_name":"Yokota","full_name":"Yokota, Hiroki","first_name":"Hiroki"}],"publication":"Encyclopedia of Systems Biology","_id":"3321","doi":"10.1007/978-1-4419-9863-7_604","citation":{"mla":"Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” <i>Encyclopedia of Systems Biology</i>, edited by Werner Dubitzky et al., vol. 3, Springer, 2013, pp. 1069–1069, doi:<a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">10.1007/978-1-4419-9863-7_604</a>.","chicago":"Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” In <i>Encyclopedia of Systems Biology</i>, edited by Werner Dubitzky, Olaf Wolkenhauer, Kwang Cho, and Hiroki Yokota, 3:1069–1069. Springer, 2013. <a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">https://doi.org/10.1007/978-1-4419-9863-7_604</a>.","apa":"Quadrianto, N., &#38; Lampert, C. (2013). Kernel based learning. In W. Dubitzky, O. Wolkenhauer, K. Cho, &#38; H. Yokota (Eds.), <i>Encyclopedia of Systems Biology</i> (Vol. 3, pp. 1069–1069). Springer. <a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">https://doi.org/10.1007/978-1-4419-9863-7_604</a>","ista":"Quadrianto N, Lampert C. 2013.Kernel based learning. In: Encyclopedia of Systems Biology. vol. 3, 1069–1069.","ama":"Quadrianto N, Lampert C. Kernel based learning. In: Dubitzky W, Wolkenhauer O, Cho K, Yokota H, eds. <i>Encyclopedia of Systems Biology</i>. Vol 3. Springer; 2013:1069-1069. doi:<a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">10.1007/978-1-4419-9863-7_604</a>","ieee":"N. Quadrianto and C. Lampert, “Kernel based learning,” in <i>Encyclopedia of Systems Biology</i>, vol. 3, W. Dubitzky, O. Wolkenhauer, K. Cho, and H. Yokota, Eds. Springer, 2013, pp. 1069–1069.","short":"N. Quadrianto, C. Lampert, in:, W. Dubitzky, O. Wolkenhauer, K. Cho, H. Yokota (Eds.), Encyclopedia of Systems Biology, Springer, 2013, pp. 1069–1069."},"publist_id":"3314","volume":3,"date_updated":"2021-01-12T07:42:38Z","publisher":"Springer","language":[{"iso":"eng"}],"date_published":"2013-01-01T00:00:00Z","author":[{"first_name":"Novi","full_name":"Quadrianto, Novi","last_name":"Quadrianto"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"}],"page":"1069 - 1069","intvolume":"         3","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","year":"2013","day":"01","quality_controlled":"1","type":"encyclopedia_article","oa_version":"None","date_created":"2018-12-11T12:02:39Z"},{"date_created":"2018-12-11T11:45:55Z","extern":"1","issue":"12","oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"Morphology is a key parameter in the design of novel nanocrystals and nanomaterials with controlled functional properties. Here, we demonstrate the potential of foreign metal ions to tune the morphology of colloidal semiconductor nanoparticles. We illustrate the underlying mechanism by preparing copper selenide nanocubes in the presence of Al ions. We further characterize the plasmonic properties of the obtained nanocrystals and demonstrate their potential as a platform to produce cubic nanoparticles with different composition by cation exchange. © 2013 American Chemical Society."}],"acknowledgement":"The research was supported by the European Regional Development Funds. M.I. thanks the Spanish MICINN for her Ph.D. grant. J.A. and R.Z. also acknowledge MAT2010-15138.","quality_controlled":"1","day":"07","month":"03","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","intvolume":"       135","page":"4664 - 4667","author":[{"last_name":"Li","first_name":"Wenhua","full_name":"Li, Wenhua"},{"first_name":"Reza","full_name":"Zamani, Reza","last_name":"Zamani"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria"},{"last_name":"Cadavid","full_name":"Cadavid, Doris","first_name":"Doris"},{"last_name":"Shavel","first_name":"Alexey","full_name":"Shavel, Alexey"},{"full_name":"Morante, Joan","first_name":"Joan","last_name":"Morante"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"date_published":"2013-03-07T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"American Chemical Society","article_type":"original","date_updated":"2021-01-12T07:43:21Z","publist_id":"7482","volume":135,"doi":"10.1021/ja400472m","citation":{"apa":"Li, W., Zamani, R., Ibáñez, M., Cadavid, D., Shavel, A., Morante, J., … Cabot, A. (2013). Metal ions to control the morphology of semiconductor nanoparticles: Copper selenide nanocubes. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/ja400472m\">https://doi.org/10.1021/ja400472m</a>","chicago":"Li, Wenhua, Reza Zamani, Maria Ibáñez, Doris Cadavid, Alexey Shavel, Joan Morante, Jordi Arbiol, and Andreu Cabot. “Metal Ions to Control the Morphology of Semiconductor Nanoparticles: Copper Selenide Nanocubes.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2013. <a href=\"https://doi.org/10.1021/ja400472m\">https://doi.org/10.1021/ja400472m</a>.","mla":"Li, Wenhua, et al. “Metal Ions to Control the Morphology of Semiconductor Nanoparticles: Copper Selenide Nanocubes.” <i>Journal of the American Chemical Society</i>, vol. 135, no. 12, American Chemical Society, 2013, pp. 4664–67, doi:<a href=\"https://doi.org/10.1021/ja400472m\">10.1021/ja400472m</a>.","short":"W. Li, R. Zamani, M. Ibáñez, D. Cadavid, A. Shavel, J. Morante, J. Arbiol, A. Cabot, Journal of the American Chemical Society 135 (2013) 4664–4667.","ieee":"W. Li <i>et al.</i>, “Metal ions to control the morphology of semiconductor nanoparticles: Copper selenide nanocubes,” <i>Journal of the American Chemical Society</i>, vol. 135, no. 12. American Chemical Society, pp. 4664–4667, 2013.","ama":"Li W, Zamani R, Ibáñez M, et al. Metal ions to control the morphology of semiconductor nanoparticles: Copper selenide nanocubes. <i>Journal of the American Chemical Society</i>. 2013;135(12):4664-4667. doi:<a href=\"https://doi.org/10.1021/ja400472m\">10.1021/ja400472m</a>","ista":"Li W, Zamani R, Ibáñez M, Cadavid D, Shavel A, Morante J, Arbiol J, Cabot A. 2013. Metal ions to control the morphology of semiconductor nanoparticles: Copper selenide nanocubes. Journal of the American Chemical Society. 135(12), 4664–4667."},"publication":"Journal of the American Chemical Society","_id":"342","status":"public","title":"Metal ions to control the morphology of semiconductor nanoparticles: Copper selenide nanocubes"},{"publication_identifier":{"issn":["0936-5214"],"eissn":["1437-2096"]},"extern":"1","issue":"18","date_created":"2023-08-01T09:47:17Z","scopus_import":"1","_id":"13405","publisher":"Georg Thieme Verlag","language":[{"iso":"eng"}],"article_processing_charge":"No","date_published":"2013-10-22T00:00:00Z","page":"2370-2374","author":[{"last_name":"Ely","full_name":"Ely, Tal","first_name":"Tal"},{"first_name":"Sanjib","full_name":"Das, Sanjib","last_name":"Das"},{"first_name":"Wenjie","full_name":"Li, Wenjie","last_name":"Li"},{"first_name":"Pintu","full_name":"Kundu, Pintu","last_name":"Kundu"},{"full_name":"Tirosh, Einat","first_name":"Einat","last_name":"Tirosh"},{"full_name":"Cahen, David","first_name":"David","last_name":"Cahen"},{"last_name":"Vilan","first_name":"Ayelet","full_name":"Vilan, Ayelet"},{"last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","full_name":"Klajn, Rafal"}],"keyword":["Organic Chemistry"],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","year":"2013","abstract":[{"lang":"eng","text":"We report a method for preparing electrode–molecule–electrode junctions that incorporate nonsymmetrical azobenzene dithiols. Our approach is based on sequential deprotection of thiol moieties originally carrying two different protecting groups. The azobenzene derivatives retained their switching properties within monolayers and permitted the photocontrol of electrical conductance."}],"type":"journal_article","day":"22","quality_controlled":"1","oa_version":"None","title":"Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol","status":"public","publication":"Synlett","doi":"10.1055/s-0033-1340087","citation":{"apa":"Ely, T., Das, S., Li, W., Kundu, P., Tirosh, E., Cahen, D., … Klajn, R. (2013). Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. <i>Synlett</i>. Georg Thieme Verlag. <a href=\"https://doi.org/10.1055/s-0033-1340087\">https://doi.org/10.1055/s-0033-1340087</a>","mla":"Ely, Tal, et al. “Photocontrol of Electrical Conductance with a Nonsymmetrical Azobenzene Dithiol.” <i>Synlett</i>, vol. 24, no. 18, Georg Thieme Verlag, 2013, pp. 2370–74, doi:<a href=\"https://doi.org/10.1055/s-0033-1340087\">10.1055/s-0033-1340087</a>.","chicago":"Ely, Tal, Sanjib Das, Wenjie Li, Pintu Kundu, Einat Tirosh, David Cahen, Ayelet Vilan, and Rafal Klajn. “Photocontrol of Electrical Conductance with a Nonsymmetrical Azobenzene Dithiol.” <i>Synlett</i>. Georg Thieme Verlag, 2013. <a href=\"https://doi.org/10.1055/s-0033-1340087\">https://doi.org/10.1055/s-0033-1340087</a>.","ama":"Ely T, Das S, Li W, et al. Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. <i>Synlett</i>. 2013;24(18):2370-2374. doi:<a href=\"https://doi.org/10.1055/s-0033-1340087\">10.1055/s-0033-1340087</a>","ista":"Ely T, Das S, Li W, Kundu P, Tirosh E, Cahen D, Vilan A, Klajn R. 2013. Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. Synlett. 24(18), 2370–2374.","short":"T. Ely, S. Das, W. Li, P. Kundu, E. Tirosh, D. Cahen, A. Vilan, R. Klajn, Synlett 24 (2013) 2370–2374.","ieee":"T. Ely <i>et al.</i>, “Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol,” <i>Synlett</i>, vol. 24, no. 18. Georg Thieme Verlag, pp. 2370–2374, 2013."},"article_type":"original","volume":24,"date_updated":"2024-10-14T12:21:03Z","intvolume":"        24"},{"scopus_import":"1","_id":"13406","publisher":"Wiley","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2013-01-18T00:00:00Z","author":[{"first_name":"Sanjib","full_name":"Das, Sanjib","last_name":"Das"},{"full_name":"Ranjan, Priyadarshi","first_name":"Priyadarshi","last_name":"Ranjan"},{"last_name":"Maiti","first_name":"Pradipta Sankar","full_name":"Maiti, Pradipta Sankar"},{"last_name":"Singh","full_name":"Singh, Gurvinder","first_name":"Gurvinder"},{"last_name":"Leitus","full_name":"Leitus, Gregory","first_name":"Gregory"},{"full_name":"Klajn, Rafal","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn"}],"page":"422-426","publication_identifier":{"issn":["0935-9648"]},"issue":"3","extern":"1","date_created":"2023-08-01T09:47:30Z","external_id":{"pmid":["22933327"]},"title":"Dual-responsive nanoparticles and their self-assembly","status":"public","publication":"Advanced Materials","citation":{"chicago":"Das, Sanjib, Priyadarshi Ranjan, Pradipta Sankar Maiti, Gurvinder Singh, Gregory Leitus, and Rafal Klajn. “Dual-Responsive Nanoparticles and Their Self-Assembly.” <i>Advanced Materials</i>. Wiley, 2013. <a href=\"https://doi.org/10.1002/adma.201201734\">https://doi.org/10.1002/adma.201201734</a>.","mla":"Das, Sanjib, et al. “Dual-Responsive Nanoparticles and Their Self-Assembly.” <i>Advanced Materials</i>, vol. 25, no. 3, Wiley, 2013, pp. 422–26, doi:<a href=\"https://doi.org/10.1002/adma.201201734\">10.1002/adma.201201734</a>.","apa":"Das, S., Ranjan, P., Maiti, P. S., Singh, G., Leitus, G., &#38; Klajn, R. (2013). Dual-responsive nanoparticles and their self-assembly. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201201734\">https://doi.org/10.1002/adma.201201734</a>","ista":"Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. 2013. Dual-responsive nanoparticles and their self-assembly. Advanced Materials. 25(3), 422–426.","ama":"Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. Dual-responsive nanoparticles and their self-assembly. <i>Advanced Materials</i>. 2013;25(3):422-426. doi:<a href=\"https://doi.org/10.1002/adma.201201734\">10.1002/adma.201201734</a>","ieee":"S. Das, P. Ranjan, P. S. Maiti, G. Singh, G. Leitus, and R. Klajn, “Dual-responsive nanoparticles and their self-assembly,” <i>Advanced Materials</i>, vol. 25, no. 3. Wiley, pp. 422–426, 2013.","short":"S. Das, P. Ranjan, P.S. Maiti, G. Singh, G. Leitus, R. Klajn, Advanced Materials 25 (2013) 422–426."},"doi":"10.1002/adma.201201734","volume":25,"date_updated":"2024-10-14T12:21:16Z","article_type":"original","intvolume":"        25","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"publication_status":"published","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","day":"18","quality_controlled":"1","abstract":[{"text":"Dual-responsive nanoparticles are designed by functionalizing magnetic cores with light-responsive ligands. These materials respond to both light and magnetic fields and can be assembled into various higher-order structures, depending on the relative contributions of these two stimuli.","lang":"eng"}],"type":"journal_article","oa_version":"None","pmid":1},{"has_accepted_license":"1","series_title":"Leibniz International Proceedings in Informatics","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël"}],"conference":{"name":"CSL: Computer Science Logic","end_date":"2013-09-05","start_date":"203-09-02","location":"Torino, Italy"},"page":"181 - 196","date_published":"2013-09-01T00:00:00Z","scopus_import":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"alternative_title":["LIPIcs"],"_id":"1374","date_created":"2018-12-11T11:51:39Z","ddc":["000"],"file_date_updated":"2020-07-14T12:44:47Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pubrep_id":"624","date_updated":"2024-10-09T20:55:23Z","volume":23,"publist_id":"5837","oa":1,"intvolume":"        23","file":[{"checksum":"b7091a3866db573c0db5ec486952255e","file_id":"5023","relation":"main_file","file_size":547296,"creator":"system","access_level":"open_access","date_created":"2018-12-12T10:13:38Z","content_type":"application/pdf","date_updated":"2020-07-14T12:44:47Z","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf"}],"department":[{"_id":"KrCh"}],"status":"public","title":"Infinite-state games with finitary conditions","citation":{"chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In <i>22nd EACSL Annual Conference on Computer Science Logic</i>, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” <i>22nd EACSL Annual Conference on Computer Science Logic</i>, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In <i>22nd EACSL Annual Conference on Computer Science Logic</i> (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in <i>22nd EACSL Annual Conference on Computer Science Logic</i>, Torino, Italy, 2013, vol. 23, pp. 181–196.","short":"K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.","ista":"Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: <i>22nd EACSL Annual Conference on Computer Science Logic</i>. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>"},"doi":"10.4230/LIPIcs.CSL.2013.181","ec_funded":1,"publication":"22nd EACSL Annual Conference on Computer Science Logic","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","month":"09","publication_status":"published","corr_author":"1","quality_controlled":"1","day":"01","type":"conference","abstract":[{"text":"We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.","lang":"eng"}]},{"month":"12","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","quality_controlled":"1","corr_author":"1","day":"11","type":"conference","related_material":{"record":[{"status":"public","id":"5406","relation":"earlier_version"}]},"abstract":[{"text":"We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","title":"Distributed synthesis for LTL fragments","OA_type":"green","doi":"10.1109/FMCAD.2013.6679386","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, 18–25. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>.","mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 18–25, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In <i>13th International Conference on Formal Methods in Computer-Aided Design</i> (pp. 18–25). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 18–25.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: <i>13th International Conference on Formal Methods in Computer-Aided Design</i>. IEEE; 2013:18-25. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>"},"publication":"13th International Conference on Formal Methods in Computer-Aided Design","ec_funded":1,"date_updated":"2025-06-26T08:33:43Z","publist_id":"5835","oa":1,"main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2013-130-v1-1","open_access":"1"}],"date_created":"2018-12-11T11:51:40Z","scopus_import":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"_id":"1376","OA_place":"repository","article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"IEEE","page":"18 - 25","conference":{"location":"Portland, OR, United States","start_date":"2013-10-20","end_date":"2013-10-23","name":"FMCAD: Formal Methods in Computer-Aided Design"},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"}],"date_published":"2013-12-11T00:00:00Z"},{"page":"77 - 84","author":[{"last_name":"Hofferek","full_name":"Hofferek, Georg","first_name":"Georg"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh"},{"last_name":"Könighofer","first_name":"Bettina","full_name":"Könighofer, Bettina"},{"last_name":"Jiang","full_name":"Jiang, Jie","first_name":"Jie"},{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"}],"conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","end_date":"2013-10-23","location":"Portland, OR, United States"},"date_published":"2013-12-11T00:00:00Z","language":[{"iso":"eng"}],"publisher":"IEEE","_id":"1385","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","date_created":"2018-12-11T11:51:43Z","acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND  (FP7-2009-IST-4-248613), and  QUAINT  (I774-N23),  ","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.4767"}],"date_updated":"2024-10-21T06:02:56Z","oa":1,"publist_id":"5825","citation":{"ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: <i>2013 Formal Methods in Computer-Aided Design</i>. IEEE; 2013:77-84. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in <i>2013 Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 77–84.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In <i>2013 Formal Methods in Computer-Aided Design</i>, 77–84. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>.","mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” <i>2013 Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>.","apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &#38; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In <i>2013 Formal Methods in Computer-Aided Design</i> (pp. 77–84). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>"},"doi":"10.1109/FMCAD.2013.6679394","ec_funded":1,"publication":"2013 Formal Methods in Computer-Aided Design","status":"public","title":"Synthesizing multiple boolean functions using interpolation on a single proof","external_id":{"arxiv":["1308.4767"]},"department":[{"_id":"ToHe"}],"arxiv":1,"oa_version":"Preprint","type":"conference","abstract":[{"text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results.","lang":"eng"}],"quality_controlled":"1","day":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","month":"12","publication_status":"published"},{"date_updated":"2020-08-11T10:09:09Z","publist_id":"5823","oa":1,"volume":7966,"file":[{"checksum":"98bc02e3793072e279ec8d364b381ff3","file_id":"7857","relation":"main_file","content_type":"application/pdf","date_created":"2020-05-15T11:05:50Z","access_level":"open_access","file_size":276982,"creator":"dernst","file_name":"2013_ICALP_Boker.pdf","date_updated":"2020-07-14T12:44:48Z"}],"intvolume":"      7966","status":"public","title":"Nondeterminism in the presence of a diverse or unknown future","department":[{"_id":"ToHe"}],"doi":"10.1007/978-3-642-39212-2_11","citation":{"apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100."},"ec_funded":1,"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","year":"2013","publication_status":"published","type":"conference","abstract":[{"lang":"eng","text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata."}],"quality_controlled":"1","day":"01","language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"Springer","has_accepted_license":"1","series_title":"Lecture Notes in Computer Science","page":"89 - 100","author":[{"full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker"},{"last_name":"Kuperberg","full_name":"Kuperberg, Denis","first_name":"Denis"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"full_name":"Skrzypczak, Michał","first_name":"Michał","last_name":"Skrzypczak"}],"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","start_date":"2013-07-08","location":"Riga, Latvia"},"date_published":"2013-07-01T00:00:00Z","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"alternative_title":["LNCS"],"scopus_import":1,"_id":"1387","issue":"PART 2","file_date_updated":"2020-07-14T12:44:48Z","date_created":"2018-12-11T11:51:44Z","ddc":["000"],"acknowledgement":"and ERC Grant QUALITY."},{"file_date_updated":"2021-11-17T13:47:58Z","date_created":"2018-12-11T11:51:50Z","ddc":["000"],"main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"degree_awarded":"PhD","acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS 2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this part is mostly related to the implementation. The theory required to understand the method and its implementation is quickly recalled to make the thesis self-contained, but should not be considered as a contribution. For the details of the methods, we refer the reader to the orig- inal publication [13] and the corresponding technical report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar, and Thomas Wies. I also would like to thank the people who supported over the past 4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on projects I was interested in. My collaborators, especially Thomas Wies with whom I worked since the beginning. The members of my thesis committee, Viktor Kun- cak and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny, Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created an enjoyable environment. ","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","author":[{"first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"page":"134","date_published":"2013-09-05T00:00:00Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"alternative_title":["ISTA Thesis"],"_id":"1405","oa_version":"Published Version","year":"2013","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"09","publication_status":"published","type":"dissertation","abstract":[{"text":"Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point.","lang":"eng"}],"related_material":{"record":[{"id":"4361","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"3251","relation":"part_of_dissertation"},{"id":"2847","relation":"part_of_dissertation","status":"public"}]},"supervisor":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","day":"05","date_updated":"2025-04-15T08:11:54Z","publist_id":"5802","oa":1,"file":[{"relation":"main_file","success":1,"file_id":"9176","checksum":"ed2d7b52933d134e8dc69d569baa284e","date_updated":"2021-02-22T11:28:36Z","file_name":"2013_Zufferey_thesis_final.pdf","file_size":1514906,"creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2021-02-22T11:28:36Z"},{"date_updated":"2021-11-17T13:47:58Z","file_name":"2013_Zufferey_thesis_final_pdfa.pdf","creator":"cchlebak","file_size":1378313,"date_created":"2021-11-16T14:42:52Z","content_type":"application/pdf","access_level":"closed","relation":"main_file","file_id":"10298","checksum":"cecc4c4b14225bee973d32e3dba91a55"}],"status":"public","title":"Analysis of dynamic message passing programs","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"citation":{"chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>.","mla":"Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>.","apa":"Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>","ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013.","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>"},"doi":"10.15479/at:ista:1405","ec_funded":1},{"degree_awarded":"PhD","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","year":"2013","publication_identifier":{"issn":["2663-337X"]},"day":"01","corr_author":"1","supervisor":[{"last_name":"Heisenberg","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"abstract":[{"lang":"eng","text":"Epithelial spreading is a critical part of various developmental and wound repair processes. Here we use zebrafish epiboly as a model system to study the cellular and molecular mechanisms underlying the spreading of epithelial sheets. During zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the embryo to eventually cover the entire yolk cell by the end of gastrulation. The EVL leading edge is anchored through tight junctions to the yolk syncytial layer (YSL), where directly adjacent to the EVL margin a contractile actomyosin ring is formed that is thought to drive EVL epiboly. The prevalent view in the field was that the contractile ring exerts a pulling force on the EVL margin, which pulls the EVL towards the vegetal pole. However, how this force is generated and how it affects EVL morphology still remains elusive. Moreover, the cellular mechanisms mediating the increase in EVL surface area, while maintaining tissue integrity and function are still unclear. Here we show that the YSL actomyosin ring pulls on the EVL margin by two distinct force-generating mechanisms. One mechanism is based on contraction of the ring around its circumference, as previously proposed. The second mechanism is based on actomyosin retrogade flows, generating force through resistance against the substrate. The latter can function at any epiboly stage even in situations where the contraction-based mechanism is unproductive. Additionally, we demonstrate that during epiboly the EVL is subjected to anisotropic tension, which guides the orientation of EVL cell division along the main axis (animal-vegetal) of tension. The influence of tension in cell division orientation involves cell elongation and requires myosin-2 activity for proper spindle alignment. Strikingly, we reveal that tension-oriented cell divisions release anisotropic tension within the EVL and that in the absence of such divisions, EVL cells undergo ectopic fusions. We conclude that forces applied to the EVL by the action of the YSL actomyosin ring generate a tension anisotropy in the EVL that orients cell divisions, which in turn limit tissue tension increase thereby facilitating tissue spreading."}],"type":"dissertation","oa_version":"None","date_created":"2018-12-11T11:51:50Z","department":[{"_id":"CaHe"}],"title":"Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading","status":"public","alternative_title":["ISTA Thesis"],"_id":"1406","citation":{"ama":"Campinho P. Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading. 2013.","ista":"Campinho P. 2013. Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading. Institute of Science and Technology Austria.","short":"P. Campinho, Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading, Institute of Science and Technology Austria, 2013.","ieee":"P. Campinho, “Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading,” Institute of Science and Technology Austria, 2013.","apa":"Campinho, P. (2013). <i>Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading</i>. Institute of Science and Technology Austria.","mla":"Campinho, Pedro. <i>Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading</i>. Institute of Science and Technology Austria, 2013.","chicago":"Campinho, Pedro. “Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading.” Institute of Science and Technology Austria, 2013."},"publist_id":"5801","date_updated":"2024-12-09T14:12:48Z","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"article_processing_charge":"No","date_published":"2013-10-01T00:00:00Z","author":[{"first_name":"Pedro","full_name":"Campinho, Pedro","last_name":"Campinho","orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87"}],"page":"123"},{"issue":"3","extern":1,"date_created":"2018-12-11T11:52:02Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.2375"}],"publication_status":"published","month":"01","year":"2013","day":"01","quality_controlled":0,"abstract":[{"lang":"eng","text":"We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier transform, the dimensions of the isotypical components of the cohomology of associated Nakajima quiver varieties under the action of a Weyl group. The generating function of the corresponding Poincare polynomials is an extension of Hua's formula for Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The resulting formulae contain a wide range of information on the geometry of the quiver varieties."}],"acknowledgement":"The first author thanks the Royal Society for funding his research 2005-2012 in the form of a Royal Society University Research Fellowship as well as the Mathematical Institute and Wadham College in Oxford for a very productive environment. The second author is supported by Agence Nationale de la Recherche grant\nANR-09-JCJC-0102-01. The third author is supported by the NSF grant DMS-1101484 and a Research Scholarship from the Clay Mathematical Institute.","type":"journal_article","volume":177,"oa":1,"publist_id":"5754","date_updated":"2021-01-12T06:50:47Z","publisher":"Princeton University Press","date_published":"2013-01-01T00:00:00Z","page":"1147 - 1168","author":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel","full_name":"Tamas Hausel","first_name":"Tamas"},{"last_name":"Letellier","full_name":"Letellier, Emmanuel","first_name":"Emmanuel"},{"last_name":"Rodríguez Villegas","first_name":"Fernando","full_name":"Rodríguez Villegas, Fernando"}],"intvolume":"       177","title":"Positivity for Kac polynomials and DT-invariants of quivers","status":"public","publication":"Annals of Mathematics","_id":"1442","doi":"10.4007/annals.2013.177.3.8","citation":{"chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Positivity for Kac Polynomials and DT-Invariants of Quivers.” <i>Annals of Mathematics</i>. Princeton University Press, 2013. <a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">https://doi.org/10.4007/annals.2013.177.3.8</a>.","mla":"Hausel, Tamás, et al. “Positivity for Kac Polynomials and DT-Invariants of Quivers.” <i>Annals of Mathematics</i>, vol. 177, no. 3, Princeton University Press, 2013, pp. 1147–68, doi:<a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">10.4007/annals.2013.177.3.8</a>.","apa":"Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2013). Positivity for Kac polynomials and DT-invariants of quivers. <i>Annals of Mathematics</i>. Princeton University Press. <a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">https://doi.org/10.4007/annals.2013.177.3.8</a>","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Positivity for Kac polynomials and DT-invariants of quivers,” <i>Annals of Mathematics</i>, vol. 177, no. 3. Princeton University Press, pp. 1147–1168, 2013.","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177 (2013) 1147–1168.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2013. Positivity for Kac polynomials and DT-invariants of quivers. Annals of Mathematics. 177(3), 1147–1168.","ama":"Hausel T, Letellier E, Rodríguez Villegas F. Positivity for Kac polynomials and DT-invariants of quivers. <i>Annals of Mathematics</i>. 2013;177(3):1147-1168. doi:<a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">10.4007/annals.2013.177.3.8</a>"}},{"status":"public","alternative_title":["Advanced Lectures in Mathematics"],"title":"Global topology of the Hitchin system","citation":{"mla":"Hausel, Tamás. “Global Topology of the Hitchin System.” <i>Handbook of Moduli: Volume II</i>, vol. 25, International Press, 2013, pp. 29–70.","chicago":"Hausel, Tamás. “Global Topology of the Hitchin System.” In <i>Handbook of Moduli: Volume II</i>, 25:29–70. International Press, 2013.","apa":"Hausel, T. (2013). Global topology of the Hitchin system. In <i>Handbook of Moduli: Volume II</i> (Vol. 25, pp. 29–70). International Press.","ista":"Hausel T. 2013.Global topology of the Hitchin system. In: Handbook of Moduli: Volume II. Advanced Lectures in Mathematics, vol. 25, 29–70.","ama":"Hausel T. Global topology of the Hitchin system. In: <i>Handbook of Moduli: Volume II</i>. Vol 25. International Press; 2013:29-70.","ieee":"T. Hausel, “Global topology of the Hitchin system,” in <i>Handbook of Moduli: Volume II</i>, vol. 25, International Press, 2013, pp. 29–70.","short":"T. Hausel, in:, Handbook of Moduli: Volume II, International Press, 2013, pp. 29–70."},"publication":"Handbook of Moduli: Volume II","_id":"1443","publisher":"International Press","date_updated":"2021-01-12T06:50:47Z","volume":25,"oa":1,"publist_id":"5753","intvolume":"        25","page":"29 - 70","author":[{"full_name":"Tamas Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"}],"date_published":"2013-03-15T00:00:00Z","year":"2013","month":"03","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1102.1717","open_access":"1"}],"type":"book_chapter","abstract":[{"lang":"eng","text":"Here we survey several results and conjectures on the cohomology of the total space of the Hitchin system: the moduli space of semi-stable rank n and degree d Higgs bundles on a complex algebraic curve C. The picture emerging is a dynamic mixture of ideas originating in theoretical physics such as gauge theory and mirror symmetry, Weil conjectures in arithmetic algebraic geometry, representation theory of finite groups of Lie type and Langlands duality in number theory."}],"quality_controlled":0,"day":"15","extern":1,"date_created":"2018-12-11T11:52:03Z"},{"title":"Arithmetic harmonic analysis on character and quiver varieties II","status":"public","publication":"Advances in Mathematics","_id":"1469","citation":{"ama":"Hausel T, Letellier E, Rodríguez Villegas F. Arithmetic harmonic analysis on character and quiver varieties II. <i>Advances in Mathematics</i>. 2013;234:85-128. doi:<a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">10.1016/j.aim.2012.10.009</a>","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2013. Arithmetic harmonic analysis on character and quiver varieties II. Advances in Mathematics. 234, 85–128.","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Advances in Mathematics 234 (2013) 85–128.","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Arithmetic harmonic analysis on character and quiver varieties II,” <i>Advances in Mathematics</i>, vol. 234. Academic Press, pp. 85–128, 2013.","apa":"Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2013). Arithmetic harmonic analysis on character and quiver varieties II. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">https://doi.org/10.1016/j.aim.2012.10.009</a>","mla":"Hausel, Tamás, et al. “Arithmetic Harmonic Analysis on Character and Quiver Varieties II.” <i>Advances in Mathematics</i>, vol. 234, Academic Press, 2013, pp. 85–128, doi:<a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">10.1016/j.aim.2012.10.009</a>.","chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Arithmetic Harmonic Analysis on Character and Quiver Varieties II.” <i>Advances in Mathematics</i>. Academic Press, 2013. <a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">https://doi.org/10.1016/j.aim.2012.10.009</a>."},"doi":"10.1016/j.aim.2012.10.009","publisher":"Academic Press","publist_id":"5724","volume":234,"date_updated":"2021-01-12T06:50:57Z","intvolume":"       234","date_published":"2013-02-15T00:00:00Z","author":[{"first_name":"Tamas","full_name":"Tamas Hausel","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Letellier","full_name":"Letellier, Emmanuel","first_name":"Emmanuel"},{"last_name":"Rodríguez Villegas","first_name":"Fernando","full_name":"Rodríguez Villegas, Fernando"}],"page":"85 - 128","publication_status":"published","year":"2013","month":"02","abstract":[{"lang":"eng","text":"We study connections between the topology of generic character varieties of fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver representations, Hilbert schemes on Cx × Cx, modular forms and multiplicities in tensor products of irreducible characters of finite general linear groups."}],"acknowledgement":"During the preparation of this paper TH was supported by a Royal Society University Research Fellowship at the University of Oxford. EL was supported by ANR-09-JCJC-0102-01. FRV was supported by NSF grant DMS-0200605, an FRA from the University of Texas at Austin, EPSRC grant EP/G027110/1, Visiting Fellowships at All Souls and Wadham Colleges in Oxford and a Research Scholarship from the Clay Mathematical Institute.","type":"journal_article","day":"15","quality_controlled":0,"extern":1,"date_created":"2018-12-11T11:52:12Z"},{"page":"23 - 38","author":[{"last_name":"De Cataldo","first_name":"Mark","full_name":"De Cataldo, Mark A"},{"first_name":"Tamas","full_name":"Tamas Hausel","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Migliorini","full_name":"Migliorini, Luca","first_name":"Luca"}],"date_published":"2013-01-01T00:00:00Z","intvolume":"         7","date_updated":"2021-01-12T06:50:58Z","publist_id":"5725","volume":7,"oa":1,"publisher":"Worldwide Center of Mathematics","doi":"10.5427/jsing.2013.7c","citation":{"ieee":"M. De Cataldo, T. Hausel, and L. Migliorini, “Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces,” <i>Journal of Singularities</i>, vol. 7. Worldwide Center of Mathematics, pp. 23–38, 2013.","short":"M. De Cataldo, T. Hausel, L. Migliorini, Journal of Singularities 7 (2013) 23–38.","ista":"De Cataldo M, Hausel T, Migliorini L. 2013. Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. Journal of Singularities. 7, 23–38.","ama":"De Cataldo M, Hausel T, Migliorini L. Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. <i>Journal of Singularities</i>. 2013;7:23-38. doi:<a href=\"https://doi.org/10.5427/jsing.2013.7c\">10.5427/jsing.2013.7c</a>","mla":"De Cataldo, Mark, et al. “Exchange between Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.” <i>Journal of Singularities</i>, vol. 7, Worldwide Center of Mathematics, 2013, pp. 23–38, doi:<a href=\"https://doi.org/10.5427/jsing.2013.7c\">10.5427/jsing.2013.7c</a>.","chicago":"De Cataldo, Mark, Tamás Hausel, and Luca Migliorini. “Exchange between Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.” <i>Journal of Singularities</i>. Worldwide Center of Mathematics, 2013. <a href=\"https://doi.org/10.5427/jsing.2013.7c\">https://doi.org/10.5427/jsing.2013.7c</a>.","apa":"De Cataldo, M., Hausel, T., &#38; Migliorini, L. (2013). Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. <i>Journal of Singularities</i>. Worldwide Center of Mathematics. <a href=\"https://doi.org/10.5427/jsing.2013.7c\">https://doi.org/10.5427/jsing.2013.7c</a>"},"publication":"Journal of Singularities","_id":"1470","status":"public","title":"Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces","date_created":"2018-12-11T11:52:12Z","extern":1,"quality_controlled":0,"day":"01","type":"journal_article","abstract":[{"text":"We show that a natural isomorphism between the rational cohomology groups of the two zero-dimensional Hilbert schemes of n-points of two surfaces, the affine plane minus the axes and the cotangent bundle of an elliptic curve, exchanges the weight filtration on the first set of cohomology groups with the perverse Leray filtration associated with a natural fibration on the second set of cohomology groups. We discuss some associated hard Lefschetz phenomena.","lang":"eng"}],"acknowledgement":"Mark Andrea A. de Cataldo was partially supported by N.S.A. and N.S.F. Tamás Hausel was supported by a Royal Society University Research Fellowship. Luca Migliorini was partially supported by PRIN 2007 project \"Spazi di moduli e teoria di Lie\"","main_file_link":[{"url":"http://arxiv.org/abs/1012.2583","open_access":"1"}],"year":"2013","month":"01","publication_status":"published"}]