发布求助
文献互助 智能选刊 最新文献

Journal of Applied and Industrial Mathematics最新文献

筛选
英文 中文
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
{"title":"On Nonlocal Oscillations in 3D Models\u0000of Circular Gene Networks","authors":"A. V. Glubokikh,&nbsp;V. P. Golubyatnikov","doi":"10.1134/S1990478924020078","DOIUrl":"10.1134/S1990478924020078","url":null,"abstract":"<p> We construct three-dimensional dynamical systems with block-linear discontinuous\u0000right-hand side that simulate the simplest molecular oscillators. The phase portrait of each of\u0000these systems contains a unique equilibrium point and a cycle lying in the complement of the\u0000basin of attraction of this point. There are no other equilibrium points in these phase portraits.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"246 - 252"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186790","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
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,&nbsp;A. V. Abramov,&nbsp;A. A. Chupakhin,&nbsp;A. V. Turkin,&nbsp;Jiexing Gao,&nbsp;Chumin Sun,&nbsp;Li Zhou,&nbsp;Jie Sun","doi":"10.1134/S1990478924020029","DOIUrl":"10.1134/S1990478924020029","url":null,"abstract":"<p> 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</p>","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
On the Dual Gradient Descent Method for the ResourceAllocation Problem in Multiagent Systems 论多代理系统资源分配问题的双梯度下降法
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020133
D. B. Rokhlin
{"title":"On the Dual Gradient Descent Method for the Resource\u0000Allocation Problem in Multiagent Systems","authors":"D. B. Rokhlin","doi":"10.1134/S1990478924020133","DOIUrl":"10.1134/S1990478924020133","url":null,"abstract":"<p> We consider a sequence of block-separable convex programming problems describing the\u0000resource allocation in multiagent systems. We construct several iterative algorithms for setting the\u0000resource prices. Under various assumptions about the utility functions and resource constraints,\u0000we obtain estimates for the average deviation (regret) of the objective function from the optimal\u0000value and the constraint residuals. Here the average is understood as the expectation for\u0000independent identically distributed data and as the time average in the online optimization\u0000problem. The analysis of the problem is carried out by online optimization methods and duality\u0000theory. The algorithms considered use the information concerning the difference between the total\u0000demand and supply that is generated by agents’ reactions to prices and corresponds to the\u0000constraint residuals.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"316 - 332"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186795","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 the Complexity of the Problem of Choiceof Large Clusters 论大型集群选择问题的复杂性
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020121
A. V. Pyatkin
{"title":"On the Complexity of the Problem of Choice\u0000of Large Clusters","authors":"A. V. Pyatkin","doi":"10.1134/S1990478924020121","DOIUrl":"10.1134/S1990478924020121","url":null,"abstract":"<p> The paper considers the following problem. Given a set of Euclidean vectors, find several\u0000clusters with a restriction on the maximum scatter of each cluster so that the size of the minimum\u0000cluster would be maximum. Here the scatter is the sum of squared distances from the cluster\u0000elements to its centroid. The NP-hardness of this problem is proved in the case where the\u0000dimension of the space is part of the input.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"312 - 315"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186798","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
The Problem of Verifying the Market DemandTheory 验证市场需求理论的问题
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S199047892402008X
V. K. Gorbunov, A. G. Lvov
{"title":"The Problem of Verifying the Market Demand\u0000Theory","authors":"V. K. Gorbunov,&nbsp;A. G. Lvov","doi":"10.1134/S199047892402008X","DOIUrl":"10.1134/S199047892402008X","url":null,"abstract":"<p> The aim of this paper is to acquaint applied mathematicians interested in the possibilities\u0000of applying methods for solving inverse problems in mathematical modeling in natural sciences and\u0000engineering to economic problems with our papers in this field. These papers refer to the problem\u0000of verifying the market demand theory, developed by the first author based on the revision of the\u0000unrealistic axiomatic neoclassical theory of individual demand within the framework of general\u0000scientific methodology. At the same time, the artificial object of individual theory—a\u0000rational and independent individual who maximizes his/her utility function—was replaced\u0000by a “statistical ensemble of consumers” of the market under study, and the postulates of\u0000individual theory became scientific hypotheses of the new theory. The verification of this theory\u0000consists in elucidating the question of rationalizing the statistical market demand by the collective\u0000utility function. This problem refers to the inverse problems of mathematical theories of real\u0000phenomena, which are usually ill posed and have many solutions. The solution of such problems\u0000consists in their regularization with involvement of additional information about the desired\u0000solution. Our method for verifying the market demand theory is a development of the\u0000nonparametric Afriat–Varian demand analysis with using “economic indices” of market demand as\u0000additional information, which allows obtaining solutions with various substantive properties.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"253 - 270"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186793","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 Some Linear Two-Dimensional Volterra Integral Equations ofthe First Kind 论一些线性二维 Volterra 第一类积分方程
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020157
S. V. Solodusha
{"title":"On Some Linear Two-Dimensional Volterra Integral Equations of\u0000the First Kind","authors":"S. V. Solodusha","doi":"10.1134/S1990478924020157","DOIUrl":"10.1134/S1990478924020157","url":null,"abstract":"<p> The problem of identifying Volterra kernels is an important stage in the construction of\u0000integral models of nonlinear dynamical systems based on the tool of Volterra series. The paper\u0000considers a new class of two-dimensional integral equations that arise when recovering\u0000nonsymmetric kernels in a Volterra polynomial of the second degree, where\u0000<span>( x(t) )</span> is the input vector function of time. The strategy for choosing test signals\u0000used to solve this problem is based on applying piecewise linear functions (with a rising edge). An\u0000explicit inversion formula is constructed for the selected type of Volterra equations of the first kind\u0000with variable integration limits. The questions of existence and uniqueness of solutions of the\u0000corresponding equations in the class\u0000<span>( C_{[0,T]} )</span> are studied.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"344 - 351"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186797","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
Filtration of Two Immiscible Incompressible Fluidsin a Thin Poroelastic Layer 两个不相溶的不可压缩流体在一个薄薄的多孔弹性层中的过滤
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020066
P. V. Gilev, A. A. Papin
{"title":"Filtration of Two Immiscible Incompressible Fluids\u0000in a Thin Poroelastic Layer","authors":"P. V. Gilev,&nbsp;A. A. Papin","doi":"10.1134/S1990478924020066","DOIUrl":"10.1134/S1990478924020066","url":null,"abstract":"<p> The paper considers a mathematical model of the filtration of two immiscible\u0000incompressible fluids in deformable porous media. This model is a generalization of the\u0000Musket–Leverett model, in which porosity is a function of the space coordinates. The model under\u0000study is based on the equations of conservation of mass of liquids and porous skeleton, Darcy’s law\u0000for liquids, accounting for the motion of the porous skeleton, Laplace’s formula for capillary\u0000pressure, and a Maxwell-type rheological equation for porosity and the equilibrium condition of\u0000the “system as a whole.” In the thin layer approximation, the original problem is reduced to the\u0000successive determination of the porosity of the solid skeleton and its speed, and then the\u0000elliptic-parabolic system for the “reduced” pressure and saturation of the fluid phase is derived. In\u0000view of the degeneracy of equations on the solution, the solution is understood in a weak sense.\u0000The proofs of the results are carried out in four stages: regularization of the problem, proof of the\u0000maximum principle, construction of Galerkin approximations, and passage to the limit in terms of\u0000the regularization parameters based on the compensated compactness principle.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"234 - 245"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186832","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
Cooperative Games with Preferences: Applicationof the Weight Rule to Problems of Public Space in St. Petersburg 有偏好的合作博弈：权重规则在圣彼得堡公共空间问题中的应用
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020091
V. V. Gusev
{"title":"Cooperative Games with Preferences: Application\u0000of the Weight Rule to Problems of Public Space in St. Petersburg","authors":"V. V. Gusev","doi":"10.1134/S1990478924020091","DOIUrl":"10.1134/S1990478924020091","url":null,"abstract":"<p> The paper examines the problem of the distribution of public space. We use the methods\u0000of cooperative game theory to solve this problem. Players are districts, while the value of the\u0000characteristic function is the total number of people interested in a particular type of public space\u0000in the areas under consideration. The axioms that are characteristic of the problem of division are\u0000compiled. A special value of the cooperative game is derived that depends on the weights of the\u0000players. It is shown how to choose the weights by optimization methods.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"271 - 281"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186791","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
Enumeration of Even and Odd ChordDiagrams 偶数和奇数和弦图列举
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020042
D. B. Efimov
{"title":"Enumeration of Even and Odd Chord\u0000Diagrams","authors":"D. B. Efimov","doi":"10.1134/S1990478924020042","DOIUrl":"10.1134/S1990478924020042","url":null,"abstract":"<p> A general method for the enumeration of various classes of chord diagrams with even and\u0000odd numbers of chord intersections is considered. The method is based on the calculation of the\u0000Pfaffian and Hafnian of the constraint matrix characterizing a class of diagrams.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"216 - 226"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227653","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
Solvability Analysis of Problems of Determining ExternalInfluence of Combined Type in Processes Describedby Parabolic Equations 抛物线方程描述过程中确定组合型外部影响问题的可解决性分析
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2024-08-15 DOI: 10.1134/S1990478924020108
A. I. Kozhanov, G. V. Namsaraeva
{"title":"Solvability Analysis of Problems of Determining External\u0000Influence of Combined Type in Processes Described\u0000by Parabolic Equations","authors":"A. I. Kozhanov,&nbsp;G. V. Namsaraeva","doi":"10.1134/S1990478924020108","DOIUrl":"10.1134/S1990478924020108","url":null,"abstract":"<p> The aim of this paper is to study the solvability of inverse problems of determining,\u0000together with the solution of the heat equation, its right-hand side or an unknown external\u0000influence. The specific feature of the problems studied is that the unknown external influence is\u0000determined by two functions of which one depends only on the spatial variable and the other, only\u0000on the time variable.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"282 - 293"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224609","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信