检索结果-内蒙古大学图书馆

Development of a new solver for homogenous mixture based on regularized gas dynamic equation system

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS 2025年第1期97卷 1-19页

作者： Epikhin, Andrey But, Ivan RAS Ivannikov Inst Syst Programming Moscow Russia RAS Keldysh Inst Appl Math Moscow Ctr Fundamental & Appl Math Moscow Russia

The paper presents an improved approach for modeling multicomponent gas mixtures based on quasi-gasdynamic equations. The proposed numerical algorithm is implemented as a reactingQGDFoam solver based on the open-source OpenFOAM platform. The following problems have been considered for validation: the Riemann problems, the backward facing step problem, the interaction of a shock wave with a heavy and a light gas bubble, the unsteady underexpanded hydrogen jet flow in an air. The stability and convergence parameters of the proposed numerical algorithm are determined. The simulation results are found to be in agreement with analytical solutions and experimental data. The paper presents an improved approach for modelling multi-component gas mixtures based on quasi-gasdynamic equations. The proposed numerical algorithm is implemented as a reactingQGDFoam solver based on the open-source OpenFOAM platform. This solver has been extensively validated and verified through a variety of well-described test problems. The stability and convergence parameters of the proposed numerical algorithm are determined. The simulation results are found to be in agreement with analytical solutions and experimental data. image

关键词： compressible flows jets multicomponent gases OpenFOAM quasi-gas dynamic equations

来源：评论

学校读者我要写书评

暂无评论

Wave attractor in basin with underwater step: from discrete to continuous energy spectrum

引用

INDIAN JOURNAL OF PHYSICS 2025年 1-3页

作者： Elistratov, Stepan A. But, Ivan I. RAS Shirshov Inst Oceanol Moscow 117218 Russia RAS Ivannikov Inst Syst Programming Moscow 109004 Russia

Wave attractor, a phenomenon of internal/inertial wave self-focusing in a stratified/rotating fluid in non-trivial geometry, leads to the rapid turbulence development due to the energy accumulation on a limited area. It was believed until now that instability in a wave attractor should develop in the Triadic Resonance instability way. In this work it is shown that in a specific geometry, close to real water basins geometries, the instability behaviour can sufficiently differ from that observed in a trapezoid setup.

关键词： Wave attractor Internal wave instability CFD

来源：评论

学校读者我要写书评

暂无评论

Accurate code fragment clone detection and its application in identifying known CVE clones

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2025年第1期24卷 1-14页

作者： Arutunian, Mariam Sargsyan, Sevak Hovhannisyan, Hripsime Khroyan, Garnik Mkrtchyan, Albert Movsisyan, Hovhannes Avetisyan, Arutyun Aslanyan, Hayk Russian Armenian Univ Ctr Adv Software Technol Yerevan 0051 Armenia RAS Ivannikov Inst Syst Programming Moscow 109004 Russia

This article presents a novel method for detecting copied code fragments called clones, which is then utilized to identify known common vulnerabilities and exposures copies. The proposed method is versatile and applicable to both source and binary code. It overcomes the limitations of existing tools that typically focus on detecting entire function clones and specializing in either source or binary code, but not both. The method outputs all the detected clones by comparing the provided code fragment against the target project. It employs program dependence graphs-a data structure that unifies data and control dependencies for the function to achieve high accuracy. Experimental evaluations of real-world projects and benchmarks demonstrate the high precision of the proposed method. Furthermore, we successfully applied this method to detect clones of known common vulnerabilities and exposures in source code and uncovered vulnerabilities in actual software. The detected vulnerabilities were confirmed by the community, validating the effectiveness of the proposed method.

关键词： Fragment clone detection CVE clone detection Code static analysis Software security

来源：评论

学校读者我要写书评

暂无评论

Discrete cutting path problems: a general solution framework and industrial applications

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2025年第3期63卷 949-969页

作者： Khachai, Daniil Battaia, Olga Petunin, Alexander Khachay, Michael Kedge Business Sch 680 Cours Liberat Talence France Ural Fed Univ Ekaterinburg Russia NN Krasovskii Inst Math & Mech Ekaterinburg Russia RAS Ivannikov Inst Syst Programming Moscow Russia

