The string theory is a fast moving subject, both physics wise and in the respect of mathematics. In order to keep up with the discipline it is important to move with new ideas which are being stressed. Here I wish to give extracts from new papers of ideas which I have recently found interesting. There are six papers which are involved: I ."Strings formulated directly in 4 dimensions " A. N...

It is built a map between the Topological Quantum Field Theory (TQFT) 3D compact U(1) gauge Maxwell Chern-Simons and the non-relativistic quantum mechanics (semi-classical) Azbel-Hofstadter model of Bloch-electrons. The U q (sl 2) quantum group of magnetic translations in the Azbel-Hofstadter model is interpreted as discretized gauge transformations on the TQFT. The monopole confining and monop...

Models of security-sensitive code enable reasoning about the security implications of code. In this paper we present an approach for extracting models of security-sensitive operations directly from program binaries, which lets third-party analysts reason about a program when the source code is not available. Our approach is based on string-enhanced white-box exploration, a new technique that im...

Insulator strings with several material and profiles are very common in overhead transmission lines. However, the electric field and voltage distribution of insulator string is uneven which may easily lead to corona, insulators’ surface deterioration and even flashover. So the calculation of the electric field and voltage distribution along them is a very important factor in the operation time....

The buckling behavior of rod strings in wellbore is one of the key issues in petroleum engineering. The slender rod strings in vertical wellbore were selected as research objects. Based on the energy method, the critical load formulas of sinusoidal and helical buckling were derived for the string with the bottom of the wellbore pressure. According to the sinusoidal and helical buckling’s geomet...

Recently, we introduced a new automata model, so-called colored finite (CFAs) whose accepting states are multi-colored (i.e., not conventional black-and-white acceptance) in order to classify their input strings into two or more languages, and solved the specific complexity problems concerning color-unmixedness of nondeterministic CFA. That is, UV, UP, UE shown be NLOG-complete, P, NP-complete,...