نتایج جستجو برای: string representation

تعداد نتایج: 277969  

1992
S. Zerbini

A novel representation —in terms of a Laurent series— for the free energy of string theory at non-zero temperature is constructed. The examples of open bosonic, open supersymmetric and closed bosonic strings are studied in detail. In all these cases the Laurent series representation for the free energy is obtained explicitly. It is shown that the Hagedorn temperature arises in this formalism as...

2001
Mitsuo Abe Katsunori Kawamura

Representation of the algebra of FP (anti)ghosts in string theory is studied by generalizing the recursive fermion system in the Cuntz algebra constructed previously. For that purpose, the pseudo Cuntz algebra, which is a ∗-algebra generalizing the Cuntz algebra and acting on indefinite-metric vector spaces, is introduced. The algebra of FP (anti)ghosts in string theory is embedded into the pse...

2002
Ying-Hong Wang

The increasing availability of image and multimedia-oriented applications markedly impacts image/multimedia file and database systems. Image data are not well-defined keywords such as traditional text data used in searching and retrieving functions. Consequently, various indexing and retrieving methodologies must be defined based on the characteristics of image data. Spatial relationships repre...

2004
J. Mourad

A classical action is proposed which upon quantisation yields massless particles belonging to the continuous spin representation of the Poincaré group. The string generalisation of the action is identical to the tensionless extrinsic curvature action proposed by Savvidy. We show that the BRST quantisation of the string action gives a critical dimension of 28. The constraints result in a number ...

2007
Pietro Giudice Ferdinando Gliozzi Stefano Lottini

Simple scaling properties of correlation functions of a confining gauge theory in d-dimensions lead to the conclusion that k-string dynamics is described, in the infrared limit, by a two-dimensional conformal field theory with conformal anomaly c = (d−2)σk/σ, where σk is the k-string tension and σ that of the fundamental representation. This result applies to any gauge theory with stable k-stri...

2007
D. H. PETERSON

The character of a highest weight representation of an affine lie algebra can be written as a finite sum of products of classical 0-functions and certain modular functions, called string functions. We find the transformation law for the string functions, which allows us to compute them explicitly in many interesting cases. Finally, we write an explicit formula for the partition function, in the...

2007
JASON BROWNLEE

Strings of bits (bitstrings) are a common first-order representation in the design and preliminary investigation of computational intelligence algorithms given (1) the ease in mapping the strings to arbitrary domains (such as real numbers), and (2) in terms of mathematical analysis. This work considers the use of bitstrings in the context of the clonal expansion and antigenic selection in a gen...

Journal: :Theor. Comput. Sci. 2013
Artur Jez

In this paper we present a simple linear-time algorithm constructing a context-free grammar of size O(g log(N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is linear assuming that the alphabet Σ of the input string can be identified with number...

2004
Hendrik Grundling C. A. Hurst

Our aim in this paper is to make explicit the operator theory of the heuristic open Bosonic string and to abstract a suitable field algebra for the string. This is done on a Fock-Krein space and we examine integrability and J-unitary implementability of all the defining transformations of the string, i.e. time translations, gauge transformations and Poincare transformations. The results obtaine...

2016
Taeho Jo

In this research, we propose the string vector based K Nearest Neighbor as the approach to the word categorization. In the previous works on the text categorization, it was successful to encode texts into string vectors, by preventing the demerits from encoding them into numerical vectors; it provides the motivation for doing this research. In this research, we encode words into string vectors ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید