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

Adaptive Variant of the Frank-Wolfe Algorithm for Convex Optimization Problems

programming AND COMPUTER SOFTWARE 2023年第6期49卷 493-504页

作者： Aivazian, G. V. Stonyakin, F. S. Pasechnyk, D. A. Alkousa, M. S. Raigorodsky, A. M. Baran, I. V. Moscow Inst Phys & Technol Inst Per 9 Dolgoprudnyi 141701 Russia Vernadsky Crimean Fed Univ Pr Akad Vernadskogo 4 Simferopol 295007 Russia Russian Acad Sci Ivannikov Inst Syst Programming Trusted Artificial Intelligence Res Ctr Ul Solzhenitsyna 25 Moscow 109004 Russia Natl Res Univ Higher Sch Econ Ul Myasnitskaya 20 Moscow 101000 Russia Moscow MV Lomonosov State Univ Fac Mech & Math Moscow 119991 Russia Adyghe State Univ Caucasian Math Ctr Ul Pervomaiskaya 208 Maykop 385000 Russia

In this paper, we investigate a variant of the Frank-Wolfe method for convex optimization problems with the adaptive selection of the step parameter corresponding to information about the smoothness of the objective function (the Lipschitz constant of the gradient). Theoretical estimates of the quality of the approximate solution provided by the method using adaptively selected parameters L-k are presented. For a class of problems on a convex feasible set with a convex objective function, the guaranteed convergence rate of the proposed method is sublinear. A special subclass of these problems (an objective function with the gradient dominance condition) is considered and the convergence rate of the method using adaptively selected parameters L-k is estimated. An important feature of the result obtained is the elaboration of the case where it is possible to guarantee, after the completion of the iteration, at least double reduction in the residual of the function. At the same time, the use of adaptively selected parameters in theoretical estimates makes the method applicable to both smooth and non-smooth problems, provided that the iteration termination criterion is met. For smooth problems, it can be proved that the theoretical estimates of the method are reliably optimal up to multiplication by a constant factor. Computational experiments are carried out and a comparison with two other algorithms is made to demonstrate the efficiency of the algorithm on a number of both smooth and non-smooth problems.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Deriving Homing Sequences for Finite State Machines with Timed Guards

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2021年第7期55卷 738-750页

作者： Tvardovskii, A. S. Yevtushenko, N. V. Natl Res Tomsk State Univ Tomsk 634050 Russia Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia Natl Res Univ Higher Sch Econ Moscow 101000 Russia

State identification is a well-known problem in the theory of finite state machines (FSM). In this theory homing sequences (HS) allow to identify the current state of an FSM and are widely used for testing and verification of hardware and software systems. Sufficient and necessary conditions for the existence of preset and adaptive HS are established for various kinds of FSMs, such as partial and complete machines, deterministic and nondeterministic, and algorithms for deriving these sequences are proposed when such a sequence exists. Nowadays, time-related aspects must be considered when verifying and testing hardware and software, which is why FSM models are extended by clock variables. This work studies the problems of checking the existence and synthesis of preset and adaptive homing sequences for FSMs with timed guards and we show that the length estimates for these sequences coincide with the estimates for classical FSMs. A proposed approach is based on the FSM abstraction of a timed FSM, that is, on the description of this timed FSM by a corresponding FSM that preserves the properties of the timed FSM related to homing sequences.

关键词： finite state machine timed guards FSM abstraction homing sequence

来源：评论

学校读者我要写书评

暂无评论

On Implementation of Discontinuous Galerkin Scheme for Gas Dynamics Problems Using Open-Source Software

On Implementation of Discontinuous Galerkin Scheme for Gas D...

引用

Ivannikov Ispras Open Conference (ISPRAS)

作者： Korchagova, Victoria Russian Acad Sci Ivannikov Inst Syst Programming Moscow Russia

ISBN: (纸本)9781665412919

