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

Nobrainer: An Example-Driven Framework for C/C++ Code Transformations 1

12th International Andrei P. Ershov Informatics Conference, PSI 2019

作者： Savchenko, Valeriy Sorokin, Konstantin Pankratenko, Georgiy Markov, Sergey Spiridonov, Alexander Alexandrov, Ilia Volkov, Alexander Sun, Kwangwon Ivannikov Institute for System Programming of the Russian Academy of Sciences 25 Alexander Solzhenitsyn st. Moscow109004 Russia Lomonosov Moscow State University GSP-1 Leninskie Gory Moscow119991 Russia Samsung Electronics Samsung GEC 26 Sangil-ro 6-gil Gangdong-gu Seoul Korea Republic of

ISBN: (数字)9783030374877

ISBN: (纸本)9783030374860

Refactoring is a standard part of any modern development cycle. It helps to reduce technical debt and keep software projects healthy. However, in many cases refactoring requires that transformations are applied globally across multiple files. Applying them manually involves large amounts of monotonous work. Nevertheless, automatic tools are severely underused because users find them unreliable, difficult to adopt, and not customizable enough. This paper presents a new code transformation framework. It delivers an intuitive way to specify the expected outcome of a transformation applied within the whole project. The user provides simple C/C++ code snippets that serve as examples of what the code should look like before and after the transformation. Due to the absence of any additional abstractions (such as domain-specific languages), we believe this approach flattens the learning curve, making adoption easier. Besides using the source code of the provided snippets, the framework also operates at the AST level. This gives it a deeper understanding of the program, which allows it to validate the correctness of the transformation and match the exact cases required by the user. © Springer Nature Switzerland AG 2019.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

Efficient metaobject control using mediators 2nd

Efficient metaobject control using mediators

引用

Proceedings of the 1996 2nd International Andrei Ershov Memorial Conference on Perspectives of system Informatics

作者： Ivannikov, V. Zadorozhny, V. Kossmann, R. Novikov, B. Institute of System Programming Russian Academy of Sciences Bolshaya Kommunisticheskaya 25 Moscow 109004 Russian Federation Nortel Technologies Station C P.O. Box 3511 Ottawa K1Y 4H7 ON Canada University of St.-Petersburg St.-Petersburg Russian Federation

ISBN: (纸本)3540620648

In this paper we propose an approach to optimization of reflection which combines flexibility and efficiency while implementing metaobject-based systems. The main idea is to flatten nested metainterpreter layers using a particular kind of mediator objects, which provide object/metaobject connection. One of the most significant features of the approach is that it allows to carry out what we called metaupgrading of existing software systems in a systematic way, efficient and transparent for the application. The meta-upgrading approach based on Interface Object technology can be efficiently used for system integration and re-use of legacy software components. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Forecasting Global Monkeypox Infections Using LSTM: A Non-Stationary Time Series Analysis

Forecasting Global Monkeypox Infections Using LSTM: A Non-St...

引用

Electronic Engineering (ICEEM), International Conference on

作者： Omnia M. Osama Khder Alakkari Mostafa Abotaleb El-Sayed M. El-Kenawy Department of Communications and Electronics Delta Higher Institute of Engineering and Technology Mansoura Egypt Department of Statistics and Programming Faculty of Economics University of Tishreen Tartous Syria Department of System Programming South Ural State University Chelyabinsk Russia Department of Communications Delta Higher Institute Mansoura Egypt

