2025.4

The paper considers a method of stabilized hard thresholding in the problem of inverting linear homogeneous operators using wavelet decomposition. In a data model with additive Gaussian noise, an analysis of the unbiased estimate of the mean square risk of this method is carried out. Under the assumption of a long-term dependence between noise coefficients, conditions are given under which the unbiased risk estimate is strongly consistent and asymptotically normal.

The problem of Hausdorff approximation by finite sets of the solution and the value of a multicriteria mixed strategy bimatrix game using a representation based on linear scalarization is considered. For the case of 2×2 matrices, explicit formulas are obtained for constructing nodes of a δ-net on the product of simplices of scalarization parameters. It is proved that the set of the equilibrium values obtained for the net converges in the Hausdorff metric to the solution of the initial game at δ →0. Possibile appearance of degenerate bimatrix games in scalarization is taken account. Examples are given for two-criteria 2×2×2 games.

In this paper, the definitions of generalized Student’s distributions are extended to a wider set of parameters of these distributions and multiplication theorems are given that allow the generalized Student’s and Lomax’s distributions to be represented as scale mixtures of the same distributions but with larger parameters. A similar result is obtained for beta distributions. Analogs of multiplication theorems are obtained for the classical Student’s and Lomax’s distributions as corollaries; in particular, it is shown that the Student’s distribution can be represented as a scale mixture of the Student’s distribution with a large number of degrees of freedom. A representation of strictly stable distributions concentrated on the positive semiaxis is also obtained as scale mixtures of a special distribution that is not stable. This alternative representation complements the multiplication theorem for such strictly stable laws.

We present an efficient algorithm for checking language equivalence of states in top-down deterministic finite tree automata (DFTAs). Unlike string automata, tree automata operate over hierarchical structures, posing unique challenges for algorithmic analysis. Our approach reduces the equivalence checking problem to that of checking the solvability of a system of language-theoretic equations which specify the behavior of a DFTA. By constructing such a system of equations and systematically manipulating with it through substitution and conflict detection rules, we develop a decision procedure that determines whether two states accept the same tree language. We formally prove the correctness and termination of the algorithm and establish its worst-case time complexity as O(n²) under the RAM (Random Access Machine) model of computation augmented with pointers.

The aim of equivalence testing is to verify that two parameters are sufficiently close or, alternatively, that the parameter of interest lies within two pre-specified limits. The two one-sided tests procedure is arguably the most widely known approach for assessing equivalence in the pharmaceutical field. Using a model that accounts for missing data, it is shown analytically that the type I error rate may exceed the nominal significance level. A refined estimate of this error is also obtained. For the standard 2x2 crossover design, a method is proposed that enables control of the type I error in the presence of missing data.

This study presents a modified vector autoregression (VAR) method for forecasting the quality metrics of overlay channels. The modification involves the introduction of weighted coefficients for time series quantiles, with two distinct approaches proposed for calculating these weights: exponential weighting (EVAR) and linear weighting (LVAR). Experimental results demonstrate that the proposed method improves prediction accuracy by 2.6% to 25.2% compared to classical AR and VAR methods, albeit at the expense of higher computational complexity.

It was proved earlier that product xy is a universal function for the class of linear functions depending on two arguments if k=6l±1. Then the criterion of existence of a universal polinomial was obtained for any number of arguments and any k. In this paper we show that product xy is universal for any class of linear functions over Galua field GF(p^m), where p is any prime and m is natural, m⩾2.

A detailed description of the implementation of an algorithm for constructing a variable-structure stabilizing controller for a switched interval linear system with slow switches inaccessible to observation is proposed. It is proposed to use a neural network as an observer of the active modes of a closed system. The simulation results of the constructed stabilization system are presented.