Outliers Resistant Learning Algorithm for Radial-basis-fuzzy-wavelet-neural Network in Stomach Acute Injury Diagnosis Tasks

In this paper an outliers resistant learning algorithm for the radial-basis-fuzzy-wavelet-neural network based on R. Welsh criterion is proposed. Suggested learning algorithm under consideration allows the signals processing in presence of significant noise level and outliers. The robust learning algorithm efficiency is investigated and confirmed by the number of experiments including medical applications.

A Generalized Convolution with a Weight Function for the Fourier Cosine and Sine Transforms

A generalized convolution with a weight function for the Fourier cosine and sine transforms is introduced. Its properties and applications to solving a system of integral equations are considered.

On the Mellin Transforms of Dirac’S Delta Function, The Hausdorff Dimension Function, and The Theorem by Mellin

Mathematics Subject Classification: 44A05, 46F12, 28A78

Discrete Models of Time-Fractional Diffusion in a Potential Well

Mathematics Subject Classification: 26A33, 45K05, 60J60, 60G50, 65N06, 80-99.

Convolution Products in L1(R+), Integral Transforms and Fractional Calculus

Mathematics Subject Classification: 43A20, 26A33 (main), 44A10, 44A15

On q-Laplace Transforms of the q-Bessel Functions

Mathematics Subject Classification: 33D15, 44A10, 44A20

Generalized Convolution Transforms and Toeplitz Plus Hankel Integral Equations

Mathematics Subject Classification: 44A05, 44A35

About Learning Discrete Mathematics at Bulgarian School

The present work is dedicated to the learning discrete mathematics at Bulgarian school. A review of syllabuses and standards has been made. A project of learning discrete mathematics elements from first to twelve class is proposed.

Integral Transforms Method to Solve a Time-Space Fractional Diffusion Equation

Mathematical Subject Classification 2010: 35R11, 42A38, 26A33, 33E12.

Fractional Calculus of P-transforms

MSC 2010: 44A20, 33C60, 44A10, 26A33, 33C20, 85A99

Henselian Discrete Valued Fields Admitting One-Dimensional Local Class Field Theory

2000 Mathematics Subject Classification: 11S31 12E15 12F10 12J20.

Generalized Fractional Calculus, Special Functions and Integral Transforms: What is the Relation?

Виржиния С. Кирякова - В този обзор илюстрираме накратко наши приноси към обобщенията на дробното смятане (анализ) като теория на операторите за интегриране и диференциране от произволен (дробен) ред, на класическите специални функции и на интегралните трансформации от лапласов тип. Показано е, че тези три области на анализа са тясно свързани и взаимно индуцират своето възникване и по-нататъшно развитие. За конкретните твърдения, доказателства и примери, вж. Литературата.

Notes on the Solution of Dynamic Optimization Problems with Explicit Controls in Discrete-Time Economic Models

Йордан Йорданов, Андрей Василев - В работата се изследват методи за решаването на задачи на оптималното управление в дискретно време с безкраен хоризонт и явни управления. Дадена е обосновка на една процедура за решаване на такива задачи, базирана на множители на Лагранж, коята често се употребява в икономическата литература. Извеждени са необходимите условия за оптималност на базата на уравнения на Белман и са приведени достатъчни условия за оптималност при допускания, които често се използват в икономиката.

Discrete Generalization of Gronwall-Bellman Inequality with Maxima and Application

Снежана Христова, Кремена Стефанова, Лиляна Ванкова - В работата са решени няколко нови видове линейни дискретни неравенства, които съдържат максимума на неизвестната функция в отминал интервал от време. Някои от тези неравенства са приложени за изучаване непрекъснатата зависимост от смущения при дискретни уравнения с максимуми.

An edge-based matching kernel through discrete-time quantum walks

In this paper, we propose a new edge-based matching kernel for graphs by using discrete-time quantum walks. To this end, we commence by transforming a graph into a directed line graph. The reasons of using the line graph structure are twofold. First, for a graph, its directed line graph is a dual representation and each vertex of the line graph represents a corresponding edge in the original graph. Second, we show that the discrete-time quantum walk can be seen as a walk on the line graph and the state space of the walk is the vertex set of the line graph, i.e., the state space of the walk is the edges of the original graph. As a result, the directed line graph provides an elegant way of developing new edge-based matching kernel based on discrete-time quantum walks. For a pair of graphs, we compute the h-layer depth-based representation for each vertex of their directed line graphs by computing entropic signatures (computed from discrete-time quantum walks on the line graphs) on the family of K-layer expansion subgraphs rooted at the vertex, i.e., we compute the depth-based representations for edges of the original graphs through their directed line graphs. Based on the new representations, we define an edge-based matching method for the pair of graphs by aligning the h-layer depth-based representations computed through the directed line graphs. The new edge-based matching kernel is thus computed by counting the number of matched vertices identified by the matching method on the directed line graphs. Experiments on standard graph datasets demonstrate the effectiveness of our new kernel.