[{"article_type":"letter_note","date_updated":"2025-01-03T09:47:07Z","quality_controlled":"1","type":"journal_article","issue":"4","external_id":{"pmid":["21366230"]},"title":"Mechanics and chemistry: Single molecule bond rupture forces correlate with molecular backbone structure","language":[{"iso":"eng"}],"volume":11,"publication":"Nano Letters","month":"03","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"oa_version":"None","year":"2011","abstract":[{"text":"We simultaneously measure conductance and force across nanoscale junctions. A new, two-dimensional histogram technique is introduced to statistically extract bond rupture forces from a large data set of individual junction elongation traces. For the case of Au point contacts, we find a rupture force of 1.4 ± 0.2 nN, which is in good agreement with previous measurements. We then study systematic trends for single gold metal−molecule−metal junctions for a series of molecules terminated with amine and pyridine linkers. For all molecules studied, single molecule junctions rupture at the Au−N bond. Selective binding of the linker group allows us to correlate the N−Au bond-rupture force to the molecular backbone. We find that the rupture force ranges from 0.8 nN for 4,4′ bipyridine to 0.5 nN in 1,4 diaminobenzene. These experimental results are in excellent quantitative agreement with density functional theory based adiabatic molecular junction elongation and rupture calculations.","lang":"eng"}],"page":"1518-1523","extern":"1","_id":"18019","scopus_import":"1","OA_type":"closed access","article_processing_charge":"No","day":"02","date_published":"2011-03-02T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","citation":{"ista":"Frei M, Aradhya SV, Koentopp M, Hybertsen MS, Venkataraman L. 2011. Mechanics and chemistry: Single molecule bond rupture forces correlate with molecular backbone structure. Nano Letters. 11(4), 1518–1523.","mla":"Frei, Michael, et al. “Mechanics and Chemistry: Single Molecule Bond Rupture Forces Correlate with Molecular Backbone Structure.” <i>Nano Letters</i>, vol. 11, no. 4, American Chemical Society, 2011, pp. 1518–23, doi:<a href=\"https://doi.org/10.1021/nl1042903\">10.1021/nl1042903</a>.","ieee":"M. Frei, S. V. Aradhya, M. Koentopp, M. S. Hybertsen, and L. Venkataraman, “Mechanics and chemistry: Single molecule bond rupture forces correlate with molecular backbone structure,” <i>Nano Letters</i>, vol. 11, no. 4. American Chemical Society, pp. 1518–1523, 2011.","chicago":"Frei, Michael, Sriharsha V. Aradhya, Max Koentopp, Mark S. Hybertsen, and Latha Venkataraman. “Mechanics and Chemistry: Single Molecule Bond Rupture Forces Correlate with Molecular Backbone Structure.” <i>Nano Letters</i>. American Chemical Society, 2011. <a href=\"https://doi.org/10.1021/nl1042903\">https://doi.org/10.1021/nl1042903</a>.","short":"M. Frei, S.V. Aradhya, M. Koentopp, M.S. Hybertsen, L. Venkataraman, Nano Letters 11 (2011) 1518–1523.","ama":"Frei M, Aradhya SV, Koentopp M, Hybertsen MS, Venkataraman L. Mechanics and chemistry: Single molecule bond rupture forces correlate with molecular backbone structure. <i>Nano Letters</i>. 2011;11(4):1518-1523. doi:<a href=\"https://doi.org/10.1021/nl1042903\">10.1021/nl1042903</a>","apa":"Frei, M., Aradhya, S. V., Koentopp, M., Hybertsen, M. S., &#38; Venkataraman, L. (2011). Mechanics and chemistry: Single molecule bond rupture forces correlate with molecular backbone structure. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/nl1042903\">https://doi.org/10.1021/nl1042903</a>"},"publication_status":"published","author":[{"last_name":"Frei","full_name":"Frei, Michael","first_name":"Michael"},{"first_name":"Sriharsha V.","full_name":"Aradhya, Sriharsha V.","last_name":"Aradhya"},{"full_name":"Koentopp, Max","last_name":"Koentopp","first_name":"Max"},{"first_name":"Mark S.","full_name":"Hybertsen, Mark S.","last_name":"Hybertsen"},{"full_name":"Venkataraman, Latha","orcid":"0000-0002-6957-6089","last_name":"Venkataraman","first_name":"Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf"}],"intvolume":"        11","doi":"10.1021/nl1042903","pmid":1,"date_created":"2024-09-09T12:37:10Z","publisher":"American Chemical Society"},{"intvolume":"       133","author":[{"first_name":"Severin T.","full_name":"Schneebeli, Severin T.","last_name":"Schneebeli"},{"full_name":"Kamenetska, Maria","last_name":"Kamenetska","first_name":"Maria"},{"first_name":"Zhanling","last_name":"Cheng","full_name":"Cheng, Zhanling"},{"last_name":"Skouta","full_name":"Skouta, Rachid","first_name":"Rachid"},{"first_name":"Richard A.","full_name":"Friesner, Richard A.","last_name":"Friesner"},{"first_name":"Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","full_name":"Venkataraman, Latha","last_name":"Venkataraman","orcid":"0000-0002-6957-6089"},{"last_name":"Breslow","full_name":"Breslow, Ronald","first_name":"Ronald"}],"publisher":"American Chemical Society","doi":"10.1021/ja111320n","pmid":1,"date_created":"2024-09-09T12:57:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"S.T. Schneebeli, M. Kamenetska, Z. Cheng, R. Skouta, R.A. Friesner, L. Venkataraman, R. Breslow, Journal of the American Chemical Society 133 (2011) 2136–2139.","apa":"Schneebeli, S. T., Kamenetska, M., Cheng, Z., Skouta, R., Friesner, R. A., Venkataraman, L., &#38; Breslow, R. (2011). Single-molecule conductance through multiple π−π-stacked benzene rings determined with direct electrode-to-benzene ring connections. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/ja111320n\">https://doi.org/10.1021/ja111320n</a>","ama":"Schneebeli ST, Kamenetska M, Cheng Z, et al. Single-molecule conductance through multiple π−π-stacked benzene rings determined with direct electrode-to-benzene ring connections. <i>Journal of the American Chemical Society</i>. 2011;133(7):2136-2139. doi:<a href=\"https://doi.org/10.1021/ja111320n\">10.1021/ja111320n</a>","ieee":"S. T. Schneebeli <i>et al.</i>, “Single-molecule conductance through multiple π−π-stacked benzene rings determined with direct electrode-to-benzene ring connections,” <i>Journal of the American Chemical Society</i>, vol. 133, no. 7. American Chemical Society, pp. 2136–2139, 2011.","chicago":"Schneebeli, Severin T., Maria Kamenetska, Zhanling Cheng, Rachid Skouta, Richard A. Friesner, Latha Venkataraman, and Ronald Breslow. “Single-Molecule Conductance through Multiple Π−π-Stacked Benzene Rings Determined with Direct Electrode-to-Benzene Ring Connections.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2011. <a href=\"https://doi.org/10.1021/ja111320n\">https://doi.org/10.1021/ja111320n</a>.","ista":"Schneebeli ST, Kamenetska M, Cheng Z, Skouta R, Friesner RA, Venkataraman L, Breslow R. 2011. Single-molecule conductance through multiple π−π-stacked benzene rings determined with direct electrode-to-benzene ring connections. Journal of the American Chemical Society. 133(7), 2136–2139.","mla":"Schneebeli, Severin T., et al. “Single-Molecule Conductance through Multiple Π−π-Stacked Benzene Rings Determined with Direct Electrode-to-Benzene Ring Connections.” <i>Journal of the American Chemical Society</i>, vol. 133, no. 7, American Chemical Society, 2011, pp. 2136–39, doi:<a href=\"https://doi.org/10.1021/ja111320n\">10.1021/ja111320n</a>."},"publication_status":"published","status":"public","date_published":"2011-01-25T00:00:00Z","article_processing_charge":"No","day":"25","OA_type":"closed access","scopus_import":"1","_id":"18020","abstract":[{"lang":"eng","text":"Understanding electron transport across π−π-stacked systems will help to answer fundamental questions about biochemical redox processes and benefit the design of new materials and molecular devices. Herein we employed the STM break-junction technique to measure the single-molecule conductance of multiple π−π-stacked aromatic rings. We studied electron transport through up to four stacked benzene rings held together in an eclipsed fashion via a paracyclophane scaffold. We found that the strained hydrocarbons studied herein couple directly to gold electrodes during the measurements; hence, we did not require any heteroatom binding groups as electrical contacts. Density functional theory-based calculations suggest that the gold atoms of the electrodes bind to two neighboring carbon atoms of the outermost cyclophane benzene rings in η2 fashion. Our measurements show an exponential decay of the conductance with an increasing number of stacked benzene rings, indicating a nonresonant tunneling mechanism. Furthermore, STM tip−substrate displacement data provide additional evidence that the electrodes bind to the outermost benzene rings of the π−π-stacked molecular wires."}],"year":"2011","page":"2136-2139","extern":"1","oa_version":"None","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"volume":133,"month":"01","publication":"Journal of the American Chemical Society","language":[{"iso":"eng"}],"title":"Single-molecule conductance through multiple π−π-stacked benzene rings determined with direct electrode-to-benzene ring connections","external_id":{"pmid":["21265533"]},"type":"journal_article","issue":"7","quality_controlled":"1","date_updated":"2025-01-03T09:49:00Z","article_type":"letter_note"},{"day":"01","article_processing_charge":"No","OA_type":"closed access","scopus_import":"1","_id":"18021","page":"353-357","extern":"1","abstract":[{"lang":"eng","text":"Charge transport across metal–molecule interfaces has an important role in organic electronics1. Typically, chemical link groups such as thiols2 or amines3 are used to bind organic molecules to metal electrodes in single-molecule circuits, with these groups controlling both the physical structure and the electronic coupling at the interface. Direct metal–carbon coupling has been shown through C60, benzene and π-stacked benzene4,5,6,7, but ideally the carbon backbone of the molecule should be covalently bonded to the electrode without intervening link groups. Here, we demonstrate a method to create junctions with such contacts. Trimethyl tin (SnMe3)-terminated polymethylene chains are used to form single-molecule junctions with a break-junction technique2,3. Gold atoms at the electrode displace the SnMe3 linkers, leading to the formation of direct Au–C bonded single-molecule junctions with a conductance that is ∼100 times larger than analogous alkanes with most other terminations. The conductance of these Au–C bonded alkanes decreases exponentially with molecular length, with a decay constant of 0.97 per methylene, consistent with a non-resonant transport mechanism. Control experiments and ab initio calculations show that high conductances are achieved because a covalent Au–C sigma (σ) bond is formed. This offers a new method for making reproducible and highly conducting metal–organic contacts."}],"year":"2011","publisher":"Springer Nature","pmid":1,"doi":"10.1038/nnano.2011.66","date_created":"2024-09-09T12:57:48Z","intvolume":"         6","author":[{"first_name":"Z.-L.","full_name":"Cheng, Z.-L.","last_name":"Cheng"},{"full_name":"Skouta, R.","last_name":"Skouta","first_name":"R."},{"first_name":"H.","full_name":"Vazquez, H.","last_name":"Vazquez"},{"full_name":"Widawsky, J. R.","last_name":"Widawsky","first_name":"J. R."},{"first_name":"S.","full_name":"Schneebeli, S.","last_name":"Schneebeli"},{"full_name":"Chen, W.","last_name":"Chen","first_name":"W."},{"full_name":"Hybertsen, M. S.","last_name":"Hybertsen","first_name":"M. S."},{"first_name":"R.","last_name":"Breslow","full_name":"Breslow, R."},{"full_name":"Venkataraman, Latha","orcid":"0000-0002-6957-6089","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha"}],"publication_status":"published","citation":{"ista":"Cheng Z-L, Skouta R, Vazquez H, Widawsky JR, Schneebeli S, Chen W, Hybertsen MS, Breslow R, Venkataraman L. 2011. In situ formation of highly conducting covalent Au–C contacts for single-molecule junctions. Nature Nanotechnology. 6(6), 353–357.","mla":"Cheng, Z. L., et al. “In Situ Formation of Highly Conducting Covalent Au–C Contacts for Single-Molecule Junctions.” <i>Nature Nanotechnology</i>, vol. 6, no. 6, Springer Nature, 2011, pp. 353–57, doi:<a href=\"https://doi.org/10.1038/nnano.2011.66\">10.1038/nnano.2011.66</a>.","chicago":"Cheng, Z.-L., R. Skouta, H. Vazquez, J. R. Widawsky, S. Schneebeli, W. Chen, M. S. Hybertsen, R. Breslow, and Latha Venkataraman. “In Situ Formation of Highly Conducting Covalent Au–C Contacts for Single-Molecule Junctions.” <i>Nature Nanotechnology</i>. Springer Nature, 2011. <a href=\"https://doi.org/10.1038/nnano.2011.66\">https://doi.org/10.1038/nnano.2011.66</a>.","ieee":"Z.-L. Cheng <i>et al.</i>, “In situ formation of highly conducting covalent Au–C contacts for single-molecule junctions,” <i>Nature Nanotechnology</i>, vol. 6, no. 6. Springer Nature, pp. 353–357, 2011.","ama":"Cheng Z-L, Skouta R, Vazquez H, et al. In situ formation of highly conducting covalent Au–C contacts for single-molecule junctions. <i>Nature Nanotechnology</i>. 2011;6(6):353-357. doi:<a href=\"https://doi.org/10.1038/nnano.2011.66\">10.1038/nnano.2011.66</a>","short":"Z.-L. Cheng, R. Skouta, H. Vazquez, J.R. Widawsky, S. Schneebeli, W. Chen, M.S. Hybertsen, R. Breslow, L. Venkataraman, Nature Nanotechnology 6 (2011) 353–357.","apa":"Cheng, Z.-L., Skouta, R., Vazquez, H., Widawsky, J. R., Schneebeli, S., Chen, W., … Venkataraman, L. (2011). In situ formation of highly conducting covalent Au–C contacts for single-molecule junctions. <i>Nature Nanotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nnano.2011.66\">https://doi.org/10.1038/nnano.2011.66</a>"},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2011-06-01T00:00:00Z","title":"In situ formation of highly conducting covalent Au–C contacts for single-molecule junctions","external_id":{"pmid":["21552252"]},"issue":"6","type":"journal_article","quality_controlled":"1","date_updated":"2025-01-03T09:51:33Z","article_type":"letter_note","publication_identifier":{"issn":["1748-3387"],"eissn":["1748-3395"]},"oa_version":"None","month":"06","publication":"Nature Nanotechnology","volume":6,"language":[{"iso":"eng"}]},{"title":"Adaptive response and enlargement of dynamic range","day":"02","type":"journal_article","issue":"2","_id":"1815","quality_controlled":0,"year":"2011","abstract":[{"text":"Many membrane channels and receptors exhibit adaptive, or desensitized, response to a strong sustained input stimulus, often supported by protein activity-dependent inactivation. Adaptive response is thought to be related to various cellular functions such as homeostasis and enlargement of dynamic range by background compensation. Here we study the quantitative relation between adaptive response and background compensation within a modeling framework. We show that any particular type of adaptive response is neither sufficient nor necessary for adaptive enlargement of dynamic range. In particular a precise adaptive response, where system activity is maintained at a constant level at steady state, does not ensure a large dynamic range neither in input signal nor in system output. A general mechanism for input dynamic range enlargement can come about from the activity-dependent modulation of protein responsiveness by multiple biochemical modification, regardless of the type of adaptive response it induces. Therefore hierarchical biochemical processes such as methylation and phosphorylation are natural candidates to induce this property in signaling systems.","lang":"eng"}],"date_updated":"2021-01-12T06:53:23Z","extern":1,"page":"515 - 526","author":[{"first_name":"Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","last_name":"Friedlander","full_name":"Tamar Friedlander"},{"first_name":"Naama","full_name":"Brenner, Naama","last_name":"Brenner"}],"intvolume":"         8","date_created":"2018-12-11T11:54:10Z","doi":"10.3934/mbe.2011.8.515","publisher":"Arizona State University","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1003.2791"}],"volume":8,"status":"public","oa":1,"publication":"Mathematical Biosciences and Engineering","month":"04","publication_status":"published","citation":{"ama":"Friedlander T, Brenner N. Adaptive response and enlargement of dynamic range. <i>Mathematical Biosciences and Engineering</i>. 2011;8(2):515-526. doi:<a href=\"https://doi.org/10.3934/mbe.2011.8.515\">10.3934/mbe.2011.8.515</a>","short":"T. Friedlander, N. Brenner, Mathematical Biosciences and Engineering 8 (2011) 515–526.","apa":"Friedlander, T., &#38; Brenner, N. (2011). Adaptive response and enlargement of dynamic range. <i>Mathematical Biosciences and Engineering</i>. Arizona State University. <a href=\"https://doi.org/10.3934/mbe.2011.8.515\">https://doi.org/10.3934/mbe.2011.8.515</a>","chicago":"Friedlander, Tamar, and Naama Brenner. “Adaptive Response and Enlargement of Dynamic Range.” <i>Mathematical Biosciences and Engineering</i>. Arizona State University, 2011. <a href=\"https://doi.org/10.3934/mbe.2011.8.515\">https://doi.org/10.3934/mbe.2011.8.515</a>.","ieee":"T. Friedlander and N. Brenner, “Adaptive response and enlargement of dynamic range,” <i>Mathematical Biosciences and Engineering</i>, vol. 8, no. 2. Arizona State University, pp. 515–526, 2011.","ista":"Friedlander T, Brenner N. 2011. Adaptive response and enlargement of dynamic range. Mathematical Biosciences and Engineering. 8(2), 515–526.","mla":"Friedlander, Tamar, and Naama Brenner. “Adaptive Response and Enlargement of Dynamic Range.” <i>Mathematical Biosciences and Engineering</i>, vol. 8, no. 2, Arizona State University, 2011, pp. 515–26, doi:<a href=\"https://doi.org/10.3934/mbe.2011.8.515\">10.3934/mbe.2011.8.515</a>."},"date_published":"2011-04-02T00:00:00Z","publist_id":"5291"},{"date_created":"2024-10-15T11:20:54Z","doi":"10.1016/j.cag.2011.03.011","publisher":"Elsevier","author":[{"first_name":"Roee","full_name":"Litman, Roee","last_name":"Litman"},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"first_name":"Michael M.","full_name":"Bronstein, Michael M.","last_name":"Bronstein"}],"intvolume":"        35","OA_place":"repository","date_published":"2011-06-01T00:00:00Z","oa":1,"status":"public","citation":{"ama":"Litman R, Bronstein AM, Bronstein MM. Diffusion-geometric maximally stable component detection in deformable shapes. <i>Computers &#38; Graphics</i>. 2011;35(3):549-560. doi:<a href=\"https://doi.org/10.1016/j.cag.2011.03.011\">10.1016/j.cag.2011.03.011</a>","short":"R. Litman, A.M. Bronstein, M.M. Bronstein, Computers &#38; Graphics 35 (2011) 549–560.","apa":"Litman, R., Bronstein, A. M., &#38; Bronstein, M. M. (2011). Diffusion-geometric maximally stable component detection in deformable shapes. <i>Computers &#38; Graphics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cag.2011.03.011\">https://doi.org/10.1016/j.cag.2011.03.011</a>","chicago":"Litman, Roee, Alex M. Bronstein, and Michael M. Bronstein. “Diffusion-Geometric Maximally Stable Component Detection in Deformable Shapes.” <i>Computers &#38; Graphics</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.cag.2011.03.011\">https://doi.org/10.1016/j.cag.2011.03.011</a>.","ieee":"R. Litman, A. M. Bronstein, and M. M. Bronstein, “Diffusion-geometric maximally stable component detection in deformable shapes,” <i>Computers &#38; Graphics</i>, vol. 35, no. 3. Elsevier, pp. 549–560, 2011.","ista":"Litman R, Bronstein AM, Bronstein MM. 2011. Diffusion-geometric maximally stable component detection in deformable shapes. Computers &#38; Graphics. 35(3), 549–560.","mla":"Litman, Roee, et al. “Diffusion-Geometric Maximally Stable Component Detection in Deformable Shapes.” <i>Computers &#38; Graphics</i>, vol. 35, no. 3, Elsevier, 2011, pp. 549–60, doi:<a href=\"https://doi.org/10.1016/j.cag.2011.03.011\">10.1016/j.cag.2011.03.011</a>."},"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1012.3951","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","page":"549-560","extern":"1","year":"2011","abstract":[{"text":"Maximally stable component detection is a very popular method for feature analysis in images, mainly due to its low computation cost and high repeatability. With the recent advance of feature-based methods in geometric shape analysis, there is significant interest in finding analogous approaches in the 3D world. In this paper, we formulate a diffusion-geometric framework for stable component detection in non-rigid 3D shapes, which can be used for geometric feature detection and description. A quantitative evaluation of our method on the SHREC’10 feature detection benchmark shows its potential as a source of high-quality features.","lang":"eng"}],"_id":"18362","scopus_import":"1","OA_type":"green","oa_version":"Preprint","publication_identifier":{"issn":["0097-8493"]},"language":[{"iso":"eng"}],"publication":"Computers & Graphics","month":"06","volume":35,"issue":"3","type":"journal_article","title":"Diffusion-geometric maximally stable component detection in deformable shapes","arxiv":1,"external_id":{"arxiv":["1012.3951"]},"article_type":"original","date_updated":"2024-11-12T08:40:40Z","quality_controlled":"1"},{"language":[{"iso":"eng"}],"month":"06","publication":"Computers & Graphics","volume":35,"oa_version":"Preprint","publication_identifier":{"issn":["0097-8493"]},"date_updated":"2024-11-12T08:37:24Z","article_type":"letter_note","quality_controlled":"1","issue":"3","type":"journal_article","external_id":{"arxiv":["1012.5936"]},"arxiv":1,"title":"Affine-invariant geodesic geometry of deformable 3D shapes","date_published":"2011-06-01T00:00:00Z","publication_status":"published","citation":{"short":"D. Raviv, A.M. Bronstein, M.M. Bronstein, R. Kimmel, N. Sochen, Computers &#38; Graphics 35 (2011) 692–697.","ama":"Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. Affine-invariant geodesic geometry of deformable 3D shapes. <i>Computers &#38; Graphics</i>. 2011;35(3):692-697. doi:<a href=\"https://doi.org/10.1016/j.cag.2011.03.030\">10.1016/j.cag.2011.03.030</a>","apa":"Raviv, D., Bronstein, A. M., Bronstein, M. M., Kimmel, R., &#38; Sochen, N. (2011). Affine-invariant geodesic geometry of deformable 3D shapes. <i>Computers &#38; Graphics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cag.2011.03.030\">https://doi.org/10.1016/j.cag.2011.03.030</a>","ista":"Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. 2011. Affine-invariant geodesic geometry of deformable 3D shapes. Computers &#38; Graphics. 35(3), 692–697.","mla":"Raviv, Dan, et al. “Affine-Invariant Geodesic Geometry of Deformable 3D Shapes.” <i>Computers &#38; Graphics</i>, vol. 35, no. 3, Elsevier, 2011, pp. 692–97, doi:<a href=\"https://doi.org/10.1016/j.cag.2011.03.030\">10.1016/j.cag.2011.03.030</a>.","chicago":"Raviv, Dan, Alex M. Bronstein, Michael M. Bronstein, Ron Kimmel, and Nir Sochen. “Affine-Invariant Geodesic Geometry of Deformable 3D Shapes.” <i>Computers &#38; Graphics</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.cag.2011.03.030\">https://doi.org/10.1016/j.cag.2011.03.030</a>.","ieee":"D. Raviv, A. M. Bronstein, M. M. Bronstein, R. Kimmel, and N. Sochen, “Affine-invariant geodesic geometry of deformable 3D shapes,” <i>Computers &#38; Graphics</i>, vol. 35, no. 3. Elsevier, pp. 692–697, 2011."},"oa":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1012.5936"}],"publisher":"Elsevier","date_created":"2024-10-15T11:20:54Z","doi":"10.1016/j.cag.2011.03.030","intvolume":"        35","author":[{"first_name":"Dan","full_name":"Raviv, Dan","last_name":"Raviv"},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730"},{"full_name":"Bronstein, Michael M.","last_name":"Bronstein","first_name":"Michael M."},{"full_name":"Kimmel, Ron","last_name":"Kimmel","first_name":"Ron"},{"full_name":"Sochen, Nir","last_name":"Sochen","first_name":"Nir"}],"OA_place":"repository","page":"692-697","extern":"1","abstract":[{"text":"Natural objects can be subject to various transformations yet still preserve properties that we refer to as invariants. Here, we use definitions of affine-invariant arclength for surfaces in \r\n in order to extend the set of existing non-rigid shape analysis tools. We show that by re-defining the surface metric as its equi-affine version, the surface with its modified metric tensor can be treated as a canonical Euclidean object on which most classical Euclidean processing and analysis tools can be applied. The new definition of a metric is used to extend the fast marching method technique for computing geodesic distances on surfaces, where now, the distances are defined with respect to an affine-invariant arclength. Applications of the proposed framework demonstrate its invariance, efficiency, and accuracy in shape analysis.","lang":"eng"}],"year":"2011","scopus_import":"1","OA_type":"green","_id":"18363","article_processing_charge":"No","day":"01"},{"type":"conference","article_processing_charge":"No","day":"22","arxiv":1,"title":"Affine-invariant diffusion geometry for the analysis of deformable 3D shapes","conference":{"name":"IEEE Computer Vision and Pattern Recognition (CVPR) 2011","start_date":"2011-06-20","location":"Colorado Springs, CO, United States","end_date":"2011-06-25"},"article_number":"5995486","external_id":{"arxiv":["1012.5933"]},"extern":"1","abstract":[{"lang":"eng","text":"We introduce an (equi-)affine invariant diffusion geometry by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to construct an invariant Laplacian from which local and global geometric structures are extracted. Applications of the proposed framework demonstrate its power in generalizing and enriching the existing set of tools for shape analysis."}],"date_updated":"2024-12-05T14:15:22Z","year":"2011","quality_controlled":"1","_id":"18377","publisher":"IEEE","date_created":"2024-10-15T11:20:54Z","doi":"10.1109/cvpr.2011.5995486","publication_identifier":{"eissn":["1063-6919"],"isbn":["9781457703942"]},"oa_version":"Preprint","author":[{"last_name":"Raviv","full_name":"Raviv, Dan","first_name":"Dan"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"},{"full_name":"Kimmel, Ron","last_name":"Kimmel","first_name":"Ron"},{"first_name":"Nir","last_name":"Sochen","full_name":"Sochen, Nir"}],"language":[{"iso":"eng"}],"date_published":"2011-08-22T00:00:00Z","publication_status":"published","citation":{"short":"D. Raviv, M.M. Bronstein, A.M. Bronstein, R. Kimmel, N. Sochen, in:, CVPR 2011, IEEE, 2011.","ama":"Raviv D, Bronstein MM, Bronstein AM, Kimmel R, Sochen N. Affine-invariant diffusion geometry for the analysis of deformable 3D shapes. In: <i>CVPR 2011</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/cvpr.2011.5995486\">10.1109/cvpr.2011.5995486</a>","apa":"Raviv, D., Bronstein, M. M., Bronstein, A. M., Kimmel, R., &#38; Sochen, N. (2011). Affine-invariant diffusion geometry for the analysis of deformable 3D shapes. In <i>CVPR 2011</i>. Colorado Springs, CO, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2011.5995486\">https://doi.org/10.1109/cvpr.2011.5995486</a>","ista":"Raviv D, Bronstein MM, Bronstein AM, Kimmel R, Sochen N. 2011. Affine-invariant diffusion geometry for the analysis of deformable 3D shapes. CVPR 2011. IEEE Computer Vision and Pattern Recognition (CVPR) 2011, 5995486.","mla":"Raviv, Dan, et al. “Affine-Invariant Diffusion Geometry for the Analysis of Deformable 3D Shapes.” <i>CVPR 2011</i>, 5995486, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/cvpr.2011.5995486\">10.1109/cvpr.2011.5995486</a>.","ieee":"D. Raviv, M. M. Bronstein, A. M. Bronstein, R. Kimmel, and N. Sochen, “Affine-invariant diffusion geometry for the analysis of deformable 3D shapes,” in <i>CVPR 2011</i>, Colorado Springs, CO, United States, 2011.","chicago":"Raviv, Dan, Michael M. Bronstein, Alex M. Bronstein, Ron Kimmel, and Nir Sochen. “Affine-Invariant Diffusion Geometry for the Analysis of Deformable 3D Shapes.” In <i>CVPR 2011</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/cvpr.2011.5995486\">https://doi.org/10.1109/cvpr.2011.5995486</a>."},"publication":"CVPR 2011","oa":1,"month":"08","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1012.5933","open_access":"1"}]},{"scopus_import":"1","_id":"18394","quality_controlled":"1","date_updated":"2024-12-04T12:08:48Z","abstract":[{"text":"In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required results. First it warps multiple appearances of each word-part in the lexicon for embedding into the same euclidean space. The embedding is done based on the warping path produced by the Dynamic Time Warping (DTW) process while calculating the similarity distance. In the next step, all samples of different word-parts are resampled uniformly to the same size. The kd-tree structure is used to store all shapes representing word parts in the lexicon. Fast approximation of k-nearest neighbors generates a short list of candidates to be presented to the next step. In the third step, the Active-DTW [15] algorithm is used to examine each sample in the short list and give final accurate results. We demonstrate our method on a database of 23,500 images of word-parts extracted from the IFN/ENIT database [6] and 22,000 images collected from 93 writers. Our method achieves a speedup of 5 orders of magnitude over the exact method, at the cost of only a 3.8% reduction in accuracy.","lang":"eng"}],"year":"2011","extern":"1","title":"Fast key-word searching via embedding and active-DTW","article_number":"6065278","conference":{"end_date":"2011-09-21","start_date":"2011-09-18","location":"Beijing, China","name":"11th International Conference on Document Analysis and Recognition"},"day":"03","article_processing_charge":"No","type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"chicago":"Saabni, Raid, and Alex M. Bronstein. “Fast Key-Word Searching via Embedding and Active-DTW.” In <i>2011 International Conference on Document Analysis and Recognition</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/icdar.2011.23\">https://doi.org/10.1109/icdar.2011.23</a>.","ieee":"R. Saabni and A. M. Bronstein, “Fast key-word searching via embedding and active-DTW,” in <i>2011 International Conference on Document Analysis and Recognition</i>, Beijing, China, 2011.","mla":"Saabni, Raid, and Alex M. Bronstein. “Fast Key-Word Searching via Embedding and Active-DTW.” <i>2011 International Conference on Document Analysis and Recognition</i>, 6065278, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/icdar.2011.23\">10.1109/icdar.2011.23</a>.","ista":"Saabni R, Bronstein AM. 2011. Fast key-word searching via embedding and active-DTW. 2011 International Conference on Document Analysis and Recognition. 11th International Conference on Document Analysis and Recognition, 6065278.","ama":"Saabni R, Bronstein AM. Fast key-word searching via embedding and active-DTW. In: <i>2011 International Conference on Document Analysis and Recognition</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/icdar.2011.23\">10.1109/icdar.2011.23</a>","short":"R. Saabni, A.M. Bronstein, in:, 2011 International Conference on Document Analysis and Recognition, IEEE, 2011.","apa":"Saabni, R., &#38; Bronstein, A. M. (2011). Fast key-word searching via embedding and active-DTW. In <i>2011 International Conference on Document Analysis and Recognition</i>. Beijing, China: IEEE. <a href=\"https://doi.org/10.1109/icdar.2011.23\">https://doi.org/10.1109/icdar.2011.23</a>"},"publication":"2011 International Conference on Document Analysis and Recognition","status":"public","month":"11","date_published":"2011-11-03T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","publication_identifier":{"eissn":["2379-2140"],"isbn":["9781457713507"]},"author":[{"full_name":"Saabni, Raid","last_name":"Saabni","first_name":"Raid"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein"}],"publisher":"IEEE","date_created":"2024-10-15T11:20:54Z","doi":"10.1109/icdar.2011.23"},{"month":"06","publication":"2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro","status":"public","publication_status":"published","citation":{"mla":"Michel, Fabrice, et al. “Boosted Metric Learning for 3D Multi-Modal Deformable Registration.” <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro</i>, 5872619, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/isbi.2011.5872619\">10.1109/isbi.2011.5872619</a>.","ista":"Michel F, Bronstein M, Bronstein AM, Paragios N. 2011. Boosted metric learning for 3D multi-modal deformable registration. 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro. 8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 5872619.","ieee":"F. Michel, M. Bronstein, A. M. Bronstein, and N. Paragios, “Boosted metric learning for 3D multi-modal deformable registration,” in <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro</i>,  Chicago, IL, United States, 2011.","chicago":"Michel, Fabrice, Michael Bronstein, Alex M. Bronstein, and Nikos Paragios. “Boosted Metric Learning for 3D Multi-Modal Deformable Registration.” In <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/isbi.2011.5872619\">https://doi.org/10.1109/isbi.2011.5872619</a>.","ama":"Michel F, Bronstein M, Bronstein AM, Paragios N. Boosted metric learning for 3D multi-modal deformable registration. In: <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/isbi.2011.5872619\">10.1109/isbi.2011.5872619</a>","short":"F. Michel, M. Bronstein, A.M. Bronstein, N. Paragios, in:, 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, IEEE, 2011.","apa":"Michel, F., Bronstein, M., Bronstein, A. M., &#38; Paragios, N. (2011). Boosted metric learning for 3D multi-modal deformable registration. In <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro</i>.  Chicago, IL, United States: IEEE. <a href=\"https://doi.org/10.1109/isbi.2011.5872619\">https://doi.org/10.1109/isbi.2011.5872619</a>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2011-06-09T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2024-10-15T11:20:54Z","doi":"10.1109/isbi.2011.5872619","publisher":"IEEE","author":[{"first_name":"Fabrice","full_name":"Michel, Fabrice","last_name":"Michel"},{"first_name":"Michael","last_name":"Bronstein","full_name":"Bronstein, Michael"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Paragios","full_name":"Paragios, Nikos","first_name":"Nikos"}],"publication_identifier":{"isbn":["9781424441280"],"eissn":["1945-8452"]},"oa_version":"None","quality_controlled":"1","_id":"18406","scopus_import":"1","extern":"1","year":"2011","date_updated":"2024-12-04T11:55:42Z","abstract":[{"lang":"eng","text":"Defining a suitable metric is one of the biggest challenges in deformable image fusion from different modalities. In this paper, we propose a novel approach for multi-modal metric learning in the deformable registration framework that consists of embedding data from both modalities into a common metric space whose metric is used to parametrize the similarity. Specifically, we use image representation in the Fourier/Gabor space which introduces invariance to the local pose parameters, and the Hamming metric as the target embedding space, which allows constructing the embedding using boosted learning algorithms. The resulting metric is incorporated into a discrete optimization framework. Very promising results demonstrate the potential of the proposed method."}],"day":"09","article_processing_charge":"No","conference":{"location":" Chicago, IL, United States","end_date":"2011-04-02","start_date":"2011-03-30","name":"8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro"},"title":"Boosted metric learning for 3D multi-modal deformable registration","article_number":"5872619","type":"conference"},{"date_published":"2011-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","citation":{"apa":"Bronstein, M. M., &#38; Bronstein, A. M. (2011). Shape recognition with spectral distances. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tpami.2010.210\">https://doi.org/10.1109/tpami.2010.210</a>","short":"M.M. Bronstein, A.M. Bronstein, IEEE Transactions on Pattern Analysis and Machine Intelligence 33 (2011) 1065–1071.","ama":"Bronstein MM, Bronstein AM. Shape recognition with spectral distances. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2011;33(5):1065-1071. doi:<a href=\"https://doi.org/10.1109/tpami.2010.210\">10.1109/tpami.2010.210</a>","chicago":"Bronstein, Michael M, and Alex M. Bronstein. “Shape Recognition with Spectral Distances.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers, 2011. <a href=\"https://doi.org/10.1109/tpami.2010.210\">https://doi.org/10.1109/tpami.2010.210</a>.","ieee":"M. M. Bronstein and A. M. Bronstein, “Shape recognition with spectral distances,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 33, no. 5. Institute of Electrical and Electronics Engineers, pp. 1065–1071, 2011.","ista":"Bronstein MM, Bronstein AM. 2011. Shape recognition with spectral distances. IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(5), 1065–1071.","mla":"Bronstein, Michael M., and Alex M. Bronstein. “Shape Recognition with Spectral Distances.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 33, no. 5, Institute of Electrical and Electronics Engineers, 2011, pp. 1065–71, doi:<a href=\"https://doi.org/10.1109/tpami.2010.210\">10.1109/tpami.2010.210</a>."},"author":[{"full_name":"Bronstein, Michael M","last_name":"Bronstein","first_name":"Michael M"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"}],"intvolume":"        33","date_created":"2024-10-15T11:20:54Z","doi":"10.1109/tpami.2010.210","pmid":1,"publisher":"Institute of Electrical and Electronics Engineers","year":"2011","abstract":[{"text":"Recent works have shown the use of diffusion geometry for various pattern recognition applications, including nonrigid shape analysis. In this paper, we introduce spectral shape distance as a general framework for distribution-based shape similarity and show that two recent methods for shape similarity due to Rustamov and Mahmoudi and Sapiro are particular cases thereof.","lang":"eng"}],"extern":"1","page":"1065-1071","_id":"18411","OA_type":"closed access","scopus_import":"1","article_processing_charge":"No","day":"01","language":[{"iso":"eng"}],"volume":33,"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","month":"05","publication_identifier":{"issn":["0162-8828"]},"oa_version":"None","article_type":"original","date_updated":"2024-10-22T08:02:31Z","quality_controlled":"1","type":"journal_article","issue":"5","title":"Shape recognition with spectral distances","external_id":{"pmid":["21135442"]}},{"author":[{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"full_name":"Guibas, Leonidas J.","last_name":"Guibas","first_name":"Leonidas J."},{"full_name":"Ovsjanikov, Maks","last_name":"Ovsjanikov","first_name":"Maks"}],"intvolume":"        30","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"oa_version":"None","doi":"10.1145/1899404.1899405","date_created":"2024-10-15T11:20:55Z","publisher":"Association for Computing Machinery","volume":30,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"ACM Transactions on Graphics","status":"public","month":"01","publication_status":"published","citation":{"mla":"Bronstein, Alex M., et al. “Shape Google: Geometric Words and Expressions for Invariant Shape Retrieval.” <i>ACM Transactions on Graphics</i>, vol. 30, no. 1, Association for Computing Machinery, 2011, pp. 1–20, doi:<a href=\"https://doi.org/10.1145/1899404.1899405\">10.1145/1899404.1899405</a>.","ista":"Bronstein AM, Bronstein MM, Guibas LJ, Ovsjanikov M. 2011. Shape google: Geometric words and expressions for invariant shape retrieval. ACM Transactions on Graphics. 30(1), 1–20.","chicago":"Bronstein, Alex M., Michael M. Bronstein, Leonidas J. Guibas, and Maks Ovsjanikov. “Shape Google: Geometric Words and Expressions for Invariant Shape Retrieval.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1899404.1899405\">https://doi.org/10.1145/1899404.1899405</a>.","ieee":"A. M. Bronstein, M. M. Bronstein, L. J. Guibas, and M. Ovsjanikov, “Shape google: Geometric words and expressions for invariant shape retrieval,” <i>ACM Transactions on Graphics</i>, vol. 30, no. 1. Association for Computing Machinery, pp. 1–20, 2011.","ama":"Bronstein AM, Bronstein MM, Guibas LJ, Ovsjanikov M. Shape google: Geometric words and expressions for invariant shape retrieval. <i>ACM Transactions on Graphics</i>. 2011;30(1):1-20. doi:<a href=\"https://doi.org/10.1145/1899404.1899405\">10.1145/1899404.1899405</a>","short":"A.M. Bronstein, M.M. Bronstein, L.J. Guibas, M. Ovsjanikov, ACM Transactions on Graphics 30 (2011) 1–20.","apa":"Bronstein, A. M., Bronstein, M. M., Guibas, L. J., &#38; Ovsjanikov, M. (2011). Shape google: Geometric words and expressions for invariant shape retrieval. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1899404.1899405\">https://doi.org/10.1145/1899404.1899405</a>"},"language":[{"iso":"eng"}],"date_published":"2011-01-01T00:00:00Z","title":"Shape google: Geometric words and expressions for invariant shape retrieval","article_processing_charge":"No","day":"01","type":"journal_article","issue":"1","_id":"18433","scopus_import":"1","quality_controlled":"1","year":"2011","abstract":[{"text":"The computer vision and pattern recognition communities have recently witnessed a surge of feature-based methods in object recognition and image retrieval applications. These methods allow representing images as collections of “visual words” and treat them using text search approaches following the “bag of features” paradigm. In this article, we explore analogous approaches in the 3D world applied to the problem of nonrigid shape retrieval in large databases. Using multiscale diffusion heat kernels as “geometric words,” we construct compact and informative shape descriptors by means of the “bag of features” approach. We also show that considering pairs of “geometric words” (“geometric expressions”) allows creating spatially sensitive bags of features with better discriminative power. Finally, adopting metric learning approaches, we show that shapes can be efficiently represented as binary codes. Our approach achieves state-of-the-art results on the SHREC 2010 large-scale shape retrieval benchmark.","lang":"eng"}],"date_updated":"2024-12-18T14:59:43Z","page":"1-20","extern":"1"},{"date_updated":"2026-06-29T10:44:15Z","article_type":"original","quality_controlled":"1","issue":"5","type":"journal_article","title":"The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions","external_id":{"arxiv":["1002.1756"]},"arxiv":1,"language":[{"iso":"eng"}],"publication":"Proceedings of the American Mathematical Society","month":"05","volume":139,"oa_version":"Preprint","publication_identifier":{"eissn":["1088-6826"],"issn":["0002-9939"]},"page":"1805-1817","extern":"1","abstract":[{"lang":"eng","text":"We consider the defocusing nonlinear wave equation utt − Δu +\r\n|u|\r\npu = 0 with spherically-symmetric initial data in the regime 4\r\nd−2 <p< 4\r\nd−3\r\n(which is energy-supercritical) and dimensions 3 ≤ d ≤ 6; we also consider\r\nd ≥ 7, but for a smaller range of p> 4\r\nd−2 . The principal result is that\r\nblowup (or failure to scatter) must be accompanied by blowup of the critical\r\nSobolev norm. An equivalent formulation is that maximal-lifespan solutions\r\nwith bounded critical Sobolev norm are global and scatter"}],"year":"2011","OA_type":"green","scopus_import":"1","_id":"22061","day":"01","article_processing_charge":"No","date_published":"2011-05-01T00:00:00Z","citation":{"mla":"Killip, Rowan, and Monica Vişan. “The Radial Defocusing Energy-Supercritical Nonlinear Wave Equation in All Space Dimensions.” <i>Proceedings of the American Mathematical Society</i>, vol. 139, no. 5, American Mathematical Society, 2011, pp. 1805–17, doi:<a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">10.1090/s0002-9939-2010-10615-9</a>.","ista":"Killip R, Vişan M. 2011. The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions. Proceedings of the American Mathematical Society. 139(5), 1805–1817.","ieee":"R. Killip and M. Vişan, “The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions,” <i>Proceedings of the American Mathematical Society</i>, vol. 139, no. 5. American Mathematical Society, pp. 1805–1817, 2011.","chicago":"Killip, Rowan, and Monica Vişan. “The Radial Defocusing Energy-Supercritical Nonlinear Wave Equation in All Space Dimensions.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2011. <a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">https://doi.org/10.1090/s0002-9939-2010-10615-9</a>.","short":"R. Killip, M. Vişan, Proceedings of the American Mathematical Society 139 (2011) 1805–1817.","apa":"Killip, R., &#38; Vişan, M. (2011). The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">https://doi.org/10.1090/s0002-9939-2010-10615-9</a>","ama":"Killip R, Vişan M. The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions. <i>Proceedings of the American Mathematical Society</i>. 2011;139(5):1805-1817. doi:<a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">10.1090/s0002-9939-2010-10615-9</a>"},"publication_status":"published","oa":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1002.1756"}],"publisher":"American Mathematical Society","doi":"10.1090/s0002-9939-2010-10615-9","date_created":"2026-06-19T08:11:09Z","intvolume":"       139","mathsc":["35L71"],"das_tickbox":"1","author":[{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","full_name":"Visan, Monica"}],"OA_place":"repository"},{"related_material":{"record":[{"status":"public","id":"3876","relation":"earlier_version"}]},"file_date_updated":"2020-07-14T12:46:07Z","language":[{"iso":"eng"}],"volume":7,"has_accepted_license":"1","publication":"Logical Methods in Computer Science","month":"12","oa_version":"Published Version","project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"}],"date_updated":"2026-07-06T13:25:39Z","quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"journal_article","issue":"4","title":"Timed parity games: Complexity and robustness","ddc":["000","005"],"ec_funded":1,"publist_id":"3324","date_published":"2011-12-14T00:00:00Z","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"status":"public","publication_status":"published","citation":{"ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation for Computational Logic, 2011, doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International Federation for Computational Logic, 2011.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2011. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>."},"file":[{"creator":"system","date_created":"2018-12-12T10:16:42Z","relation":"main_file","access_level":"open_access","checksum":"3480e1594bbef25ff7462fa93a8a814e","content_type":"application/pdf","date_updated":"2020-07-14T12:46:07Z","file_id":"5231","file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf","file_size":588863}],"das_tickbox":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Vinayak","full_name":"Prabhu, Vinayak","last_name":"Prabhu"}],"intvolume":"         7","doi":"10.2168/LMCS-7(4:8)2011","date_created":"2018-12-11T12:02:37Z","publisher":"International Federation for Computational Logic","year":"2011","tmp":{"image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"pubrep_id":"506","abstract":[{"text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers.","lang":"eng"}],"_id":"3315","scopus_import":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","day":"14","article_processing_charge":"No"},{"oa_version":"Submitted Version","month":"06","publication":"3rd USENIX Workshop on Hot Topics in Cloud Computing","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:06Z","ddc":["000","005"],"title":"Static scheduling in clouds","conference":{"name":"HotCloud: Workshop on Hot Topics in Cloud Computing","end_date":"2011-06-15","location":"Portland, OR, United States","start_date":"2011-06-14"},"type":"conference","quality_controlled":"1","department":[{"_id":"ToHe"}],"date_updated":"2026-07-07T06:07:16Z","publisher":"Usenix Association","date_created":"2018-12-11T12:02:33Z","das_tickbox":"1","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singh, Anmol","last_name":"Singh","first_name":"Anmol","id":"72A86902-E99F-11E9-9F62-915534D1B916"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh","full_name":"Singh, Vasu"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"}],"file":[{"file_size":232770,"file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf","date_updated":"2020-07-14T12:46:06Z","file_id":"5333","access_level":"open_access","checksum":"21a461ac004bb535c83320fe79b30375","relation":"main_file","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:18:14Z"}],"publication_status":"published","citation":{"mla":"Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Usenix Association, 2011, pp. 1–6.","ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” in <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Portland, OR, United States, 2011, pp. 1–6.","chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds.” In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, 1–6. Usenix Association, 2011.","short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.","apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Static scheduling in clouds. In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i> (pp. 1–6). Portland, OR, United States: Usenix Association.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>. Usenix Association; 2011:1-6."},"status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3338","corr_author":"1","date_published":"2011-06-14T00:00:00Z","article_processing_charge":"No","day":"14","_id":"3302","page":"1 - 6","pubrep_id":"90","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler.","lang":"eng"}],"year":"2011"},{"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:09Z","related_material":{"record":[{"id":"5385","relation":"earlier_version","status":"public"},{"status":"public","id":"2038","relation":"later_version"}]},"language":[{"iso":"eng"}],"has_accepted_license":"1","isi":1,"month":"06","type":"conference","title":"Temporal specifications with accumulative values","external_id":{"isi":["000297350400007"]},"conference":{"name":"LICS: Logic in Computer Science","location":"Toronto, Canada","end_date":"2011-06-24","start_date":"2011-06-21"},"ddc":["000","004"],"article_number":"5970226","ec_funded":1,"date_updated":"2026-07-07T14:01:43Z","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"publisher":"IEEE","date_created":"2018-12-11T12:02:52Z","doi":"10.1109/LICS.2011.33","publist_id":"3259","date_published":"2011-06-21T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. 5970226, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011."},"file":[{"date_updated":"2020-07-14T12:46:09Z","file_id":"4960","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","file_size":225426,"creator":"system","date_created":"2018-12-12T10:12:42Z","access_level":"open_access","relation":"main_file","checksum":"792128f5455f0f40f1105f0398e05fa9","content_type":"application/pdf"}],"publication_status":"published","oa":1,"status":"public","day":"21","article_processing_charge":"No","abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"pubrep_id":"83","year":"2011","scopus_import":"1","_id":"3356"},{"publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","has_accepted_license":"1","month":"04","file_date_updated":"2020-07-14T12:46:41Z","related_material":{"record":[{"id":"3356","relation":"later_version","status":"public"},{"relation":"later_version","id":"2038","status":"public"}]},"language":[{"iso":"eng"}],"ddc":["000","004"],"title":"Temporal specifications with accumulative values","ec_funded":1,"type":"technical_report","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2026-07-07T14:01:43Z","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"alternative_title":["IST Austria Technical Report"],"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"publisher":"IST Austria","date_created":"2018-12-12T11:39:02Z","doi":"10.15479/AT:IST-2011-0003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","access_level":"open_access","checksum":"8491d0d48c4911620ecd5350b413c11e","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T11:53:00Z","file_size":366281,"file_name":"IST-2011-0003_IST-2011-0003.pdf","date_updated":"2020-07-14T12:46:41Z","file_id":"5461"}],"citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>"},"publication_status":"published","oa":1,"status":"public","date_published":"2011-04-04T00:00:00Z","day":"04","_id":"5385","pubrep_id":"21","abstract":[{"text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable.","lang":"eng"}],"year":"2011","page":"14"},{"title":"Partial-observation stochastic games: How to win when belief fails","ddc":["000","005"],"day":"05","type":"technical_report","_id":"5381","department":[{"_id":"KrCh"}],"pubrep_id":"17","date_updated":"2026-07-07T14:01:25Z","abstract":[{"text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"year":"2011","alternative_title":["IST Austria Technical Report"],"page":"43","oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"publisher":"IST Austria","date_created":"2018-12-12T11:39:00Z","doi":"10.15479/AT:IST-2011-0007","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p."},"publication_status":"published","file":[{"date_created":"2018-12-12T11:53:27Z","creator":"system","content_type":"application/pdf","access_level":"open_access","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","relation":"main_file","file_name":"IST-2011-0007_IST-2011-0007.pdf","file_size":574055,"date_updated":"2020-07-14T12:46:39Z","file_id":"5488"}],"status":"public","oa":1,"month":"07","file_date_updated":"2020-07-14T12:46:39Z","related_material":{"record":[{"id":"1903","relation":"later_version","status":"public"},{"relation":"later_version","id":"2955","status":"public"},{"id":"2211","relation":"later_version","status":"public"}]},"language":[{"iso":"eng"}],"date_published":"2011-07-05T00:00:00Z"},{"year":"2011","pubrep_id":"85","abstract":[{"lang":"eng","text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces."}],"_id":"3353","scopus_import":"1","article_processing_charge":"No","day":"01","publist_id":"3263","date_published":"2011-07-01T00:00:00Z","oa":1,"status":"public","file":[{"access_level":"open_access","relation":"main_file","checksum":"5d44a8aa81e33210649beae507602138","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:16:45Z","date_updated":"2020-07-14T12:46:09Z","file_id":"5235","file_size":775662,"file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf"}],"publication_status":"published","citation":{"ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. 2011;33(4). doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems 33 (2011).","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4, 14, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4. ACM, 2011.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/1985342.1985345","date_created":"2018-12-11T12:02:51Z","publisher":"ACM","author":[{"full_name":"Tripakis, Stavros","last_name":"Tripakis","first_name":"Stavros"},{"first_name":"Ben","last_name":"Lickly","full_name":"Lickly, Ben"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Edward","full_name":"Lee, Edward","last_name":"Lee"}],"das_tickbox":"1","intvolume":"        33","project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"},{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"date_updated":"2026-07-07T14:03:34Z","quality_controlled":"1","department":[{"_id":"ToHe"}],"issue":"4","type":"journal_article","ec_funded":1,"article_number":"14","ddc":["000","005"],"external_id":{"isi":["000292766400003"]},"title":"A theory of synchronous relational interfaces","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:09Z","month":"07","publication":"ACM Transactions on Programming Languages and Systems","isi":1,"has_accepted_license":"1","volume":33,"oa_version":"Submitted Version"},{"day":"04","article_processing_charge":"No","scopus_import":"1","_id":"3354","abstract":[{"lang":"eng","text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory."}],"year":"2011","publisher":"ACM","date_created":"2018-12-11T12:02:51Z","doi":"10.1145/1970398.1970404","intvolume":"        12","das_tickbox":"1","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Luca","full_name":"De Alfaro, Luca","last_name":"De Alfaro"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publication_status":"published","citation":{"short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic 12 (2011).","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. 2011;12(4). doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4. ACM, 2011.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic. 12(4), 28.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>."},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2011-07-04T00:00:00Z","publist_id":"3262","corr_author":"1","external_id":{"isi":["000296202300006"]},"title":"Qualitative concurrent parity games","article_number":"28","issue":"4","type":"journal_article","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","date_updated":"2026-07-07T14:02:38Z","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","publication":"ACM Transactions on Computational Logic","month":"07","isi":1,"volume":12,"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"2054","relation":"later_version","status":"public"}]}},{"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:12Z","publication":"Development","isi":1,"month":"11","has_accepted_license":"1","volume":138,"oa_version":"Published Version","article_type":"original","date_updated":"2026-07-28T08:23:30Z","quality_controlled":"1","department":[{"_id":"CaHe"}],"issue":"21","type":"journal_article","title":"Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube","external_id":{"isi":["000296060100011"]},"ddc":["570"],"date_published":"2011-11-01T00:00:00Z","publist_id":"3210","corr_author":"1","oa":1,"status":"public","citation":{"short":"P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.","ama":"Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. 2011;138(21):4673-4683. doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>","apa":"Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>","ieee":"P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp. 4673–4683, 2011.","chicago":"Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>.","mla":"Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>, vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>.","ista":"Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. Development. 138(21), 4673–4683."},"publication_status":"published","file":[{"content_type":"application/pdf","checksum":"ca12b79e01ef36c1ef1aea31cf7e7139","relation":"main_file","access_level":"open_access","date_created":"2019-10-07T14:19:42Z","creator":"dernst","file_size":4672439,"file_name":"2011_Development_Stockinger.pdf","date_updated":"2020-07-14T12:46:12Z","file_id":"6930"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:03:06Z","doi":"10.1242/dev.071233","publisher":"Company of Biologists","author":[{"last_name":"Stockinger","full_name":"Stockinger, Petra","first_name":"Petra","id":"261CB030-E90D-11E9-B182-F697D44B663C"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg"},{"last_name":"Maître","orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","first_name":"Jean-Léon"}],"intvolume":"       138","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"page":"4673 - 4683","year":"2011","abstract":[{"lang":"eng","text":"Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain undergo a characteristic tangential migration from rhombomere (r) 4, where they are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium such that they move apically between NCs towards the midline of the neuroepithelium instead of tangentially along the basal side of the neuroepithelium towards r6/7. However, direct experimental evaluation of this hypothesis is still lacking. Here, we have used a combination of biophysical cell adhesion measurements and high-resolution time-lapse microscopy to determine the role of NC cohesion in FBMN migration. We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity results in FBMNs positioned at the basal side of the neuroepithelium moving apically towards the neural tube midline instead of tangentially towards r6/7. In embryos with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results in fusion of the bilateral FBMN clusters over the apical midline of the neural tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin 2 (Cntn2) expression in these cells has little effect on apical FBMN movement, but reduces the fusion of the bilateral FBMN clusters in embryos with strongly diminished NC cohesion. These data provide direct experimental evidence that NC cohesion functions in tangential FBMN migration by restricting their apical movement."}],"keyword":["Epithelial cohesion","Hindbrain","Neuronal migration","Zebrafish"],"acknowledgement":"We thank C. Moens and J. Geiger for critical reading of earlier versions of this manuscript and members of the Heisenberg laboratory for discussions. We are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting; and the fish facility of the MPI-CBG and IST Austria for excellent fish care.","_id":"3396","scopus_import":"1","day":"01","article_processing_charge":"No"}]