[{"date_updated":"2020-08-11T10:09:54Z","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":7724,"conference":{"name":"ACCV: Asian Conference on Computer Vision","end_date":"2012-11-09","location":"Daejeon, Korea","start_date":"2012-11-05"},"has_accepted_license":"1","citation":{"ista":"Tommasi T, Quadrianto N, Caputo B, Lampert C. 2013. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 7724, 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.","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>.","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>","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>","short":"T. Tommasi, N. Quadrianto, B. Caputo, C. Lampert, 7724 (2013) 1–15.","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>."},"day":"04","publisher":"Springer","_id":"2948","page":"1 - 15","acknowledgement":"This work was supported by the PASCAL 2 Network of Excellence (TT) and by the Newton International Fellowship (NQ)","scopus_import":1,"alternative_title":["LNCS"],"title":"Beyond dataset bias: Multi-task unaligned shared knowledge transfer","quality_controlled":"1","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"5874","creator":"dernst","checksum":"a0a7234a89e2192af655b0d0ae3bf445","file_size":1513620,"access_level":"open_access","file_name":"2012_ACCV_Tommasi.pdf","date_created":"2019-01-22T14:03:11Z","date_updated":"2020-07-14T12:45:55Z"}],"doi":"10.1007/978-3-642-37331-2_1","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:55Z","ddc":["000"],"date_created":"2018-12-11T12:00:30Z","author":[{"last_name":"Tommasi","first_name":"Tatiana","full_name":"Tommasi, Tatiana"},{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"full_name":"Caputo, Barbara","last_name":"Caputo","first_name":"Barbara"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"}],"intvolume":"      7724","publist_id":"3784","year":"2013","status":"public","month":"04","series_title":"Lecture Notes in Computer Science","date_published":"2013-04-04T00:00:00Z","publication_status":"published","department":[{"_id":"ChLa"}]},{"date_updated":"2021-01-12T07:40:10Z","acknowledgement":"This work is being performed within the FP7 EU project CACE (Computer Aided Cryptography Engineering).","abstract":[{"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.","lang":"eng"}],"oa":1,"volume":7028,"type":"conference","alternative_title":["LNCS"],"conference":{"name":"SPW: Security Protocols Workshop"},"title":"Bringing Zero-Knowledge Proofs of Knowledge to Practice","quality_controlled":0,"citation":{"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.","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.","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>.","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>","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>","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.","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>."},"doi":"10.1007/978-3-642-36213-2_9","date_created":"2018-12-11T12:00:38Z","day":"08","publisher":"Springer","extern":1,"author":[{"full_name":"Bangerter, Endre","first_name":"Endre","last_name":"Bangerter"},{"full_name":"Barzan, Stefania","last_name":"Barzan","first_name":"Stefania"},{"last_name":"Krenn","first_name":"Stephan","full_name":"Stephan Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093"},{"full_name":"Sadeghi, Ahmad-Reza","last_name":"Sadeghi","first_name":"Ahmad"},{"full_name":"Schneider, Thomas","last_name":"Schneider","first_name":"Thomas"},{"first_name":"Joe","last_name":"Tsay","full_name":"Tsay, Joe-Kai"}],"publist_id":"3732","intvolume":"      7028","year":"2013","status":"public","month":"01","_id":"2973","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2009/211.pdf"}],"date_published":"2013-01-08T00:00:00Z","page":"51 - 62","publication_status":"published","editor":[{"first_name":"Bruce","last_name":"Christianson","full_name":"Christianson, Bruce"},{"full_name":"Malcolm, James A.","last_name":"Malcolm","first_name":"James"},{"full_name":"Matyas, Vashek","first_name":"Vashek","last_name":"Matyas"},{"first_name":"Michael","last_name":"Roe","full_name":"Roe, Michael"}]},{"date_updated":"2025-09-29T13:24:54Z","language":[{"iso":"eng"}],"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."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","volume":42,"issue":"2","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.","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>","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.","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>.","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>","short":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174."},"publisher":"Springer","day":"01","_id":"3116","page":"142 - 174","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.","publication":"Formal Methods in System Design","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","title":"Code aware resource management","doi":"10.1007/s10703-012-0170-4","oa_version":"None","external_id":{"isi":["000316677500002"]},"isi":1,"date_created":"2018-12-11T12:01:29Z","publist_id":"3583","intvolume":"        42","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"full_name":"Faella, Marco","last_name":"Faella","first_name":"Marco"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"last_name":"Raman","first_name":"Vishwanath","full_name":"Raman, Vishwanath"}],"year":"2013","month":"04","status":"public","date_published":"2013-04-01T00:00:00Z","publication_status":"published","department":[{"_id":"KrCh"}]},{"page":"16301 - 16308","day":"08","publisher":"National Academy of Sciences","_id":"3261","issue":"41","has_accepted_license":"1","citation":{"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.","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>.","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>","ista":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. 2013. Positional information, in bits. PNAS. 110(41), 16301–16308.","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>.","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>","short":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, W. Bialek, PNAS 110 (2013) 16301–16308."},"date_updated":"2025-09-29T13:24:21Z","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"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","volume":110,"date_published":"2013-10-08T00:00:00Z","publication_status":"published","department":[{"_id":"GaTk"}],"date_created":"2018-12-11T12:02:19Z","isi":1,"author":[{"first_name":"Julien","last_name":"Dubuis","full_name":"Dubuis, Julien"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper"},{"full_name":"Wieschaus, Eric","last_name":"Wieschaus","first_name":"Eric"},{"last_name":"Gregor","first_name":"Thomas","full_name":"Gregor, Thomas"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"intvolume":"       110","publist_id":"3387","year":"2013","status":"public","month":"10","scopus_import":"1","title":"Positional information, in bits","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:46:06Z","date_created":"2019-01-22T13:53:23Z","file_name":"2013_PNAS_Dubuis.pdf","access_level":"open_access","file_size":1670548,"checksum":"ecd859fe52a562193027d428b5524a8d","content_type":"application/pdf","creator":"dernst","file_id":"5873","relation":"main_file"}],"file_date_updated":"2020-07-14T12:46:06Z","doi":"10.1073/pnas.1315642110","external_id":{"pmid":["24089448"],"isi":["000325395600021"]},"oa_version":"Published Version","ddc":["570"],"pmid":1,"publication":"PNAS","article_processing_charge":"No"},{"author":[{"full_name":"Li, Wenhua","last_name":"Li","first_name":"Wenhua"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"full_name":"Rivera Gil, Pilar","first_name":"Pilar","last_name":"Rivera Gil"},{"full_name":"Pelaz, Beatriz","last_name":"Pelaz","first_name":"Beatriz"},{"first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"Alvarez Puebla, Ramon","first_name":"Ramon","last_name":"Alvarez Puebla"},{"first_name":"Wolfgang","last_name":"Parak","full_name":"Parak, Wolfgang"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"extern":"1","intvolume":"       135","publist_id":"7521","date_created":"2018-12-11T11:45:51Z","day":"30","publisher":"ACS","status":"public","_id":"331","article_type":"original","month":"04","year":"2013","date_published":"2013-04-30T00:00:00Z","page":"7098 - 7101","publication_status":"published","publication":"Journal of the American Chemical Society","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."}],"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:42:33Z","article_processing_charge":"No","volume":135,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents","quality_controlled":"1","issue":"19","citation":{"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>.","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.","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>","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.","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>.","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>","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."},"oa_version":"None","doi":"10.1021/ja401428e"},{"date_updated":"2021-01-12T07:42:38Z","publication":"Encyclopedia of Systems Biology","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"encyclopedia_article","volume":3,"title":"Kernel based learning","quality_controlled":"1","citation":{"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>","short":"N. Quadrianto, C. Lampert, in:, W. Dubitzky, O. Wolkenhauer, K. Cho, H. Yokota (Eds.), Encyclopedia of Systems Biology, Springer, 2013, pp. 1069–1069.","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>.","ista":"Quadrianto N, Lampert C. 2013.Kernel based learning. In: Encyclopedia of Systems Biology. vol. 3, 1069–1069.","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.","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>"},"doi":"10.1007/978-1-4419-9863-7_604","oa_version":"None","date_created":"2018-12-11T12:02:39Z","day":"01","publisher":"Springer","author":[{"full_name":"Quadrianto, Novi","first_name":"Novi","last_name":"Quadrianto"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"}],"publist_id":"3314","intvolume":"         3","year":"2013","status":"public","_id":"3321","month":"01","date_published":"2013-01-01T00:00:00Z","page":"1069 - 1069","publication_status":"published","editor":[{"full_name":"Dubitzky, Werner","first_name":"Werner","last_name":"Dubitzky"},{"last_name":"Wolkenhauer","first_name":"Olaf","full_name":"Wolkenhauer, Olaf"},{"full_name":"Cho, Kwang","first_name":"Kwang","last_name":"Cho"},{"last_name":"Yokota","first_name":"Hiroki","full_name":"Yokota, Hiroki"}],"department":[{"_id":"ChLa"}]},{"date_published":"2013-03-07T00:00:00Z","page":"4664 - 4667","publication_status":"published","date_created":"2018-12-11T11:45:55Z","publisher":"American Chemical Society","day":"07","author":[{"last_name":"Li","first_name":"Wenhua","full_name":"Li, Wenhua"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"last_name":"Morante","first_name":"Joan","full_name":"Morante, Joan"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"extern":"1","intvolume":"       135","publist_id":"7482","year":"2013","status":"public","_id":"342","month":"03","article_type":"original","issue":"12","title":"Metal ions to control the morphology of semiconductor nanoparticles: Copper selenide nanocubes","quality_controlled":"1","doi":"10.1021/ja400472m","oa_version":"None","citation":{"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.","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>.","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.","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>","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>","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.","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>."},"date_updated":"2021-01-12T07:43:21Z","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.","abstract":[{"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.","lang":"eng"}],"publication":"Journal of the American Chemical Society","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"journal_article","volume":135},{"abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2024-10-14T12:21:03Z","keyword":["Organic Chemistry"],"type":"journal_article","volume":24,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"18","citation":{"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.","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>.","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>","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.","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>.","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>","short":"T. Ely, S. Das, W. Li, P. Kundu, E. Tirosh, D. Cahen, A. Vilan, R. Klajn, Synlett 24 (2013) 2370–2374."},"extern":"1","publisher":"Georg Thieme Verlag","day":"22","article_type":"original","_id":"13405","page":"2370-2374","publication":"Synlett","article_processing_charge":"No","title":"Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol","quality_controlled":"1","scopus_import":"1","oa_version":"None","doi":"10.1055/s-0033-1340087","author":[{"last_name":"Ely","first_name":"Tal","full_name":"Ely, Tal"},{"full_name":"Das, Sanjib","last_name":"Das","first_name":"Sanjib"},{"first_name":"Wenjie","last_name":"Li","full_name":"Li, Wenjie"},{"last_name":"Kundu","first_name":"Pintu","full_name":"Kundu, Pintu"},{"full_name":"Tirosh, Einat","last_name":"Tirosh","first_name":"Einat"},{"last_name":"Cahen","first_name":"David","full_name":"Cahen, David"},{"first_name":"Ayelet","last_name":"Vilan","full_name":"Vilan, Ayelet"},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal"}],"publication_identifier":{"eissn":["1437-2096"],"issn":["0936-5214"]},"intvolume":"        24","date_created":"2023-08-01T09:47:17Z","status":"public","month":"10","year":"2013","date_published":"2013-10-22T00:00:00Z","publication_status":"published"},{"issue":"3","citation":{"short":"S. Das, P. Ranjan, P.S. Maiti, G. Singh, G. Leitus, R. Klajn, Advanced Materials 25 (2013) 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>","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>.","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.","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>","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.","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>."},"date_updated":"2024-10-14T12:21:16Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":25,"keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"page":"422-426","day":"18","publisher":"Wiley","extern":"1","article_type":"original","_id":"13406","scopus_import":"1","quality_controlled":"1","title":"Dual-responsive nanoparticles and their self-assembly","oa_version":"None","external_id":{"pmid":["22933327"]},"doi":"10.1002/adma.201201734","pmid":1,"publication":"Advanced Materials","article_processing_charge":"No","date_published":"2013-01-18T00:00:00Z","publication_status":"published","date_created":"2023-08-01T09:47:30Z","intvolume":"        25","publication_identifier":{"issn":["0935-9648"]},"author":[{"last_name":"Das","first_name":"Sanjib","full_name":"Das, Sanjib"},{"last_name":"Ranjan","first_name":"Priyadarshi","full_name":"Ranjan, Priyadarshi"},{"last_name":"Maiti","first_name":"Pradipta Sankar","full_name":"Maiti, Pradipta Sankar"},{"full_name":"Singh, Gurvinder","first_name":"Gurvinder","last_name":"Singh"},{"first_name":"Gregory","last_name":"Leitus","full_name":"Leitus, Gregory"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","last_name":"Klajn"}],"year":"2013","month":"01","status":"public"},{"ec_funded":1,"date_published":"2013-09-01T00:00:00Z","series_title":"Leibniz International Proceedings in Informatics","corr_author":"1","pubrep_id":"624","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow","first_name":"Nathanaël"}],"intvolume":"        23","publist_id":"5837","date_created":"2018-12-11T11:51:39Z","status":"public","month":"09","year":"2013","title":"Infinite-state games with finitary conditions","quality_controlled":"1","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","doi":"10.4230/LIPIcs.CSL.2013.181","file_date_updated":"2020-07-14T12:44:47Z","ddc":["000"],"file":[{"relation":"main_file","date_updated":"2020-07-14T12:44:47Z","date_created":"2018-12-12T10:13:38Z","access_level":"open_access","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","checksum":"b7091a3866db573c0db5ec486952255e","file_size":547296,"creator":"system","content_type":"application/pdf","file_id":"5023"}],"publication":"22nd EACSL Annual Conference on Computer Science Logic","page":"181 - 196","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"1374","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"license":"https://creativecommons.org/licenses/by/4.0/","has_accepted_license":"1","conference":{"location":"Torino, Italy","end_date":"2013-09-05","name":"CSL: Computer Science Logic","start_date":"203-09-02"},"citation":{"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>.","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>","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.","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>.","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.","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>","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."},"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"}],"language":[{"iso":"eng"}],"date_updated":"2024-10-09T20:55:23Z","type":"conference","volume":23,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]},{"_id":"1376","day":"11","publisher":"IEEE","related_material":{"record":[{"status":"public","id":"5406","relation":"earlier_version"}]},"page":"18 - 25","OA_type":"green","oa":1,"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2025-06-26T08:33:43Z","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"citation":{"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>","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.","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>.","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.","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.","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>.","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>"},"conference":{"end_date":"2013-10-23","name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Portland, OR, United States","start_date":"2013-10-20"},"year":"2013","status":"public","month":"12","date_created":"2018-12-11T11:51:40Z","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"},{"first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5835","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"corr_author":"1","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.15479/AT:IST-2013-130-v1-1"}],"date_published":"2013-12-11T00:00:00Z","article_processing_charge":"No","publication":"13th International Conference on Formal Methods in Computer-Aided Design","OA_place":"repository","oa_version":"Preprint","doi":"10.1109/FMCAD.2013.6679386","scopus_import":"1","title":"Distributed synthesis for LTL fragments","quality_controlled":"1"},{"date_published":"2013-12-11T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.4767"}],"ec_funded":1,"publication_status":"published","department":[{"_id":"ToHe"}],"arxiv":1,"date_created":"2018-12-11T11:51:43Z","publist_id":"5825","author":[{"full_name":"Hofferek, Georg","last_name":"Hofferek","first_name":"Georg"},{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","last_name":"Gupta"},{"full_name":"Könighofer, Bettina","first_name":"Bettina","last_name":"Könighofer"},{"full_name":"Jiang, Jie","first_name":"Jie","last_name":"Jiang"},{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"}],"year":"2013","month":"12","status":"public","scopus_import":"1","quality_controlled":"1","title":"Synthesizing multiple boolean functions using interpolation on a single proof","oa_version":"Preprint","external_id":{"arxiv":["1308.4767"]},"doi":"10.1109/FMCAD.2013.6679394","acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND  (FP7-2009-IST-4-248613), and  QUAINT  (I774-N23),  ","publication":"2013 Formal Methods in Computer-Aided Design","page":"77 - 84","day":"11","publisher":"IEEE","_id":"1385","conference":{"start_date":"2013-10-20","location":"Portland, OR, United States","end_date":"2013-10-23","name":"FMCAD: Formal Methods in Computer-Aided Design"},"citation":{"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.","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>.","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>","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.","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>.","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>","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."},"date_updated":"2024-10-21T06:02:56Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"conference"},{"year":"2013","status":"public","month":"07","date_created":"2018-12-11T11:51:44Z","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi"},{"full_name":"Kuperberg, Denis","last_name":"Kuperberg","first_name":"Denis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"},{"full_name":"Skrzypczak, Michał","first_name":"Michał","last_name":"Skrzypczak"}],"intvolume":"      7966","publist_id":"5823","publication_status":"published","department":[{"_id":"ToHe"}],"series_title":"Lecture Notes in Computer Science","ec_funded":1,"date_published":"2013-07-01T00:00:00Z","article_processing_charge":"No","acknowledgement":"and ERC Grant QUALITY.","file":[{"relation":"main_file","access_level":"open_access","file_name":"2013_ICALP_Boker.pdf","date_created":"2020-05-15T11:05:50Z","date_updated":"2020-07-14T12:44:48Z","file_id":"7857","creator":"dernst","content_type":"application/pdf","checksum":"98bc02e3793072e279ec8d364b381ff3","file_size":276982}],"doi":"10.1007/978-3-642-39212-2_11","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:48Z","ddc":["000"],"scopus_import":1,"alternative_title":["LNCS"],"title":"Nondeterminism in the presence of a diverse or unknown future","quality_controlled":"1","_id":"1387","publisher":"Springer","day":"01","page":"89 - 100","oa":1,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":7966,"type":"conference","date_updated":"2020-08-11T10:09:09Z","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."}],"language":[{"iso":"eng"}],"citation":{"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.","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>","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>.","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.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","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>","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>."},"issue":"PART 2","conference":{"start_date":"2013-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","location":"Riga, Latvia"},"has_accepted_license":"1"},{"publication_status":"published","page":"1147 - 1168","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.2375"}],"date_published":"2013-01-01T00:00:00Z","year":"2013","status":"public","_id":"1442","month":"01","date_created":"2018-12-11T11:52:02Z","day":"01","publisher":"Princeton University Press","extern":1,"author":[{"first_name":"Tamas","last_name":"Hausel","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Letellier, Emmanuel","first_name":"Emmanuel","last_name":"Letellier"},{"full_name":"Rodríguez Villegas, Fernando","last_name":"Rodríguez Villegas","first_name":"Fernando"}],"publist_id":"5754","intvolume":"       177","citation":{"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>","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177 (2013) 1147–1168.","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>.","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.","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>.","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.","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>"},"doi":"10.4007/annals.2013.177.3.8","issue":"3","title":"Positivity for Kac polynomials and DT-invariants of quivers","quality_controlled":0,"oa":1,"volume":177,"type":"journal_article","date_updated":"2021-01-12T06:50:47Z","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.","abstract":[{"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.","lang":"eng"}],"publication":"Annals of Mathematics"},{"publisher":"International Press","day":"15","date_created":"2018-12-11T11:52:03Z","intvolume":"        25","publist_id":"5753","extern":1,"author":[{"last_name":"Hausel","first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"year":"2013","month":"03","_id":"1443","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1102.1717","open_access":"1"}],"date_published":"2013-03-15T00:00:00Z","page":"29 - 70","publication_status":"published","date_updated":"2021-01-12T06:50:47Z","publication":"Handbook of Moduli: Volume II","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."}],"oa":1,"type":"book_chapter","volume":25,"alternative_title":["Advanced Lectures in Mathematics"],"quality_controlled":0,"title":"Global topology of the Hitchin system","citation":{"ista":"Hausel T. 2013.Global topology of the Hitchin system. In: Handbook of Moduli: Volume II. Advanced Lectures in Mathematics, vol. 25, 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.","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.","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.","ama":"Hausel T. Global topology of the Hitchin system. In: <i>Handbook of Moduli: Volume II</i>. Vol 25. International Press; 2013:29-70.","short":"T. Hausel, in:, Handbook of Moduli: Volume II, International Press, 2013, pp. 29–70.","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."}},{"title":"Arithmetic harmonic analysis on character and quiver varieties II","quality_controlled":0,"citation":{"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.","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.","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>.","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>","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>","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Advances in Mathematics 234 (2013) 85–128.","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>."},"doi":"10.1016/j.aim.2012.10.009","abstract":[{"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.","lang":"eng"}],"publication":"Advances in Mathematics","date_updated":"2021-01-12T06:50:57Z","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.","volume":234,"type":"journal_article","date_published":"2013-02-15T00:00:00Z","publication_status":"published","page":"85 - 128","author":[{"full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas","last_name":"Hausel"},{"first_name":"Emmanuel","last_name":"Letellier","full_name":"Letellier, Emmanuel"},{"last_name":"Rodríguez Villegas","first_name":"Fernando","full_name":"Rodríguez Villegas, Fernando"}],"extern":1,"intvolume":"       234","publist_id":"5724","date_created":"2018-12-11T11:52:12Z","publisher":"Academic Press","day":"15","status":"public","month":"02","_id":"1469","year":"2013"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1012.2583"}],"date_published":"2013-01-01T00:00:00Z","publication_status":"published","page":"23 - 38","date_created":"2018-12-11T11:52:12Z","day":"01","publisher":"Worldwide Center of Mathematics","extern":1,"author":[{"last_name":"De Cataldo","first_name":"Mark","full_name":"De Cataldo, Mark A"},{"first_name":"Tamas","last_name":"Hausel","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Luca","last_name":"Migliorini","full_name":"Migliorini, Luca"}],"intvolume":"         7","publist_id":"5725","year":"2013","status":"public","_id":"1470","month":"01","title":"Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces","quality_controlled":0,"citation":{"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.","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>.","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.","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>","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>","short":"M. De Cataldo, T. Hausel, L. Migliorini, Journal of Singularities 7 (2013) 23–38.","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>."},"doi":"10.5427/jsing.2013.7c","date_updated":"2021-01-12T06:50:58Z","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\"","abstract":[{"lang":"eng","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."}],"publication":"Journal of Singularities","oa":1,"volume":7,"type":"journal_article"},{"title":"Experimental realization of non-Abelian non-adiabatic geometric gates","quality_controlled":0,"issue":"7446","citation":{"apa":"Abdumalikov, A., Fink, J. M., Juliusson, K., Pechal, M., Berger, S., Wallraff, A., &#38; Filipp, S. (2013). Experimental realization of non-Abelian non-adiabatic geometric gates. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature12010\">https://doi.org/10.1038/nature12010</a>","ieee":"A. Abdumalikov <i>et al.</i>, “Experimental realization of non-Abelian non-adiabatic geometric gates,” <i>Nature</i>, vol. 496, no. 7446. Nature Publishing Group, pp. 482–485, 2013.","chicago":"Abdumalikov, Abdufarrukh, Johannes M Fink, K Juliusson, M Pechal, Stefan Berger, Andreas Wallraff, and Stefan Filipp. “Experimental Realization of Non-Abelian Non-Adiabatic Geometric Gates.” <i>Nature</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/nature12010\">https://doi.org/10.1038/nature12010</a>.","ista":"Abdumalikov A, Fink JM, Juliusson K, Pechal M, Berger S, Wallraff A, Filipp S. 2013. Experimental realization of non-Abelian non-adiabatic geometric gates. Nature. 496(7446), 482–485.","mla":"Abdumalikov, Abdufarrukh, et al. “Experimental Realization of Non-Abelian Non-Adiabatic Geometric Gates.” <i>Nature</i>, vol. 496, no. 7446, Nature Publishing Group, 2013, pp. 482–85, doi:<a href=\"https://doi.org/10.1038/nature12010\">10.1038/nature12010</a>.","short":"A. Abdumalikov, J.M. Fink, K. Juliusson, M. Pechal, S. Berger, A. Wallraff, S. Filipp, Nature 496 (2013) 482–485.","ama":"Abdumalikov A, Fink JM, Juliusson K, et al. Experimental realization of non-Abelian non-adiabatic geometric gates. <i>Nature</i>. 2013;496(7446):482-485. doi:<a href=\"https://doi.org/10.1038/nature12010\">10.1038/nature12010</a>"},"doi":"10.1038/nature12010","abstract":[{"text":"The geometric aspects of quantum mechanics are emphasized most prominently by the concept of geometric phases, which are acquired whenever a quantum system evolves along a path in Hilbert space, that is, the space of quantum states of the system. The geometric phase is determined only by the shape of this path and is, in its simplest form, a real number. However, if the system has degenerate energy levels, then matrix-valued geometric state transformations, known as non-Abelian holonomies-the effect of which depends on the order of two consecutive paths-can be obtained. They are important, for example, for the creation of synthetic gauge fields in cold atomic gases or the description of non-Abelian anyon statistics. Moreover, there are proposals to exploit non-Abelian holonomic gates for the purposes of noise-resilient quantum computation. In contrast to Abelian geometric operations, non-Abelian ones have been observed only in nuclear quadrupole resonance experiments with a large number of spins, and without full characterization of the geometric process and its non-commutative nature. Here we realize non-Abelian non-adiabatic holonomic quantum operations on a single, superconducting, artificial three-level atom by applying a well-controlled, two-tone microwave drive. Using quantum process tomography, we determine fidelities of the resulting non-commuting gates that exceed 95 per cent. We show that two different quantum gates, originating from two distinct paths in Hilbert space, yield non-equivalent transformations when applied in different orders. This provides evidence for the non-Abelian character of the implemented holonomic quantum operations. In combination with a non-trivial two-quantum-bit gate, our method suggests a way to universal holonomic quantum computing.","lang":"eng"}],"publication":"Nature","date_updated":"2021-01-12T06:53:11Z","acknowledgement":"This work is supported financially by GEOMDISS, the Swiss National Science Foundation and ETH Zurich","volume":496,"type":"journal_article","date_published":"2013-04-25T00:00:00Z","page":"482 - 485","publication_status":"published","author":[{"full_name":"Abdumalikov, Abdufarrukh A","first_name":"Abdufarrukh","last_name":"Abdumalikov"},{"full_name":"Johannes Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","last_name":"Fink","first_name":"Johannes M"},{"full_name":"Juliusson, K","last_name":"Juliusson","first_name":"K"},{"first_name":"M","last_name":"Pechal","full_name":"Pechal, M"},{"full_name":"Berger, Stefan T","last_name":"Berger","first_name":"Stefan"},{"first_name":"Andreas","last_name":"Wallraff","full_name":"Wallraff, Andreas"},{"full_name":"Filipp, Stefan","last_name":"Filipp","first_name":"Stefan"}],"extern":1,"intvolume":"       496","publist_id":"5329","date_created":"2018-12-11T11:54:00Z","publisher":"Nature Publishing Group","day":"25","status":"public","_id":"1785","month":"04","year":"2013"},{"intvolume":"       110","publist_id":"5328","extern":1,"author":[{"last_name":"Nissen","first_name":"Felix","full_name":"Nissen, Felix"},{"first_name":"Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Johannes Fink"},{"full_name":"Mlynek, Jonas A","last_name":"Mlynek","first_name":"Jonas"},{"last_name":"Wallraff","first_name":"Andreas","full_name":"Wallraff, Andreas"},{"last_name":"Keeling","first_name":"Jonathan","full_name":"Keeling, Jonathan M"}],"publisher":"American Physical Society","day":"15","date_created":"2018-12-11T11:54:00Z","_id":"1786","month":"05","status":"public","year":"2013","date_published":"2013-05-15T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1302.0665","open_access":"1"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We report the experimental observation and a theoretical explanation of collective suppression of linewidths for multiple superconducting qubits coupled to a good cavity. This demonstrates how strong qubit-cavity coupling can significantly modify the dephasing and dissipation processes that might be expected for individual qubits, and can potentially improve coherence times in many-body circuit QED."}],"publication":"Physical Review Letters","acknowledgement":"J. K. acknowledges financial support from EPSRC program “TOPNES” (EP/I031014/1) and EPSRC (EP/G004714/2)","date_updated":"2021-01-12T06:53:11Z","volume":110,"type":"journal_article","oa":1,"quality_controlled":0,"title":"Collective suppression of linewidths in circuit QED","issue":"20","doi":"10.1103/PhysRevLett.110.203602","citation":{"mla":"Nissen, Felix, et al. “Collective Suppression of Linewidths in Circuit QED.” <i>Physical Review Letters</i>, vol. 110, no. 20, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.203602\">10.1103/PhysRevLett.110.203602</a>.","short":"F. Nissen, J.M. Fink, J. Mlynek, A. Wallraff, J. Keeling, Physical Review Letters 110 (2013).","ama":"Nissen F, Fink JM, Mlynek J, Wallraff A, Keeling J. Collective suppression of linewidths in circuit QED. <i>Physical Review Letters</i>. 2013;110(20). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.203602\">10.1103/PhysRevLett.110.203602</a>","apa":"Nissen, F., Fink, J. M., Mlynek, J., Wallraff, A., &#38; Keeling, J. (2013). Collective suppression of linewidths in circuit QED. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.110.203602\">https://doi.org/10.1103/PhysRevLett.110.203602</a>","chicago":"Nissen, Felix, Johannes M Fink, Jonas Mlynek, Andreas Wallraff, and Jonathan Keeling. “Collective Suppression of Linewidths in Circuit QED.” <i>Physical Review Letters</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevLett.110.203602\">https://doi.org/10.1103/PhysRevLett.110.203602</a>.","ieee":"F. Nissen, J. M. Fink, J. Mlynek, A. Wallraff, and J. Keeling, “Collective suppression of linewidths in circuit QED,” <i>Physical Review Letters</i>, vol. 110, no. 20. American Physical Society, 2013.","ista":"Nissen F, Fink JM, Mlynek J, Wallraff A, Keeling J. 2013. Collective suppression of linewidths in circuit QED. Physical Review Letters. 110(20)."}},{"publication_status":"published","page":"345 - 348","date_published":"2013-06-01T00:00:00Z","year":"2013","status":"public","month":"06","_id":"1787","date_created":"2018-12-11T11:54:00Z","day":"01","publisher":"Nature Publishing Group","author":[{"full_name":"Lang, C","last_name":"Lang","first_name":"C"},{"full_name":"Eichler, Christopher","first_name":"Christopher","last_name":"Eichler"},{"first_name":"L.","last_name":"Steffen","full_name":"Steffen, L. Kraig"},{"orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Johannes Fink","first_name":"Johannes M","last_name":"Fink"},{"full_name":"Woolley, Matthew J","last_name":"Woolley","first_name":"Matthew"},{"first_name":"Alexandre","last_name":"Blais","full_name":"Blais, Alexandre"},{"last_name":"Wallraff","first_name":"Andreas","full_name":"Wallraff, Andreas"}],"extern":1,"intvolume":"         9","publist_id":"5327","doi":"10.1038/nphys2612","citation":{"ista":"Lang C, Eichler C, Steffen L, Fink JM, Woolley M, Blais A, Wallraff A. 2013. Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies. Nature Physics. 9(6), 345–348.","apa":"Lang, C., Eichler, C., Steffen, L., Fink, J. M., Woolley, M., Blais, A., &#38; Wallraff, A. (2013). Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies. <i>Nature Physics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nphys2612\">https://doi.org/10.1038/nphys2612</a>","ieee":"C. Lang <i>et al.</i>, “Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies,” <i>Nature Physics</i>, vol. 9, no. 6. Nature Publishing Group, pp. 345–348, 2013.","chicago":"Lang, C, Christopher Eichler, L. Steffen, Johannes M Fink, Matthew Woolley, Alexandre Blais, and Andreas Wallraff. “Correlations, Indistinguishability and Entanglement in Hong-Ou-Mandel Experiments at Microwave Frequencies.” <i>Nature Physics</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/nphys2612\">https://doi.org/10.1038/nphys2612</a>.","short":"C. Lang, C. Eichler, L. Steffen, J.M. Fink, M. Woolley, A. Blais, A. Wallraff, Nature Physics 9 (2013) 345–348.","ama":"Lang C, Eichler C, Steffen L, et al. Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies. <i>Nature Physics</i>. 2013;9(6):345-348. doi:<a href=\"https://doi.org/10.1038/nphys2612\">10.1038/nphys2612</a>","mla":"Lang, C., et al. “Correlations, Indistinguishability and Entanglement in Hong-Ou-Mandel Experiments at Microwave Frequencies.” <i>Nature Physics</i>, vol. 9, no. 6, Nature Publishing Group, 2013, pp. 345–48, doi:<a href=\"https://doi.org/10.1038/nphys2612\">10.1038/nphys2612</a>."},"issue":"6","title":"Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies","quality_controlled":0,"type":"journal_article","volume":9,"date_updated":"2021-01-12T06:53:11Z","acknowledgement":"This work was supported by the European Research Council (ERC) through a Starting Grant and by ETHZ. L.S. was supported by EU IP SOLID. A.B. and M.J.W. were supported by NSERC, CIFAR and the Alfred P. Sloan Foundation","abstract":[{"text":"When two indistinguishable single photons impinge at the two inputs of a beam splitter they coalesce into a pair of photons appearing in either one of its two outputs. This effect is due to the bosonic nature of photons and was first experimentally observed by Hong, Ou and Mandel. Here, we present the observation of the Hong-Ou-Mandel effect with two independent single-photon sources in the microwave frequency domain. We probe the indistinguishability of single photons, created with a controllable delay, in time-resolved second-order cross- and auto-correlation function measurements. Using quadrature amplitude detection we are able to resolve different photon numbers and detect coherence in and between the output arms. This scheme allows us to fully characterize the two-mode entanglement of the spatially separated beam-splitter output modes. Our experiments constitute a first step towards using two-photon interference at microwave frequencies for quantum communication and information processing.","lang":"eng"}],"publication":"Nature Physics"}]