Journal of Applied and Industrial Mathematics最新文献_第8页

Application of Evolutionary Computations for Solving OptimalControl Problems with Terminal Constraints 演化计算在解决终端约束最优控制问题中的应用

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-12-01 DOI: 10.1134/S1990478924030025

E. V. Antipina, S. A. Mustafina, A. F. Antipin

引用次数: 0

The Structure of a Two-Layer Flow in a Channelwith Radial Heating of the Lower Substratefor Small Marangoni Numbers 小马兰戈尼数时下层基底径向加热通道中的双层流结构

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020017

V. K. Andreev, M. V. Efimova

引用次数: 0

Conservation Laws and Solutions of the First Boundary ValueProblem for the Equationsof Two- and Three-Dimensional Elasticity 二维和三维弹性方程的守恒定律和第一边界值问题的解决方案

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020145

S. I. Senashov, I. L. Savostyanova

{"title":"Conservation Laws and Solutions of the First Boundary Value\u0000Problem for the Equations\u0000of Two- and Three-Dimensional Elasticity","authors":"S. I. Senashov, I. L. Savostyanova","doi":"10.1134/S1990478924020145","DOIUrl":"10.1134/S1990478924020145","url":null,"abstract":" If a system of differential equations admits a continuous transformation group, then, in\u0000some cases, the system can be represented as a combination of two systems of differential\u0000equations. These systems, as a rule, are of smaller order than the original one. This information\u0000pertains to the linear equations of elasticity theory. The first system is automorphic and is\u0000characterized by the fact that all of its solutions are obtained from a single solution using\u0000transformations in this group. The second system is resolving, with its solutions passing into\u0000themselves under the group action. The resolving system carries basic information about the\u0000original system. The present paper studies the automorphic and resolving systems of two- and\u0000three-dimensional time-invariant elasticity equations, which are systems of first-order differential\u0000equations. We have constructed infinite series of conservation laws for the resolving systems and\u0000automorphic systems. There exist infinitely many such laws, since the systems of elasticity\u0000equations under consideration are linear. Infinite series of linear conservation laws with respect to\u0000the first derivatives are constructed in this article. It is these laws that permit solving the first\u0000boundary value problem for the equations of elasticity theory in the two- and three-dimensional\u0000cases. The solutions are constructed by quadratures, which are calculated along the boundary of\u0000the studied domains.\u0000","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"333 - 343"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Upper Bounds for the Eigenvalue Multiplicitiesof a Fourth-Order Differential Operator on a Graph 图上四阶微分算子特征值乘数的上界

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020169

A. A. Urtaeva

引用次数: 0

On the Complexity of the SequentialSampling Method 论顺序抽样法的复杂性

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020054

V. M. Fomichev

{"title":"On the Complexity of the Sequential\u0000Sampling Method","authors":"V. M. Fomichev","doi":"10.1134/S1990478924020054","DOIUrl":"10.1134/S1990478924020054","url":null,"abstract":" A system of\u0000( m ) Boolean equations can be solved by a sequential sampling method using an\u0000( m )-step algorithm, where at the\u0000( i )th step the values of all variables essential for the first\u0000( i ) equations are sampled and false solutions are rejected based on the\u0000right-hand sides of the equations,\u0000( i=1,dots ,m ). The estimate of the complexity of the method depends on the structure of\u0000the sets of essential variables of the equations and attains its minimum after some permutation of\u0000the system equations. For the optimal permutation of equations we propose an algorithm that\u0000minimizes the average computational complexity of the algorithm under natural probabilistic\u0000assumptions. In a number of cases, the construction of such a permutation is computationally\u0000difficult; in this connection, other permutations are proposed which are computed in a simpler way\u0000but may lead to nonoptimal estimates of the complexity of the method. The results imply\u0000conditions under which the sequential sampling method degenerates into the exhaustive search\u0000method. An example of constructing an optimal permutation is given.\u0000","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"227 - 233"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Additive Differentials for ARX Mappings with ProbabilityExceeding 1/4 概率超过 1/4 的 ARX 映射的加法差分

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S199047892402011X

A. S. Mokrousov, N. A. Kolomeec

{"title":"Additive Differentials for ARX Mappings with Probability\u0000Exceeding 1/4","authors":"A. S. Mokrousov, N. A. Kolomeec","doi":"10.1134/S199047892402011X","DOIUrl":"10.1134/S199047892402011X","url":null,"abstract":" We consider the additive differential probabilities of functions\u0000( x oplus y ) and\u0000( (x oplus y) lll r ), where\u0000( x, y in mathbb {Z}_2^n ) and\u0000( 1 leq r < n ). The probabilities are used for the differential cryptanalysis of ARX ciphers\u0000that operate only with addition modulo\u0000( 2^n ), bitwise XOR (\u0000( oplus )), and bit rotations (\u0000( lll r )). A complete characterization of differentials whose probability exceeds\u0000( 1/4 ) is obtained. All possible values of their probabilities are\u0000( 1/3 + 4^{2 - i} / 6 ) for\u0000( i in {1, dots , n} ). We describe differentials with each of these probabilities and calculate the\u0000number of these values. We also calculate the number of all considered differentials. It is\u0000( 48n - 68 ) for\u0000( x oplus y ) and\u0000( 24n - 30 ) for\u0000( (x oplus y) lll r ), where\u0000( n geq 2 ). We compare differentials of both mappings under the given constraint.\u0000","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"294 - 311"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Comparative Analysis of Algorithms for Estimating FishPopulation Dynamics 估算鱼类种群动态的算法比较分析

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020170

V. I. Zorkaltsev, A. S. Knyazev

{"title":"Comparative Analysis of Algorithms for Estimating Fish\u0000Population Dynamics","authors":"V. I. Zorkaltsev, A. S. Knyazev","doi":"10.1134/S1990478924020170","DOIUrl":"10.1134/S1990478924020170","url":null,"abstract":" The aim of the present work is to create a tool for comparing algorithms for estimating\u0000the dynamics of the abundance of individual fish species in Lake Baikal based on experimental\u0000catching. For each instance of a randomly selected fish, its age is determined using a special\u0000technology. From the obtained data on the numbers of fish of different ages in the sample, the\u0000parameters of the given laws of age distribution are estimated. This serves as a basis for the\u0000formation of ideas about the dynamics of mortality and changes in the abundance of fish of this\u0000species in previous years. Various algorithms can be used to estimate the parameters of\u0000distribution laws, sometimes leading to considerably different results.\u0000The discussed technique for comparing parameter estimation algorithms is based\u0000on multiple computational experiments using the Monte Carlo method to simulate random\u0000samples of fish. The proposed method analyzes several algorithms for estimating the parameters\u0000of a truncated exponential distribution law for different sample sizes. As an example, the problem\u0000of estimating the mortality dynamics of the Baikal oilfish (Comephorus), the major biomass fish of\u0000Lake Baikal, is considered.\u0000","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"361 - 370"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Stability of Vertex Covers in a Gamewith Finitely Many Steps 无限步博弈中顶点覆盖的稳定性

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020030

V. L. Beresnev, A. A. Melnikov, S. Yu. Utyupin

{"title":"Stability of Vertex Covers in a Game\u0000with Finitely Many Steps","authors":"V. L. Beresnev, A. A. Melnikov, S. Yu. Utyupin","doi":"10.1134/S1990478924020030","DOIUrl":"10.1134/S1990478924020030","url":null,"abstract":" The eternal vertex cover problem is a version of the graph vertex cover problem that can\u0000be represented as a dynamic game between two players (the Attacker and the Defender) with\u0000an infinite number of steps. At each step, there is an arrangement of guards over the vertices of\u0000the graph forming a vertex cover. When the Attacker attacks one of the graph’s edges, the\u0000Defender must move the guard along the attacked edge from one vertex to the other. In addition,\u0000the Defender can move any number of other guards from their current vertices to some adjacent\u0000ones to obtain a new vertex cover. The Attacker wins if the Defender cannot build a new vertex\u0000cover after the attack.\u0000In this paper, we propose a procedure that allows us to answer the question\u0000whether there exists a winning Defender strategy that permits protecting a given vertex cover for\u0000a given finite number of steps. To construct the Defender strategy, the problem is represented as\u0000a dynamic Stackelberg game in which at each step the interaction of the opposing sides is\u0000formalized as a two-level mathematical programming problem. The idea of the procedure is to\u0000recursively check the 1-stability of vertex covers obtained as a result of solving lower-level\u0000problems and to use some information about the covers already considered.\u0000","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"206 - 215"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On Nonlocal Oscillations in 3D Modelsof Circular Gene Networks 论环状基因网络三维模型中的非局部振荡

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020078

A. V. Glubokikh, V. P. Golubyatnikov

引用次数: 0

Ant Colony Algorithm for Single Processor Schedulingwith Minimization of Peak Resource Usage 最小化峰值资源使用的单处理器调度蚁群算法

IF 0.58

Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020029

V. V. Balashov, A. V. Abramov, A. A. Chupakhin, A. V. Turkin, Jiexing Gao, Chumin Sun, Li Zhou, Jie Sun

{"title":"Ant Colony Algorithm for Single Processor Scheduling\u0000with Minimization of Peak Resource Usage","authors":"V. V. Balashov, A. V. Abramov, A. A. Chupakhin, A. V. Turkin, Jiexing Gao, Chumin Sun, Li Zhou, Jie Sun","doi":"10.1134/S1990478924020029","DOIUrl":"10.1134/S1990478924020029","url":null,"abstract":" We consider the problem of constructing a single processor task schedule with\u0000minimization of peak resource usage. An example of the resource is the main memory of the target\u0000computer. Task set to be scheduled is represented as a directed acyclic graph every node of which\u0000is marked with the amount of resource used by the corresponding task. The resource allocated to\u0000a task is released on completion of the last (according to the schedule) immediate successor of this\u0000task in the graph. Correctness constraint on the schedule is the partial order specified by the task\u0000graph. Task duration values are not considered. The formal statement of the problem is provided.\u0000To solve the problem, we propose an ant colony algorithm modified so that the pheromone matrix\u0000reflects the desirability of pairwise order in the schedule for every pair of tasks, not only for pairs of\u0000adjacent tasks. During the schedule construction, for every task the algorithm chooses its position\u0000in the schedule, in contrast to existing ant colony scheduling algorithms that construct schedule in\u0000increasing order of positions (left-to-right) choosing a task for every next position. Experimental\u0000evaluation of the algorithm was conducted on two sets of task graphs. The first set contains\u0000graphs generated in such a way that the estimation for the optimum value of the goal function is\u0000known a priori. Graphs from the second set are “layered,” and their structure corresponds to the\u0000structure of multistage data processing applications. In both sets, the graphs are generated\u0000randomly with respect to specified generation parameters and constraints on the graph structure.\u0000The experiments indicate high precision and stability of the proposed ant colony algorithm.\u0000","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"192 - 205"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0