For equations of the form ux + uy = λux(x;0) + µuy(0;y) the investigation on the correctness of the number of initial value problems in bounded and unbounded domains.
The theorem about the a priori estimate for the solution of Tricomi problem for Lavrentiev-Bitsadze equation is proved. From this theorem, in particular, follows the uniqueness of a regular solution of the investigated problem.
In this paper we construct an explicit representation of the solution of the Cauchy problem for ordinary differential equation of fractional order with Dzhrbashyan-Nersesyan operators.
In the paper we study the first boundary value problem for the diffusion equation of fractional order. A solution in its difference form is obtained by the method of lines.
In this paper we consider a nonlocal boundary value problem with integral condition for the fractional diffusion equation with Caputo operator. The theorem of existence of a solution of the problem.
First boundary value problem is investigated for the Hallaire inhomogeneous equation. With the help of the Fourier method we have found an explicit representation of a regular solution.
The solution to the Goursat problem is written out explicitly for a hyperbolic secondorder
loaded equation, proposed as a mathematical model of Aller equation under certain conditions.
The method of energy inequalities obtained a priori estimate of the solution of the problem of Cattabriga for the equation with multiple characteristics.
In this work we build a fundamental solution to a regular continuous differential equation of second order with regularized derivatives of segment order and find an explicit solution to Cauchy problem in terms of fundamental solution.
In this paper we propose a method for representing various-valued logic function in a logical neural network. This logical neural network will keep the totality of cause-andeffect relationships identified using various-valued logic functions with-in a given specified area. Thus, it becomes possible to transfer a logical algorithm to detect hidden patterns in a given specified area, in case when the values of logical variables are not well-defined and are values obscured between zero and one. These logic operations are implemented by special logic neural cells: conjunctors and disjunctors.
A method of constructing an optimal cognitive maps consists in optimizing the input data and the dimension data structure of a cognitive map. Pro-optimization problem occurs when large amounts of input data. Optimization of time-dimension data is clustering the input data and as a method of polarization-clusters using hierarchical agglomerative method. Cluster analysis allows to divide the data set into a finite number of homogeneous groups. Optimization of the structurery cognitive map is automatically tuning the balance of influence on each other concepts of machine learning methods, particularly the method of training the neural network.
This paper considers the logical approach to the theoretical justification of constructing correct algorithms that extend the area of the solutions obtained on the basis of existing
algorithms. The proposed method makes it possible on the basis of a given set of pattern recognition algorithms to identify additional knowledge of a given subject area and to build a minimum rule, providing additional training of these algorithms.
The paper proposes a new scheme for the gradient solution to minimize losses averaged
problem. It is an analog circuit used in the SAG algorithm in the case when the risk is calculated using the arithmetic mean. An illustrative example of the construction of robust classification based on the maximization of the surrogate median indentation.
Today
Yesterday
This week
This month
All days
Number of views: 380