[{"article_processing_charge":"No","citation":{"apa":"Fang, W., &#38; Haiman, Z. (2008). An evolving entropy floor in the intracluster gas? <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.1086/587780\">https://doi.org/10.1086/587780</a>","mla":"Fang, Wenjuan, and Zoltán Haiman. “An Evolving Entropy Floor in the Intracluster Gas?” <i>The Astrophysical Journal</i>, vol. 680, no. 1, American Astronomical Society, 2008, pp. 200–13, doi:<a href=\"https://doi.org/10.1086/587780\">10.1086/587780</a>.","ista":"Fang W, Haiman Z. 2008. An evolving entropy floor in the intracluster gas? The Astrophysical Journal. 680(1), 200–213.","ieee":"W. Fang and Z. Haiman, “An evolving entropy floor in the intracluster gas?,” <i>The Astrophysical Journal</i>, vol. 680, no. 1. American Astronomical Society, pp. 200–213, 2008.","ama":"Fang W, Haiman Z. An evolving entropy floor in the intracluster gas? <i>The Astrophysical Journal</i>. 2008;680(1):200-213. doi:<a href=\"https://doi.org/10.1086/587780\">10.1086/587780</a>","chicago":"Fang, Wenjuan, and Zoltán Haiman. “An Evolving Entropy Floor in the Intracluster Gas?” <i>The Astrophysical Journal</i>. American Astronomical Society, 2008. <a href=\"https://doi.org/10.1086/587780\">https://doi.org/10.1086/587780</a>.","short":"W. Fang, Z. Haiman, The Astrophysical Journal 680 (2008) 200–213."},"doi":"10.1086/587780","abstract":[{"text":"Nongravitational processes, such as feedback from galaxies and their active nuclei, are believed to have injected excess entropy into the intracluster gas, and therefore to have modified the density profiles in galaxy clusters during their formation. Here we study a simple model for this so-called preheating scenario, and ask (1) whether it can simultaneously explain both global X-ray scaling relations and number counts of galaxy clusters, and (2) whether the amount of entropy required evolves with redshift. We adopt a baseline entropy profile that fits recent hydrodynamic simulations, modify the hydrostatic equilibrium condition for the gas by including ≈20% nonthermal pressure support, and add an entropy floor K0 that is allowed to vary with redshift. We find that the observed luminosity-temperature (L − T) relations of low-redshift (⟨ z⟩ = 0.05) HIFLUGCS clusters and high-redshift (⟨ z⟩ = 0.80) WARPS clusters are best simultaneously reproduced with an entropy floor that evolves from ≈200 h^−1/3 keV cm^ 2 at z ≈ 0.8 to ≳300 h^−1/3 keV cm^ 2 at z < 0.05. This evolution may take place predominantly at low redshift (z≲ 0.2). If we restrict our analysis to the subset of bright (kT≳ 3 keV) clusters, we find that the evolving entropy floor can mimic a self-similar evolution in the L − T scaling relation. This degeneracy with self-similar evolution is, however, lifted when 0.5 keV ≲ kT≲ 3 keV clusters are included. Using the cosmological parameters from the WMAP 3 yr data, but treating σ8 as a free parameter, our model can reproduce the number counts of the X-ray galaxy clusters in the 158 deg2 ROSAT PSPC survey, with a best-fit value of σ8 = 0.80 ± 0.05.","lang":"eng"}],"publication_identifier":{"issn":["0004-637X","1538-4357"]},"_id":"17788","publisher":"American Astronomical Society","date_updated":"2024-09-30T13:33:11Z","title":"An evolving entropy floor in the intracluster gas?","main_file_link":[{"url":"https://doi.org/10.1086/587780","open_access":"1"}],"oa_version":"Published Version","month":"06","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","publication_status":"published","fulldoi":"https://doi.org/10.1086/587780","publication":"The Astrophysical Journal","intvolume":"       680","status":"public","year":"2008","extern":"1","issue":"1","type":"journal_article","date_created":"2024-09-06T10:20:50Z","oa":1,"date_published":"2008-06-10T00:00:00Z","page":"200-213","author":[{"last_name":"Fang","first_name":"Wenjuan","full_name":"Fang, Wenjuan"},{"last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","full_name":"Haiman, Zoltán"}],"day":"10","article_type":"original","quality_controlled":"1","volume":680},{"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1086/523787"}],"scopus_import":"1","month":"01","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"American Astronomical Society","_id":"17789","date_updated":"2024-09-30T13:47:04Z","title":"Can we detect the anisotropic shapes of quasar H ii regions during reionization through the small‐scale redshifted 21 cm power spectrum?","doi":"10.1086/523787","citation":{"apa":"Sethi, S., &#38; Haiman, Z. (2008). Can we detect the anisotropic shapes of quasar H ii regions during reionization through the small‐scale redshifted 21 cm power spectrum? <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.1086/523787\">https://doi.org/10.1086/523787</a>","mla":"Sethi, Shiv, and Zoltán Haiman. “Can We Detect the Anisotropic Shapes of Quasar H Ii Regions during Reionization through the Small‐scale Redshifted 21 Cm Power Spectrum?” <i>The Astrophysical Journal</i>, vol. 673, no. 1, American Astronomical Society, 2008, pp. 1–13, doi:<a href=\"https://doi.org/10.1086/523787\">10.1086/523787</a>.","ama":"Sethi S, Haiman Z. Can we detect the anisotropic shapes of quasar H ii regions during reionization through the small‐scale redshifted 21 cm power spectrum? <i>The Astrophysical Journal</i>. 2008;673(1):1-13. doi:<a href=\"https://doi.org/10.1086/523787\">10.1086/523787</a>","chicago":"Sethi, Shiv, and Zoltán Haiman. “Can We Detect the Anisotropic Shapes of Quasar H Ii Regions during Reionization through the Small‐scale Redshifted 21 Cm Power Spectrum?” <i>The Astrophysical Journal</i>. American Astronomical Society, 2008. <a href=\"https://doi.org/10.1086/523787\">https://doi.org/10.1086/523787</a>.","short":"S. Sethi, Z. Haiman, The Astrophysical Journal 673 (2008) 1–13.","ista":"Sethi S, Haiman Z. 2008. Can we detect the anisotropic shapes of quasar H ii regions during reionization through the small‐scale redshifted 21 cm power spectrum? The Astrophysical Journal. 673(1), 1–13.","ieee":"S. Sethi and Z. Haiman, “Can we detect the anisotropic shapes of quasar H ii regions during reionization through the small‐scale redshifted 21 cm power spectrum?,” <i>The Astrophysical Journal</i>, vol. 673, no. 1. American Astronomical Society, pp. 1–13, 2008."},"publication_identifier":{"issn":["0004-637X","1538-4357"]},"abstract":[{"lang":"eng","text":"Light-travel time delays distort the apparent shapes of H II regions surrounding bright quasars during early stages of cosmic reionization. Individual H II regions may remain undetectable in forthcoming redshifted 21 cm experiments. However, the systematic deformation along the line of sight may be detectable statistically, either by stacking tomographic 21 cm images of quasars identified, for example, by the James Webb Space Telescope, or as small-scale anisotropy in the three-dimensional 21 cm power spectrum. Here we consider the detectability of this effect. The anisotropy is largest when H II regions are large and expand rapidly, and we find that if bright quasars contributed to the early stages of reionization, then they can produce significant anisotropy, on scales comparable to the typical sizes of H II regions of the bright quasars (≲30 Mpc). The effect therefore cannot be ignored when analyzing future 21 cm power spectra on small scales. If 10% of the volume of the intergalactic medium at z≃ 10 is ionized by quasars with typical ionizing luminosity of S≳ 5 × 10^56 s^−1, the distortions cause an ≳10 percent enhancement of the 21 cm power spectrum in the radial (redshift) direction, relative to the transverse directions. The level of this anisotropy exceeds that due to redshift-space distortion and has the opposite sign. We show that ongoing experiments such as Murchison Widefield Array (MWA, formerly known as the Mileura Widefield Array) should be able to detect this effect. A detection would reveal the presence of bright quasars and shed light on the ionizing yield and age of the ionizing sources and the distribution and small-scale clumping of neutral intergalactic gas in their vicinity."}],"article_processing_charge":"No","quality_controlled":"1","article_type":"original","volume":673,"page":"1-13","day":"20","author":[{"first_name":"Shiv","full_name":"Sethi, Shiv","last_name":"Sethi"},{"last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán"}],"issue":"1","type":"journal_article","intvolume":"       673","year":"2008","status":"public","extern":"1","oa":1,"date_published":"2008-01-20T00:00:00Z","date_created":"2024-09-06T10:21:39Z","publication":"The Astrophysical Journal","publication_status":"published","fulldoi":"https://doi.org/10.1086/523787"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.0804.3141","open_access":"1"}],"oa_version":"Preprint","month":"08","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Primordial gas in protogalactic DM halos with virial temperatures Tvir≳ 104 K begins to cool and condense via atomic hydrogen. Provided that this gas is irradiated by a strong UV flux and remains free of H2 and other molecules, it has been proposed that the halo with Tvir ∼ 104 K may avoid fragmentation and lead to the rapid formation of an SMBH as massive as M ≈ 105–106 M☉. This \"head start\" would help explain the presence of SMBHs with inferred masses of several times 109 M☉, powering the bright quasars discovered in the SDSS at redshift z≳ 6. However, high-redshift DM halos with Tvir ∼ 104 K are likely already enriched with at least trace amounts of metals and dust produced by prior star formation in their progenitors. Here we study the thermal and chemical evolution of low-metallicity gas exposed to extremely strong UV radiation fields. Our results, obtained in one-zone models, suggest that gas fragmentation is inevitable above a critical metallicity, whose value is between Zcr ≈ 3 × 10−4 Z☉ (in the absence of dust) and as low as Zcr ≈ 5 × 10−6 Z☉ (with a dust-to-gas mass ratio of about 0.01Z/Z☉). We propose that when the metallicity exceeds these critical values, dense clusters of low-mass stars may form at the halo nucleus. Relatively massive stars in such a cluster can then rapidly coalesce into a single more massive object, which may produce an intermediate-mass BH remnant with a mass up to M≲ 102–103 M☉."}],"publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"citation":{"mla":"Omukai, K., et al. “Can Supermassive Black Holes Form in Metal‐enriched High‐redshift Protogalaxies?” <i>The Astrophysical Journal</i>, vol. 686, no. 2, American Astronomical Society, 2008, pp. 801–14, doi:<a href=\"https://doi.org/10.1086/591636\">10.1086/591636</a>.","apa":"Omukai, K., Schneider, R., &#38; Haiman, Z. (2008). Can supermassive black holes form in metal‐enriched high‐redshift protogalaxies? <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.1086/591636\">https://doi.org/10.1086/591636</a>","ieee":"K. Omukai, R. Schneider, and Z. Haiman, “Can supermassive black holes form in metal‐enriched high‐redshift protogalaxies?,” <i>The Astrophysical Journal</i>, vol. 686, no. 2. American Astronomical Society, pp. 801–814, 2008.","ista":"Omukai K, Schneider R, Haiman Z. 2008. Can supermassive black holes form in metal‐enriched high‐redshift protogalaxies? The Astrophysical Journal. 686(2), 801–814.","chicago":"Omukai, K., R. Schneider, and Zoltán Haiman. “Can Supermassive Black Holes Form in Metal‐enriched High‐redshift Protogalaxies?” <i>The Astrophysical Journal</i>. American Astronomical Society, 2008. <a href=\"https://doi.org/10.1086/591636\">https://doi.org/10.1086/591636</a>.","short":"K. Omukai, R. Schneider, Z. Haiman, The Astrophysical Journal 686 (2008) 801–814.","ama":"Omukai K, Schneider R, Haiman Z. Can supermassive black holes form in metal‐enriched high‐redshift protogalaxies? <i>The Astrophysical Journal</i>. 2008;686(2):801-814. doi:<a href=\"https://doi.org/10.1086/591636\">10.1086/591636</a>"},"doi":"10.1086/591636","date_updated":"2024-11-12T10:11:29Z","publisher":"American Astronomical Society","_id":"17804","external_id":{"arxiv":["0804.3141"]},"title":"Can supermassive black holes form in metal‐enriched high‐redshift protogalaxies?","OA_place":"repository","page":"801-814","author":[{"full_name":"Omukai, K.","first_name":"K.","last_name":"Omukai"},{"first_name":"R.","full_name":"Schneider, R.","last_name":"Schneider"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman","orcid":"0000-0003-3633-5403","first_name":"Zoltán","full_name":"Haiman, Zoltán"}],"day":"20","OA_type":"free access","article_type":"original","quality_controlled":"1","volume":686,"fulldoi":"https://doi.org/10.1086/591636","arxiv":1,"publication_status":"published","publication":"The Astrophysical Journal","status":"public","year":"2008","extern":"1","intvolume":"       686","type":"journal_article","issue":"2","date_created":"2024-09-06T11:33:03Z","date_published":"2008-08-20T00:00:00Z","oa":1},{"pmid":1,"article_type":"original","OA_type":"green","quality_controlled":"1","volume":20,"OA_place":"repository","author":[{"full_name":"Hybertsen, Mark S","first_name":"Mark S","last_name":"Hybertsen"},{"last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","orcid":"0000-0002-6957-6089","full_name":"Venkataraman, Latha","first_name":"Latha"},{"first_name":"Jennifer E","full_name":"Klare, Jennifer E","last_name":"Klare"},{"last_name":"Whalley","full_name":"Whalley, Adam C","first_name":"Adam C"},{"last_name":"Steigerwald","full_name":"Steigerwald, Michael L","first_name":"Michael L"},{"first_name":"Colin","full_name":"Nuckolls, Colin","last_name":"Nuckolls"}],"day":"26","year":"2008","extern":"1","status":"public","intvolume":"        20","type":"journal_article","issue":"37","date_created":"2024-09-09T14:23:37Z","date_published":"2008-08-26T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1088/0953-8984/20/37/374115","publication_status":"published","arxiv":1,"publication":"Journal of Physics: Condensed Matter","article_number":"374115","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/0803.0582"}],"oa_version":"Preprint","month":"08","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-01-03T10:50:09Z","publisher":"IOP Publishing","_id":"18032","external_id":{"arxiv":["0803.0582"],"pmid":["21694422"]},"title":"Amine-linked single-molecule circuits: Systematic trends across molecular families","article_processing_charge":"No","abstract":[{"text":"A comprehensive review is presented of single-molecule junction conductance measurements across families of molecules measured while breaking a gold point contact in a solution of molecules with amine end groups. A theoretical framework unifies the picture for the amine–gold link bonding and the tunnel coupling through the junction using density functional theory based calculations. The reproducible electrical characteristics and utility for many molecules is shown to result from the selective binding between the gold electrodes and amine link groups through a donor–acceptor bond to undercoordinated gold atoms. While the bond energy is modest, the maximum force sustained by the junction is comparable to, but less than, that required to break gold point contacts. The calculated tunnel coupling provides conductance trends for all 41 molecule measurements presented here, as well as insight into the variability of conductance due to the conformational changes within molecules with torsional degrees of freedom. The calculated trends agree to within a factor of 2 with the measured values for conductance ranging from 10−7G0 to 10−2G0, where G0 is the quantum of conductance (2e2/h).","lang":"eng"}],"publication_identifier":{"eissn":["1361-648X"],"issn":["0953-8984"]},"citation":{"ista":"Hybertsen MS, Venkataraman L, Klare JE, Whalley AC, Steigerwald ML, Nuckolls C. 2008. Amine-linked single-molecule circuits: Systematic trends across molecular families. Journal of Physics: Condensed Matter. 20(37), 374115.","ieee":"M. S. Hybertsen, L. Venkataraman, J. E. Klare, A. C. Whalley, M. L. Steigerwald, and C. Nuckolls, “Amine-linked single-molecule circuits: Systematic trends across molecular families,” <i>Journal of Physics: Condensed Matter</i>, vol. 20, no. 37. IOP Publishing, 2008.","ama":"Hybertsen MS, Venkataraman L, Klare JE, Whalley AC, Steigerwald ML, Nuckolls C. Amine-linked single-molecule circuits: Systematic trends across molecular families. <i>Journal of Physics: Condensed Matter</i>. 2008;20(37). doi:<a href=\"https://doi.org/10.1088/0953-8984/20/37/374115\">10.1088/0953-8984/20/37/374115</a>","chicago":"Hybertsen, Mark S, Latha Venkataraman, Jennifer E Klare, Adam C Whalley, Michael L Steigerwald, and Colin Nuckolls. “Amine-Linked Single-Molecule Circuits: Systematic Trends across Molecular Families.” <i>Journal of Physics: Condensed Matter</i>. IOP Publishing, 2008. <a href=\"https://doi.org/10.1088/0953-8984/20/37/374115\">https://doi.org/10.1088/0953-8984/20/37/374115</a>.","short":"M.S. Hybertsen, L. Venkataraman, J.E. Klare, A.C. Whalley, M.L. Steigerwald, C. Nuckolls, Journal of Physics: Condensed Matter 20 (2008).","apa":"Hybertsen, M. S., Venkataraman, L., Klare, J. E., Whalley, A. C., Steigerwald, M. L., &#38; Nuckolls, C. (2008). Amine-linked single-molecule circuits: Systematic trends across molecular families. <i>Journal of Physics: Condensed Matter</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/0953-8984/20/37/374115\">https://doi.org/10.1088/0953-8984/20/37/374115</a>","mla":"Hybertsen, Mark S., et al. “Amine-Linked Single-Molecule Circuits: Systematic Trends across Molecular Families.” <i>Journal of Physics: Condensed Matter</i>, vol. 20, no. 37, 374115, IOP Publishing, 2008, doi:<a href=\"https://doi.org/10.1088/0953-8984/20/37/374115\">10.1088/0953-8984/20/37/374115</a>."},"doi":"10.1088/0953-8984/20/37/374115"},{"publication":"2008 International Symposium on VLSI Technology, Systems and Applications","citation":{"apa":"Venkataraman, L. (2008). Molecule Nanoelectronics. In <i>2008 International Symposium on VLSI Technology, Systems and Applications</i> (pp. 64–65). Hsinchu, Taiwan: IEEE. <a href=\"https://doi.org/10.1109/vtsa.2008.4530800\">https://doi.org/10.1109/vtsa.2008.4530800</a>","mla":"Venkataraman, Latha. “Molecule Nanoelectronics.” <i>2008 International Symposium on VLSI Technology, Systems and Applications</i>, IEEE, 2008, pp. 64–65, doi:<a href=\"https://doi.org/10.1109/vtsa.2008.4530800\">10.1109/vtsa.2008.4530800</a>.","ista":"Venkataraman L. 2008. Molecule Nanoelectronics. 2008 International Symposium on VLSI Technology, Systems and Applications. VLSI-TSA; Symposium on VLSI Technology, Systems and Applications, 64–65.","ieee":"L. Venkataraman, “Molecule Nanoelectronics,” in <i>2008 International Symposium on VLSI Technology, Systems and Applications</i>, Hsinchu, Taiwan, 2008, pp. 64–65.","ama":"Venkataraman L. Molecule Nanoelectronics. In: <i>2008 International Symposium on VLSI Technology, Systems and Applications</i>. IEEE; 2008:64-65. doi:<a href=\"https://doi.org/10.1109/vtsa.2008.4530800\">10.1109/vtsa.2008.4530800</a>","short":"L. Venkataraman, in:, 2008 International Symposium on VLSI Technology, Systems and Applications, IEEE, 2008, pp. 64–65.","chicago":"Venkataraman, Latha. “Molecule Nanoelectronics.” In <i>2008 International Symposium on VLSI Technology, Systems and Applications</i>, 64–65. IEEE, 2008. <a href=\"https://doi.org/10.1109/vtsa.2008.4530800\">https://doi.org/10.1109/vtsa.2008.4530800</a>."},"doi":"10.1109/vtsa.2008.4530800","abstract":[{"lang":"eng","text":"We measure the conductance of over 30 amine terminated molecules by breaking Au point-contacts in a molecular solution at room temperature. We find that the variability of the observed conductance for the diamine molecule-Au junctions is much less than the variability for diisonitrile and dithiol-Au junctions. This narrow distribution enables unambiguous conductance measurements of single molecules. For an alkane diamine series with 2-8 carbon atoms in the hydrocarbon chain and for polyphenyl diamine with 1-3 benzene rings, our results show that conductance decreases exponentially with length. For biphenyl diamines with different substituents that alter the phenyl-phenyl dihedral angle, we find that the conductance decreases with increasing twist angle, following a cosine squared dependence. Finally, for a series of substituted benzene diamines, we find that electron donating substituents on the ring, which drive the occupied molecular orbitals up, increase the junction conductance while electron withdrawing substituents have the opposite effect. Thus for this measured series, conductance varies inversely with the calculated ionization potential of the molecules. These results reveal that the occupied states are closest to the gold Fermi energy, indicating that the tunneling transport through these molecules is analogous to hole tunneling through an insulating film."}],"publication_identifier":{"issn":["1930-885X"]},"publication_status":"published","fulldoi":"https://doi.org/10.1109/vtsa.2008.4530800","article_processing_charge":"No","conference":{"location":"Hsinchu, Taiwan","start_date":"2008-04-21","end_date":"2008-04-23","name":"VLSI-TSA; Symposium on VLSI Technology, Systems and Applications"},"type":"conference","publisher":"IEEE","_id":"18033","extern":"1","status":"public","year":"2008","date_updated":"2025-01-03T10:55:23Z","date_published":"2008-04-25T00:00:00Z","title":"Molecule Nanoelectronics","date_created":"2024-09-09T14:24:32Z","oa_version":"None","page":"64-65","scopus_import":"1","day":"25","author":[{"first_name":"Latha","full_name":"Venkataraman, Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","orcid":"0000-0002-6957-6089","last_name":"Venkataraman"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"04","quality_controlled":"1","OA_type":"closed access"},{"pmid":1,"article_type":"letter_note","OA_type":"closed access","quality_controlled":"1","volume":3,"page":"187-188","author":[{"orcid":"0000-0002-6957-6089","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","full_name":"Venkataraman, Latha","first_name":"Latha"}],"day":"01","year":"2008","status":"public","extern":"1","intvolume":"         3","type":"journal_article","issue":"4","date_created":"2024-09-09T14:26:30Z","date_published":"2008-04-01T00:00:00Z","fulldoi":"https://doi.org/10.1038/nnano.2008.81","publication_status":"published","publication":"Nature Nanotechnology","oa_version":"None","language":[{"iso":"eng"}],"month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-01-03T10:57:41Z","publisher":"Springer Nature","_id":"18034","external_id":{"pmid":["18654498"]},"title":"Seeing is believing","article_processing_charge":"No","abstract":[{"text":"The ability to perform optical measurements on a single molecule placed between two electrodes while also measuring the current flowing through it could herald a new generation of experiments on molecular junctions.","lang":"eng"}],"publication_identifier":{"issn":["1748-3387"],"eissn":["1748-3395"]},"doi":"10.1038/nnano.2008.81","citation":{"chicago":"Venkataraman, Latha. “Seeing Is Believing.” <i>Nature Nanotechnology</i>. Springer Nature, 2008. <a href=\"https://doi.org/10.1038/nnano.2008.81\">https://doi.org/10.1038/nnano.2008.81</a>.","short":"L. Venkataraman, Nature Nanotechnology 3 (2008) 187–188.","ama":"Venkataraman L. Seeing is believing. <i>Nature Nanotechnology</i>. 2008;3(4):187-188. doi:<a href=\"https://doi.org/10.1038/nnano.2008.81\">10.1038/nnano.2008.81</a>","ieee":"L. Venkataraman, “Seeing is believing,” <i>Nature Nanotechnology</i>, vol. 3, no. 4. Springer Nature, pp. 187–188, 2008.","ista":"Venkataraman L. 2008. Seeing is believing. Nature Nanotechnology. 3(4), 187–188.","mla":"Venkataraman, Latha. “Seeing Is Believing.” <i>Nature Nanotechnology</i>, vol. 3, no. 4, Springer Nature, 2008, pp. 187–88, doi:<a href=\"https://doi.org/10.1038/nnano.2008.81\">10.1038/nnano.2008.81</a>.","apa":"Venkataraman, L. (2008). Seeing is believing. <i>Nature Nanotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nnano.2008.81\">https://doi.org/10.1038/nnano.2008.81</a>"}},{"publist_id":"5280","publication_status":"published","fulldoi":"https://doi.org/10.1103/PhysRevLett.101.018104","publication":"Physical Review Letters","doi":"10.1103/PhysRevLett.101.018104","citation":{"apa":"Friedlander, T., &#38; Brenner, N. (2008). Cellular properties and population asymptotics in the population balance equation. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.101.018104\">https://doi.org/10.1103/PhysRevLett.101.018104</a>","mla":"Friedlander, Tamar, and Naama Brenner. “Cellular Properties and Population Asymptotics in the Population Balance Equation.” <i>Physical Review Letters</i>, vol. 101, no. 1, American Physical Society, 2008, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.101.018104\">10.1103/PhysRevLett.101.018104</a>.","ista":"Friedlander T, Brenner N. 2008. Cellular properties and population asymptotics in the population balance equation. Physical Review Letters. 101(1).","ieee":"T. Friedlander and N. Brenner, “Cellular properties and population asymptotics in the population balance equation,” <i>Physical Review Letters</i>, vol. 101, no. 1. American Physical Society, 2008.","ama":"Friedlander T, Brenner N. Cellular properties and population asymptotics in the population balance equation. <i>Physical Review Letters</i>. 2008;101(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.101.018104\">10.1103/PhysRevLett.101.018104</a>","short":"T. Friedlander, N. Brenner, Physical Review Letters 101 (2008).","chicago":"Friedlander, Tamar, and Naama Brenner. “Cellular Properties and Population Asymptotics in the Population Balance Equation.” <i>Physical Review Letters</i>. American Physical Society, 2008. <a href=\"https://doi.org/10.1103/PhysRevLett.101.018104\">https://doi.org/10.1103/PhysRevLett.101.018104</a>."},"abstract":[{"lang":"eng","text":"Proliferating cell populations at steady-state growth often exhibit broad protein distributions with exponential tails. The sources of this variation and its universality are of much theoretical interest. Here we address the problem by asymptotic analysis of the population balance equation. We show that the steady-state distribution tail is determined by a combination of protein production and cell division and is insensitive to other model details. Under general conditions this tail is exponential with a dependence on parameters consistent with experiment. We discuss the conditions for this effect to be dominant over other sources of variation and the relation to experiments."}],"date_created":"2018-12-11T11:54:13Z","title":"Cellular properties and population asymptotics in the population balance equation","date_published":"2008-07-01T00:00:00Z","_id":"1826","publisher":"American Physical Society","intvolume":"       101","year":"2008","date_updated":"2021-01-12T06:53:27Z","extern":1,"status":"public","issue":"1","type":"journal_article","author":[{"id":"36A5845C-F248-11E8-B48F-1D18A9856A87","last_name":"Friedlander","first_name":"Tamar","full_name":"Tamar Friedlander"},{"first_name":"Naama","full_name":"Brenner, Naama","last_name":"Brenner"}],"month":"07","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/0804.4804","open_access":"0"}],"volume":101,"quality_controlled":0},{"publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-540-88688-4_11","publication":"10th European Conference on Computer Vision","conference":{"location":"Marseille, France","name":"ECCV: European Conference on Computer Vision","end_date":"2008-10-18","start_date":"2008-10-12"},"intvolume":"      5303","status":"public","year":"2008","extern":"1","type":"conference","date_created":"2024-10-15T11:20:54Z","date_published":"2008-11-01T00:00:00Z","page":"143-154","author":[{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"}],"day":"01","quality_controlled":"1","volume":5303,"article_processing_charge":"No","citation":{"apa":"Bronstein, A. M., &#38; Bronstein, M. M. (2008). Regularized partial matching of rigid shapes. In <i>10th European Conference on Computer Vision</i> (Vol. 5303, pp. 143–154). Marseille, France: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-88688-4_11\">https://doi.org/10.1007/978-3-540-88688-4_11</a>","mla":"Bronstein, Alex M., and Michael M. Bronstein. “Regularized Partial Matching of Rigid Shapes.” <i>10th European Conference on Computer Vision</i>, vol. 5303, Springer Berlin Heidelberg, 2008, pp. 143–54, doi:<a href=\"https://doi.org/10.1007/978-3-540-88688-4_11\">10.1007/978-3-540-88688-4_11</a>.","ista":"Bronstein AM, Bronstein MM. 2008. Regularized partial matching of rigid shapes. 10th European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 5303, 143–154.","ieee":"A. M. Bronstein and M. M. Bronstein, “Regularized partial matching of rigid shapes,” in <i>10th European Conference on Computer Vision</i>, Marseille, France, 2008, vol. 5303, pp. 143–154.","ama":"Bronstein AM, Bronstein MM. Regularized partial matching of rigid shapes. In: <i>10th European Conference on Computer Vision</i>. Vol 5303. Springer Berlin Heidelberg; 2008:143-154. doi:<a href=\"https://doi.org/10.1007/978-3-540-88688-4_11\">10.1007/978-3-540-88688-4_11</a>","short":"A.M. Bronstein, M.M. Bronstein, in:, 10th European Conference on Computer Vision, Springer Berlin Heidelberg, 2008, pp. 143–154.","chicago":"Bronstein, Alex M., and Michael M. Bronstein. “Regularized Partial Matching of Rigid Shapes.” In <i>10th European Conference on Computer Vision</i>, 5303:143–54. Springer Berlin Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-88688-4_11\">https://doi.org/10.1007/978-3-540-88688-4_11</a>."},"doi":"10.1007/978-3-540-88688-4_11","abstract":[{"text":"Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show a rigorous approach allowing to find matching parts of rigid shapes with controllable size and regularity. The regularity term we use is similar to the spirit of the Mumford-Shah functional, extended to non-Euclidean spaces. Numerical experiments show that the regularized partial matching produces better results compared to the non-regularized one.","lang":"eng"}],"publication_identifier":{"issn":["1611-3349"],"eisbn":["9783540886884"],"isbn":["9783540886853"],"eissn":["0302-9743"]},"alternative_title":["LNCS"],"publisher":"Springer Berlin Heidelberg","_id":"18337","date_updated":"2024-11-18T10:22:43Z","title":"Regularized partial matching of rigid shapes","oa_version":"None","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","scopus_import":"1"},{"intvolume":"        78","status":"public","year":"2008","extern":"1","type":"journal_article","date_created":"2024-10-15T11:20:54Z","date_published":"2008-06-01T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1007/s11263-007-0078-4","publication":"International Journal of Computer Vision","article_type":"original","OA_type":"closed access","quality_controlled":"1","volume":78,"page":"67-88","author":[{"full_name":"Bronstein, Alexander","first_name":"Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"last_name":"Bruckstein","first_name":"Alfred M.","full_name":"Bruckstein, Alfred M."},{"first_name":"Ron","full_name":"Kimmel, Ron","last_name":"Kimmel"}],"day":"01","_id":"18355","publisher":"Springer Nature","date_updated":"2024-10-22T07:22:49Z","title":"Analysis of two-dimensional non-rigid shapes","article_processing_charge":"No","doi":"10.1007/s11263-007-0078-4","citation":{"short":"A.M. Bronstein, M.M. Bronstein, A.M. Bruckstein, R. Kimmel, International Journal of Computer Vision 78 (2008) 67–88.","chicago":"Bronstein, Alex M., Michael M. Bronstein, Alfred M. Bruckstein, and Ron Kimmel. “Analysis of Two-Dimensional Non-Rigid Shapes.” <i>International Journal of Computer Vision</i>. Springer Nature, 2008. <a href=\"https://doi.org/10.1007/s11263-007-0078-4\">https://doi.org/10.1007/s11263-007-0078-4</a>.","ama":"Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. Analysis of two-dimensional non-rigid shapes. <i>International Journal of Computer Vision</i>. 2008;78:67-88. doi:<a href=\"https://doi.org/10.1007/s11263-007-0078-4\">10.1007/s11263-007-0078-4</a>","ieee":"A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel, “Analysis of two-dimensional non-rigid shapes,” <i>International Journal of Computer Vision</i>, vol. 78. Springer Nature, pp. 67–88, 2008.","ista":"Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. 2008. Analysis of two-dimensional non-rigid shapes. International Journal of Computer Vision. 78, 67–88.","mla":"Bronstein, Alex M., et al. “Analysis of Two-Dimensional Non-Rigid Shapes.” <i>International Journal of Computer Vision</i>, vol. 78, Springer Nature, 2008, pp. 67–88, doi:<a href=\"https://doi.org/10.1007/s11263-007-0078-4\">10.1007/s11263-007-0078-4</a>.","apa":"Bronstein, A. M., Bronstein, M. M., Bruckstein, A. M., &#38; Kimmel, R. (2008). Analysis of two-dimensional non-rigid shapes. <i>International Journal of Computer Vision</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11263-007-0078-4\">https://doi.org/10.1007/s11263-007-0078-4</a>"},"publication_identifier":{"issn":["0920-5691","1573-1405"]},"abstract":[{"lang":"eng","text":"Analysis of deformable two-dimensional shapes is an important problem, encountered in numerous pattern recognition, computer vision and computer graphics applications. In this paper, we address three major problems in the analysis of non-rigid shapes: similarity, partial similarity, and correspondence. We present an axiomatic construction of similarity criteria for deformation-invariant shape comparison, based on intrinsic geometric properties of the shapes, and show that such criteria are related to the Gromov-Hausdorff distance. Next, we extend the problem of similarity computation to shapes which have similar parts but are dissimilar when considered as a whole, and present a construction of set-valued distances, based on the notion of Pareto optimality. Finally, we show that the correspondence between non-rigid shapes can be obtained as a byproduct of the non-rigid similarity problem. As a numerical framework, we use the generalized multidimensional scaling (GMDS) method, which is the numerical core of the three problems addressed in this paper."}],"oa_version":"None","language":[{"iso":"eng"}],"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1"},{"date_created":"2024-10-15T11:20:54Z","date_published":"2008-07-01T00:00:00Z","title":"Not only size matters: Regularized partial matching of nonrigid shapes","year":"2008","date_updated":"2024-11-18T10:18:28Z","status":"public","extern":"1","_id":"18381","publisher":"IEEE","type":"conference","conference":{"location":"Anchorage, AK, United States","end_date":"2008-06-28","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2008-06-23"},"article_processing_charge":"No","fulldoi":"https://doi.org/10.1109/cvprw.2008.4563077","publication_status":"published","abstract":[{"text":"Partial matching is probably one of the most challenging problems in nonrigid shape analysis. The problem consists of matching similar parts of shapes that are dissimilar on the whole and can assume different forms by undergoing nonrigid deformations. Conceptually, two shapes can be considered partially matching if they have significant similar parts, with the simplest definition of significance being the size of the parts. Thus, partial matching can be defined as a multicriterion optimization problem trying to simultaneously maximize the similarity and the size of these parts. In this paper, we propose a different definition of significance, taking into account the regularity of parts besides their size. The regularity term proposed here is similar to the spirit of the Mumford-Shah functional. Numerical experiments show that the regularized partial matching produces semantically better results compared to the non-regularized one.","lang":"eng"}],"publication_identifier":{"isbn":["9781424423392"],"issn":["2160-7508"]},"citation":{"apa":"Bronstein, A. M., &#38; Bronstein, M. M. (2008). Not only size matters: Regularized partial matching of nonrigid shapes. In <i>2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops</i>. Anchorage, AK, United States: IEEE. <a href=\"https://doi.org/10.1109/cvprw.2008.4563077\">https://doi.org/10.1109/cvprw.2008.4563077</a>","mla":"Bronstein, Alex M., and Michael M. Bronstein. “Not Only Size Matters: Regularized Partial Matching of Nonrigid Shapes.” <i>2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops</i>, IEEE, 2008, doi:<a href=\"https://doi.org/10.1109/cvprw.2008.4563077\">10.1109/cvprw.2008.4563077</a>.","ama":"Bronstein AM, Bronstein MM. Not only size matters: Regularized partial matching of nonrigid shapes. In: <i>2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops</i>. IEEE; 2008. doi:<a href=\"https://doi.org/10.1109/cvprw.2008.4563077\">10.1109/cvprw.2008.4563077</a>","chicago":"Bronstein, Alex M., and Michael M. Bronstein. “Not Only Size Matters: Regularized Partial Matching of Nonrigid Shapes.” In <i>2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops</i>. IEEE, 2008. <a href=\"https://doi.org/10.1109/cvprw.2008.4563077\">https://doi.org/10.1109/cvprw.2008.4563077</a>.","short":"A.M. Bronstein, M.M. Bronstein, in:, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2008.","ista":"Bronstein AM, Bronstein MM. 2008. Not only size matters: Regularized partial matching of nonrigid shapes. 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops. CVPR: Conference on Computer Vision and Pattern Recognition.","ieee":"A. M. Bronstein and M. M. Bronstein, “Not only size matters: Regularized partial matching of nonrigid shapes,” in <i>2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops</i>, Anchorage, AK, United States, 2008."},"publication":"2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops","doi":"10.1109/cvprw.2008.4563077","quality_controlled":"1","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","first_name":"Alexander"},{"last_name":"Bronstein","first_name":"Michael M.","full_name":"Bronstein, Michael M."}],"day":"01","scopus_import":"1","oa_version":"None"},{"date_published":"2008-10-01T00:00:00Z","title":"Parallel algorithms for approximation of distance maps on parametric surfaces","date_created":"2024-10-15T11:20:55Z","issue":"4","type":"journal_article","publisher":"Association for Computing Machinery","_id":"18431","intvolume":"        27","year":"2008","date_updated":"2024-12-18T14:46:45Z","extern":"1","status":"public","citation":{"mla":"Weber, Ofir, et al. “Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 27, no. 4, 104, Association for Computing Machinery, 2008, doi:<a href=\"https://doi.org/10.1145/1409625.1409626\">10.1145/1409625.1409626</a>.","apa":"Weber, O., Devir, Y. S., Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2008). Parallel algorithms for approximation of distance maps on parametric surfaces. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1409625.1409626\">https://doi.org/10.1145/1409625.1409626</a>","short":"O. Weber, Y.S. Devir, A.M. Bronstein, M.M. Bronstein, R. Kimmel, ACM Transactions on Graphics 27 (2008).","chicago":"Weber, Ofir, Yohai S. Devir, Alex M. Bronstein, Michael M. Bronstein, and Ron Kimmel. “Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2008. <a href=\"https://doi.org/10.1145/1409625.1409626\">https://doi.org/10.1145/1409625.1409626</a>.","ama":"Weber O, Devir YS, Bronstein AM, Bronstein MM, Kimmel R. Parallel algorithms for approximation of distance maps on parametric surfaces. <i>ACM Transactions on Graphics</i>. 2008;27(4). doi:<a href=\"https://doi.org/10.1145/1409625.1409626\">10.1145/1409625.1409626</a>","ieee":"O. Weber, Y. S. Devir, A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Parallel algorithms for approximation of distance maps on parametric surfaces,” <i>ACM Transactions on Graphics</i>, vol. 27, no. 4. Association for Computing Machinery, 2008.","ista":"Weber O, Devir YS, Bronstein AM, Bronstein MM, Kimmel R. 2008. Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Transactions on Graphics. 27(4), 104."},"doi":"10.1145/1409625.1409626","publication":"ACM Transactions on Graphics","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"abstract":[{"text":"We present an efficient O(n) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n is the number of points on the surface. The structure of our algorithm allows efficient implementation on parallel architectures. Two implementations on a SIMD processor and on a GPU are discussed. Numerical results demonstrate up to four orders of magnitude improvement in execution time compared to the state-of-the-art algorithms.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","fulldoi":"https://doi.org/10.1145/1409625.1409626","volume":27,"article_number":"104","quality_controlled":"1","scopus_import":"1","day":"01","author":[{"first_name":"Ofir","full_name":"Weber, Ofir","last_name":"Weber"},{"first_name":"Yohai S.","full_name":"Devir, Yohai S.","last_name":"Devir"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"},{"first_name":"Ron","full_name":"Kimmel, Ron","last_name":"Kimmel"}],"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"10","oa_version":"None"},{"quality_controlled":"1","OA_type":"green","article_type":"original","volume":20,"page":"881-919","das_tickbox":"1","OA_place":"repository","day":"03","author":[{"first_name":"Terence","full_name":"Tao, Terence","last_name":"Tao"},{"first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"},{"full_name":"Zhang, Xiaoyi","first_name":"Xiaoyi","last_name":"Zhang"}],"type":"journal_article","issue":"5","year":"2008","status":"public","extern":"1","intvolume":"        20","mathsc":["35Q55"],"date_published":"2008-11-03T00:00:00Z","oa":1,"date_created":"2026-06-19T07:53:12Z","publication":"Forum Mathematicum","fulldoi":"https://doi.org/10.1515/forum.2008.042","publication_status":"published","arxiv":1,"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.math/0609690"}],"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","external_id":{"arxiv":["math/0609690"]},"date_updated":"2026-06-25T08:15:22Z","publisher":"De Gruyter","_id":"22049","title":"Minimal-mass blowup solutions of the mass-critical NLS","abstract":[{"lang":"eng","text":"We consider the minimal mass m0 required for solutions to the mass-critical nonlinear Schrödinger (NLS) equation iut + Δu = μ|u|^4/d u to blow up. If m0 is finite, we show that there exists a minimal-mass solution blowing up (in the sense of an infinite spacetime norm) in both time directions, whose orbit in  is compact after quotienting out by the symmetries of the equation. A similar result is obtained for spherically symmetric solutions. Similar results were previously obtained by Keraani, [Keraani S.: On the blow-up phenomenon of the critical nonlinear Schrödinger equation. J. Funct. Anal. 235 (2006), 171–192], in dimensions 1, 2 and Begout and Vargas, [Begout P., Vargas A.: Mass concentration phenomena for the L2-critical nonlinear Schrödinger equation, preprint], in dimensions d ≥ 3 for the mass-critical NLS and by Kenig and Merle, [Kenig C., Merle F.: Global well-posedness, scattering, and blowup for the energy-critical, focusing, non-linear Schrödinger equation in the radial case, preprint], in the energy-critical case. In a subsequent paper we shall use this compactness result to establish global existence and scattering in  for the defocusing NLS in three and higher dimensions with spherically symmetric data."}],"publication_identifier":{"issn":["0933-7741"],"eissn":["1435-5337"]},"doi":"10.1515/forum.2008.042","citation":{"short":"T. Tao, M. Vişan, X. Zhang, Forum Mathematicum 20 (2008) 881–919.","chicago":"Tao, Terence, Monica Vişan, and Xiaoyi Zhang. “Minimal-Mass Blowup Solutions of the Mass-Critical NLS.” <i>Forum Mathematicum</i>. De Gruyter, 2008. <a href=\"https://doi.org/10.1515/forum.2008.042\">https://doi.org/10.1515/forum.2008.042</a>.","ama":"Tao T, Vişan M, Zhang X. Minimal-mass blowup solutions of the mass-critical NLS. <i>Forum Mathematicum</i>. 2008;20(5):881-919. doi:<a href=\"https://doi.org/10.1515/forum.2008.042\">10.1515/forum.2008.042</a>","ieee":"T. Tao, M. Vişan, and X. Zhang, “Minimal-mass blowup solutions of the mass-critical NLS,” <i>Forum Mathematicum</i>, vol. 20, no. 5. De Gruyter, pp. 881–919, 2008.","ista":"Tao T, Vişan M, Zhang X. 2008. Minimal-mass blowup solutions of the mass-critical NLS. Forum Mathematicum. 20(5), 881–919.","mla":"Tao, Terence, et al. “Minimal-Mass Blowup Solutions of the Mass-Critical NLS.” <i>Forum Mathematicum</i>, vol. 20, no. 5, De Gruyter, 2008, pp. 881–919, doi:<a href=\"https://doi.org/10.1515/forum.2008.042\">10.1515/forum.2008.042</a>.","apa":"Tao, T., Vişan, M., &#38; Zhang, X. (2008). Minimal-mass blowup solutions of the mass-critical NLS. <i>Forum Mathematicum</i>. De Gruyter. <a href=\"https://doi.org/10.1515/forum.2008.042\">https://doi.org/10.1515/forum.2008.042</a>"},"article_processing_charge":"No"},{"date_published":"2008-03-01T00:00:00Z","oa":1,"date_created":"2026-06-19T08:27:11Z","type":"journal_article","issue":"3","year":"2008","extern":"1","status":"public","mathsc":["35Q55"],"intvolume":"         7","publication":"Communications on Pure and Applied Analysis","fulldoi":"https://doi.org/10.3934/cpaa.2008.7.467","publication_status":"published","arxiv":1,"volume":7,"quality_controlled":"1","article_type":"original","OA_type":"green","day":"01","author":[{"last_name":"Colliander","full_name":"Colliander, J.","first_name":"J."},{"last_name":"Holmer","first_name":"Justin","full_name":"Holmer, Justin"},{"first_name":"Monica","full_name":"Visan, Monica","last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"},{"last_name":"Zhang","full_name":"Zhang, Xiaoyi","first_name":"Xiaoyi"}],"page":"467-489","das_tickbox":"1","OA_place":"repository","title":"Global existence and scattering for rough solutions to generalized nonlinear Schrödinger equations on $R$","external_id":{"arxiv":["math/0612452"]},"date_updated":"2026-07-01T07:05:55Z","_id":"22081","publisher":"American Institute of Mathematical Sciences","abstract":[{"lang":"eng","text":"We consider the Cauchy problem for a family of semilinear defocusing Schrödinger equations with monomial nonlinearities in one space dimension. We establish global well-posedness and scattering. Our analysis is based on a four-particle interaction Morawetz estimate giving a priori $L_{t,x}^8$ spacetime control on solutions."}],"publication_identifier":{"issn":["1534-0392"],"eissn":["1553-5258"]},"citation":{"chicago":"Colliander, J., Justin Holmer, Monica Vişan, and Xiaoyi Zhang. “Global Existence and Scattering for Rough Solutions to Generalized Nonlinear Schrödinger Equations on $R$.” <i>Communications on Pure and Applied Analysis</i>. American Institute of Mathematical Sciences, 2008. <a href=\"https://doi.org/10.3934/cpaa.2008.7.467\">https://doi.org/10.3934/cpaa.2008.7.467</a>.","short":"J. Colliander, J. Holmer, M. Vişan, X. Zhang, Communications on Pure and Applied Analysis 7 (2008) 467–489.","ama":"Colliander J, Holmer J, Vişan M, Zhang X. Global existence and scattering for rough solutions to generalized nonlinear Schrödinger equations on $R$. <i>Communications on Pure and Applied Analysis</i>. 2008;7(3):467-489. doi:<a href=\"https://doi.org/10.3934/cpaa.2008.7.467\">10.3934/cpaa.2008.7.467</a>","ieee":"J. Colliander, J. Holmer, M. Vişan, and X. Zhang, “Global existence and scattering for rough solutions to generalized nonlinear Schrödinger equations on $R$,” <i>Communications on Pure and Applied Analysis</i>, vol. 7, no. 3. American Institute of Mathematical Sciences, pp. 467–489, 2008.","ista":"Colliander J, Holmer J, Vişan M, Zhang X. 2008. Global existence and scattering for rough solutions to generalized nonlinear Schrödinger equations on $R$. Communications on Pure and Applied Analysis. 7(3), 467–489.","mla":"Colliander, J., et al. “Global Existence and Scattering for Rough Solutions to Generalized Nonlinear Schrödinger Equations on $R$.” <i>Communications on Pure and Applied Analysis</i>, vol. 7, no. 3, American Institute of Mathematical Sciences, 2008, pp. 467–89, doi:<a href=\"https://doi.org/10.3934/cpaa.2008.7.467\">10.3934/cpaa.2008.7.467</a>.","apa":"Colliander, J., Holmer, J., Vişan, M., &#38; Zhang, X. (2008). Global existence and scattering for rough solutions to generalized nonlinear Schrödinger equations on $R$. <i>Communications on Pure and Applied Analysis</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/cpaa.2008.7.467\">https://doi.org/10.3934/cpaa.2008.7.467</a>"},"doi":"10.3934/cpaa.2008.7.467","article_processing_charge":"No","scopus_import":"1","month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.math/0612452","open_access":"1"}]},{"das_tickbox":"1","page":"229-266","OA_place":"repository","day":"01","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","first_name":"Monica","full_name":"Visan, Monica"},{"last_name":"Zhang","full_name":"Zhang, Xiaoyi","first_name":"Xiaoyi"}],"quality_controlled":"1","OA_type":"green","article_type":"original","volume":1,"publication":"Analysis & PDE","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.2140/apde.2008.1.229","issue":"2","type":"journal_article","intvolume":"         1","extern":"1","status":"public","year":"2008","oa":1,"date_published":"2008-06-01T00:00:00Z","date_created":"2026-06-19T08:27:33Z","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.0708.0849","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Killip R, Vişan M, Zhang X. 2008. The mass-critical nonlinear Schrödinger equation with radial data in dimensions three and higher. Analysis &#38; PDE. 1(2), 229–266.","ieee":"R. Killip, M. Vişan, and X. Zhang, “The mass-critical nonlinear Schrödinger equation with radial data in dimensions three and higher,” <i>Analysis &#38; PDE</i>, vol. 1, no. 2. Mathematical Sciences Publishers, pp. 229–266, 2008.","ama":"Killip R, Vişan M, Zhang X. The mass-critical nonlinear Schrödinger equation with radial data in dimensions three and higher. <i>Analysis &#38; PDE</i>. 2008;1(2):229-266. doi:<a href=\"https://doi.org/10.2140/apde.2008.1.229\">10.2140/apde.2008.1.229</a>","chicago":"Killip, Rowan, Monica Vişan, and Xiaoyi Zhang. “The Mass-Critical Nonlinear Schrödinger Equation with Radial Data in Dimensions Three and Higher.” <i>Analysis &#38; PDE</i>. Mathematical Sciences Publishers, 2008. <a href=\"https://doi.org/10.2140/apde.2008.1.229\">https://doi.org/10.2140/apde.2008.1.229</a>.","short":"R. Killip, M. Vişan, X. Zhang, Analysis &#38; PDE 1 (2008) 229–266.","apa":"Killip, R., Vişan, M., &#38; Zhang, X. (2008). The mass-critical nonlinear Schrödinger equation with radial data in dimensions three and higher. <i>Analysis &#38; PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/apde.2008.1.229\">https://doi.org/10.2140/apde.2008.1.229</a>","mla":"Killip, Rowan, et al. “The Mass-Critical Nonlinear Schrödinger Equation with Radial Data in Dimensions Three and Higher.” <i>Analysis &#38; PDE</i>, vol. 1, no. 2, Mathematical Sciences Publishers, 2008, pp. 229–66, doi:<a href=\"https://doi.org/10.2140/apde.2008.1.229\">10.2140/apde.2008.1.229</a>."},"doi":"10.2140/apde.2008.1.229","abstract":[{"text":"We establish global well-posedness and scattering for solutions to the mass-critical nonlinear Schrödinger equation (mathematical formular)  for large spherically symmetric L2/x(R^d) initial data in dimensions d >= 3.\r\nIn the focusing case we require that the mass is strictly less than that of the ground state. As a consequence, we obtain that in the focusing case, any spherically symmetric blowup solution must concentrate at least the mass of the ground state at the blowup time.","lang":"eng"}],"publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"article_processing_charge":"No","external_id":{"arxiv":["0708.0849"]},"publisher":"Mathematical Sciences Publishers","_id":"22082","date_updated":"2026-07-01T07:15:15Z","title":"The mass-critical nonlinear Schrödinger equation with radial data in dimensions three and higher"},{"oa_version":"Published Version","month":"12","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., De Alfaro, L., Majumdar, R., &#38; Raman, V. (2008). Algorithms for game metrics (Vol. 2, pp. 107–118). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745\">https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745</a>","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Game Metrics</i>. Vol. 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 107–18, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745\">10.4230/LIPIcs.FSTTCS.2008.1745</a>.","ista":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2008. Algorithms for game metrics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 2, 107–118.","ieee":"K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2008, vol. 2, pp. 107–118.","ama":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics. In: Vol 2. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2008:107-118. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745\">10.4230/LIPIcs.FSTTCS.2008.1745</a>","short":"K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 107–118.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics,” 2:107–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745\">https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745</a>."},"file_date_updated":"2020-07-14T12:46:12Z","doi":"10.4230/LIPIcs.FSTTCS.2008.1745","abstract":[{"text":"Simulation and bisimulation metrics for stochastic systems provide a quantitative gen- eralization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative μ-calculus and related probabilistic logics.\r\nWe present algorithms for computing the metrics on Markov decision processes (MDPs), turn- based stochastic games, and concurrent games. For turn-based games and MDPs, we provide a polynomial-time algorithm based on linear programming for the computation of the one-step metric distance between states. The algorithm improves on the previously known exponential-time algo- rithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known bound for Markov chains. For the bisimulation kernel of the metric, which corresponds to probabilistic bisimulation, our algorithm works in time O(n4) for both turn-based games and MDPs; improving the previously best known O(n9 · log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance between states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be accomplished via a reduction to the theory of real closed fields, involving a\r\nformula with three quantifier alternations, yielding O(|G|O(|G|5)) time complexity, improving the previously known reduction with O(|G|O(|G|7)) time complexity. These algorithms can be iterated\r\nto approximate the metrics using binary search.","lang":"eng"}],"alternative_title":["LIPIcs"],"has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"3504","ddc":["000"],"date_updated":"2026-07-06T13:25:11Z","acknowledgement":"This research was supported in part by the NSF grants CCR-0132780 and CNS-0720884.","title":"Algorithms for game metrics","page":"107 - 118","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"},{"first_name":"Vishwanath","full_name":"Raman, Vishwanath","last_name":"Raman"}],"day":"05","quality_controlled":"1","file":[{"checksum":"0a447454a24e273f7ddf51dbfe47f877","relation":"main_file","date_updated":"2020-07-14T12:46:12Z","access_level":"open_access","date_created":"2019-05-10T10:01:21Z","file_name":"2008_LIPIcs_Chatterjee.pdf","file_size":442139,"creator":"dernst","file_id":"6398","content_type":"application/pdf"}],"volume":2,"publication_status":"published","fulldoi":"https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publist_id":"2883","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"intvolume":"         2","related_material":{"record":[{"id":"3868","status":"public","relation":"later_version"}]},"year":"2008","status":"public","extern":"1","type":"conference","date_created":"2018-12-11T12:03:40Z","oa":1,"date_published":"2008-12-05T00:00:00Z"},{"title":"Timed parity games: complexity and robustness","publisher":"Springer Nature","_id":"3876","date_updated":"2026-07-06T13:25:38Z","acknowledgement":"This research was supported in part by the NSF grants CCR-0132780, CNS-0720884, and CCR-0225610, and by the European COMBEST project.","external_id":{"arxiv":["0807.1165"]},"alternative_title":["LNCS"],"article_processing_charge":"No","doi":"10.1007/978-3-540-85778-5_10","citation":{"ista":"Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity and robustness. Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 5215, 124–140.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: complexity and robustness,” in <i>Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems</i>, Saint Malo, France, 2008, vol. 5215, pp. 124–140.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: complexity and robustness. In: <i>Proceedings of the 6th International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 5215. Springer Nature; 2008:124-140. doi:<a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">10.1007/978-3-540-85778-5_10</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” In <i>Proceedings of the 6th International Conference on Formal Modeling and Analysis of Timed Systems</i>, 5215:124–40. Springer Nature, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">https://doi.org/10.1007/978-3-540-85778-5_10</a>.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Proceedings of the 6th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2008, pp. 124–140.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2008). Timed parity games: complexity and robustness. In <i>Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 5215, pp. 124–140). Saint Malo, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">https://doi.org/10.1007/978-3-540-85778-5_10</a>","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Proceedings of the 6th International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 5215, Springer Nature, 2008, pp. 124–40, doi:<a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">10.1007/978-3-540-85778-5_10</a>."},"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783540857778"],"issn":["0302-9743"]},"abstract":[{"text":"We consider two-player games played in real time on game structures with clocks and parity objectives. 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 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., nonconcurrent) finite-state (i.e., untimed) parity games. The states of the resulting game are pairs of clock regions of the original game. 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. 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 strategies. Using a limit-robust 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. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust 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"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"10","oa_version":"None","date_created":"2018-12-11T12:05:39Z","date_published":"2008-10-01T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"3315"}]},"intvolume":"      5215","extern":"1","status":"public","year":"2008","type":"conference","conference":{"start_date":"2008-09-15","end_date":"2008-09-17","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Saint Malo, France"},"publist_id":"2294","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1007/978-3-540-85778-5_10","publication":"Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems","volume":5215,"OA_type":"green","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"day":"01","OA_place":"repository","page":"124 - 140"}]