The paper is concerned to implementation of the Runge - Kutta Discontinuous Galerkin numerical scheme using open-source software. Many big finite element libraries have a branch for development of high-order methods, but a majority of solvers were implemented only for continuous problems. The application for modelling of compressible inviscid gas flows with strong discontinuities has been implemented based on the free finite element library MFEM. The verification results for three test cases (Shu - Osher problem, Mach 3 wind tunnel with a forward step, three-dimensional Sod-like explosion) is presented.

关键词： discontinuous Galerkin RKDG high-order methods gas dynamics MFEM polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Foreword to the Special Issue on Configurable systems

引用

EMPIRICAL SOFTWARE ENGINEERING 2021年第4期26卷 1-3页

作者： Duchien, Laurence Gruenbacher, Paul Thuem, Thomas Univ Lille CNRS UMR 9189 INRIACent LilleCRIStAL F-59000 Lille France Johannes Kepler Univ Linz Inst Software Syst Engn Linz Austria Univ Ulm Inst Software Engn & Programming Languages Ulm Germany

来源：评论

学校读者我要写书评

暂无评论

Formally verified complete quantifier instatiation strategy for the theory of bounded linear integer arithmetic

Formally verified complete quantifier instatiation strategy ...

引用

Ivannikov Ispras Open Conference (ISPRAS)

作者： Sadykov, Rafael Mandrykin, Mikhail RAS Software Engn Dept Ivannikov Inst Syst Programming Moscow Russia

ISBN: (纸本)9781665412919

The Isabelle/HOL proof assistant provides quite advanced and reliable support for discharging proof goals with external SMT solvers by reconstructing the resulting proof tree within the Isabelle/Pure inference kernel. In particular, currently Isabelle fully and efficiently supports proof reconstruction for the quantifier-free fragments of the theories of equality and uninterpreted functions (QF_UF) and linear integer arithmetic (QF_LIA). Yet there are a number of practically relevant theories that can be decided using relatively efficient algorithms, but are not supported either by the Isabelle proof reconstruction procedure or by the SMT solvers themselves. Meanwhile, if the decision procedure for an extended logical theory can be expressed as a complete quantifier instantiation strategy that reduces the given decision problem into the supported logical fragment (QF_UFLIA), the theory can be fully supported within the existing Isabelle/HOL infrastructure with relatively little additional effort. The goal of our work was to develop a fully formal completeness proof for an efficient quantifier instantiation strategy that translates a satisfiability problem in the logic of bounded linear integer arithmetic (we call it QF_BLIA) into the equisatisfiable problem in the logic of linear integer arithmetic and uninterpreted functions (QF_UFLIA). In this paper we first give the initial informal presentation of the proof, then discuss the most relevant issues of our resulting corresponding formal development of the completeness proof within Isabelle/HOL. The resulting formal proofs tightly follow the provided informal presentation, but at the same time they also contain quite significant amount of auxiliary developments that can potentially be generalized for other similar proof formalizations and automated using theory generation facilities of Isabelle/ML.

关键词： static verification quantifier instantiation SMT formulas SMT solvers decision procedures instantiation strategy

来源：评论

学校读者我要写书评

暂无评论

CPALockator: Thread-Modular Analysis with Projections (Competition Contribution) 27th

