样式： 排序： IF:  GO 导出 标记为已读

On the Limiting Distribution of Studentized Intermediate Order Statistics Moscow Univ. Comput. Math. Cybern. Pub Date : 20210720
V. I. PagurovaAbstract Conditions are considered under which studentization does not change the limiting distribution of the normalized intermediate order statistics. A similar problem is considered by Berman as applied to a limiting distribution of extreme order statistics.

On a Property of Linear Boolean Functions Moscow Univ. Comput. Math. Cybern. Pub Date : 20210720
A. A. VoronenkoAbstract A problem is considered in which it is required that a Boolean function \(g\) of \(n\) variables be specified such that for any function that essentially depends on exactly \(n1\) variables it is possible to present a certain number of tuples of a given function so that this function \(g\) is the only one that coincides with the given function on these tuples. It is shown that the sum modulo

Transfer Functions of Optimum Filters of Different Dynamic Orders for Discrete Systems Moscow Univ. Comput. Math. Cybern. Pub Date : 20210720
M. A. KamenshchikovAbstract The problem of constructing optimum observers (filters) of different dynamic orders is considered for stochastic control objects in discrete time. Analytical expressions are obtained for the transfer functions of filters,which allow us to calculate the quadratic optimality criterion. With an example of a fourthorder system, the constructed filters are compared by the meansquare observation

Applying the Linear Scalarization in Multicriteria Maximin Problems Moscow Univ. Comput. Math. Cybern. Pub Date : 20210720
N. M. Novikova, I. I. PospelovaAbstract The problem is formulated of analyzing the possibility of parametrizing the multicriteria maximin value using a linear scalarization. A representation based on the inverse Germeier’s logical scalarizing function is used. It is shown that the standard application of the weighted sum of partial criteria for this formulation of the problem requires some modification. Differences are revealed

Multifactor Modeling and Analysis of Repeated Observations of Biological Objects Moscow Univ. Comput. Math. Cybern. Pub Date : 20210720
A. G. Belov, A. E. Polienko, O. A. BelovaAbstract A multifactor model of the behavior of a population of biological objects is described. The model considers the structure of repeated observations and does not assume there are classical requirements for the independence of observations, their normality, or correlation homogeneity. Hypotheses about there being no influence of intergroup and intragroup factors on measured characteristics of

Analytical and Modeling Approaches to Studying the Integral Equation Appearing after a Power3 Closure Moscow Univ. Comput. Math. Cybern. Pub Date : 20210720
S. R. Gadzhiev, E. G. Galkin, A. A. NikitinAbstract A study is performed of the nonlinear integral equation that arises in the biological model of Dieckmann and Law. A brief outline of the model is given, and the meaning and need to introduce spatial moments are described. The nonlinear equation (for the state of equilibrium) is derived from the system of dynamics of spatial moments after power3 closure. The obtained equation is transformed

A Criterion of the Congruence of Nonsingular Matrices from the GroupTheoretic Viewpoint Moscow Univ. Comput. Math. Cybern. Pub Date : 20210429
Kh. D. IkramovAbstract A known criterion of the congruence between nonsingular matrices (\(A\) and \(B\) are congruent if and only if their cosquares \(A^{T}A\) and \(B^{T}B\) are similar) is interpreted from the grouptheoretic viewpoint. This interpretation makes it possible to understand why it is the cosquares of \(A\) and \(B\) that participate in the above criterion.