This study leverages the capabilities of Long Short-Term Memory (LSTM) models in forecasting global Monkeypox infections, thereby demonstrating the significant potential of advanced machine learning techniques in epidemiological forecasting. Our LSTM model effectively navigates the challenges posed by non-stationary time-series data, a common issue in epidemiological studies. It successfully captures the underlying patterns in the data, producing reliable forecasts. The model’s performance was evaluated using several metrics, including RMSE, MSE, MAE, and R 2 , all of which pointed to its robust and satisfactory predictive capabilities. Our findings underscore the significant role LSTM models can play in informing the development of timely and effective disease control and prevention strategies. They thereby contribute to enhancing public health responses to emerging infectious diseases such as Monkeypox. However, despite the promising results, the study highlights the ongoing challenge of enhancing the interpretability of LSTM models, an area that warrants further research. As a future direction, efforts should focus on refining LSTM models to bolster their interpretability, ensuring their broader adoption and utility in public health practice.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Nesterov’s method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square

arXiv

引用

arXiv 2024年

作者： Chervonenkis, Boris Krasnov, Andrei Gasnikov, Alexander Lobanov, Aleksandr Moscow Institute of Physics and Technology Russia Institute for Information Transmission Problems RAS Moscow Russia Innopolis University Russia Skolkovo Institute of Science and Technology Russia The Institute for System Programming The Russian Academy of Sciences Russia

The challenges of black box optimization arise due to imprecise responses and limited output information. This article describes new results on optimizing multivariable functions using an Order Oracle, which provides access only to the order between function values and with some small errors. We obtained convergence rate estimates for the one-dimensional search method (golden ratio method) under the condition of oracle inaccuracy, as well as convergence results for the algorithm on a "square" (also with noise), which outperforms its alternatives. The results obtained are similar to those in problems with oracles providing significantly more information about the optimized function. Additionally, the practical application of the algorithm has been demonstrated in maximizing a preference function, where the parameters are the acidity and sweetness of the drink. This function is expected to be convex or at least quasi-convex. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Checking Robustness of Web Services based on Solving Automata Equations

Checking Robustness of Web Services based on Solving Automat...

引用

Annual Siberian Russian Workshop on Electron Devices and Materials (EDM)

作者： Anton Kolomeets Ekaterina Shirokova Maxim Gromov Nina Yevtushenko MainConcept-NLD LLC Tomsk Russia Tomsk State University Tomsk Russia Ivannikov Institute for System Programming of RAS Higher School of Economics Moscow Russia

In this paper, we consider checking the robustness of web services using the model of finite state automata and analyzing the solvability of an automaton equation over the concatenation operator. The paper contains the procedure for constructing the largest solution for a solvable automata equation, since a solution to the equation describes a malicious input. Experimental results have shown that this approach can be effective when checking the robustness of web services.

关键词： Analytical models Web services Conferences Automata Robustness Mathematical model Electron devices

来源：评论

学校读者我要写书评

暂无评论

Profile-based type reconstruction for decompilation

IEEE International Conference on Program Comprehension

引用

IEEE International Conference on Program Comprehension 2009年 263-267页

作者： Troshina, K. Chernov, A. Fokin, A. Institute for System Programming RAS 25 Alexander Solzhenitsyn st. Moscow 109004 Russia Moscow State University Computational Math. and Cybernetics Dept. Leninskie Gory Moscow Russia

ISBN: (纸本)9781424439973

Decompilation is reconstruction of a program in a highlevel language from a program in a low-level language. In most cases static decompilation is unable to completely reconstruct high-level data types due to loss of typing information during compilation. We present several profilebased techniques that help to recover high-level types. The techniques include pointer/integer determination by value profiling and composite type identification by heap profiling. © 2009 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks 21

Lower bounds and optimal algorithms for smooth and strongly ...

引用

Proceedings of the 35th International Conference on Neural Information Processing systems

作者： Dmitry Kovalev Elnur Gasanov Alexander Gasnikov Peter Richtárik King Abdullah University of Science and Technology Thuwal Saudi Arabia KAUST Moscow Institute of Physics and Technology Moscow Russia and Institute for System Programming of the Russian Academy of Sciences Research Center for Trusted

ISBN: (纸本)9781713845393