The optimal tool routing for cutting machines, also known as cutting path optimisation is an important problem in production research. This problem is relevant in various manufacturing environments such as aeronautic, automotive, garment and semiconductor industries. In this paper, we introduce a general solution framework for the discrete Cutting Path Problem which includes: (i) the universal approach to reduce numerous settings of this problem to the appropriate auxiliary instances of the well-known Precedence Constrained Generalized Traveling Salesman Problem;(ii) the proposition of efficient solution methods for finding (sub-) optimal solutions. We carry out extensive computational experiments in order to evaluate performance of the proposed framework and the obtained results demonstrate its efficiency for real-life industrial instances.

关键词： Cutting path problem endpoint cutting problem precedence constrained generalised travelling salesman problem branch-and-cut algorithm adaptive large neighbourhood search industry innovation and infrastructure

来源：评论

学校读者我要写书评

暂无评论

Revisiting linear machine learning through the perspective of inverse problems

引用

JOURNAL OF INVERSE AND ILL-POSED PROBLEMS 2025年第2期33卷 281-303页

作者： Liu, Shuang Kabanikhin, Sergey Strijhak, Sergei Wang, Ying-Ao Zhang, Ye Russian Acad Sci Ivannikov Inst Syst Programming Moscow Russia Novosibirsk State Univ Novosibirsk Russia Russian Acad Sci Siberian Branch Sobolev Inst Math Novosibirsk Russia Beijing Inst Technol Sch Math & Stat Beijing 100081 Peoples R China Shenzhen MSU BIT Univ MSU BIT SMBU Joint Res Ctr Appl Math Shenzhen 518172 Peoples R China

In this paper, we revisit Linear Neural Networks (LNNs) with single-output neurons performing linear operations. The study focuses on constructing an optimal regularized weight matrix Q from training pairs { G , H } {\{G,H\}} , reformulating the LNNs framework as matrix equations, and addressing it as a linear inverse problem. The ill-posedness of linear machine learning problems is analyzed through the lens of inverse problems. Furthermore, classical and modern regularization techniques from both the machine learning and inverse problems communities are reviewed. The effectiveness of LNNs is demonstrated through a real-world application in blood test classification, highlighting their practical value in solving real-life problems.

关键词： Machine learning linear neural network linear inverse and ill-posed problems regularization

来源：评论

学校读者我要写书评

暂无评论

Optimal Approximation of Average Reward Markov Decision Processes

引用

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2025年第3期65卷 567-581页

作者： Sapronov, Y. F. Yudin, N. E. Moscow Inst Phys & Technol Dolgoprudnyi 141701 Russia Higher Sch Econ Univ Moscow 109028 Russia Innopolis Univ Innopolis 420500 Russia Russian Acad Sci Inst Informat Transmiss Problems Kharkevich Inst Moscow 127051 Russia Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia Russian Acad Sci Fed Res Ctr Informat & Control Moscow 119333 Russia

We continue to develop the concept of studying the epsilon-optimal policy for Average Reward Markov Decision Processes (AMDP) by reducing it to Discounted Markov Decision Processes (DMDP). Existing research often stipulates that the discount factor must not fall below a certain threshold. Typically, this threshold is close to one, and as is well-known, iterative methods used to find the optimal policy for DMDP become less effective as the discount factor approaches this value. Our work distinguishes itself from existing studies by allowing for inaccuracies in solving the empirical Bellman equation. Despite this, we have managed to maintain the sample complexity that aligns with the latest results. We have succeeded in separating the contributions from the inaccuracy of approximating the transition matrix and the residuals in solving the Bellman equation in the upper estimate so that our findings enable us to determine the total complexity of the epsilon-optimal policy analysis for DMDP across any method with a theoretical foundation in iterative complexity.

关键词： Markov decision processes reinforcement learning sample complexity iteration complexity ICOMP2024

来源：评论

学校读者我要写书评

暂无评论

Assessing the coverage of W-based conformance testing methods over code faults

引用

SCIENCE OF COMPUTER programming 2025年 241卷

作者： El-Fakih, Khaled Hassan, Faiz Alzaatreh, Ayman Yevtushenko, Nina Amer Univ Sharjah Dept Comp Sci & Engn Sharjah U Arab Emirates Amer Univ Sharjah Dept Math & Stat Sharjah U Arab Emirates RAS Ivannikov Inst Syst Programming Moscow Russia