CPALockator: Thread-Modular Analysis with Projections (Compe...

引用

27th International Conference on Tools and Algorithms for Construction and Analysis of systems (TACAS)

作者： Andrianov, Pavel Mutilin, Vadim Khoroshilov, Alexey RAS Ivannikov Inst Syst Programming Moscow Russia Lomonosov Moscow State Univ Moscow Russia Moscow Inst Phys & Technol Moscow Russia Higher Sch Econ Moscow Russia

ISBN: (纸本)9783030720124;9783030720131

Our submission to SV-COMP'21 is based on the software verification framework CPAchecker and implements the extension to the thread-modular approach. It considers every thread separately, but in a special environment which models thread interactions. The environment is expressed by projections of normal transitions in each thread. A projection contains a description of possible effects over shared data and synchronization primitives, as well as conditions of its application. Adjusting the precision of the projections, one can find a balance between the speed and the precision of the whole analysis. Implementation on the top of the CPAchecker framework allows combining our approach with existing algorithms and analyses. Evaluation on the sv-benchmarks confirms the scalability and soundness of the approach.

关键词： Multithreading Projection Thread-modular approach

来源：评论

学校读者我要写书评

暂无评论

Visualization Component for the Aircraft Real-Time Operating system JetOS

引用

programming AND COMPUTER SOFTWARE 2020年第3期46卷 167-175页

作者： Barladian, B. Kh Shapiro, L. Z. Mallachiev, K. A. Khoroshilov, A., V Solodelov, Yu A. Voloboy, A. G. Galaktionov, V. A. Koverninskii, I., V Russian Acad Sci Keldysh Inst Appl Math Moscow 125047 Russia State Res Inst Aviat Syst Moscow 125167 Russia Russian Acad Sci Inst Syst Programming Moscow 109004 Russia

The creation of visualization component for onboard civil aviation systems is considered. The software used on board must comply with the internationally accepted safety standards. This imposes additional requirements for both the hardware used and the system development process. This paper is devoted to the use of multicore processors in avionics embedded systems for improving the performance of the software implementation of the OpenGL SC library. The ability to use multicore processors in safety critical systems is provided by the Russian-made real-time operating system JetOS. An implementation of multi-window rendering using the OpenGL SC library is also considered.

关键词： OpenGL SC embedded systems real-time operating system multicore computations rendering acceleration multi-windowing compositor

来源：评论

学校读者我要写书评

暂无评论

Explainable framework for Glaucoma diagnosis by image processing and convolutional neural network synergy: Analysis with doctor evaluation

引用

FUTURE GENERATION COMPUTER systEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2022年 129卷 152-169页

作者： Deperlioglu, Omer Kose, Utku Gupta, Deepak Khanna, Ashish Giampaolo, Fabio Fortino, Giancarlo Afyon Kocatepe Univ Vocat Sch Afyon Dept Sci Comp Programming Afyon Turkey Suleyman Demirel Univ Isparta Turkey Maharaja Agrasen Inst Technol Delhi India Maharaja Agrasen Inst Technol Dept Comp Sci & Engn Sect 22 Delhi India Univ Naples Federico II Math Naples Italy Univ Calabria Unical Dept Informat Modeling Elect & Syst Arcavacata Di Rende Italy

Glaucoma causes blindness in long-time untreated cases. So, its early diagnosis is very important. Moving from that, there have been lots of Deep Learning oriented studies to diagnose Glaucoma from color fundus images. However, it is important to know about how humans can trust to black-box level Deep Learning models in their decision makings. In this study, a hybrid solution with image processing and deep learning was supported with the Explainable Artificial Intelligence (XAI), to ensure a trustworthy decision-making for Glaucoma diagnosis. In detail, image processing employing both histogram equalization (HE) and contrast-limited adaptive HE (CLAHE) was used to enhance colored fundus image-data. For the diagnosis, the enhanced image-data was used by an explainable convolutional neural network (CNN). The XAI was achieved via Class Activation Mapping (CAM) allowing heat map-based explanations for the image analysis done by the CNN. The performance of the hybrid solution was tested with the Drishti-GS, ORIGA(-Light) and HRF retinal image datasets through a total of twenty attempts for classification. Considering the performance evaluation, the highest mean values were found with the ORIGA(-Light) dataset (with accuracy: 93.5%, sensitivity/recall: 97.7%, specificity: 92.6%, precision: 93.8%, F1-Score: 95.7%, and AUC: 95.1%). As the XAI contribution of this study was with also an analysis by humans, the CAM based XAI effect was evaluated by some doctors. The CAM based XAI showed the accuracy of 82.73%, which was acceptable among alternative XAI methods. Also, according to the manual diagnosis test done with the doctors, the detections by the CAM based XAI was not below 97% and the worst diagnosis detection was 90%. Eventually, the results for the XAI effect were positive as pointing that use of XAI for black-box deep learning improves trust level for doctors. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Glaucoma Convolutional neural network Explainable artificial intelligence Class activation mapping Image processing

来源：评论

学校读者我要写书评

暂无评论

Modified Error Detection and Localization in the Residue Number system

引用

programming AND COMPUTER SOFTWARE 2022年第8期48卷 598-605页

作者： Gladkov, A. Kuchukov, V. Babenko, M. Tchernykh, A. Berezhnoy, V. Drozdov, A. Yu. North Caucasus Fed Univ Stavropol 355029 Russia North Caucasus Fed Univ North Caucasus Ctr Math Res Stavropol 355029 Russia CICESE Res Ctr Carr Tijuana Ensenada 3918 Ensenada 22860 BC Mexico Russian Acad Sci Inst Syst Programming Moscow 109004 Russia South Ural State Univ Chelyabinsk 454080 Russia Moscow Inst Phys & Technol Dolgoprudnyi 141701 Moscow Oblast Russia

This article presents the design of the modified error detection and localization algorithm in the Residue Number system (RNS). Classical redundant RNS with one control modulus can detect one error but not localize it. Two control moduli are used to localize a single error. Presented algorithm can achieve an error correction with a single control modulus transmitted over a reliable communication channel. The proposed approach was veryfied using Verilog on ASIC in RTL and physical synthesis tool Cadence Genus Synthesis Solution. It significantly reduces the area of the hardware implementation increasing the packing density and more efficient use of silicon resource. It slightly increases the running time compared with the classical algorithm. Distributed data storage was developed to study efficiency of the proposed algorithm.

关键词： Error detection

来源：评论

学校读者我要写书评

暂无评论

Enhancing SNV identification in whole-genome sequencing data through the incorporation of known genetic variants into the minimap2 index

引用

BMC BIOINFORMATICS 2024年第1期25卷 238页

作者： Egor, Guguchkin Artem, Kasianov Maksim, Belenikin Gaukhar, Zobkova Ekaterina, Kosova Vsevolod, Makeev Evgeny, Karpulevich Ivannikov Inst Syst Programming Moscow Russia Inst Informat Transmiss Problems Moscow Russia Evogen LLC Moscow Russia Vavilov Inst Gen Genet Moscow Russia Ufa Sci Ctr Inst Biochem & Genet Ufa Russia Univ Manchester Canc Res UK Canc Biomarker Ctr Manchester M20 4BX England

MotivationAlignment of reads to a reference genome sequence is one of the key steps in the analysis of human whole-genome sequencing data obtained through Next-generation sequencing (NGS) technologies. The quality of the subsequent steps of the analysis, such as the results of clinical interpretation of genetic variants or the results of a genome-wide association study, depends on the correct identification of the position of the read as a result of its alignment. The amount of human NGS whole-genome sequencing data is constantly growing. There are a number of human genome sequencing projects worldwide that have resulted in the creation of large-scale databases of genetic variants of sequenced human genomes. Such information about known genetic variants can be used to improve the quality of alignment at the read alignment stage when analysing sequencing data obtained for a new individual, for example, by creating a genomic graph. While existing methods for aligning reads to a linear reference genome have high alignment speed, methods for aligning reads to a genomic graph have greater accuracy in variable regions of the genome. The development of a read alignment method that takes into account known genetic variants in the linear reference sequence index allows combining the advantages of both sets of *** this paper, we present the minimap2_index_modifier tool, which enables the construction of a modified index of a reference genome using known single nucleotide variants and insertions/deletions (indels) specific to a given human population. The use of the modified minimap2 index improves variant calling quality without modifying the bioinformatics pipeline and without significant additional computational overhead. Using the PrecisionFDA Truth Challenge V2 benchmark data (for HG002 short-read data aligned to the GRCh38 linear reference (GCA_000001405.15) with parameters k = 27 and w = 14) it was demonstrated that the number of false negative genetic var

关键词： Minimap2 Minimap2 index modification Read alignment Human pangenome HPRC NGS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：