Related papers: Towards complete string effective actions beyond l…

I compute the derivative expansion of an effective action at finite temperature using the imaginary time approach. I show that it is a well behaved expansion giving a unique seriers contrary to previous results. This disparity is shown to…

Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an…

In String Theory there often appears a rather interesting class of higher derivative theories containing an infinite set of derivatives in the form of an exponential. These theories may provide a way to tame ultraviolet divergences without…

Some results are presented concerning duality invariant effective string actions and the construction of automorphic functions for general (2,2) string compactifications. These considerations are applied in order to discuss the {\it…

A truncation of string field theory is compared with the duality invariant effective action of $D=4, N=4$ heterotic strings to cubic order. The three string vertex must satisfy a set of compatibility conditions. Any cyclic three string…

We present new results on learning temporally extended actions for continuoustasks, using the options framework (Suttonet al.[1999b], Precup [2000]). In orderto achieve this goal we work with the option-critic architecture (Baconet…

The derivative expansion of the one-loop effective action in QED$_3$ and QED$_4$ is considered. The first term in such an expansion is the effective action for a constant electromagnetic field. An explicit expression for the next term…

The explicit expression of all the WZW effective actions for a simple group G broken down to a subgroup H is established in a simple and direct way, and the formal similarity of these actions to the Chern-Simons forms is explained.…

Examples of non-trivial higher string topology operations have been regrettably rare in the literature. In this paper, working in the context of string topology of classifying spaces, we provide explicit calculations of a wealth of…

Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…

In this paper we analyse the selectivity measure calculated from the complex network in the task of the automatic keyword extraction. Texts, collected from different web sources (portals, forums), are represented as directed and weighted…

More and more processes governing our lives use in some part an automatic decision step, where -- based on a feature vector derived from an applicant -- an algorithm has the decision power over the final outcome. Here we present a simple…

We use the background field method along with a special gauge condition, to derive the hard thermal loop effective action in a simple manner. The new point in the paper is to relate the effective action explicitly to the S-matrix from the…

Context: A tertiary study can be performed to identify related reviews on a topic of interest. However, the elaboration of an appropriate and effective search string to detect secondary studies is challenging for Software Engineering (SE)…

In this paper we determine the number of the meaningful compositions of higher order of the differential operations and Gateaux directional derivative.

Motivated by extending the functional stochastic calculus, to important functionals to which it does not apply, a notion of functional derivative along a curve is introduced. This new setting is developed by incorporating path-dependent…

For processes involving structure functions and/or fragmentation functions, arguments that, over a range of a proper kinematic variable, there is a part that dominates the next-to-leading order (NLO) corrections are briefly reviewed. The…

We develop a general problem setting for training and testing the ability of agents to gather information efficiently. Specifically, we present a collection of tasks in which success requires searching through a partially-observed…

The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and…

The recent years have seen remarkable success in the use of deep neural networks on text summarization. However, there is no clear understanding of \textit{why} they perform so well, or \textit{how} they might be improved. In this paper, we…