### Article

## New alphabet-dependent morphological transition in random RNA alignment

We study the fraction f of nucleotides involved in the formation of a cactuslike secondary structure of random heteropolymer RNA-like molecules. In the low-temperature limit, we study this fraction as a function of the number c of different nucleotide species. We show, that with changing c, the secondary structures of random RNAs undergo a morphological transition:f(c)→1 for c≤ccr as the chain length n goes to infinity, signaling the formation of a virtually perfect gapless secondary structure; while f(c)<1 for c>ccr, which means that a nonperfect structure with gaps is formed. The strict upper and lower bounds 2≤ccr≤4 are proven, and the numerical evidence for ccr is presented. The relevance of the transition from the evolutional point of view is discussed.

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

The book contains the necessary information from the algorithm theory, graph theory, combinatorics. It is considered partially recursive functions, Turing machines, some versions of the algorithms (associative calculus, the system of substitutions, grammars, Post's productions, Marcov's normal algorithms, operator algorithms). The main types of graphs are described (multigraphs, pseudographs, Eulerian graphs, Hamiltonian graphs, trees, bipartite graphs, matchings, Petri nets, planar graphs, transport nets). Some algorithms often used in practice on graphs are given. It is considered classical combinatorial configurations and their generating functions, recurrent sequences. It is put in a basis of the book long-term experience of teaching by authors the discipline «Discrete mathematics» at the business informatics faculty, at the computer science faculty* *of National Research University Higher School of Economics, and at the automatics and computer technique faculty of National research university Moscow power engineering institute. The book is intended for the students of a bachelor degree, trained at the computer science faculties in the directions 09.03.01 Informatics and computational technique, 09.03.02 Informational systems and technologies, 09.03.03 Applied informatics, 09.03.04 Software Engineering, and also for IT experts and developers of software products.

We study the planar matching problem, defined by a symmetric random matrix with independent identically distributed entries, taking values 0 and 1. We show that the existence of a perfect planar matching structure is possible only above a certain critical density of allowed contacts, $p_{c}$. This problem has an important application for the prediction of the optimal folding of RNA-type polymers. Using an alternative formulation of the problem in terms of Dyck paths and a matrix model of planar contact structures, we provide an analytical estimation for the value of the transition point, $p_{c}$, in the thermodynamic limit. This estimation is close to the critical value, $p_{c}\approx 0.38$, obtained in numerical simulations based on an exact dynamic-programming algorithm. We characterize the corresponding critical behavior of the model and discuss the relation of the perfect-imperfect matching transition to the known molten-glass transition in the context of random RNA secondary structure's formation. In particular, we provide strong evidence supporting the conjecture that the molten-glass transition at $T=0$ occurs at $p_{c}$

A simple sociophysical model is proposed to describe the transition between a chaotic and a coherent state of a microblogging social network. The model is based on the equations of evolution of the order parameter, the conjugated field, and the control parameter. The self-consistent evolution of the networks is presented by equations in which the correlation function between the incoming information and the subsequent change of the number of microposts plays the role of the order parameter; the conjugate field is equal to the existing information; and the control parameter is given by the number of strategically oriented users. Analysis of the adiabatic approximation shows that the second-order phase transition, which means following a definite strategy by the network users, occurs when their initial number exceeds a critical value equal to the geometric mean of the total and critical number of users.

In this work, we explore the properties of antiferromagnetic cycloid and the phase transitions between commensurate and incommensurate magnetic states in epitaxial BiFeO3 film. Additional magnetic anisotropy induced by strain effects in the films allocates cycloids with the definite directions of spin rotation. Peculiar feature of the cycloids propagating in the films whose symmetry is different from the single crystals is the orientation of spin rotational plane that does not contain electric polarization in contrast with the bulk materials. We construct a diagram of phase transitions induced by magnetic field applied along normal to the surface and show considerable decrease of the strength of magnetic field destroying cycloid in films compared with the bulk.

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.

Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability

The dynamics of a two-component Davydov-Scott (DS) soliton with a small mismatch of the initial location or velocity of the high-frequency (HF) component was investigated within the framework of the Zakharov-type system of two coupled equations for the HF and low-frequency (LF) fields. In this system, the HF field is described by the linear Schrödinger equation with the potential generated by the LF component varying in time and space. The LF component in this system is described by the Korteweg-de Vries equation with a term of quadratic influence of the HF field on the LF field. The frequency of the DS soliton`s component oscillation was found analytically using the balance equation. The perturbed DS soliton was shown to be stable. The analytical results were confirmed by numerical simulations.