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

Ivannikov Ispras Open Conference (ISPras)

作者： Aksenova, Elena Lazarev, Nikita Badalyan, David Borisenko, Oleg Pastukhov, Roman RAS Ivannikov Inst Syst Programming Moscow Russia Plekhanov Russian Univ Econ Ivannikov Inst Syst Programming RAS Moscow Russia

ISBN: (纸本)9781665412919

Big data storing and processing require specialized distributed services and significant amounts of computing resources. Cloud environments allow one to deploy virtual clusters with the requested characteristics and install the necessary services, but manual configuration is too laborious and inefficient. To use IaaS clouds one should be a highly knowledgeable in the field of system administration. This article presents a Michman tool, which allows on-demand deployment of clusters with a set of services in the cloud IaaS, stores information about deployed systems and provides management of their life cycle. The tool is implemented as a service with a system of user groups, REST API carries access to the system.

关键词： cloud computing orchestration IaaS PaaS virtualization distributed systems Ansible Go

来源：评论

学校读者我要写书评

暂无评论

PuzzleMesh: A Puzzle Model to Build Mesh of Agnostic Services for Edge-Fog-Cloud

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2023年第2期16卷 1334-1345页

作者： Sanchez-Gallegos, Dante D. D. Gonzalez-Compean, J. L. Carretero, Jesus Marin-Castro, Heidy M. M. Tchernykh, Andrei Montella, Raffaele Cinvestav Tamaulipas Ciudad Victoria 87130 Tamaulipas Mexico Univ Carlos III Madrid Madrid 28903 Spain Univ Autonoma Tamaulipas Catedras CONACYT Ciudad Victoria Tamaulipas Mexico CICESE Res Ctr Ensenada Mexico RAS Moscow Ivannikov Inst Syst Programming Moscow 119991 Russia South Ural State Univ Chelyabinsk 454080 Russia Univ Naples Parthenope Dept Sci & Technol I-80133 Naples NA Italy

This paper presents the design, development, and evaluation of PuzzleMesh, an agnostic service mesh composition model to process large volumes of data in edge-fog-cloud environments. This model is based on a puzzle metaphor where pieces, puzzles, and metapuzzles represent self-contained autonomous and reusable software artifacts encapsulated into containers and published as microservices. A piece represents the integration of apps with I/O interfaces (loops/sockets), parallel processing, and management software. A puzzle represents a processing structure (e.g., workflows) built coupling pieces through loops and sockets. Puzzles integrate structures with a microservice architecture, implicit continuous dataflows, and transparent data exchange management software. A metapuzzle represents a recursive assemble of puzzles. A mesh represents a pool of pieces, puzzles, and metapuzzles available for designers to choose artifacts to build services. A prototype developed using PuzzleMesh model was evaluated through case studies about the automatic construction of processing services for the acquisition, pre-processing, manufacturing, preserving, and visualizing of satellite imagery. A qualitative comparison revealed that PuzzleMesh provides a flexible way to build reusable and portable services and to improve the usability of the services. The case study also revealed that PuzzleMesh yielded better performance results than other state-of-the-art tools.

关键词： Terms-Agnostic services big data pipelines microservices architecture edge-fog-cloud services

来源：评论

学校读者我要写书评

暂无评论

Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling 36

Accelerated Primal-Dual Gradient Method for Smooth and Conve...

引用

36th Conference on Neural Information Processing systems (NeurIPS)

作者： Kovalev, Dmitry Gasnikov, Alexander Richtarik, Peter King Abdullah Univ Sci & Technol Thuwal Saudi Arabia Moscow Inst Phys & Technol Dolgoprudnyi Russia RAS Res Ctr Trusted Artificial Intelligence Inst Syst Programming Moscow Russia Natl Res Univ Higher Sch Econ Moscow Russia

ISBN: (纸本)9781713871088

In this paper we study the convex-concave saddle-point problem min(x) max(y) f(x)+ y(T)Ax- g(y), where f(x) and g(y) are smooth and convex functions. We propose an Accelerated Primal-Dual Gradient Method (APDG) for solving this problem, achieving (i) an optimal linear convergence rate in the strongly-convex-stronglyconcave regime, matching the lower complexity bound (Zhang et al., 2021), and (ii) an accelerated linear convergence rate in the case when only one of the functions f(x) and g(y) is strongly convex or even none of them are. Finally, we obtain a linearly convergent algorithm for the general smooth and convex-concave saddle point problem min(x) max(y) F(x, y) without the requirement of strong convexity or strong concavity.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Transferring Natural Language Datasets Between Languages Using Large Language Models for Modern Decision Support and Sci-Tech Analytical systems

引用

BIG DATA AND COGNITIVE COMPUTING 2025年第5期9卷

作者： Popov, Dmitrii Terentev, Egor Serenko, Danil Sochenkov, Ilya Buyanov, Igor Russian Acad Sci FRC CSC RAS Fed Res Ctr Comp Sci & Control Moscow 119333 Russia RUDN Univ Fac Phys & Math & Nat Sci Moscow 117198 Russia Russian Acad Sci IITP RAS Inst Informat Transmiss Problems Moscow 127051 Russia Russian Acad Sci ISP RAS Ivannikov Inst Syst Programming Moscow 109004 Russia