Associative Steganography of Text Messages Moscow Univ. Comput. Math. Cybern. Pub Date : 20210429
I. S. Vershinin, R. F. Gibadullin, S. V. Pystogov, V. A. RaikhlinAbstract Along with features of the architecture of a textual DBMS with associative protection, problems of encoding text characters and generating a protected database using encoded text are considered in the context of an earlier infological database for the associative protection of text messages. The steganographic resistance of associative protection is assessed using the NIST (National Institute

Estimation of the Average Error Probability for Calculating Wavelet Coefficients in the Hybrid Thresholding Method Moscow Univ. Comput. Math. Cybern. Pub Date : 20210429
A. A. Kudryavtsev, O. V. ShestakovAbstract We consider the denoising problem using the hybrid thresholding of wavelettransform coefficients of the array of observations. The asymptotic order of the threshold and loss function is calculated while minimizing the average probability of error in calculating the wavelet coefficients.

Problem of Consensus for Linear Dynamic Systems with Stochastic Disturbances Moscow Univ. Comput. Math. Cybern. Pub Date : 20210429
A. I. SamarinAbstract A multiagent system with identical linear agents is considered. The consensus problem is to synchronize the agents’ state vector. The distributed control algorithm that solves the problem is known for a system without disturbances. The applicability of this algorithm is also shown for when stochastic disturbances act on the agents’ dynamics and output.

Structural Stability Threshold for the Condition of Robust No Deterministic Sure Arbitrage with Unbounded Profit Moscow Univ. Comput. Math. Cybern. Pub Date : 20210429
S. N. SmirnovAbstract A model financial market is considered that has an uncertain deterministic evolution of prices in discrete time such that prices of assets evolve under uncertainty described using a priori data about possible increments of prices: they are assumed to lie in given compacta that depend on the prehistory of prices. It is assumed that trading constraints are convex, depend on the prehistory of

Approximation of Quasiperiodic Signal Phase Trajectory Using Directional Regression Moscow Univ. Comput. Math. Cybern. Pub Date : 20210113
K. R. Usmanova, Yu. I. Zhuravlev, K. V. Rudakov, V. V. StrijovAbstract This paper solves the phase trajectory approximation problem. Quasiperiodic time series form its trajectory in high dimensional space. The trajectory is represented in the spherical coordinate system. To approximate the trajectory the authors use a directional regression technique. It finds space of minimal dimension with the phase trajectory has no selfintersections. Its selfintersections

An Algorithm Verifying the Congruence of Complex Matrices Whose Cosquares Have Eigenvalues of Modulus One Moscow Univ. Comput. Math. Cybern. Pub Date : 20210113
Kh. D. Ikramov, V. A. UsovAbstract A finite computational process using arithmetic operations only is called a rational algorithm. Presently, no rational algorithm is available that is able to check the congruence of arbitrary complex matrices A and B. In this paper, we propose a rational algorithm of verification that works under less stringent conditions than all the conditions known by now.

On Linear Multistep Controlled Processes Moscow Univ. Comput. Math. Cybern. Pub Date : 20210113
M. S. Nikol’skiiAbstract Linear controlled multistep processes are considered with an additive quality functional under a phase constraint and a terminal condition. These processes are of interest for control theory and its applications. An existence theorem for optimum control is proved for the controlled processes under consideration. In analogy with backward constructions in the positional theory of differential

Strong Consistency of the Risk Estimator in Multiple Hypothesis Testing with the FDR Threshold Moscow Univ. Comput. Math. Cybern. Pub Date : 20210113
S. I. PalionnaiaAbstract Procedures for multiple hypothesis testing are widely used in analyzing data arrays. Transformation is done first, producing an economic (sparse) array representation. Data is then processed by testing hypotheses of data significance and using inverse transformation. Noise suppression and/or data compression are the main goals of this approach. Such techniques are used in the theory of communication

Way of Assessing an Athlete’s Upright Posture Control while Performing Tracking Movements Moscow Univ. Comput. Math. Cybern. Pub Date : 20210113
I. G. Shevtsova, A. A. Navolotskii, N. A. Eremich, M. P. ShestakovAbstract Numerical modeling is performed of movement control processes in higher regions of the human brain during the planning and execution of voluntary tracking movements, based on the internal model hypothesis. Such measures as a Kalman filter, linear–quadratic estimator, and linear–quadratic regulator are used. A way of determining moments of the activation of controls is proposed, based on an

Crowd Flow Control in a Building During Evacuation Moscow Univ. Comput. Math. Cybern. Pub Date : 20210113
M. V. Zaitseva, P. A. TochilinAbstract The motion of a group of people is modeled for an emergency where it is necessary to evacuate people from a building of complicated structure as quickly as possible without stampede. To build the model, it is important to determine which information is available for a current analysis of the situation and which parameters can be used as controls. A macroscopic model of crowd flows is considered

Conditional Testing for Cardot Circuits Moscow Univ. Comput. Math. Cybern. Pub Date : 20200914
A. A. VoronenkoAbstractAbsolute lower bound \(2^{n}\) is established for the length of a full conditional diagnostic test for a Cardot circuit that implements the sum of \(n\) variables.

Behavioral Model of Text Input in the Authentication of Mobile Device Users Moscow Univ. Comput. Math. Cybern. Pub Date : 20200914
A. V. Galkov, I. V. Mashechkin, I. S. PopovAbstractAn investigation is performed of individual behavioral characteristics of text input that are based on the keystroke dynamics using a virtual keyboard, and their application in the authentication of mobile device users. Key hold time, time between two consecutive keystrokes, and keystroke pressure are used as features to build a user model. A feature vector of a freely typed text is constructed

Tool System for Testing RealTime Constraints for Modular Computational System Configurations Moscow Univ. Comput. Math. Cybern. Pub Date : 20200914
A. B. GloninaAbstractThe problem of testing realtime constraints for modular computational systems (MCSes) is exemplified by systems of integrated modular avionics. The requirements to the software for testing these constraints are formulated. An approach to modeling MCSes based on the mathematical apparatus of timed automata with suspended timers is described, and a tool system that implements this approach is

Development of Parallel Codes for a Nonlinear Heat Equation in Problems of PhaseChange Memory Simulation Moscow Univ. Comput. Math. Cybern. Pub Date : 20200914
G. N. ShumkinAbstractResults are presented from developing a parallel code for a joint solution to the nonlinear threedimensional heat equation and the Poisson equation in creating a multiscale model for phasechange memory based on amorphous carbon nanofilms (aC). Their numerical convergence is investigated. The parallel effectiveness of the new code is examined on the IBM BlueGene/P supercomputer.

Geometric Criterion for a Robust Condition of No Sure Arbitrage with Unlimited Profit Moscow Univ. Comput. Math. Cybern. Pub Date : 20200914
S. N. SmirnovAbstractA model is presented of the financial market with a discretetime uncertain deterministic evolution of prices in which asset prices evolve under uncertainty described using a priori information on possible price increments; i.e., it is assumed that they lie in given compact sets that depend on the prehistory of prices. Trading constraints depending on the history of prices are assumed to be

Arithmetization of Register Machines with Counters Moscow Univ. Comput. Math. Cybern. Pub Date : 20200914
I. V. SavitskiiAbstractRegister machines with counters are arithmetized in class \(\mathcal{E}^{0}\) of the Grzegorczyk hierarchy. As a sequence, we construct a new simple basis via superpositioning in Grzegorczyk class \(\mathcal{E}^{2}\).

Refining Rossberg’s Theorem Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
V. I. PagurovaAbstractA study is performed of the asymptotic independence of intermediate order statistics and the ‘‘lower’’ and ‘‘upper’’ extreme order statistics as the sample size grows infinitely large. The result is used to refine Rossberg’s theorem.

On the Toeplitz and Polar Decompositions of an Involutive Matrix Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
Kh. D. IkramovAbstractPeculiarities of the Toeplitz and polar decompositions of an involutive matrix are described. For instance, it is shown that the unitary factor in both polar decompositions of such a matrix is itself an involution; consequently, it is not only a unitary matrix but a Hermitian matrix as well.

Completeness Criterion in Class of ExponentialPolynomial Functions Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
S. S. MarchenkovAbstractThe class \(\textrm{EP}_{\mathbb{N}}\) of all exponentialpolynomial functions that can be obtained from the functions \(0,1,x+y,x\cdot y,\) and \(x^{y}\) by arbitrary superpositions is considered. In \(\textrm{EP}_{\mathbb{N}}\), six precomplete (with respect to the superposition operation) classes are efficiently defined so that a completeness criterion and a recognition algorithm for completeness

Multidimensional EconomicGrowth Models with an Integral Utility Function Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
Yu. N. Kiselev, M. V. Orlov, S. M. OrlovAbstractAn \(n\)dimensional economic model is considered that has a Cobb–Douglas production function on the infinite planning horizon such that the utility function is an integraltype functional with a discount and a logarithmtype integrant. It is assumed that all of the model’s amortization factors are equal to one another. The constructed optimum control contains \(n1\) special segments that

Stochastic Geometry for PopulationDynamic Modeling: A Dieckmann Model with Immovable Individuals Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
E. G. Galkin, A. A. NikitinAbstractA study is performed of the main approaches to investigating the stochastic process of population dynamics. Continuous time and space and immovable individuals are used to derive a denumerable system of integrodifferential equations corresponding to the dynamics of the spatial momentum of this process. A way to find an approximate solution using the momentum approach is described.

Difference Differential Operators with Values at the Midpoints of the Sides of Cells of a Triangular Grid Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
M. N. SablinAbstractA grid analog of the formula of integration by parts is constructed and studied for a twodimensional case in which one of the grid functions is defined at nodes, and the second function is defined at the midpoints of the sides of cells of a simplicial grid in the Cartesian and cylindrical systems of coordinates. Grid analogs of such firstorder differential operators as the gradient, divergence

On the Zeros of CrossProduct Bessel Functions in Oblique Derivative BoundaryValue Problems Moscow Univ. Comput. Math. Cybern. Pub Date : 20200726
S. S. BudzinskiyAbstractCombinations of the crossproducts of Bessel functions that arise in oblique derivative boundaryvalue problems for the Laplace operator in a ring are considered. The behavior of zeros of these functions as the ring thickness tends to zero is studied. It is shown that the zeros are divided into two classes, as in the case of Neumann boundary conditions. Some of them remain finite in the limit

Synthesizing Asymptotic Observers for Hyperoutput Systems with Uncertainty upon Transfer Matrix Degeneracy Moscow Univ. Comput. Math. Cybern. Pub Date : 20200521
V. V. Fomichev, A. V. Kraev, S. Z. TevdoradzeAbstractThe problem of synthesizing an asymptotic observer for a linear system with \(l\) measurable outputs \(y=Cx\) and \(m\) unknown inputs \(f(t)\) acting on the system through the matrix \(D\) is considered. A case of hyperoutput systems is examined; such systems have output dimensions larger than that of an unknown input (\(l>m\)). Ways of constructing observers are wellknown for such systems

A Simultaneous Tube of the Mean Value of Multiple Observations in Multivariate Regression Moscow Univ. Comput. Math. Cybern. Pub Date : 20200521
A. G. BelovAbstractThe problem of constructing a simultaneous confidence tube of the mean value of multiple responses in a multivariate linear normal multiregression model is considered. Simultaneous confidence multivariate ellipsoidal limits for the mean of multiple responses are obtained to solve it. Using a simple bivariate regression model, simultaneous confidence tubes are numerically modeled and analyzed

Sufficient Conditions of the Ergodicity of Queueing Systems with Absolute Priority Moscow Univ. Comput. Math. Cybern. Pub Date : 20200521
A. V. Mistryukov, V. G. UshakovAbstractThe familiar results on ergodicity of priority queueing systems were obtained under the assumption that the input streams of requests of all priorities are Poisson. This assumption is weakened by finding the sufficient conditions of ergodicity of queueing systems with two classes of priorities, where the stream of requests of higher priority is hyperexponential, and the one of lower priority

On Risks of Estimates Based on RandomSize Samples Moscow Univ. Comput. Math. Cybern. Pub Date : 20200521
V. E. BeningAbstractAn asymptotical approach to the statistical estimation problem is considered under the assumption that the number of observations is a random variable. This leads to distributions with heavy tails and changes in the efficiency of the normally used statistical procedures. Statistical estimates based on randomsize and nonrandomsize samples are asymptotically compared against one another. The

Boundary Value Problem for a ThirdOrder Differential Equation with a Strong Boundary Layer Moscow Univ. Comput. Math. Cybern. Pub Date : 20200521
T. Ya. ErshovaAbstractA case is considered in which when the solution to the boundary value problem for a thirdorder singularly perturbed ordinary differential equation has a strong boundary layer. A difference scheme on piecewise uniform Shishkin meshes is used to solve the problem numerically. It is proved that the solution to the difference problem is reduced to solving the original problem uniformly in a small

Way of Measuring Data Transfer Delays among Graphics Processing Units at Different Nodes of a Computer Cluster Moscow Univ. Comput. Math. Cybern. Pub Date : 20200521
A. A. Begaev, A. N. SalnikovAbstractThe basics of load tests for a computer cluster with a large number of GPUs (graphics processing units) distributed over the cluster’s nodes are presented and implemented as a program code. Information about the time delays in the transfer of data of different sizes among all GPUs in the system is collected as a result. Two modes of tests, ‘‘all to all’’ and ‘‘one to one,’’ are developed. In

Depth of Schemes Embedded in a Unit Cube and Implementing Typical Boolean Functions Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
S. A. Lozhkin, E. L. DovgalyukA class of schemes of functional elements in the standard basis of conjunction, disjunction, and negation elements is considered. For each scheme Σ from this class, in addition to depth D(Σ), its dimension R(Σ) is determined and found to be equal to the minimum dimension of the unit (Boolean) cube that allows isomorphic embedding Σ. In addition to results obtained earlier, it is proved that within

On Bilinear Complexity of Multiplying 2 × 2Matrix by 2 × m Matrix over Finite Field Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
V. B. Alekseev, A. A. NazarovThe problem of the least number of multiplications required to compute the product of a 2 × 2matrix X and a 2 × mmatrix Y over an arbitrary finite field is considered by assuming that the elements of the matrices are independent variables. No commutativity of elements of matrix X with elements of matrix Y is assumed (i.e., bilinear complexity is considered). Upper bound \(\frac{{7m}}{2}\) for this

Efficient EquivalenceChecking Algorithms for Procedural Programs in Progressive Semigroup Gateway Models Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
V. V. PodymovThe problem of program equivalence, checking whether programs have the same (equivalent) behavior in a given model, is investigated. The considered models of programs with “gateway” procedures were proposed somewhat recently, and almost nothing is known about solving the problem of equivalence for them. An approach is proposed to solving the problem of the consistent halting of programs without procedures

Exact Solutions to One Nonlinear Sobolev Equation Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
A. I. AristovSeveral families of exact solutions expressed in terms of elementary and special functions are constructed for one nonlinear Sobolevtype equation. The qualitative behavior of these solutions is analyzed.

Problem of Stabilizing a Switching System Using a PiecewiseLinear Control System Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
A. A. Atanesyan, P. A. TochilinThe problem of stabilizing a mathematical hybrid system with switchings between the operating modes is solved. Each of these modes is associated with nonlinear differential equations that have control parameters. The switching instances (conditions) are control components. A stabilizer must be designed in positional form that allows the trajectory of the entire nonlinear system to reach the target

Queue Length in a Queuing System with Dependent Service Times Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
V. G. Ushakov, N. G. UshakovA singleserver queuing system with infinite capacity and a recurrent input flow is considered. Service times of the customer units have an exponential distribution with random parameter. The current value of the parameter is chosen from a finite set with given probabilities at the time the service of a certain customer is completed. Sequential values of the parameters form a special kind of Markov

Refining the Upper Bound for the Cardinality of the Definition Domain of Universal Functions for a Class of Linear Boolean Functions Moscow Univ. Comput. Math. Cybern. Pub Date : 20191210
A. A. Voronenko, I. A. KarchmitNew upper bound 3n is presented for the cardinality of the definition domain of a universal function for a class of linear Boolean functions in which n is the number of variables.

Outlier Detection in Complex Structured Event Streams Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
M. A. Kazachuk, M. I. Petrovskiy, I. V. Mashechkin, O. E. GorokhovOutlier detection methods are now used extensively, particularly in systems for detecting internal intrusions, in medicine, and in systems for detecting extremism in public political discussions on forums and social media. The aim of this work is to consider a fuzzy method of detecting outliers, based on elliptic clustering in the higherdimensional space of attributes and using the Mahalanobis metrics

Square Roots of Hermitian Matrices and a Rational Algorithm for Checking Their Congruence Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
Kh. D. IkramovA finite computational process using only arithmetical operations is called a rational algorithm. Presently, there is no known rational algorithm for checking congruence between arbitrary complex matrices A and B. The situation may be different if A and B belong to a special matrix class. For instance, there exist rational algorithms for the cases where both matrices are Hermitian, unitary, or accretive

Asymptotically Optimum Arrangements for a Special Class of Normed Spaces Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
T. V. ZakharovaA nonclassical queuingtheory problem with calls arising in a space is considered. Stations must be placed to minimize the service time for arising calls. The service time is an increasing function that depends on the distance between a call and a station. The time spent to overcome the same distance frequently depends on the direction of motion. In this case, a metric that considers the nonequivalence

Tests Concerning Certain Types of Faults at the Scheme Inputs Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
V. K. KurbatskaiaEstimates are obtained for the Shannon function of the length of a diagnostic test with respect to cyclic shifts of scheme inputs, and for the Shannon function of fault detection and length of a diagnostic test with respect to a single stuckat fault and a cyclic shift of scheme inputs.

Algorithm of the Method of Generalized Potentials for Problems of the Optimum Synthesis of Communication Networks with Undefined Factors Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
O. A. KosorukovThe optimum allocation of resources for a Gale problem of supply and demand with uncertain factors is considered. The DantzigWolfe decomposition and the generalized potential method developed earlier by the author for a deterministic version of the problem are used to construct and validate the algorithm for a numerical solution.

Central Limit Theorem for a Wavelet Estimator of a Probability Density with a Given Weight Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
O. V. ShestakovThe problem of estimating a probability density with a given weight is considered. Probability densities of this type arise in different cases, e.g., analyzing order statistics and studying randomsize samples in problems of reliability theory, insurance, and other areas. When constructing an estimator, expansion is used with respect to a wavelet basis based on wavelet functions with bounded spectrum

Stabilized Hard Thresholding of WaveletVaguelette Decomposition Coefficients in Reconstructing Tomographic Images Using Projections with Correlated Noise Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
O. V. ShestakovA way of reconstructing tomographic images based on waveletvaguelette decomposition is considered for a model with correlated additive noise. The asymptotic properties of an unbiased estimator are studied for the meansquare risk with stabilized hard thresholding of the coefficients of decomposition. It is shown that under certain conditions, this estimator is strongly consistent and asymptotically

Eliminating Inequalities in Register Machines with Counters Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
I. V. SavitskiiIt is proved that in programs of register machines with counters, only the equalto/notequalto relations between registers and counters are essential without loss of computational capabilities.

Equational Closure and Closure with Respect to Enumeration on a Set of Partial Multivalued Logic Functions Moscow Univ. Comput. Math. Cybern. Pub Date : 20190831
S. S. Marchenkov, V. A. ProstovIt is proven that for any k ⩾ 2, operators of equational closure and closure with respect to enumeration (Πoperator) generate one and the same classification on set Pk* of partial kvalued logic functions. Thirteen IIprecomplete classes are identified in class P3*.

Calculating the Index of Volatility in Inhomogeneous Levy Models Moscow Univ. Comput. Math. Cybern. Pub Date : 20190611
A. S. Kuvaev, L. V. NazarovThe problem of calculating an analog of volatility index (VIX) in exponential Levy models is considered. To obtain the relation for the original index, an assumption is made about the market diffusion model. Unlike Levy models, diffusion models are not able to describe sharp changes of asset prices and offer a poorer calibration flexibility. Relations for calculating an analog of VIX for the exponential

Error Estimate for the Displacement Method Moscow Univ. Comput. Math. Cybern. Pub Date : 20190611
V. A. Goloveshkin, S. Yu. Solov’evThe problem of constructing an explicit formula for a majorant of a number sequence specified by recurrence relations is considered. Problems of this kind arise when estimating the error of recursive methods for calculating certain functions of a real variable. A special approach to studying the given recurrence relations is proposed in this work, based on which it is established that a majorant can

A Confidence Tube of the Mean Value of Multiple Observations in Multivariate Linear Normal Multiregression Moscow Univ. Comput. Math. Cybern. Pub Date : 20190611
A. G. BelovThe problem of constructing a confidence tube of the mean value of multiple responses in a multivariate linear normal multiregression model is considered. To solve it, confidence multivariate ellipsoidal limits of the mean value of multiple responses are obtained. In the case of a simple bivariate regression model, confidence tubes are numerically modelled and analyzed by comparing them for the mean

Convergence of Grid BoundaryValue Problems for Functions Defined on Grid Cells and Faces Moscow Univ. Comput. Math. Cybern. Pub Date : 20190611
N. V. Ardelyan, K. V. KosmachevskiiFor stationary diffusiontype equations, we study the convergence of grid inhomogeneous boundaryvalue problems of a version of the mimetic finite difference (MFD) technique in which grid scalars are defined inside grid cells and grid vectors are specified by their local normal coordinates on the plane faces of grid cells. Grid equations and boundary conditions are formulated in operator form using

Coloring of Pseudocubic Graphs in Three Colors Moscow Univ. Comput. Math. Cybern. Pub Date : 20190611
S. N. Selezneva, M. V. Mel’nik, A. V. AstakhovaA graph is called pseudocubic if the degrees of all its vertices, with a single exception, do not exceed three, and the degree of an exceptional vertex does not exceed four. In this work, it is proved that the vertices of a pseudocubic graph without induced subgraphs that are isomorphic to K4 or K −4 can be colored in three colors. In addition, it is shown that the problem of 3coloring of pseudocubic

FPTAlgorithm for Computing the Width of a Simplex Given by a Convex Hull Moscow Univ. Comput. Math. Cybern. Pub Date : 20190502
S. I. Veselov, D. V. Gribanov, D. S. MalyshevThe problem of computing the width of simplices generated by the convex hull of their integer vertices is considered. An FPT algorithm, in which the parameter is the maximum absolute value of the rank minors of the matrix consisting from the simplex vertices, is presented.

Applying a Generalized Allocation Scheme to Analyzing a Class of Sequences Generated by a Shift Register Moscow Univ. Comput. Math. Cybern. Pub Date : 20190502
A. V. Kolchin, B. F. Bezrodnyy, M. A. LeevaAn example of applying a generalized allocation scheme to studying the asymptotic behavior of combinatorial objects is considered. The allocation of tuples of zeros and ones onto a circle generated by a shift register under certain conditions is analyzed.

Adjacent Vertices Can be Hard to Find by Quantum Walks Moscow Univ. Comput. Math. Cybern. Pub Date : 20190502
N. Nahimovs, R. A. M. Santos, K. R. KhadievQuantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search