A consistent procedure for regularization of divergences and for the subsequent renormalization of the string tension is proposed in the framework of the one-loop calculation of the interquark potential generated by the Polyakov-Kleinert string. In this way, a justification of the formal treatment of divergences by analytic continuation of the Riemann and Epstein-Hurwitz zeta functions is given...

We obtain an effective string theory of the Abrikosov–Nielsen–Olesen vortices of the Abelian Higgs model. The theory has an anomaly free effective string action which, when the extrinsic curvature is set equal to zero, yields the Nambu–Goto action. This generalizes previous work in which a string representation was obtained in the London limit, where the magnitude of the Higgs field is fixed. V...

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes.

This paper describes the architecture, operation and results obtained with the Question Answering prototype developed in the Department of Language Processing and Information Systems at the University of Alicante. Our approach accomplishes question representation by combining keywords with a semantic representation of expected answer characteristics. Answer string ranking is performed by comput...

Some old and new evidence for the existence of the string (planar random surfaces) representation of multicolour QCD are reviewed. They concern the random surface representation of the strong coupling expansion in lattice multicolour gauge theory in any dimension. Our old idea of modified strong coupling expansion in terms of planar random surfaces, valid for the physical weak coupling phase of...

Graph relabeling systems (GRS's) have been introduced as a suitable tool for coding and proving sequential or distributed algorithms on graphs or networks. These systems do not change the underlying structure of the graph on which they work, but only the labeling of its components (edges or vertices). Each relabeling step is fully determined by the knowledge of a xed size subgraph, the local co...

It will be argued that among the known systems in three dimensions that have string like excitations periodic U(1) pure gauge theories are the most likely candidates to lead to a string representation of their universal properties. Some recent work with F. David will also be reviewed.

In this paper, we propose fast string matching system using GPU for large scale string matching. The key of our proposed system is the use of bit-parallel pattern matching approach for compact NFA representation and fast simulation of NFA transition on GPU. In the experiments, we show the usefulness of our proposed pattern matching system.

We consider a random surface representation of the three-dimensional Ising model.The model exhibit scaling behaviour and a new critical index κ which relates γ string for the bosonic string to the exponent α of the specific heat of the 3d Ising model is introduced. We try to determine κ by numerical simulations.