I analyse the problem of introducing the spin of the quark and the antiquark in effective QCD strings from the point of view of the Wilson loop for a spin-half particle, or the Super Wilson loop. A string representation of the Super Wilson loop is obtained starting from an effective string representation of a Wilson Loop. The action obtained in this manner is invariant under a worldline supersy...

This work is devoted to provide a way of representing $4D$ spherically symmetric and static compact stellar configurations into $5D$ space time, using the black string framework. We write four five dimensional line elements energy momentum tensor such that quantities are related by function $A(z)$, where $z$ represents extra dimension. Remarkably, one consequence our chosen form for element, fa...

A candidate for the confining string of gauge theories is constructed via a representation of the ultraviolet divergences of quantum field theory by a closed string dilaton insertion, computed through the soft dilaton theorem. The resulting (critical) confining string is conformally invariant, singles out naturally d = 4 dimensions, and can not be used to represent theories with Landau poles. E...

In this paper we consider the completeness problem of reasoning about planar spatial relationships in pictorial retrieval systems. We define a large class of two-dimensional scenes, the extended pseudo-symbolic pictures. The existing rule system R is proved to be complete for (extended) pseudo-symbolic pictures. We also introduce a new iconic indexing, the (extended) pseudo2D string representat...

The correspondence between a string of a language and its abstract representation, usually a (decorated) tree, is not straightforward. However, it is desirable to maintain it, for example to build structured editors for texts written in natural language. As such correspondences must be compositional, we call them "Structured String-Tree Correspondences" (SSTC). We argue that a SSTC is in fact c...

Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." Discussion of this document should take place on the LDAP (v3) Revison (ldapbis) Working Group mailing list . ...

In this paper, we present a novel optimization-based method for the combination of cluster ensembles. The information among the ensemble is formulated in 0-1 bit strings. The suggested model de ̄nes a constrained nonlinear objective function, called fuzzy string objective function (FSOF), which maximizes the agreement between the ensemble members and minimizes the disagreement simultaneously. De...

A 2-variable matrix B ∈ GLn(Z[u±1, v±1]) is defined for any n-string link, generalizing the Burau matrix of an nbraid. The specialization u = 1, v = t−1 recovers the generalized Burau matrix recently defined by X. S. Lin, F. Tian and Z. Wang using probabilistic methods. The specialization u = t−1, v = 1 results in a matrix with a natural algebraic interpretation, and one that yields homological...

In this paper, we prove that every planar 4-connected graph has a CZ-representation—a string representation using paths in a rectangular grid that contain at most one vertical segment. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. The required size of the grid is n× 2n.