Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 2,995 papers for “String metric”

An LCS-based string metric

Daniel Bakkelund · 2009

These notes presents a string similarity measure which is a metric in the mathematical sense. In particular, the triangle inequality holds for this metric. The metric is based on the longest common subsequence (LCS) measure, and the complexity of any sensible implementation will be no worse than O(n 2). 1

Cited by 0

Bosonic String in Affine-Metric Curved Space

Tarasov, Vasily E. · arXiv (Cornell University) · 2004

The sigma model approach to the closed bosonic string on the affine-metric manifold is considered. The two-loop metric counterterms for the nonlinear two-dimensional sigma model with affine-metric target manifold are calculated. The correlation of the metric and affine connection is considered as the result of the ultraviolet finiteness (or beta-function vanishing) condition for the nonlinear sigma model. The examples of the nonflat nonRiemannian manifolds resulting in the trivial metric beta-function are suggested.

Cited by 0Open access

Exact metric around a wiggly cosmic string

Ozdemir, N. · arXiv (Cornell University) · 2000

The exact metric around a wiggly cosmic string is found by modifying the energy momentum-tensor of a straight infinitely thin cosmic string to include an electric current along the symmetry axis.

Cited by 0Open access

Metric and coupling reversal in string theory

Duff, M. J., Kalkkinen, Jussi · arXiv (Cornell University) · 2006

Invariance under reversing the sign of the metric G_{MN}(x) and/or the sign of the string coupling field H(x), where = g_s, leads to four possible Universes denoted 1,I,J,K according as (G,H) goes to (G,H), (-G,H), (-G,-H), (G,-H), respectively. Universe 1 is described by conventional string/M theory and contains all M, D, F and NS branes. Universe I contains only D(-1), D3 and D7. Universe J contains only D1, D5, D9 and Type I. Universe K contains only F1 and NS5 of IIB and Heterotic SO(32).

Cited by 0Open access

Similarity Overlap Metric and Greedy String Tiling at

Arun Kumar Jayapal · 2012

Abstract This paper reports the best performed approach followed for the can-didate document retrieval task and the approach used for the detailed comparison task of the Plagiarism detection track in PAN 2012. The aim of the participation was to understand a few of the computer-assisted approaches used for plagiarism detection. The plagiarism detection is dependent on two broad tasks, (1) the can-didate document retrieval task and (2) the detailed comparison task. The N-gram similarity overlap metric was used for candidate document retrieval task and the greedy string tiling algorithm for detailed comparison task. The evaluation re-sults suggested that the approach used for the candidate document retrieval task was highly competitive, but the approach used for detailed comparison task need much more improvement. Index Terms: plagiarism detection, candidate document retrieval, detailed com-parison, similarity overlap, greedy string tiling

Cited by 0

Remarks on the Hiscock-Gott interior string metric

Andréa A. Morégula, Marcelo de Oliveira Souza, M. M. Som · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · 1995

Using the Lagrangian of a U(1) gauge field and a complex scalar field we show that the interior string metric obtained by Hiscock and Gott, which is not consistent with boundary conditions, can be considered as an approximate solution in the first order of the scalar field. With this approximate solution one can avoid the discontinuities of the scalar and gauge fields.

Cited by 4

Curved-spacetime metric generated by Planckian energy string collisions

C. O. Loustó, N. Sánchez · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · 1992

We study Planckian energy string collisions in flat spacetime as the scattering of a string in the effective curved background produced by the others as the impact parameter $b$ decreases. We find the effective energy-density distribution $\ensuremath{\sigma}(\ensuremath{\rho})\ensuremath{\sim}\mathrm{exp}{\frac{{\ensuremath{-}\ensuremath{\rho}}^{2}}{{\ensuremath{\Delta}}^{2}}}$, generated by these collisions. Two different regimes can be studied: intermediate impact parameters ${x}^{d}<<b<<\sqrt{{\ensuremath{\alpha}}^{\ensuremath{'}}\mathrm{ln}s}\ensuremath{\simeq}\frac{\ensuremath{\Delta}}{2}$ (${x}^{d}$ characterizing the string fluctuations) and large impact parameters $b>>\sqrt{{\ensuremath{\alpha}}^{\ensuremath{'}}\mathrm{ln}s}\ensuremath{\simeq}\frac{\ensuremath{\Delta}}{2}>>{x}^{d}$. The effective metric generated by these collisions for large $b$ is a gravitational shock wave of profile $f(\ensuremath{\rho})\ensuremath{\sim}p{\ensuremath{\rho}}^{4\ensuremath{-}D}$, i.e., the Aichelburg-Sexl (AS) geometry for a pointlike particle of momentum $p$. For intermediate $b$, $f(\ensuremath{\rho})\ensuremath{\sim}q{\ensuremath{\rho}}^{2}$, corresponding to an extended source of momentum $q$. The scattering matrix in this geometry and its implications for the string collision process are analyzed. We show that the poles $iGs=n$, $n=0,1,2,\dots{}$, characteristic of the scattering by the AS geometry are absent here, due to the extended nature of the effective source.

Cited by 14

Preprocessing Algorithm for Deciphering Historical Inscriptions Using String Metric

Loránd Lehel Tóth, Raymond Pardede, György András Jeney et al. · Open Journal Systems (Taiwan Association of Engineering and Technology Innovation) · 2016

The article presents the improvements in the preprocessing part of the deciphering method (shortly preprocessing algorithm) for historical inscriptions of unknown origin. Glyphs used in historical inscriptions changed through time; therefore, various versions of the same script may contain different glyphs for each grapheme. The purpose of the preprocessing algorithm is reducing the running time of the deciphering process by filtering out the less probable interpretations of the examined inscription. However, the first version of the preprocessing algorithm leads incorrect outcome or no result in the output in certain cases. Therefore, its improved version was developed to find the most similar words in the dictionary by relaying the search conditions more accurately, but still computationally effectively. Moreover, a sophisticated similarity metric used to determine the possible meaning of the unknown inscription is introduced. The results of the evaluations are also detailed.

Cited by 1Open access