Data Flow Analysis and the Linear Programming Model

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

Null Condition for Semilinear Wave Equation with Variable Coefficients

∗The author was partially supported by M.U.R.S.T. Progr. Nazionale “Problemi Non Lineari...”

Applied Aspects of Mathematical Modeling and Optimization of Dynamics of Charged Beams

The complex of questions connected with the analysis, estimation and structural-parametrical optimization of dynamic system is considered in this article. Connection of such problems with tasks of control by beams of trajectories is emphasized. The special attention is concentrated on the review and analysis of spent scientific researches, the attention is stressed to their constructability and applied directedness. Efficiency of the developed algorithmic and software is demonstrated on the tasks of modeling and optimization of output beam characteristics in linear resonance accelerators.

Применение Метода Параметрической Оптимизации для Задач Фокусировки Пучков Ионов в Линейных Ускорителях

Предложен конструктивный метод параметрической оптимизации для проектирования систем ускорения и фокусировки ионов в линейных резонансных ускорителях. На примере математической модели процесса ускорения и фокусировки пучка ионов решена актуальная задача увеличения интенсивности пучка заряженных частиц для медицинского ускорителя заряженных частиц на 3 Мэв.

Maximization of a Linear Utility Function over the Set of the Housing Market Short-Term Equilibria

AMS subject classification: 90C05, 90A14.

Spiral Walk Exposed

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2015

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.

Nonlinear Wave Equation with Vanishing Potential

We study the Cauchy problem for utt − ∆u + V (x)u^5 = 0 in 3–dimensional case. The function V (x) is positive and regular, in particular we are interested in the case V (x) = 0 in some points. We look for the global classical solution of this equation under a suitable hypothesis on the initial energy.

Nonlinear Variational Inequalities Depending on a Parameter

This paper develops the results announced in the Note [14]. Using an eigenvalue problem governed by a variational inequality, we try to unify the theory concerning the post-critical equilibrium state of a thin elastic plate subjected to unilateral conditions.

The Technology of Programming for a Cluster Computer by the Remote Terminal with OS Windows

The problem of preparation of a program to perform it on multiprocessor system of a cluster type is considered. When developing programs for a cluster computer the technology based on use of the remote terminal is applied. The situation when such remote terminal is the computer with operational system Windows is considered. The set of the tool means, allowing carrying out of editing program texts, compiling and starting programs on a cluster computer, is suggested. Advantage of an offered way of preparation of programs to execution is that it allows as much as possible to use practical experience of programmers used to working in OS Windows environment.

Cauchy Problem for Differential Equation with Caputo Derivative

The paper is devoted to the study of the Cauchy problem for a nonlinear differential equation of complex order with the Caputo fractional derivative. The equivalence of this problem and a nonlinear Volterra integral equation in the space of continuously differentiable functions is established. On the basis of this result, the existence and uniqueness of the solution of the considered Cauchy problem is proved. The approximate-iterative method by Dzjadyk is used to obtain the approximate solution of this problem. Two numerical examples are given.

Mathematical Optimization for the Train Timetabling Problem

AMS Subj. Classification: 90C57; 90C10;

Nonlinear Waves: An Introduction

This book deals with equations of mathematical physics as the different modifications of the KdV equation, the Camassa-Holm type equations, several modifications of Burger's equation, the Hunter-Saxton equation, conservation laws equations and others. The equations originate from physics but are proposed here for their investigation via purely mathematical methods in the frames of university courses. More precisely, we propose classification theorems for the traveling wave solutions for a sufficiently large class of third order nonlinear PDE when the corresponding profiles develop different kind of singularities (cusps, peaks), existence and uniqueness results, etc. The orbital stability of the periodic solutions of traveling type for mKdV equations are also studied. Of great interest too is the interaction of peakon type solutions of the Camassa-Holm equation and the solvability of the classical and generalized Cauchy problem for the Hunter-Saxton equation. The Riemann problem for special systems of conservation laws and the corresponding -shocks are also considered. As it concerns numerical methods we apply the CNN approach. The book is addressed to a broader audience including graduate students, Ph.D. students, mathematicians, physicist, engineers and specialists in the domain of PDE.

Solving Maximum Clique Problem for Protein Structure Similarity

Computing the similarity between two protein structures is a crucial task in molecular biology, and has been extensively investigated. Many protein structure comparison methods can be modeled as maximum weighted clique problems in specific k-partite graphs, referred here as alignment graphs. In this paper we present both a new integer programming formulation for solving such clique problems and a dedicated branch and bound algorithm for solving the maximum cardinality clique problem. Both approaches have been integrated in VAST, a software for aligning protein 3D structures largely used in the National Center for Biotechnology Information, an original clique solver which uses the well known Bron and Kerbosch algorithm (BK). Our computational results on real protein alignment instances show that our branch and bound algorithm is up to 116 times faster than BK.

N–Dimensional Orthogonal Tile Sizing Problem

AMS subject classification: 68Q22, 90C90