We present novel empirical assessments of prominent finite state machine (FSM) conformance test derivation methods against their coverage of code faults. We consider a number of realistic extended FSM examples with their related Java implementations and derive for these examples complete test suites using the W method and its HSI and H derivatives considering the case when the implementation under test (IUT) has the same number of states as the specification FSM. We also consider W ++ , HSI ++ , and H ++ test suites derived considering the case when the IUT can have one more extra state. For each pair of considered test suites, we determine if there is a difference between the pair in covering the implementations faults. If the difference is significant, we determine which test suite outperforms the other. We run two other assessments which show that the obtained results are not due to the size or length of the test suites. In addition, we conduct assessments to determine whether each of the methods has better coverage of certain classes of faults than others and whether the W outperforms the HSI and H methods over only certain classes of faults. The results and outcomes of conducted experiments are summarized. Major artifacts used in the assessments are provided as benchmarks for further studies.

关键词： Conformance testing Model-based testing Extended finite state machines W, HSI and H methods Mutation testing Empirical evaluation Fault coverage

来源：评论

学校读者我要写书评

暂无评论

Distributed saddle point problems: lower bounds, near-optimal and robust algorithms

引用

OPTIMIZATION METHODS & SOFTWARE 2025年

作者： Beznosikov, Aleksandr Samokhin, Valentin Gasnikov, Alexander RAS Lab Federated Learning Problems Ivannikov Inst Syst Programming Moscow Russia Moscow Inst Phys & Technol BRAIn Lab Moscow Russia Russian Presidential Acad Natl Econ & Publ Adm Ctr Appl Artificial Intelligence Moscow Russia Innopolis Univ Artificial Intelligence Ctr Innopolis Russia Artificial Intelligence Res Inst AGI Med Lab Moscow Russia RAS Dept Data Anal Neurosci Inst Informat Transmiss Problems Moscow Russia RAS Ivannikov Inst Syst Programming Artificial Intelligence Ctr Moscow Russia Moscow Inst Phys & Technol Lab Math Methods Optimizat Moscow Russia

This paper focuses on the distributed optimization of stochastic saddle point problems. The first part of the paper is devoted to lower bounds for the centralized and decentralized distributed methods for smooth (strongly) convex-(strongly) concave saddle point problems, as well as the near-optimal algorithms by which these bounds are achieved. Next, we present a new federated algorithm for centralized distributed saddle-point problems - Extra Step Local SGD. The theoretical analysis of the new method is carried out for strongly convex-strongly concave and non-convex-non-concave problems. In the experimental part of the paper, we show the effectiveness of our method in practice. In particular, we train GANs in a distributed manner.

关键词： Distributed optimization saddle point problems lower and upper bounds local methods convex optimization stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Analysis of Correct Synchronization of Operating system Components

引用

programming AND COMPUTER SOFTWARE 2020年第8期46卷 712-730页

作者： Andrianov, P. S. RAS Ivannikov Inst Syst Programming Moscow Russia

Most of the software model checker tools do not scale well on complicated software. Our goal was to develop a tool, which provides an adjustable balance between precise and slow software model checkers and fast and imprecise static analyzers. The key idea of the approach is an abstraction over the precise thread interaction and analysis for each thread in a separate way, but together with a specific environment, which models effects of other threads. The environment contains a description of potential actions over the shared data and synchronization primitives, and conditions for its application. Adjusting the precision of the environment, one can achieve a required balance between speed and precision of the complete analysis. A formal description of the suggested approach was performed within a Configurable Program Analysis theory. It allows formulating assumptions and proving the soundness of the approach under the assumptions. For efficient data race detection we use a specific memory model, which allows to distinguish memory domains into the disjoint set of regions, which correspond to a data types. An implementation of the suggested approach into the CPAchecker framework allows reusing an existed approaches with minimal changes. Implementation of additional techniques according to the extended theory allows to increase the precision of the analysis. Results of the evaluation allow confirming scalability and practical usability of the approach.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A Formal Model for Detecting Bugs by Symbolic Execution of Programs

引用

programming AND COMPUTER SOFTWARE 2020年第8期46卷 731-736页

作者： Gerasimov, A. Yu. Kuts, D. O. Novikov, A. A. Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia

Automatic detection of bugs in programs is an extremely important direction of current research and development in the field of program reliability and security assurance. Earlier studies covered, methods for program analysis that combine the dynamic symbolic execution, randomized testing, and static analysis. In this paper, a formal model for detecting bugs using the symbolic execution of programs and its implementation for detecting the buffer bounds violation is presented. A formal model of the program symbolic execution is described, and a theorem on detecting a bug on the basis of the violation of the operation domain is formulated and proved. An implementation of the buffer bounds violation analyzer in the process of symbolic program execution is described, and the application of the implemented prototype for analyzing a set of programs in Debian Linux is presented. The experiments confirm the actionability of the proposed method.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：