[{"type":"journal_article","status":"public","doi":"10.1103/physrevd.96.023004","date_created":"2024-09-06T08:52:28Z","issue":"2","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1705.06765"}],"author":[{"full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"}],"quality_controlled":"1","external_id":{"arxiv":["1705.06765"]},"year":"2017","intvolume":"        96","article_number":"023004","abstract":[{"text":"The gravitational waves (GWs) from a binary black hole (BBH) with masses between 10^4 and 10^7 Msun can be detected with the Laser Interferometer Space Antenna (LISA) once their orbital frequency exceeds 10^-4 - 10^-5 Hz. The binary separation at this stage is approximately a=100 R_g (gravitational radius), and the orbital speed is of order v/c=0.1. We argue that at this stage, the binary will be producing bright electromagnetic (EM) radiation via gas bound to the individual BHs. Both BHs will have their own photospheres in X-ray and possibly also in optical bands. Relativistic Doppler modulations and lensing effects will inevitably imprint periodic variability in the EM light-curve, tracking the phase of the orbital motion, and serving as a template for the GW inspiral waveform. Advanced localization of the source by LISA weeks to months prior to merger will enable a measurement of this EM chirp by wide-field X-ray or optical instruments. A comparison of the phases of the GW and EM chirp signals will help break degeneracies between system parameters, and probe a fractional difference difference Delta v in the propagation speed of photons and gravitons as low as Delta v/c = O(10^-17).","lang":"eng"}],"date_updated":"2024-09-25T11:53:53Z","title":"Electromagnetic chirp of a compact binary black hole: A phase template for the gravitational wave inspiral","day":"14","language":[{"iso":"eng"}],"oa_version":"Preprint","oa":1,"extern":"1","arxiv":1,"publication":"Physical Review D","_id":"17707","publication_identifier":{"issn":["2470-0010","2470-0029"]},"fulldoi":"https://doi.org/10.1103/physrevd.96.023004","scopus_import":"1","publisher":"American Physical Society","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","publication_status":"published","date_published":"2017-07-14T00:00:00Z","month":"07","volume":96,"citation":{"apa":"Haiman, Z. (2017). Electromagnetic chirp of a compact binary black hole: A phase template for the gravitational wave inspiral. <i>Physical Review D</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevd.96.023004\">https://doi.org/10.1103/physrevd.96.023004</a>","ista":"Haiman Z. 2017. Electromagnetic chirp of a compact binary black hole: A phase template for the gravitational wave inspiral. Physical Review D. 96(2), 023004.","mla":"Haiman, Zoltán. “Electromagnetic Chirp of a Compact Binary Black Hole: A Phase Template for the Gravitational Wave Inspiral.” <i>Physical Review D</i>, vol. 96, no. 2, 023004, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/physrevd.96.023004\">10.1103/physrevd.96.023004</a>.","short":"Z. Haiman, Physical Review D 96 (2017).","ieee":"Z. Haiman, “Electromagnetic chirp of a compact binary black hole: A phase template for the gravitational wave inspiral,” <i>Physical Review D</i>, vol. 96, no. 2. American Physical Society, 2017.","ama":"Haiman Z. Electromagnetic chirp of a compact binary black hole: A phase template for the gravitational wave inspiral. <i>Physical Review D</i>. 2017;96(2). doi:<a href=\"https://doi.org/10.1103/physrevd.96.023004\">10.1103/physrevd.96.023004</a>","chicago":"Haiman, Zoltán. “Electromagnetic Chirp of a Compact Binary Black Hole: A Phase Template for the Gravitational Wave Inspiral.” <i>Physical Review D</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/physrevd.96.023004\">https://doi.org/10.1103/physrevd.96.023004</a>."},"article_processing_charge":"No"},{"fulldoi":"https://doi.org/10.1103/physrevd.96.023513","publisher":"American Physical Society","scopus_import":"1","publication":"Physical Review D","_id":"17708","publication_identifier":{"issn":["2470-0010","2470-0029"]},"arxiv":1,"oa":1,"extern":"1","article_processing_charge":"No","volume":96,"citation":{"ieee":"J. M. Z. Matilla, Z. Haiman, A. Petri, and T. Namikawa, “Geometry and growth contributions to cosmic shear observables,” <i>Physical Review D</i>, vol. 96, no. 2. American Physical Society, 2017.","apa":"Matilla, J. M. Z., Haiman, Z., Petri, A., &#38; Namikawa, T. (2017). Geometry and growth contributions to cosmic shear observables. <i>Physical Review D</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevd.96.023513\">https://doi.org/10.1103/physrevd.96.023513</a>","ista":"Matilla JMZ, Haiman Z, Petri A, Namikawa T. 2017. Geometry and growth contributions to cosmic shear observables. Physical Review D. 96(2), 023513.","mla":"Matilla, José Manuel Zorrilla, et al. “Geometry and Growth Contributions to Cosmic Shear Observables.” <i>Physical Review D</i>, vol. 96, no. 2, 023513, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/physrevd.96.023513\">10.1103/physrevd.96.023513</a>.","short":"J.M.Z. Matilla, Z. Haiman, A. Petri, T. Namikawa, Physical Review D 96 (2017).","ama":"Matilla JMZ, Haiman Z, Petri A, Namikawa T. Geometry and growth contributions to cosmic shear observables. <i>Physical Review D</i>. 2017;96(2). doi:<a href=\"https://doi.org/10.1103/physrevd.96.023513\">10.1103/physrevd.96.023513</a>","chicago":"Matilla, José Manuel Zorrilla, Zoltán Haiman, Andrea Petri, and Toshiya Namikawa. “Geometry and Growth Contributions to Cosmic Shear Observables.” <i>Physical Review D</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/physrevd.96.023513\">https://doi.org/10.1103/physrevd.96.023513</a>."},"date_published":"2017-07-13T00:00:00Z","publication_status":"published","month":"07","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","author":[{"first_name":"José Manuel Zorrilla","last_name":"Matilla","full_name":"Matilla, José Manuel Zorrilla"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","last_name":"Haiman","full_name":"Haiman, Zoltán"},{"first_name":"Andrea","last_name":"Petri","full_name":"Petri, Andrea"},{"full_name":"Namikawa, Toshiya","last_name":"Namikawa","first_name":"Toshiya"}],"date_created":"2024-09-06T08:53:13Z","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1706.05133"}],"issue":"2","type":"journal_article","doi":"10.1103/physrevd.96.023513","status":"public","day":"13","title":"Geometry and growth contributions to cosmic shear observables","date_updated":"2024-09-25T11:57:15Z","language":[{"iso":"eng"}],"oa_version":"Preprint","intvolume":"        96","article_number":"023513","abstract":[{"text":"We explore the sensitivity of weak lensing observables to the expansion history of the universe and to the growth of cosmic structures, as well as the relative contribution of both effects to constraining cosmological parameters. We utilize ray-tracing dark-matter-only N-body simulations and validate our technique by comparing our results for the convergence power spectrum with analytic results from past studies. We then extend our analysis to non-Gaussian observables which cannot be easily treated analytically. We study the convergence (equilateral) bispectrum and two topological observables, lensing peaks and Minkowski functionals, focusing on their sensitivity to the matter density Ωm and the dark energy equation of state w. We find that a cancelation between the geometry and growth effects is a common feature for all observables, and exists at the map level. It weakens the overall sensitivity by up to a factor of 3 and 1.5 for w and Ωm, respectively, with the bispectrum worst affected. However, combining geometry and growth information alleviates the degeneracy between Ωm and w from either effect alone. As a result, the magnitude of marginalized errors remain similar to those obtained from growth-only effects, but with the correlation between the two parameters switching sign. These results shed light on the origin of cosmology-sensitivity of non-Gaussian statistics, and should be useful in optimizing combinations of observables.","lang":"eng"}],"external_id":{"arxiv":["1706.05133"]},"year":"2017","quality_controlled":"1"},{"abstract":[{"text":"The recent discovery of gravitational waves from stellar-mass binary black hole mergers by the Laser Interferometer Gravitational-wave Observatory opened the door to alternative probes of stellar and galactic evolution, cosmology and fundamental physics. Probing the origin of binary black hole mergers will be difficult due to the expected lack of electromagnetic emission and limited localization accuracy. Associations with rare host galaxy types—such as active galactic nuclei—can nevertheless be identified statistically through spatial correlation. Here we establish the feasibility of statistically proving the connection between binary black hole mergers and active galactic nuclei as hosts, even if only a sub-population of mergers originate from active galactic nuclei. Our results are the demonstration that the limited localization of gravitational waves, previously written off as not useful to distinguish progenitor channels, can in fact contribute key information, broadening the range of astrophysical questions probed by binary black hole observations.","lang":"eng"}],"article_number":"831","intvolume":"         8","language":[{"iso":"eng"}],"oa_version":"Published Version","day":"10","date_updated":"2024-09-25T12:11:24Z","title":"Gravitational-wave localization alone can probe origin of stellar-mass black hole mergers","quality_controlled":"1","year":"2017","main_file_link":[{"url":"https://doi.org/10.1038/s41467-017-00851-7","open_access":"1"}],"issue":"1","date_created":"2024-09-06T08:55:48Z","author":[{"last_name":"Bartos","first_name":"I.","full_name":"Bartos, I."},{"full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"full_name":"Marka, Z.","first_name":"Z.","last_name":"Marka"},{"first_name":"B. D.","last_name":"Metzger","full_name":"Metzger, B. D."},{"last_name":"Stone","first_name":"N. C.","full_name":"Stone, N. C."},{"full_name":"Marka, S.","last_name":"Marka","first_name":"S."}],"doi":"10.1038/s41467-017-00851-7","status":"public","type":"journal_article","citation":{"mla":"Bartos, I., et al. “Gravitational-Wave Localization Alone Can Probe Origin of Stellar-Mass Black Hole Mergers.” <i>Nature Communications</i>, vol. 8, no. 1, 831, Springer Science and Business Media LLC, 2017, doi:<a href=\"https://doi.org/10.1038/s41467-017-00851-7\">10.1038/s41467-017-00851-7</a>.","apa":"Bartos, I., Haiman, Z., Marka, Z., Metzger, B. D., Stone, N. C., &#38; Marka, S. (2017). Gravitational-wave localization alone can probe origin of stellar-mass black hole mergers. <i>Nature Communications</i>. Springer Science and Business Media LLC. <a href=\"https://doi.org/10.1038/s41467-017-00851-7\">https://doi.org/10.1038/s41467-017-00851-7</a>","ista":"Bartos I, Haiman Z, Marka Z, Metzger BD, Stone NC, Marka S. 2017. Gravitational-wave localization alone can probe origin of stellar-mass black hole mergers. Nature Communications. 8(1), 831.","short":"I. Bartos, Z. Haiman, Z. Marka, B.D. Metzger, N.C. Stone, S. Marka, Nature Communications 8 (2017).","ieee":"I. Bartos, Z. Haiman, Z. Marka, B. D. Metzger, N. C. Stone, and S. Marka, “Gravitational-wave localization alone can probe origin of stellar-mass black hole mergers,” <i>Nature Communications</i>, vol. 8, no. 1. Springer Science and Business Media LLC, 2017.","chicago":"Bartos, I., Zoltán Haiman, Z. Marka, B. D. Metzger, N. C. Stone, and S. Marka. “Gravitational-Wave Localization Alone Can Probe Origin of Stellar-Mass Black Hole Mergers.” <i>Nature Communications</i>. Springer Science and Business Media LLC, 2017. <a href=\"https://doi.org/10.1038/s41467-017-00851-7\">https://doi.org/10.1038/s41467-017-00851-7</a>.","ama":"Bartos I, Haiman Z, Marka Z, Metzger BD, Stone NC, Marka S. Gravitational-wave localization alone can probe origin of stellar-mass black hole mergers. <i>Nature Communications</i>. 2017;8(1). doi:<a href=\"https://doi.org/10.1038/s41467-017-00851-7\">10.1038/s41467-017-00851-7</a>"},"volume":8,"article_processing_charge":"No","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"10","date_published":"2017-10-10T00:00:00Z","publication_status":"published","_id":"17711","publication_identifier":{"issn":["2041-1723"]},"publication":"Nature Communications","scopus_import":"1","publisher":"Springer Science and Business Media LLC","fulldoi":"https://doi.org/10.1038/s41467-017-00851-7","extern":"1","oa":1},{"issue":"6","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1702.06529","open_access":"1"}],"date_created":"2024-09-06T08:56:32Z","author":[{"full_name":"Inayoshi, Kohei","first_name":"Kohei","last_name":"Inayoshi"},{"last_name":"Tamanini","first_name":"Nicola","full_name":"Tamanini, Nicola"},{"full_name":"Caprini, Chiara","last_name":"Caprini","first_name":"Chiara"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","last_name":"Haiman","full_name":"Haiman, Zoltán"}],"doi":"10.1103/physrevd.96.063014","status":"public","type":"journal_article","abstract":[{"text":"Multi-frequency gravitational wave (GW) observations are useful probes of the formation processes of coalescing stellar-mass binary black holes (BBHs). We discuss the phase drift in the GW inspiral waveform of the merging BBH caused by its center-of-mass acceleration. The acceleration strongly depends on the location where a BBH forms within a galaxy, allowing observations of the early inspiral phase of LIGO-like BBH mergers by the Laser Interferometer Space Antenna (LISA) to test the formation mechanism. In particular, BBHs formed in dense nuclear star clusters or via compact accretion disks around a nuclear supermassive black hole in active galactic nuclei would suffer strong acceleration, and produce large phase drifts measurable by LISA. The host galaxies of the coalescing BBHs in these scenarios can also be uniquely identified in the LISA error volume, without electromagnetic counterparts. A non-detection of phase drifts would rule out or constrain the contribution of the nuclear formation channels to the stellar-mass BBH population.","lang":"eng"}],"article_number":"063014","intvolume":"        96","language":[{"iso":"eng"}],"oa_version":"Preprint","title":"Probing stellar binary black hole formation in galactic nuclei via the imprint of their center of mass acceleration on their gravitational wave signal","date_updated":"2024-09-25T12:15:34Z","day":"25","quality_controlled":"1","year":"2017","external_id":{"arxiv":["1702.06529"]},"_id":"17712","publication_identifier":{"issn":["2470-0010","2470-0029"]},"publication":"Physical Review D","publisher":"American Physical Society ","scopus_import":"1","fulldoi":"https://doi.org/10.1103/physrevd.96.063014","extern":"1","oa":1,"arxiv":1,"citation":{"ama":"Inayoshi K, Tamanini N, Caprini C, Haiman Z. Probing stellar binary black hole formation in galactic nuclei via the imprint of their center of mass acceleration on their gravitational wave signal. <i>Physical Review D</i>. 2017;96(6). doi:<a href=\"https://doi.org/10.1103/physrevd.96.063014\">10.1103/physrevd.96.063014</a>","chicago":"Inayoshi, Kohei, Nicola Tamanini, Chiara Caprini, and Zoltán Haiman. “Probing Stellar Binary Black Hole Formation in Galactic Nuclei via the Imprint of Their Center of Mass Acceleration on Their Gravitational Wave Signal.” <i>Physical Review D</i>. American Physical Society , 2017. <a href=\"https://doi.org/10.1103/physrevd.96.063014\">https://doi.org/10.1103/physrevd.96.063014</a>.","ieee":"K. Inayoshi, N. Tamanini, C. Caprini, and Z. Haiman, “Probing stellar binary black hole formation in galactic nuclei via the imprint of their center of mass acceleration on their gravitational wave signal,” <i>Physical Review D</i>, vol. 96, no. 6. American Physical Society , 2017.","ista":"Inayoshi K, Tamanini N, Caprini C, Haiman Z. 2017. Probing stellar binary black hole formation in galactic nuclei via the imprint of their center of mass acceleration on their gravitational wave signal. Physical Review D. 96(6), 063014.","apa":"Inayoshi, K., Tamanini, N., Caprini, C., &#38; Haiman, Z. (2017). Probing stellar binary black hole formation in galactic nuclei via the imprint of their center of mass acceleration on their gravitational wave signal. <i>Physical Review D</i>. American Physical Society . <a href=\"https://doi.org/10.1103/physrevd.96.063014\">https://doi.org/10.1103/physrevd.96.063014</a>","mla":"Inayoshi, Kohei, et al. “Probing Stellar Binary Black Hole Formation in Galactic Nuclei via the Imprint of Their Center of Mass Acceleration on Their Gravitational Wave Signal.” <i>Physical Review D</i>, vol. 96, no. 6, 063014, American Physical Society , 2017, doi:<a href=\"https://doi.org/10.1103/physrevd.96.063014\">10.1103/physrevd.96.063014</a>.","short":"K. Inayoshi, N. Tamanini, C. Caprini, Z. Haiman, Physical Review D 96 (2017)."},"volume":96,"article_processing_charge":"No","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","publication_status":"published","date_published":"2017-09-25T00:00:00Z"},{"article_processing_charge":"Yes","volume":3,"citation":{"ieee":"X. Yin <i>et al.</i>, “A reversible single-molecule switch based on activated antiaromaticity,” <i>Science Advances</i>, vol. 3, no. 10. American Association for the Advancement of Science, 2017.","ista":"Yin X, Zang Y, Zhu L, Low JZ, Liu Z-F, Cui J, Neaton JB, Venkataraman L, Campos LM. 2017. A reversible single-molecule switch based on activated antiaromaticity. Science Advances. 3(10), aao2615.","apa":"Yin, X., Zang, Y., Zhu, L., Low, J. Z., Liu, Z.-F., Cui, J., … Campos, L. M. (2017). A reversible single-molecule switch based on activated antiaromaticity. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.aao2615\">https://doi.org/10.1126/sciadv.aao2615</a>","mla":"Yin, Xiaodong, et al. “A Reversible Single-Molecule Switch Based on Activated Antiaromaticity.” <i>Science Advances</i>, vol. 3, no. 10, aao2615, American Association for the Advancement of Science, 2017, doi:<a href=\"https://doi.org/10.1126/sciadv.aao2615\">10.1126/sciadv.aao2615</a>.","short":"X. Yin, Y. Zang, L. Zhu, J.Z. Low, Z.-F. Liu, J. Cui, J.B. Neaton, L. Venkataraman, L.M. Campos, Science Advances 3 (2017).","chicago":"Yin, Xiaodong, Yaping Zang, Liangliang Zhu, Jonathan Z. Low, Zhen-Fei Liu, Jing Cui, Jeffrey B. Neaton, Latha Venkataraman, and Luis M. Campos. “A Reversible Single-Molecule Switch Based on Activated Antiaromaticity.” <i>Science Advances</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/sciadv.aao2615\">https://doi.org/10.1126/sciadv.aao2615</a>.","ama":"Yin X, Zang Y, Zhu L, et al. A reversible single-molecule switch based on activated antiaromaticity. <i>Science Advances</i>. 2017;3(10). doi:<a href=\"https://doi.org/10.1126/sciadv.aao2615\">10.1126/sciadv.aao2615</a>"},"publication_status":"published","date_published":"2017-10-01T00:00:00Z","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1126/sciadv.abq0115"}]},"article_type":"original","fulldoi":"https://doi.org/10.1126/sciadv.aao2615","scopus_import":"1","publisher":"American Association for the Advancement of Science","publication":"Science Advances","_id":"17949","publication_identifier":{"eissn":["2375-2548"]},"OA_place":"publisher","oa":1,"extern":"1","title":"A reversible single-molecule switch based on activated antiaromaticity","date_updated":"2024-12-18T07:54:32Z","day":"01","oa_version":"Published Version","language":[{"iso":"eng"}],"intvolume":"         3","DOAJ_listed":"1","abstract":[{"lang":"eng","text":"Single-molecule electronic devices provide researchers with an unprecedented ability to relate novel physical phenomena to molecular chemical structures. Typically, conjugated aromatic molecular backbones are relied upon to create electronic devices, where the aromaticity of the building blocks is used to enhance conductivity. We capitalize on the classical physical organic chemistry concept of Hückel antiaromaticity by demonstrating a single-molecule switch that exhibits low conductance in the neutral state and, upon electrochemical oxidation, reversibly switches to an antiaromatic high-conducting structure. We form single-molecule devices using the scanning tunneling microscope–based break-junction technique and observe an on/off ratio of ~70 for a thiophenylidene derivative that switches to an antiaromatic state with 6-4-6-π electrons. Through supporting nuclear magnetic resonance measurements, we show that the doubly oxidized core has antiaromatic character and we use density functional theory calculations to rationalize the origin of the high-conductance state for the oxidized single-molecule junction. Together, our work demonstrates how the concept of antiaromaticity can be exploited to create single-molecule devices that are highly conducting."}],"article_number":"aao2615","year":"2017","quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nc/4.0/","author":[{"first_name":"Xiaodong","last_name":"Yin","full_name":"Yin, Xiaodong"},{"full_name":"Zang, Yaping","first_name":"Yaping","last_name":"Zang"},{"first_name":"Liangliang","last_name":"Zhu","full_name":"Zhu, Liangliang"},{"full_name":"Low, Jonathan Z.","first_name":"Jonathan Z.","last_name":"Low"},{"first_name":"Zhen-Fei","last_name":"Liu","full_name":"Liu, Zhen-Fei"},{"last_name":"Cui","first_name":"Jing","full_name":"Cui, Jing"},{"last_name":"Neaton","first_name":"Jeffrey B.","full_name":"Neaton, Jeffrey B."},{"full_name":"Venkataraman, Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha","orcid":"0000-0002-6957-6089","last_name":"Venkataraman"},{"first_name":"Luis M.","last_name":"Campos","full_name":"Campos, Luis M."}],"tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"date_created":"2024-09-09T09:12:08Z","issue":"10","main_file_link":[{"url":"https://doi.org/10.1126/sciadv.aao2615","open_access":"1"}],"type":"journal_article","status":"public","doi":"10.1126/sciadv.aao2615","OA_type":"gold"},{"doi":"10.1039/c7sc00599g","status":"public","OA_type":"gold","type":"journal_article","issue":"6","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/C7SC00599G"}],"date_created":"2024-09-09T09:17:08Z","author":[{"full_name":"Inkpen, Michael S.","last_name":"Inkpen","first_name":"Michael S."},{"full_name":"Leroux, Yann R.","last_name":"Leroux","first_name":"Yann R."},{"full_name":"Hapiot, Philippe","first_name":"Philippe","last_name":"Hapiot"},{"first_name":"Luis M.","last_name":"Campos","full_name":"Campos, Luis M."},{"orcid":"0000-0002-6957-6089","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha","full_name":"Venkataraman, Latha"}],"quality_controlled":"1","page":"4340-4346","year":"2017","external_id":{"pmid":["28660061"]},"DOAJ_listed":"1","abstract":[{"lang":"eng","text":"Whilst most studies in single-molecule electronics involve components first synthesized ex situ, there is also great potential in exploiting chemical transformations to prepare devices in situ. Here, as a first step towards this goal, we conduct reversible reactions on monolayers to make and break covalent bonds between alkanes of different lengths, then measure the conductance of these molecules connected between electrodes using the scanning tunneling microscopy-based break junction (STM-BJ) method. In doing so, we develop the critical methodology required for assembling and disassembling surface-bound single-molecule circuits. We identify effective reaction conditions for surface-bound reagents, and importantly demonstrate that the electronic characteristics of wires created in situ agree with those created ex situ. Finally, we show that the STM-BJ technique is unique in its ability to definitively probe surface reaction yields both on a local (∼50 nm2) and pseudo-global (≥10 mm2) level. This investigation thus highlights a route to the construction and integration of more complex, and ultimately functional, surface-based single-molecule circuitry, as well as advancing a methodology that facilitates studies beyond the reach of traditional ex situ synthetic approaches."}],"intvolume":"         8","language":[{"iso":"eng"}],"oa_version":"Published Version","title":"Reversible on-surface wiring of resistive circuits","date_updated":"2024-12-18T07:59:46Z","day":"07","extern":"1","oa":1,"OA_place":"publisher","pmid":1,"_id":"17950","publication_identifier":{"eissn":["2041-6539"],"issn":["2041-6520"]},"publication":"Chemical Science","scopus_import":"1","publisher":"Royal Society of Chemistry","fulldoi":"https://doi.org/10.1039/c7sc00599g","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","date_published":"2017-04-07T00:00:00Z","publication_status":"published","citation":{"ama":"Inkpen MS, Leroux YR, Hapiot P, Campos LM, Venkataraman L. Reversible on-surface wiring of resistive circuits. <i>Chemical Science</i>. 2017;8(6):4340-4346. doi:<a href=\"https://doi.org/10.1039/c7sc00599g\">10.1039/c7sc00599g</a>","chicago":"Inkpen, Michael S., Yann R. Leroux, Philippe Hapiot, Luis M. Campos, and Latha Venkataraman. “Reversible On-Surface Wiring of Resistive Circuits.” <i>Chemical Science</i>. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/c7sc00599g\">https://doi.org/10.1039/c7sc00599g</a>.","ieee":"M. S. Inkpen, Y. R. Leroux, P. Hapiot, L. M. Campos, and L. Venkataraman, “Reversible on-surface wiring of resistive circuits,” <i>Chemical Science</i>, vol. 8, no. 6. Royal Society of Chemistry, pp. 4340–4346, 2017.","apa":"Inkpen, M. S., Leroux, Y. R., Hapiot, P., Campos, L. M., &#38; Venkataraman, L. (2017). Reversible on-surface wiring of resistive circuits. <i>Chemical Science</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c7sc00599g\">https://doi.org/10.1039/c7sc00599g</a>","mla":"Inkpen, Michael S., et al. “Reversible On-Surface Wiring of Resistive Circuits.” <i>Chemical Science</i>, vol. 8, no. 6, Royal Society of Chemistry, 2017, pp. 4340–46, doi:<a href=\"https://doi.org/10.1039/c7sc00599g\">10.1039/c7sc00599g</a>.","ista":"Inkpen MS, Leroux YR, Hapiot P, Campos LM, Venkataraman L. 2017. Reversible on-surface wiring of resistive circuits. Chemical Science. 8(6), 4340–4346.","short":"M.S. Inkpen, Y.R. Leroux, P. Hapiot, L.M. Campos, L. Venkataraman, Chemical Science 8 (2017) 4340–4346."},"volume":8,"article_processing_charge":"Yes"},{"oa":1,"extern":"1","OA_place":"publisher","publication":"Chemical Science","_id":"17951","publication_identifier":{"issn":["2041-6520"],"eissn":["2041-6539"]},"fulldoi":"https://doi.org/10.1039/c6sc05283e","publisher":"Royal Society of Chemistry","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","date_published":"2017-02-28T00:00:00Z","publication_status":"published","month":"02","volume":8,"citation":{"chicago":"Low, Jonathan Z., Brian Capozzi, Jing Cui, Sujun Wei, Latha Venkataraman, and Luis M. Campos. “Tuning the Polarity of Charge Carriers Using Electron Deficient Thiophenes.” <i>Chemical Science</i>. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/c6sc05283e\">https://doi.org/10.1039/c6sc05283e</a>.","ama":"Low JZ, Capozzi B, Cui J, Wei S, Venkataraman L, Campos LM. Tuning the polarity of charge carriers using electron deficient thiophenes. <i>Chemical Science</i>. 2017;8(4):3254-3259. doi:<a href=\"https://doi.org/10.1039/c6sc05283e\">10.1039/c6sc05283e</a>","ieee":"J. Z. Low, B. Capozzi, J. Cui, S. Wei, L. Venkataraman, and L. M. Campos, “Tuning the polarity of charge carriers using electron deficient thiophenes,” <i>Chemical Science</i>, vol. 8, no. 4. Royal Society of Chemistry, pp. 3254–3259, 2017.","apa":"Low, J. Z., Capozzi, B., Cui, J., Wei, S., Venkataraman, L., &#38; Campos, L. M. (2017). Tuning the polarity of charge carriers using electron deficient thiophenes. <i>Chemical Science</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c6sc05283e\">https://doi.org/10.1039/c6sc05283e</a>","mla":"Low, Jonathan Z., et al. “Tuning the Polarity of Charge Carriers Using Electron Deficient Thiophenes.” <i>Chemical Science</i>, vol. 8, no. 4, Royal Society of Chemistry, 2017, pp. 3254–59, doi:<a href=\"https://doi.org/10.1039/c6sc05283e\">10.1039/c6sc05283e</a>.","ista":"Low JZ, Capozzi B, Cui J, Wei S, Venkataraman L, Campos LM. 2017. Tuning the polarity of charge carriers using electron deficient thiophenes. Chemical Science. 8(4), 3254–3259.","short":"J.Z. Low, B. Capozzi, J. Cui, S. Wei, L. Venkataraman, L.M. Campos, Chemical Science 8 (2017) 3254–3259."},"article_processing_charge":"Yes","type":"journal_article","status":"public","doi":"10.1039/c6sc05283e","OA_type":"gold","date_created":"2024-09-09T09:18:00Z","issue":"4","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/C6SC05283E"}],"author":[{"full_name":"Low, Jonathan Z.","last_name":"Low","first_name":"Jonathan Z."},{"full_name":"Capozzi, Brian","last_name":"Capozzi","first_name":"Brian"},{"full_name":"Cui, Jing","last_name":"Cui","first_name":"Jing"},{"first_name":"Sujun","last_name":"Wei","full_name":"Wei, Sujun"},{"orcid":"0000-0002-6957-6089","last_name":"Venkataraman","first_name":"Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","full_name":"Venkataraman, Latha"},{"full_name":"Campos, Luis M.","last_name":"Campos","first_name":"Luis M."}],"page":"3254-3259","quality_controlled":"1","year":"2017","intvolume":"         8","DOAJ_listed":"1","abstract":[{"text":"Thiophene-1,1-dioxide (TDO) oligomers have fascinating electronic properties. We previously used thermopower measurements to show that a change in charge carrier from hole to electron occurs with increasing length of TDO oligomers when single-molecule junctions are formed between gold electrodes. In this article, we show for the first time that the dominant conducting orbitals for thiophene/TDO oligomers of fixed length can be tuned by altering the strength of the electron acceptors incorporated into the backbone. We use the scanning tunneling microscope break-junction (STM-BJ) technique and apply a recently developed method to determine the dominant transport channel in single-molecule junctions formed with these systems. Through these measurements, we find that increasing the electron affinity of thiophene derivatives, within a family of pentamers, changes the polarity of the charge carriers systematically from holes to electrons, with some systems even showing mid-gap transport characteristics.","lang":"eng"}],"title":"Tuning the polarity of charge carriers using electron deficient thiophenes","date_updated":"2024-12-18T08:23:08Z","day":"28","language":[{"iso":"eng"}],"oa_version":"Published Version"},{"article_processing_charge":"No","department":[{"_id":"E-Lib"}],"citation":{"ama":"Litany O, Remez T, Rodola E, Bronstein A, Bronstein M. Deep functional maps: Structured prediction for dense shape correspondence. In: <i>2017 IEEE International Conference on Computer Vision (ICCV)</i>. Vol 31. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/iccv.2017.603\">10.1109/iccv.2017.603</a>","chicago":"Litany, Or, Tal Remez, Emanuele Rodola, Alexander Bronstein, and Michael Bronstein. “Deep Functional Maps: Structured Prediction for Dense Shape Correspondence.” In <i>2017 IEEE International Conference on Computer Vision (ICCV)</i>, Vol. 31. IEEE, 2017. <a href=\"https://doi.org/10.1109/iccv.2017.603\">https://doi.org/10.1109/iccv.2017.603</a>.","ieee":"O. Litany, T. Remez, E. Rodola, A. Bronstein, and M. Bronstein, “Deep functional maps: Structured prediction for dense shape correspondence,” in <i>2017 IEEE International Conference on Computer Vision (ICCV)</i>, 2017, vol. 31.","mla":"Litany, Or, et al. “Deep Functional Maps: Structured Prediction for Dense Shape Correspondence.” <i>2017 IEEE International Conference on Computer Vision (ICCV)</i>, vol. 31, 8237865, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/iccv.2017.603\">10.1109/iccv.2017.603</a>.","ista":"Litany O, Remez T, Rodola E, Bronstein A, Bronstein M. 2017. Deep functional maps: Structured prediction for dense shape correspondence. 2017 IEEE International Conference on Computer Vision (ICCV). 16th IEEE International Conference on Computer Vision vol. 31, 8237865.","apa":"Litany, O., Remez, T., Rodola, E., Bronstein, A., &#38; Bronstein, M. (2017). Deep functional maps: Structured prediction for dense shape correspondence. In <i>2017 IEEE International Conference on Computer Vision (ICCV)</i> (Vol. 31). IEEE. <a href=\"https://doi.org/10.1109/iccv.2017.603\">https://doi.org/10.1109/iccv.2017.603</a>","short":"O. Litany, T. Remez, E. Rodola, A. Bronstein, M. Bronstein, in:, 2017 IEEE International Conference on Computer Vision (ICCV), IEEE, 2017."},"volume":31,"month":"12","publication_status":"published","date_published":"2017-12-25T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","scopus_import":"1","fulldoi":"https://doi.org/10.1109/iccv.2017.603","publication_identifier":{"eissn":["9781538610329"]},"_id":"18286","publication":"2017 IEEE International Conference on Computer Vision (ICCV)","arxiv":1,"extern":"1","oa":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"day":"25","date_updated":"2024-12-05T14:20:54Z","title":"Deep functional maps: Structured prediction for dense shape correspondence","abstract":[{"text":"We introduce a new framework for learning dense correspondence between deformable 3D shapes. Existing learning based approaches model shape correspondence as a labelling problem, where each point of a query shape receives a label identifying a point on some reference domain; the correspondence is then constructed a posteriori by composing the label predictions of two input shapes. We propose a paradigm shift and design a structured prediction model in the space of functional maps, linear operators that provide a compact representation of the correspondence. We model the learning process via a deep residual network which takes dense descriptor fields defined on two shapes as input, and outputs a soft map between the two given objects. The resulting correspondence is shown to be accurate on several challenging benchmarks comprising multiple categories, synthetic models, real scans with acquisition artifacts, topological noise, and partiality.","lang":"eng"}],"article_number":"8237865","intvolume":"        31","year":"2017","external_id":{"arxiv":["1704.08686"]},"quality_controlled":"1","author":[{"last_name":"Litany","first_name":"Or","full_name":"Litany, Or"},{"full_name":"Remez, Tal","last_name":"Remez","first_name":"Tal"},{"first_name":"Emanuele","last_name":"Rodola","full_name":"Rodola, Emanuele"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","first_name":"Alexander"},{"last_name":"Bronstein","first_name":"Michael","full_name":"Bronstein, Michael"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1704.08686","open_access":"1"}],"date_created":"2024-10-09T07:48:43Z","status":"public","doi":"10.1109/iccv.2017.603","type":"conference","conference":{"name":"16th IEEE International Conference on Computer Vision","start_date":"2017-10-22","end_date":"2017-10-29"}},{"author":[{"full_name":"Vestner, Matthias","last_name":"Vestner","first_name":"Matthias"},{"full_name":"Litman, Roee","first_name":"Roee","last_name":"Litman"},{"full_name":"Rodola, Emanuele","first_name":"Emanuele","last_name":"Rodola"},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"first_name":"Daniel","last_name":"Cremers","full_name":"Cremers, Daniel"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1701.00669","open_access":"1"}],"date_created":"2024-10-09T07:49:43Z","status":"public","doi":"10.1109/cvpr.2017.707","type":"conference","conference":{"end_date":"2017-07-26","location":"Honolulu, HI, United States","start_date":"2017-07-21","name":"30th IEEE Conference on Computer Vision and Pattern Recognition"},"language":[{"iso":"eng"}],"oa_version":"Preprint","day":"09","date_updated":"2024-12-05T14:20:16Z","title":"Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space","abstract":[{"text":"Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a post-processing stage in the functional correspondence framework. Such frequently used techniques implicitly make restrictive assumptions (e.g., nearisometry) on the considered shapes and in practice suffer from lack of accuracy and result in poor surjectivity. We propose an alternative recovery technique capable of guaranteeing a bijective correspondence and producing significantly higher accuracy and smoothness. Unlike other methods our approach does not depend on the assumption that the analyzed shapes are isometric. We derive the proposed method from the statistical framework of kernel density estimation and demonstrate its performance on several challenging deformable 3D shape matching datasets.","lang":"eng"}],"year":"2017","external_id":{"arxiv":["1701.00669"]},"quality_controlled":"1","page":"6681 - 6690","scopus_import":"1","publisher":"IEEE","fulldoi":"https://doi.org/10.1109/cvpr.2017.707","publication_identifier":{"issn":["1063-6919"],"isbn":["9781538604588"]},"_id":"18287","publication":"2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","arxiv":1,"extern":"1","oa":1,"article_processing_charge":"No","citation":{"short":"M. Vestner, R. Litman, E. Rodola, A.M. Bronstein, D. Cremers, in:, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, 2017, pp. 6681–6690.","ista":"Vestner M, Litman R, Rodola E, Bronstein AM, Cremers D. 2017. Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 30th IEEE Conference on Computer Vision and Pattern Recognition, 6681–6690.","mla":"Vestner, Matthias, et al. “Product Manifold Filter: Non-Rigid Shape Correspondence via Kernel Density Estimation in the Product Space.” <i>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>, IEEE, 2017, pp. 6681–90, doi:<a href=\"https://doi.org/10.1109/cvpr.2017.707\">10.1109/cvpr.2017.707</a>.","apa":"Vestner, M., Litman, R., Rodola, E., Bronstein, A. M., &#38; Cremers, D. (2017). Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space. In <i>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i> (pp. 6681–6690). Honolulu, HI, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2017.707\">https://doi.org/10.1109/cvpr.2017.707</a>","ieee":"M. Vestner, R. Litman, E. Rodola, A. M. Bronstein, and D. Cremers, “Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space,” in <i>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>, Honolulu, HI, United States, 2017, pp. 6681–6690.","ama":"Vestner M, Litman R, Rodola E, Bronstein AM, Cremers D. Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space. In: <i>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>. IEEE; 2017:6681-6690. doi:<a href=\"https://doi.org/10.1109/cvpr.2017.707\">10.1109/cvpr.2017.707</a>","chicago":"Vestner, Matthias, Roee Litman, Emanuele Rodola, Alex M. Bronstein, and Daniel Cremers. “Product Manifold Filter: Non-Rigid Shape Correspondence via Kernel Density Estimation in the Product Space.” In <i>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>, 6681–90. IEEE, 2017. <a href=\"https://doi.org/10.1109/cvpr.2017.707\">https://doi.org/10.1109/cvpr.2017.707</a>."},"month":"11","publication_status":"published","date_published":"2017-11-09T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"We present ASIST, a technique for transforming point clouds by replacing objects with their semantically equivalent counterparts. Transformations of this kind have applications in virtual reality, repair of fused scans, and robotics. ASIST is based on a unified formulation of semantic labeling and object replacement; both result from minimizing a single objective. We present numerical tools for the efficient solution of this optimization problem. The method is experimentally assessed on new datasets of both synthetic and real point clouds, and is additionally compared to two recent works on object replacement on data from the corresponding papers."}],"intvolume":"       157","language":[{"iso":"eng"}],"oa_version":"Preprint","date_updated":"2024-12-18T12:24:47Z","title":"ASIST: Automatic semantically invariant scene transformation","day":"01","quality_controlled":"1","page":"284-299","year":"2017","external_id":{"arxiv":["1512.01515"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1512.01515"}],"date_created":"2024-10-15T11:20:54Z","author":[{"first_name":"Or","last_name":"Litany","full_name":"Litany, Or"},{"full_name":"Remez, Tal","first_name":"Tal","last_name":"Remez"},{"last_name":"Freedman","first_name":"Daniel","full_name":"Freedman, Daniel"},{"full_name":"Shapira, Lior","first_name":"Lior","last_name":"Shapira"},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander"},{"full_name":"Gal, Ran","first_name":"Ran","last_name":"Gal"}],"doi":"10.1016/j.cviu.2016.08.002","status":"public","type":"journal_article","citation":{"chicago":"Litany, Or, Tal Remez, Daniel Freedman, Lior Shapira, Alex M. Bronstein, and Ran Gal. “ASIST: Automatic Semantically Invariant Scene Transformation.” <i>Computer Vision and Image Understanding</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.cviu.2016.08.002\">https://doi.org/10.1016/j.cviu.2016.08.002</a>.","ama":"Litany O, Remez T, Freedman D, Shapira L, Bronstein AM, Gal R. ASIST: Automatic semantically invariant scene transformation. <i>Computer Vision and Image Understanding</i>. 2017;157:284-299. doi:<a href=\"https://doi.org/10.1016/j.cviu.2016.08.002\">10.1016/j.cviu.2016.08.002</a>","ieee":"O. Litany, T. Remez, D. Freedman, L. Shapira, A. M. Bronstein, and R. Gal, “ASIST: Automatic semantically invariant scene transformation,” <i>Computer Vision and Image Understanding</i>, vol. 157. Elsevier, pp. 284–299, 2017.","short":"O. Litany, T. Remez, D. Freedman, L. Shapira, A.M. Bronstein, R. Gal, Computer Vision and Image Understanding 157 (2017) 284–299.","mla":"Litany, Or, et al. “ASIST: Automatic Semantically Invariant Scene Transformation.” <i>Computer Vision and Image Understanding</i>, vol. 157, Elsevier, 2017, pp. 284–99, doi:<a href=\"https://doi.org/10.1016/j.cviu.2016.08.002\">10.1016/j.cviu.2016.08.002</a>.","apa":"Litany, O., Remez, T., Freedman, D., Shapira, L., Bronstein, A. M., &#38; Gal, R. (2017). ASIST: Automatic semantically invariant scene transformation. <i>Computer Vision and Image Understanding</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cviu.2016.08.002\">https://doi.org/10.1016/j.cviu.2016.08.002</a>","ista":"Litany O, Remez T, Freedman D, Shapira L, Bronstein AM, Gal R. 2017. ASIST: Automatic semantically invariant scene transformation. Computer Vision and Image Understanding. 157, 284–299."},"volume":157,"article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"04","date_published":"2017-04-01T00:00:00Z","publication_status":"published","_id":"18366","publication_identifier":{"issn":["1077-3142"]},"publication":"Computer Vision and Image Understanding","scopus_import":"1","publisher":"Elsevier","fulldoi":"https://doi.org/10.1016/j.cviu.2016.08.002","extern":"1","oa":1,"arxiv":1},{"quality_controlled":"1","page":"3189 - 3203","year":"2017","abstract":[{"text":"The sliding clamp, PCNA, plays a central role in DNA replication and repair. In the moving replication fork, PCNA is present at the leading strand and at each of the Okazaki fragments that are formed on the lagging strand. PCNA enhances the processivity of the replicative polymerases and provides a landing platform for other proteins and enzymes. The loading of the clamp onto DNA is performed by the Replication Factor C (RFC) complex, whereas its unloading can be carried out by an RFC-like complex containing Elg1. Mutations in ELG1 lead to DNA damage sensitivity and genome instability. To characterize the role of Elg1 in maintaining genomic integrity, we used homology modeling to generate a number of site-specific mutations in ELG1 that exhibit different PCNA unloading capabilities. We show that the sensitivity to DNA damaging agents and hyper-recombination of these alleles correlate with their ability to unload PCNA from the chromatin. Our results indicate that retention of modified and unmodified PCNA on the chromatin causes genomic instability. We also show, using purified proteins, that the Elg1 complex inhibits DNA synthesis by unloading SUMOylated PCNA from the DNA. Additionally, we find that mutations in ELG1 suppress the sensitivity of rad5Δ mutants to DNA damage by allowing trans-lesion synthesis to take place. Taken together, the data indicate that the Elg1–RLC complex plays an important role in the maintenance of genomic stability by unloading PCNA from the chromatin.","lang":"eng"}],"DOAJ_listed":"1","intvolume":"        45","language":[{"iso":"eng"}],"oa_version":"Published Version","day":"07","date_updated":"2024-12-18T12:31:56Z","title":"A structure-function analysis of the yeast Elg1 protein reveals the importance of PCNA unloading in genome stability maintenance","doi":"10.1093/nar/gkw1348","status":"public","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.1093/nar/gkw1348","open_access":"1"}],"issue":"6","date_created":"2024-10-15T11:20:54Z","author":[{"last_name":"Shemesh","first_name":"Keren","full_name":"Shemesh, Keren"},{"last_name":"Sebesta","first_name":"Marek","full_name":"Sebesta, Marek"},{"full_name":"Pacesa, Martin","last_name":"Pacesa","first_name":"Martin"},{"last_name":"Sau","first_name":"Soumitra","full_name":"Sau, Soumitra"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"},{"last_name":"Parnas","first_name":"Oren","full_name":"Parnas, Oren"},{"full_name":"Liefshitz, Batia","last_name":"Liefshitz","first_name":"Batia"},{"full_name":"Venclovas, Česlovas","first_name":"Česlovas","last_name":"Venclovas"},{"last_name":"Krejci","first_name":"Lumir","full_name":"Krejci, Lumir"},{"full_name":"Kupiec, Martin","first_name":"Martin","last_name":"Kupiec"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"04","publication_status":"published","date_published":"2017-04-07T00:00:00Z","citation":{"apa":"Shemesh, K., Sebesta, M., Pacesa, M., Sau, S., Bronstein, A. M., Parnas, O., … Kupiec, M. (2017). A structure-function analysis of the yeast Elg1 protein reveals the importance of PCNA unloading in genome stability maintenance. <i>Nucleic Acids Research</i>. Oxford University Press (OUP). <a href=\"https://doi.org/10.1093/nar/gkw1348\">https://doi.org/10.1093/nar/gkw1348</a>","ista":"Shemesh K, Sebesta M, Pacesa M, Sau S, Bronstein AM, Parnas O, Liefshitz B, Venclovas Č, Krejci L, Kupiec M. 2017. A structure-function analysis of the yeast Elg1 protein reveals the importance of PCNA unloading in genome stability maintenance. Nucleic Acids Research. 45(6), 3189–3203.","mla":"Shemesh, Keren, et al. “A Structure-Function Analysis of the Yeast Elg1 Protein Reveals the Importance of PCNA Unloading in Genome Stability Maintenance.” <i>Nucleic Acids Research</i>, vol. 45, no. 6, Oxford University Press (OUP), 2017, pp. 3189–203, doi:<a href=\"https://doi.org/10.1093/nar/gkw1348\">10.1093/nar/gkw1348</a>.","short":"K. Shemesh, M. Sebesta, M. Pacesa, S. Sau, A.M. Bronstein, O. Parnas, B. Liefshitz, Č. Venclovas, L. Krejci, M. Kupiec, Nucleic Acids Research 45 (2017) 3189–3203.","ieee":"K. Shemesh <i>et al.</i>, “A structure-function analysis of the yeast Elg1 protein reveals the importance of PCNA unloading in genome stability maintenance,” <i>Nucleic Acids Research</i>, vol. 45, no. 6. Oxford University Press (OUP), pp. 3189–3203, 2017.","chicago":"Shemesh, Keren, Marek Sebesta, Martin Pacesa, Soumitra Sau, Alex M. Bronstein, Oren Parnas, Batia Liefshitz, Česlovas Venclovas, Lumir Krejci, and Martin Kupiec. “A Structure-Function Analysis of the Yeast Elg1 Protein Reveals the Importance of PCNA Unloading in Genome Stability Maintenance.” <i>Nucleic Acids Research</i>. Oxford University Press (OUP), 2017. <a href=\"https://doi.org/10.1093/nar/gkw1348\">https://doi.org/10.1093/nar/gkw1348</a>.","ama":"Shemesh K, Sebesta M, Pacesa M, et al. A structure-function analysis of the yeast Elg1 protein reveals the importance of PCNA unloading in genome stability maintenance. <i>Nucleic Acids Research</i>. 2017;45(6):3189-3203. doi:<a href=\"https://doi.org/10.1093/nar/gkw1348\">10.1093/nar/gkw1348</a>"},"volume":45,"article_processing_charge":"No","extern":"1","oa":1,"_id":"18372","publication_identifier":{"issn":["0305-1048","1362-4962"]},"publication":"Nucleic Acids Research","publisher":"Oxford University Press (OUP)","scopus_import":"1","fulldoi":"https://doi.org/10.1093/nar/gkw1348"},{"abstract":[{"text":"Notions of similarity and correspondence between geometric shapes and images are central to many tasks in geometry processing, computer vision, and computer graphics. The goal of this course is to familiarize the audience with a set of recent techniques that greatly facilitate the computation of mappings or correspondences between geometric datasets, such as 3D shapes or 2D images by formulating them as mappings between functions rather than points or triangles.\r\nMethods based on the functional map framework have recently led to state-of-the-art results in problems as diverse as non-rigid shape matching, image co-segmentation and even some aspects of tangent vector field design. One challenge in adopting these methods in practice, however, is that their exposition often assumes a significant amount of background in geometry processing, spectral methods and functional analysis, which can make it difficult to gain an intuition about their performance or about their applicability to real-life problems. In this course, we try to provide all the tools necessary to appreciate and use these techniques, while assuming very little background knowledge. We also give a unifying treatment of these techniques, which may be difficult to extract from the individual publications and, at the same time, hint at the generality of this point of view, which can help tackle many problems in the analysis and creation of visual content.\r\nThis course is structured as a half day course. We will assume that the participants have knowledge of basic linear algebra and some knowledge of differential geometry, to the extent of being familiar with the concepts of a manifold and a tangent vector space. We will discuss in detail the functional approach to finding correspondences between non-rigid shapes, the design and analysis of tangent vector fields on surfaces, consistent map estimation in networks of shapes and applications to shape and image segmentation, shape variability analysis, and other areas.","lang":"eng"}],"article_number":"5","title":"Computing and processing correspondences with functional maps","date_updated":"2025-02-04T15:01:50Z","day":"30","oa_version":"Preprint","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2017","date_created":"2024-10-15T11:20:55Z","main_file_link":[{"url":"https://inria.hal.science/hal-01664767/","open_access":"1"}],"author":[{"last_name":"Ovsjanikov","first_name":"Maks","full_name":"Ovsjanikov, Maks"},{"full_name":"Corman, Etienne","last_name":"Corman","first_name":"Etienne"},{"full_name":"Bronstein, Michael","last_name":"Bronstein","first_name":"Michael"},{"last_name":"Rodolà","first_name":"Emanuele","full_name":"Rodolà, Emanuele"},{"last_name":"Ben-Chen","first_name":"Mirela","full_name":"Ben-Chen, Mirela"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"last_name":"Chazal","first_name":"Frederic","full_name":"Chazal, Frederic"},{"orcid":"0000-0001-9699-8730","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander"}],"conference":{"end_date":"2017-08-03","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques Conference","start_date":"2017-07-30","location":"Los Angeles, CA, United States"},"type":"conference","status":"public","doi":"10.1145/3084873.3084877","OA_type":"green","citation":{"short":"M. Ovsjanikov, E. Corman, M. Bronstein, E. Rodolà, M. Ben-Chen, L. Guibas, F. Chazal, A.M. Bronstein, in:, ACM SIGGRAPH 2017 Courses, ACM, 2017.","mla":"Ovsjanikov, Maks, et al. “Computing and Processing Correspondences with Functional Maps.” <i>ACM SIGGRAPH 2017 Courses</i>, 5, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3084873.3084877\">10.1145/3084873.3084877</a>.","ista":"Ovsjanikov M, Corman E, Bronstein M, Rodolà E, Ben-Chen M, Guibas L, Chazal F, Bronstein AM. 2017. Computing and processing correspondences with functional maps. ACM SIGGRAPH 2017 Courses. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 5.","apa":"Ovsjanikov, M., Corman, E., Bronstein, M., Rodolà, E., Ben-Chen, M., Guibas, L., … Bronstein, A. M. (2017). Computing and processing correspondences with functional maps. In <i>ACM SIGGRAPH 2017 Courses</i>. Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3084873.3084877\">https://doi.org/10.1145/3084873.3084877</a>","ieee":"M. Ovsjanikov <i>et al.</i>, “Computing and processing correspondences with functional maps,” in <i>ACM SIGGRAPH 2017 Courses</i>, Los Angeles, CA, United States, 2017.","chicago":"Ovsjanikov, Maks, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen, Leonidas Guibas, Frederic Chazal, and Alex M. Bronstein. “Computing and Processing Correspondences with Functional Maps.” In <i>ACM SIGGRAPH 2017 Courses</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3084873.3084877\">https://doi.org/10.1145/3084873.3084877</a>.","ama":"Ovsjanikov M, Corman E, Bronstein M, et al. Computing and processing correspondences with functional maps. In: <i>ACM SIGGRAPH 2017 Courses</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3084873.3084877\">10.1145/3084873.3084877</a>"},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-07-30T00:00:00Z","publication_status":"published","month":"07","publication":"ACM SIGGRAPH 2017 Courses","publication_identifier":{"isbn":["9781450350143"]},"_id":"18435","fulldoi":"https://doi.org/10.1145/3084873.3084877","scopus_import":"1","publisher":"ACM","oa":1,"extern":"1","OA_place":"repository"},{"intvolume":"       225","abstract":[{"text":"We consider the cubic–quintic nonlinear Schrödinger equation: (mathematical formular)\r\nIn the first part of the paper, we analyze the one-parameter family of ground state solitons associated to this equation with particular attention to the shape of the associated mass/energy curve. Additionally, we are able to characterize the kernel of the linearized operator about such solitons and to demonstrate that they occur as optimizers for a one-parameter family of inequalities of Gagliardo–Nirenberg type. Building on this work, in the latter part of the paper we prove that scattering holds for solutions belonging to the region R of the mass/energy plane where the virial is positive. We show that this region is partially bounded by solitons also by rescalings of solitons (which are not soliton solutions in their own right). The discovery of rescaled solitons in this context is new and highlights an unexpected limitation of any virial-based methodology.","lang":"eng"}],"date_updated":"2026-06-30T10:52:12Z","title":"Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3","day":"01","language":[{"iso":"eng"}],"oa_version":"Preprint","page":"469-548","quality_controlled":"1","external_id":{"arxiv":["1409.6734"]},"year":"2017","date_created":"2026-06-19T08:21:38Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1409.6734","open_access":"1"}],"author":[{"last_name":"Killip","first_name":"Rowan","full_name":"Killip, Rowan"},{"last_name":"Oh","first_name":"Tadahiro","full_name":"Oh, Tadahiro"},{"first_name":"Oana","last_name":"Pocovnicu","full_name":"Pocovnicu, Oana"},{"full_name":"Visan, Monica","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"type":"journal_article","doi":"10.1007/s00205-017-1109-0","status":"public","OA_type":"green","volume":225,"citation":{"ieee":"R. Killip, T. Oh, O. Pocovnicu, and M. Vişan, “Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 225. Springer Nature, pp. 469–548, 2017.","short":"R. Killip, T. Oh, O. Pocovnicu, M. Vişan, Archive for Rational Mechanics and Analysis 225 (2017) 469–548.","mla":"Killip, Rowan, et al. “Solitons and Scattering for the Cubic-Quintic Nonlinear Schrödinger Equation on R^3.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 225, Springer Nature, 2017, pp. 469–548, doi:<a href=\"https://doi.org/10.1007/s00205-017-1109-0\">10.1007/s00205-017-1109-0</a>.","apa":"Killip, R., Oh, T., Pocovnicu, O., &#38; Vişan, M. (2017). Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-017-1109-0\">https://doi.org/10.1007/s00205-017-1109-0</a>","ista":"Killip R, Oh T, Pocovnicu O, Vişan M. 2017. Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. Archive for Rational Mechanics and Analysis. 225, 469–548.","ama":"Killip R, Oh T, Pocovnicu O, Vişan M. Solitons and scattering for the cubic-quintic nonlinear Schrödinger equation on R^3. <i>Archive for Rational Mechanics and Analysis</i>. 2017;225:469-548. doi:<a href=\"https://doi.org/10.1007/s00205-017-1109-0\">10.1007/s00205-017-1109-0</a>","chicago":"Killip, Rowan, Tadahiro Oh, Oana Pocovnicu, and Monica Vişan. “Solitons and Scattering for the Cubic-Quintic Nonlinear Schrödinger Equation on R^3.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/s00205-017-1109-0\">https://doi.org/10.1007/s00205-017-1109-0</a>."},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","date_published":"2017-07-01T00:00:00Z","publication_status":"published","month":"07","publication":"Archive for Rational Mechanics and Analysis","_id":"22071","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"fulldoi":"https://doi.org/10.1007/s00205-017-1109-0","publisher":"Springer Nature","scopus_import":"1","oa":1,"extern":"1","OA_place":"repository","arxiv":1},{"title":"The focusing cubic NLS with inverse-square potential in three space dimensions","date_updated":"2026-07-01T12:42:38Z","day":"01","language":[{"iso":"eng"}],"oa_version":"Preprint","intvolume":"        30","abstract":[{"text":"We consider the focusing cubic nonlinear Schrödinger equation with inverse-square potential in three space dimensions. We identify a sharp threshold between scattering and blowup, establishing a result analogous to that of Duyckaerts, Holmer, and Roudenko for the standard focusing cubic NLS. We also prove failure of uniform space-time bounds at the threshold.","lang":"eng"}],"external_id":{"arxiv":["1603.08912"]},"year":"2017","page":"161-206","quality_controlled":"1","author":[{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"full_name":"Murphy, Jason","last_name":"Murphy","first_name":"Jason"},{"full_name":"Visan, Monica","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"},{"first_name":"Jiqiang","last_name":"Zheng","full_name":"Zheng, Jiqiang"}],"date_created":"2026-06-19T08:47:48Z","issue":"3/4","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1603.08912","open_access":"1"}],"type":"journal_article","status":"public","doi":"10.57262/die/1487386822","OA_type":"green","das_tickbox":"1","article_processing_charge":"No","volume":30,"citation":{"ieee":"R. Killip, J. Murphy, M. Vişan, and J. Zheng, “The focusing cubic NLS with inverse-square potential in three space dimensions,” <i>Differential and Integral Equations</i>, vol. 30, no. 3/4. Khayyam Publishing, pp. 161–206, 2017.","short":"R. Killip, J. Murphy, M. Vişan, J. Zheng, Differential and Integral Equations 30 (2017) 161–206.","ista":"Killip R, Murphy J, Vişan M, Zheng J. 2017. The focusing cubic NLS with inverse-square potential in three space dimensions. Differential and Integral Equations. 30(3/4), 161–206.","apa":"Killip, R., Murphy, J., Vişan, M., &#38; Zheng, J. (2017). The focusing cubic NLS with inverse-square potential in three space dimensions. <i>Differential and Integral Equations</i>. Khayyam Publishing. <a href=\"https://doi.org/10.57262/die/1487386822\">https://doi.org/10.57262/die/1487386822</a>","mla":"Killip, Rowan, et al. “The Focusing Cubic NLS with Inverse-Square Potential in Three Space Dimensions.” <i>Differential and Integral Equations</i>, vol. 30, no. 3/4, Khayyam Publishing, 2017, pp. 161–206, doi:<a href=\"https://doi.org/10.57262/die/1487386822\">10.57262/die/1487386822</a>.","ama":"Killip R, Murphy J, Vişan M, Zheng J. The focusing cubic NLS with inverse-square potential in three space dimensions. <i>Differential and Integral Equations</i>. 2017;30(3/4):161-206. doi:<a href=\"https://doi.org/10.57262/die/1487386822\">10.57262/die/1487386822</a>","chicago":"Killip, Rowan, Jason Murphy, Monica Vişan, and Jiqiang Zheng. “The Focusing Cubic NLS with Inverse-Square Potential in Three Space Dimensions.” <i>Differential and Integral Equations</i>. Khayyam Publishing, 2017. <a href=\"https://doi.org/10.57262/die/1487386822\">https://doi.org/10.57262/die/1487386822</a>."},"publication_status":"published","date_published":"2017-03-01T00:00:00Z","mathsc":["35Q55"],"month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","fulldoi":"https://doi.org/10.57262/die/1487386822","scopus_import":"1","publisher":"Khayyam Publishing","publication":"Differential and Integral Equations","_id":"22088","publication_identifier":{"issn":["0893-4983"]},"OA_place":"repository","arxiv":1,"oa":1,"extern":"1"},{"pubrep_id":"957","scopus_import":"1","publisher":"International Federation for Computational Logic","fulldoi":"https://doi.org/10.23638/LMCS-13(2:15)2017","_id":"466","publication_identifier":{"issn":["1860-5974"]},"publication":"Logical Methods in Computer Science","project":[{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"H2020","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","oa":1,"article_processing_charge":"No","department":[{"_id":"KrCh"}],"das_tickbox":"1","ec_funded":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2, 15, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>.","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","apa":"Chatterjee, K., Křetínská, Z., &#38; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2. International Federation for Computational Logic, 2017.","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. 2017;13(2). doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>"},"volume":13,"month":"07","date_published":"2017-07-03T00:00:00Z","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","id":"5429","status":"public"},{"status":"public","id":"5435","relation":"earlier_version"},{"status":"public","id":"1657","relation":"earlier_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Křetínská, Zuzana","last_name":"Křetínská","first_name":"Zuzana"},{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan"}],"ddc":["004"],"issue":"2","date_created":"2018-12-11T11:46:38Z","doi":"10.23638/LMCS-13(2:15)2017","file_date_updated":"2020-07-14T12:46:33Z","status":"public","type":"journal_article","oa_version":"Published Version","language":[{"iso":"eng"}],"day":"03","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","date_updated":"2026-07-06T13:26:27Z","publist_id":"7355","article_number":"15","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"file":[{"file_size":511832,"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","checksum":"bfa405385ec6229ad5ead89ab5751639","creator":"system","content_type":"application/pdf","file_id":"5354","date_created":"2018-12-12T10:18:32Z"}],"intvolume":"        13","year":"2017","external_id":{"isi":["000419160800002"]},"license":"https://creativecommons.org/licenses/by-nd/4.0/","quality_controlled":"1","isi":1},{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5438"},{"relation":"earlier_version","id":"1610","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","date_published":"2017-09-13T00:00:00Z","publication_status":"published","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation for Computational Logic, 2017."},"ec_funded":1,"volume":13,"das_tickbox":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_processing_charge":"No","has_accepted_license":"1","oa":1,"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["1860-5974"]},"_id":"465","publication":"Logical Methods in Computer Science","publisher":"International Federation for Computational Logic","scopus_import":"1","pubrep_id":"955","fulldoi":"https://doi.org/10.23638/LMCS-13(3:23)2017","quality_controlled":"1","isi":1,"year":"2017","external_id":{"isi":["000419163000005"]},"file":[{"date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2015-321-v1+1_main.pdf","access_level":"open_access","date_created":"2018-12-12T10:14:37Z","file_id":"5090","checksum":"08041379ba408d40664f449eb5907a8f","creator":"system","content_type":"application/pdf","file_size":279071,"relation":"main_file"},{"file_size":279071,"relation":"main_file","date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","access_level":"open_access","date_created":"2018-12-12T10:14:38Z","file_id":"5091","creator":"system","checksum":"08041379ba408d40664f449eb5907a8f","content_type":"application/pdf"}],"abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"intvolume":"        13","language":[{"iso":"eng"}],"oa_version":"Published Version","publist_id":"7356","date_updated":"2026-07-06T13:27:53Z","title":"Edit distance for pushdown automata","day":"13","doi":"10.23638/LMCS-13(3:23)2017","status":"public","file_date_updated":"2020-07-14T12:46:33Z","type":"journal_article","issue":"3","date_created":"2018-12-11T11:46:37Z","tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"corr_author":"1","ddc":["004"],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}]},{"intvolume":"        13","file":[{"relation":"main_file","file_size":582940,"creator":"system","content_type":"application/pdf","checksum":"12d469ae69b80361333d7dead965cf5d","file_id":"5010","date_created":"2018-12-12T10:13:27Z","access_level":"open_access","date_updated":"2020-07-14T12:46:32Z","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf"}],"abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"article_number":"26","publist_id":"7357","date_updated":"2026-07-06T13:28:05Z","title":"Improved algorithms for parity and Streett objectives","day":"26","language":[{"iso":"eng"}],"oa_version":"Published Version","isi":1,"quality_controlled":"1","external_id":{"arxiv":["1410.0833"],"isi":["000419163000001"]},"year":"2017","date_created":"2018-12-11T11:46:37Z","issue":"3","ddc":["004"],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"corr_author":"1","type":"journal_article","file_date_updated":"2020-07-14T12:46:32Z","status":"public","doi":"10.23638/LMCS-13(3:26)2017","volume":13,"citation":{"chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>.","ama":"Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>","apa":"Chatterjee, K., Henzinger, M., &#38; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, 26, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>.","ista":"Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation for Computational Logic, 2017."},"ec_funded":1,"das_tickbox":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1661"}]},"date_published":"2017-09-26T00:00:00Z","publication_status":"published","month":"09","publication":"Logical Methods in Computer Science","publication_identifier":{"issn":["1860-5974"]},"_id":"464","fulldoi":"https://doi.org/10.23638/LMCS-13(3:26)2017","publisher":"International Federation for Computational Logic","scopus_import":"1","pubrep_id":"956","oa":1,"has_accepted_license":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"arxiv":1},{"language":[{"iso":"eng"}],"oa_version":"Submitted Version","day":"01","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","publist_id":"7336","date_updated":"2026-07-06T13:34:16Z","abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β &lt; 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"intvolume":"        21","year":"2017","external_id":{"arxiv":["1509.04631"],"isi":["000409382300004"]},"quality_controlled":"1","isi":1,"page":"683 - 738","author":[{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan","last_name":"Nam","full_name":"Nam, Phan"},{"full_name":"Napiórkowski, Marcin M","last_name":"Napiórkowski","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.04631"}],"issue":"3","date_created":"2018-12-11T11:46:43Z","status":"public","doi":"10.4310/ATMP.2017.v21.n3.a4","type":"journal_article","article_processing_charge":"No","department":[{"_id":"RoSe"}],"das_tickbox":"1","ec_funded":1,"citation":{"ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):683-738. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","apa":"Nam, P., &#38; Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press of Boston, 2017, pp. 683–738, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>.","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press of Boston, pp. 683–738, 2017."},"volume":21,"month":"01","publication_status":"published","date_published":"2017-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","publisher":"International Press of Boston","fulldoi":"https://doi.org/10.4310/ATMP.2017.v21.n3.a4","publication_identifier":{"issn":["1095-0761"]},"_id":"484","publication":"Advances in Theoretical and Mathematical Physics","arxiv":1,"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"oa":1},{"article_processing_charge":"No","department":[{"_id":"LaEr"}],"das_tickbox":"1","ec_funded":1,"citation":{"ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):739-800. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press of Boston, pp. 739–800, 2017.","apa":"Bourgade, P., Erdös, L., Yau, H., &#38; Yin, J. (2017). Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press of Boston, 2017, pp. 739–800, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800."},"volume":21,"month":"08","publication_status":"published","date_published":"2017-08-25T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","publisher":"International Press of Boston","fulldoi":"https://doi.org/10.4310/ATMP.2017.v21.n3.a5","_id":"483","publication_identifier":{"issn":["1095-0761"]},"publication":"Advances in Theoretical and Mathematical Physics","arxiv":1,"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7"}],"oa":1,"oa_version":"Submitted Version","language":[{"iso":"eng"}],"day":"25","publist_id":"7337","date_updated":"2026-07-06T13:35:08Z","title":"Universality for a class of random band matrices","abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"intvolume":"        21","year":"2017","external_id":{"arxiv":["1602.02312"],"isi":["000409382300005"]},"quality_controlled":"1","isi":1,"page":"739 - 800","author":[{"last_name":"Bourgade","first_name":"Paul","full_name":"Bourgade, Paul"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"},{"full_name":"Yin, Jun","first_name":"Jun","last_name":"Yin"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"issue":"3","date_created":"2018-12-11T11:46:43Z","doi":"10.4310/ATMP.2017.v21.n3.a5","status":"public","type":"journal_article"},{"intvolume":"        70","abstract":[{"text":"We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. ","lang":"eng"}],"day":"01","date_updated":"2026-07-06T13:41:23Z","title":"PixelCNN models with auxiliary variables for natural image modeling","publist_id":"6398","language":[{"iso":"eng"}],"oa_version":"Submitted Version","isi":1,"page":"1905 - 1914","quality_controlled":"1","external_id":{"arxiv":["1612.08185"],"isi":["000683309501102"]},"year":"2017","date_created":"2018-12-11T11:49:37Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.08185"}],"acknowledgement":"We thank Tim Salimans for spotting a mistake in our preliminary arXiv manuscript. This work was funded by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.","author":[{"last_name":"Kolesnikov","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2017-08-11","name":"ICML: International Conference on Machine Learning","start_date":"2017-08-06","location":"Sydney, Australia"},"type":"conference","status":"public","volume":70,"ec_funded":1,"citation":{"short":"A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine Learning, Journal of Machine Learning Research, 2017, pp. 1905–1914.","ista":"Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for natural image modeling. 34th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 70, 1905–1914.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” <i>34th International Conference on Machine Learning</i>, vol. 70, Journal of Machine Learning Research, 2017, pp. 1905–14.","apa":"Kolesnikov, A., &#38; Lampert, C. (2017). PixelCNN models with auxiliary variables for natural image modeling. In <i>34th International Conference on Machine Learning</i> (Vol. 70, pp. 1905–1914). Sydney, Australia: Journal of Machine Learning Research.","ieee":"A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for natural image modeling,” in <i>34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 1905–1914.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” In <i>34th International Conference on Machine Learning</i>, 70:1905–14. Journal of Machine Learning Research, 2017.","ama":"Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural image modeling. In: <i>34th International Conference on Machine Learning</i>. Vol 70. Journal of Machine Learning Research; 2017:1905-1914."},"article_processing_charge":"No","department":[{"_id":"ChLa"}],"das_tickbox":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-08-01T00:00:00Z","publication_status":"published","month":"08","publication":"34th International Conference on Machine Learning","_id":"1000","publication_identifier":{"isbn":["978-151085514-4"]},"publisher":"Journal of Machine Learning Research","scopus_import":"1","oa":1,"has_accepted_license":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}],"arxiv":1}]