The decision-making process to rule R&D relies on information related to current trends in particular research areas. In this work, we investigated how one can use large language models (LLMs) to transfer the dataset and its annotation from one language to another. This is crucial since sharing knowledge between different languages could boost certain underresourced directions in the target language, saving lots of effort in data annotation or quick prototyping. We experiment with English and Russian pairs, translating the DEFT (Definition Extraction from Texts) corpus. This corpus contains three layers of annotation dedicated to term-definition pair mining, which is a rare annotation type for Russian. The presence of such a dataset is beneficial for the natural language processing methods of trend analysis in science since the terms and definitions are the basic blocks of any scientific field. We provide a pipeline for the annotation transfer using LLMs. In the end, we train the BERT-based models on the translated dataset to establish a baseline.

关键词： large language model machine translation data transferring ChatGPT Llama DeepSeek Qwen DEFT

来源：评论

学校读者我要写书评

暂无评论

The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization 36

The First Optimal Algorithm for Smooth and Strongly-Convex-S...

引用

36th Conference on Neural Information Processing systems (NeurIPS)

作者： Kovalev, Dmitry Gasnikov, Alexander King Abdullah Univ Sci & Technol Thuwal Saudi Arabia Moscow Inst Phys & Technol Dolgoprudnyi Russia RAS Res Ctr Trusted Artificial Intelligence Inst Syst Programming Moscow Russia Natl Res Univ Higher Sch Econ Moscow Russia

ISBN: (纸本)9781713871088

In this paper, we revisit the smooth and strongly-convex-strongly-concave minimax optimization problem. Zhang et al. (2021) and Ibrahim et al. (2020) established the lower bound Omega(root kappa(x) kappa(y) log 1/epsilon) on the number of gradient evaluations required to find an epsilon-accurate solution, where kappa(x) and kappa(y) are condition numbers for the strong convexity and strong concavity assumptions. However, the existing state-of-the-art methods do not match this lower bound: algorithms of Lin et al. (2020) and Wang and Li (2020) have gradient evaluation complexity O(root kappa(x) kappa(y) log(3) 1/epsilon) and O(root kappa(x) kappa(y) log(3) (kappa(x) kappa(y)) log 1/epsilon), respectively. We fix this fundamental issue by providing the first algorithm with O(root kappa(x) kappa(y) log 1/epsilon) gradient evaluation complexity. We design our algorithm in three steps: (i) we reformulate the original problem as a minimization problem via the pointwise conjugate function;(ii) we apply a specific variant of the proximal point algorithm to the reformulated problem;(iii) we compute the proximal operator inexactly using the optimal algorithm for operator norm reduction in monotone inclusions.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Autonomous Swarm of Low-Cost Commercial Unmanned Aerial Vehicles for Surveillance

引用

programming AND COMPUTER SOFTWARE 2021年第8期47卷 558-577页

作者： Garate, B. Diaz, S. Iturriaga, S. Nesmachnow, S. Shepelev, V Tchernykh, A. Univ Republica Dept Montevideo Montevideo 11200 Uruguay South Ural State Univ Chelyabinsk 454080 Russia CICESE Zona Playitas Ensenada 22860 Baja California Mexico RAS Ivannikov Inst Syst Programming Moscow 109004 Russia

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comparison of Single-Velocity and Multi-Velocity Multiphase Models for Slope Flow Simulations

Comparison of Single-Velocity and Multi-Velocity Multiphase ...

引用

Ivannikov Ispras Open Conference (ISPras)

作者： Romanova, Daria Lomonosov Moscow State Univ Ivannikov Inst Syst Programming RAS Moscow Russia

ISBN: (纸本)9781665412919

This article compares two approaches for describing flow dynamics on mountain slopes: using a single-velocity multiphase model and a multi-velocity multiphase model. Simulation of experiments of a slushflow in a tank and interaction of the flow with a complex of protective structures using single-velocity and multi-velocity multiphase approaches is carried out. Comparison of numerical solutions with experimental data is made. Both approaches are applied to the calculation of an avalanche in the 22nd avalanche site of the Yukspor Mountain (Khibiny). The range of the avalanche run-out zone and the shape of the avalanche deposits were compared with field data obtained from the results of measuring the real avalanche in this cite. As a result of a numerical experiment, distributions of such parameters of the flow as flow rate, depth, density, viscosity, and bottom shear stress were obtained. The architecture of the nonNewtonianMultiphaseEulerFoam solver is being developed to describe the motion of a multiphase multi-velocity non-Newtonian medium.

关键词： OpenFOAM snow avalanche mudfllow interFoam multiphaseEulerFoam nonNewtonianMultiphaseEuler-Foam Yukspor Mountain (Khibiny) 22nd avalanche site non-Newtonian fluid multiphase flow

来源：评论

学校读者我要写书评

暂无评论

Q-Wadge degrees as free structures

引用

COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE 2020年第3-4期9卷 327-341页

作者： Selivanov, Victor RAS AP Ershov Inst Informat Syst SB Theoret Programming Lab Moscow Russia

A natural extension of theWadge hierarchy is obtained if we consider k-partitions (or evenQ-partitions for a countable better quasiorder Q) of the Baire space instead of sets (i.e., 2-partitions). Natural initial segments of the Q-Wadge hierarchy were recently characterised in terms of the so called h-quasiorder on suitably iterated Q-labeled countable well founded forests. Though these characterisations are natural and constructive, their definitions are rather long and technical. In this paper, we find clear shorter characterizations as (reducts of) a kind of free structures satisfying some natural axioms. Informally, we provide short and clear axiomatisations of the initial segments.

关键词： Wadge degree better quasiorder semilattice labeled forest free structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：