We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two fundamental problems for this task. First, we establish the first lower bounds on the number of decentralized communication rounds and the number of local computations required to find an ∈-accurate solution. Second, we design two optimal algorithms that attain these lower bounds: (i) a variant of the recently proposed algorithm ADOM (Kovalev et al., 2021) enhanced via a multi-consensus subroutine, which is optimal in the case when access to the dual gradients is assumed, and (ii) a novel algorithm, called ADOM+, which is optimal in the case when access to the primal gradients is assumed. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Test Program Generator MicroTESK for RISC-V

Test Program Generator MicroTESK for RISC-V

引用

International Workshop on Microprocessor Test and Verification (MTV)

作者： Mikhail Chupilko Alexander Kamkin Artem Kotsynyak Alexander Protsenko Sergey Smolov Andrei Tatarnikov Ivannikov Institute for System Programming of the Russian Academy of Sciences (ISP RAS) Lomonosov Moscow State University (MSU) National Research University - Higher School of Economics (HSE)

ISBN: (纸本)9781538692516

The paper presents a test program generator for functional verification of RISC-V microprocessors. The generator is implemented on the base of MicroTESK framework and consists of formal specifications of RISC-V ISA and ISA-independent core. The specifications describe instructions' syntax and semantics and can be easily modified to support more instructions (including custom extensions). The core implements techniques of instruction sequences composition and test data generation. Test programs are generated from test templates, describing the programs' structural and behavioral properties; among generation techniques, random, combinatorial, and constraint-based ones are supported.

关键词： Registers Microprocessors Object oriented modeling Generators Syntactics Standards Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Numerical Modeling of a Melt Flow by the Czochralski Method in the OpenFOAM Package Using a Quasi-Hydrodynamic Algorithm

引用

Mathematical Models and Computer Simulations 2023年第1-Sup期15卷 S131-S142页

作者： Kirushina, M.A. Elizarova, T.G. Epikhin, A.S. Keldysh Institute of Applied Mathematics Russian Academy of Sciences Moscow Russian Federation Ivannikov Institute for System Programming Russian Academy of Sciences Moscow Russian Federation

Abstract: The formulation of the problem, the numerical solution method, and description of the test calculation case for modeling a melt flow in the problem of crystal growth by the Czochralski (Chochralsky) method are presented. The mathematical model is based on regularized or quasi-hydrodynamic (QHD) equations to describe a viscous, incompressible heat-conducting fluid. The numerical algorithm is implemented on the OpenFOAM package within the mulesQHDFoam solver. The proposed approach allows calculations of an unsteady three-dimensional flow in a crucible with the given geometry for high Reynolds and Grashof numbers. As an example, the results for the flow in a simplified configuration are given. An asymmetric transient flow is obtained. © 2023, Pleiades Publishing, Ltd.

关键词： Czochralski method OpenFOAM package quasi-hydrodynamic algorithm viscous incompressible fluid

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of stochastic gradient descent with adaptive preconditioning for non-convex and convex functions

arXiv

引用

arXiv 2023年

作者： Pasechnyuk, Dmitrii A. Gasnikov, Alexander Takáč, Martin Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Moscow Institute of Physics and Technology Russia Kharkevich Institute for Information Transmission Problems RAS Russia Ivannikov Institute for System Programming RAS Russia

Preconditioning is a crucial operation in gradient-based numerical optimisation. It helps decrease the local condition number of a function by appropriately transforming its gradient. For a convex function, where the gradient can be computed exactly, the optimal linear transformation corresponds to the inverse of the Hessian operator, while the optimal convex transformation is the convex conjugate of the function. Different conditions result in variations of these dependencies. Practical algorithms often employ low-rank or stochastic approximations of the inverse Hessian matrix for preconditioning. However, theoretical guarantees for these algorithms typically lack a justification for the defining property of preconditioning. This paper presents a simple theoretical framework that demonstrates, given a smooth function and an available unbiased stochastic approximation of its gradient, that it is possible to refine the dependency of the convergence rate on the Lipschitz constant of the *** Codes 65K10 © 2023, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：