On a Two-Dimensional Search Problem

In this article we explore the so-called two-dimensional tree− search problem. We prove that for integers m of the form m = (2^(st) − 1)/(2^s − 1) the rectangles A(m, n) are all tight, no matter what n is. On the other hand, we prove that there exist infinitely many integers m for which there is an infinite number of n’s such that A(m, n) is loose. Furthermore, we determine the smallest loose rectangle as well as the smallest loose square (A(181, 181)). It is still undecided whether there exist infinitely many loose squares.

Conceptual Idea of Identification of Patterns and Problem Solving in the Human’s Memory and the Possibilities to Use it in Artificial Intelligent

Given cybernetic idea is formed on the basis of neurophysiologic, neuropsychological, neurocybernetic data and verisimilar hypotheses, which fill gaps of formers, of the author as well. First of all attention is focused on general principles of a Memory organization in the brain and processes which take part in it that realize such psychical functions as perception and identification of input information about patterns and a problem solving, which is specified by the input and output conditions, as well. Realization of the second function, essentially cogitative, is discussed in the aspects of figurative and lingual thinking on the levels of intuition and understanding. The reasons of advisability and principles of bionic approach to creation of appropriate tools of artificial intelligent are proposed.

Active Monitoring and Decision Making Problem

Active monitoring and problem of non-stable of sound signal parameters in the regime of piling up response signal of environment is under consideration. Math model of testing object by set of weak stationary dynamic actions is offered. The response of structures to the set of signals is under processing for getting important information about object condition in high frequency band. Making decision procedure by using researcher’s heuristic and aprioristic knowledge is discussed as well. As an example the result of numerical solution is given.

Pseudo-Differential Operators in a Wave Diffraction Problem with Impedance Conditions

Mathematics Subject Classification: 35J05, 35J25, 35C15, 47H50, 47G30

A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem

AMS Subj. Classification: 90C27, 05C85, 90C59

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.

Quasi-Regular Solutions for 3D Equations of Tricomi and Keldish Types

Цветан Д. Христов, Недю Ив. Попиванов, Манфред Шнайдер - Изучени са някои тримерни гранични задачи за уравнения от смесен тип. За уравнения от типа на Трикоми те са формулирани от М. Протер през 1952, като тримерни аналози на задачите на Дарбу или Коши–Гурса в равнината. Добре известно е, че новите задачи са некоректни. Ние формулираме нова гранична задача за уравнения от типа на Келдиш и даваме понятие за квазиругулярно решение на тази задача и на eдна от задачите на Протер. Намерени са достатъчни условия за единственост на такива решения.

Singular Solutions of Protter’s Problem for a Class of 3-D Hyperbolic Equations

Недю Иванов Попиванов, Алексей Йорданов Николов - През 1952 г. М. Протър формулира нови гранични задачи за вълновото уравнение, които са тримерни аналози на задачите на Дарбу в равнината. Задачите са разгледани в тримерна област, ограничена от две характеристични конуса и равнина. Сега, след като са минали повече от 50 години, е добре известно, че за безброй гладки функции в дясната страна на уравнението тези задачи нямат класически решения, а обобщеното решение има силна степенна особеност във върха на характеристичния конус, която е изолирана и не се разпространява по конуса. Тук ние разглеждаме трета гранична задача за вълновото уравнение с младши членове и дясна страна във формата на тригонометричен полином. Дадена е по-нова от досега известната априорна оценка за максимално възможната особеност на решенията на тази задача. Оказва се, че при по-общото уравнение с младши членове възможната сингулярност е от същия ред като при чисто вълновото уравнение.

N–Dimensional Orthogonal Tile Sizing Problem

AMS subject classification: 68Q22, 90C90

A Note on the Extinction Problem for Controlled Multitype Branching Processes

2000 Mathematics Subject Classification: 60J80, 60J10.

On an ODE Relevant for the General Theory of the Hyperbolic Cauchy Problem

2000 Mathematics Subject Classification: 34E20, 35L80, 35L15.