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

6th Conference on Actual Problems of systems and Software Engineering (APSSE)

作者： Burdonov, Igor Kossachev, Alexandr Yevtushenko, Nina Villa, Tiziano RAS Ivannikov Inst Syst Programming Software Engn Dept Moscow Russia Ivannikov Inst Syst Programming Software Engn Deparment Moscow Russia Univ Verona Comp Sci Dept Verona Italy

ISBN: (纸本)9781728160610

In this paper, we consider the synchronous composition of Finite State Machines (FSMs) that corresponds to instantaneous communication of hardware components. Such FSMs can be deterministic or nondeterministic, partial or complete. We first extend the existing synchronous composition operator from a pair of components to a collection of components with multiple input and output ports, and provide a procedure to compute the composition working directly on the collection of transition tables of the component FSMs. Then, based on the notion of input-output Moore pair (the output is not sensitive to the input), we prove the following sufficient condition: if the composition has the property that every cycle of ports has a component with a Moore pair, then the class of quasi-complete and quasi-deterministic FSMs is closed under the proposed synchronous composition.

关键词： Finite State Machine (FSM) quasi-deterministic FSM quasi-complete FSM Moore pair synchronous composition

来源：评论

学校读者我要写书评

暂无评论

Muddled Notes on the Fields of Controversy

VOPROSY FILOSOFII

引用

VOPROSY FILOSOFII 2019年第6期 27-33页

作者： Burdonov, Igor B. Russian Acad Sci ISP RAS Ivannikov Inst Syst Programming 25 Solzhenitsyna Str Moscow 109004 Russia

The author tried to look at the discussion through the eyes of a mathematician, given the fact that in the 20th century classical logic was largely formalized by means of mathematics. It is noted that the proposed "syllogism 1" is not formalized by its author, A.V. Smimov, the concepts used are not clearly defined, and therefore all attempts to formalize "syllogism 1" by opponents reduce this syllogism to the classic Barbara syllogism or judgment by analogy. The same is obtained from the author of this article based on the analysis of the expression "because and only because". In this regard, the question is raised about the relationship between philosophy, logic and mathematics, especially in connection with the crisis of the foundations of mathematics in the 20th century. Processuality in mathematics does not lead to a change in logic and its basic concepts and is reduced to sets and their elements, time itself is reduced to a natural series of numbers. And this is despite the fact that, from a philosophical point of view, it is processuality in the computer age that occupies an increasing place in mathematics through the concepts of algorithms and computability. Similarly, the connection between language and processuality is not so straightforward, as demonstrated by the Chinese language. As an example of the opposite irreducibility of processuality to substantiality, poetry is given, which by its very meaning is not amenable to formalization.

关键词： A.V. Smirnov syllogism mathematical logic formalization process algorithm discreteness

来源：评论

学校读者我要写书评

暂无评论

Toward digital twins' workload allocation on clouds with low-cost microservices streaming interaction

Toward digital twins' workload allocation on clouds with low...

引用

Ivannikov Ispras Open Conference (ISPras)

作者： Tchernykh, Andrei Facio-Medina, Adrian Pulido-Gaytan, Bernardo Rivera-Rodriguez, Raul Cortes-Mendoza, Jorge M. Radchenko, Gleb Babenko, Mikhail Chernykh, Igor Kulikov, Igor Nesmachnow, Sergio Ivannikov Inst Syst Programming Moscow Russia CICESE Res Ctr Ensenada Baja California Mexico South Ural State Univ Chelyabinsk Russia North Caucasus Fed Univ Stavropol Russia ICMMG SB RAS Novosibirsk Russia Univ Republica Montevideo Uruguay

ISBN: (纸本)9781665412919

A Digital Twin (DT) is a set of computational models representing real-time physical objects and processes in a digital world. The increasing adoption of this paradigm by the major industrial equipment vendors to simulate real-time working conditions and perform smart decision-making, established the Smart Factory Digital Twins architectures, where a set of DTs published as microservices interact with each other exchanging information by streaming technology. In this sense, a fundamental problem consists of selecting adequate computational resources to simulate the physical objects. In an Infrastructure as a Service (IaaS) cloud for DTs, the allocation focuses on distributing the jobs of the set into the virtual machine instances in a way that computational resources demand is satisfied and the cost is minimized In this paper, we propose a set of algorithms based on heuristics, metaheuristics, and Mixed Integer programming to find low-cost solutions. The performance of algorithms is evaluated using Amazon EC2 instances and DT jobs with randomly generated bandwidth, memory, and processor requirements. The experimental results show that the proposed approaches based on bin packing, genetic algorithms, partition, filtering, set coverage, and branch and bound strategies present a competitive performance in the workload allocation of the computational set of jobs of a DT into an IaaS cloud environment. Our allocation heuristic-based techniques allow considerable cost savings in medium and large periods concerning standard approaches such as local search.

关键词： instance Provisioning Digital Twin Smart Factory EC2 Mixed Integer programming Evolutionary Algorithms Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

Data Reliability and Redundancy Optimization of a Secure Multi-Cloud Storage Under Uncertainty of Errors and Falsifications 33

Data Reliability and Redundancy Optimization of a Secure Mul...

引用

33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Tchernykh, Andrei Babenko, Mikhail Kuchukov, Viktor Miranda-Lopez, Vanessa Avetisyan, Arutyun Rivera-Rodriguez, Raul Radchenko, Gleb CICESE Res Ctr Ensenada Baja California Mexico South Ural State Univ Chelyabinsk Russia Ivannikov Inst Syst Programming Moscow Russia North Caucasus Fed Univ Stavropol Russia RAS Ivannikov Inst Syst Programming Moscow Russia

ISBN: (纸本)9781538655559

Despite all the benefits a cloud data storages offer to customers, there is a high risk of breach of confidentiality, integrity, and availability related with the uncertainty of errors and falsifications, loss of information, denial of access for a long time, information leakage, conspiracy, and technical failures. In this article, we propose a configurable, reliable, and secure distributed data storage scheme with improved data redundancy, reliability, and encoding/decoding speed. Our system utilizes a Polynomial Residue Number system (PRNS) with a new method of error correction codes and secret sharing schemes. We introduce the concept of an approximate value of a rank (AR) of a polynomial. It reduces the computational complexity of the encoding/decoding and PRNS coefficients size. Based on the properties of the approximate value and PRNS, we introduce the AR-PRNS method for error detection, correction, and controlling computational results with capabilities of scalable parallel computing. We provide a theoretical basis to configure and optimize the redundancy of stored data and encoding/decoding speed to cope with different objective preferences, workloads, and storage properties. Theoretical analysis shows that, by appropriate selection of AR-PRNS parameters, the proposed scheme increases the safety, reliability, and reduces the overhead of data storage.

关键词： cloud storage reliability polynomial residue number system secret sharing scheme security uncertainty

来源：评论

学校读者我要写书评

暂无评论

Continuous Integration in Distributed Applied Software Packages 42

Continuous Integration in Distributed Applied Software Packa...

引用

42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

作者： Feoktistov, A. G. Gorsky, S. A. Sidorov, I. A. Tchernykh, A. RAS SB Matrosov Inst Syst Dynam & Control Theory Irkutsk Russia CICESE Res Ctr Dept Comp Sci Ensenada Baja California Mexico RAS Ivannikov Inst Syst Programming Moscow Russia South Ural State Univ Chelyabinsk Russia

ISBN: (纸本)9789532330984

The paper addresses a new approach to supporting the continuous integration of modules for distributed applied software packages (scientific applications) that are developed in the Orlando Tools framework. We consider the packages for implementing experiments in heterogeneous distributed computing environments that integrate Grid systems, cloud platforms, and resources of public access supercomputer centers. Such packages are characterized by the modular structure, intense change of algorithmic knowledge implemented by modules, computations scalability, and execution in heterogeneous resources. In the packages, computational processes are represented by problem-solving schemes that closely correlate with the workflow concept. The essence and novelty of the proposed approach come from the merge of a methodology creating the packages with the modern practice of software development based on continuous integration. We automate and unify module assembly processes on both the dedicated servers and package developer machines through using the specialized virtual machines. In contrast to the well-known tools, we support the synthesis of the test problem-solving schemes in the automated mode. The practical applications of the developed prototype of the continuous integration system show the significant reducing the time of debugging, testing, and deploying the package modules.

关键词： heterogeneous environment scientific applications modular approach continuous integration subject knowledge

来源：评论

学校读者我要写书评

暂无评论

Even Simple π-Calculus Processes Are Difficult to Analyze

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2019年第7期53卷 573-583页

作者： Abbas, M. M. Zakharov, V. A. Moscow MV Lomonosov State Univ Moscow 119991 Russia Natl Res Univ Univ Higher Sch Econ Moscow 101000 Russia RAS ISP Ivannikov Inst Syst Programming Moscow 109004 Russia

Mathematical models of distributed computations, based on calculus of mobile processes (pi-calculus) are widely used for checking information security properties of cryptographic protocols. Since calculus is a Turing-complete computation model, this problem is unsolvable in the general case. Therefore, its study is carried out only for some special classes of pi-calculus processes with restricted computational capabilities, for example, for nonrecursive processes with all runs limited in length, for processes with a limited number of parallel components, etc. However, even in these cases the proposed checking procedures are very time consuming. We assume that this is due to the very nature of the pi-calculus processes. The goal of this paper is to show that even for the weakest passive adversary model and for relatively simple protocols that make use of only basic pi-calculus operations, the checking of the information security properties of these protocols is a co-NP-complete problem.

关键词： pi-calculus protocol security passive adversary verification complexity NP-completeness

来源：评论

学校读者我要写书评

暂无评论

Guest Editorial: Special issue on Testing Software and systems

引用

SOFTWARE QUALITY JOURNAL 2019年第2期27卷 497-499页

作者： Yenigun, Husnu Yevtushenko, Nina Cavalli, Ana Rosa Sabanci Univ Istanbul Turkey RAS Ivannikov Inst Syst Programming Moscow Russia Natl Res Univ Higher Sch Econ HSE Moscow Russia Paris Saclay Univ Telecom SudParis CNRS SAMOVAR Paris France

来源：评论

学校读者我要写书评

暂无评论

EndoNuke: Nuclei Detection Dataset for Estrogen and Progesterone Stained IHC Endometrium Scans

引用

DATA 2022年第6期7卷

作者： Naumov, Anton Ushakov, Egor Ivanov, Andrey Midiber, Konstantin Khovanskaya, Tatyana Vishnyakova, Polina Nora, Sergei Mikhaleva, Liudmila Fatkhudinov, Timur Karpulevich, Evgeny Russian Acad Sci ISP RAS Ivannikov Inst Syst Programming Informat Syst Dept Moscow 109004 Russia AP Avtsyn Sci Res Inst Human Morphol Moscow 117418 Russia City Clin Hosp 31 Moscow Healthcare Dept Moscow 119415 Russia RUDN Univ Peoples Friendship Univ Russia Med Inst Moscow 117198 Russia Minist Healthcare Russian Federat Natl Med Res Ctr Obstet Gynecol & Perinatol Lab Regenerat Med Moscow 117997 Russia Yaroslav The Wise Novgorod State Univ Dept Microbiol Immunol & Infect Dis Veliky Novgorod 173003 Russia

We present EndoNuke, an open dataset consisting of tiles from endometrium immunohistochemistry slides with the nuclei annotated as keypoints. Several experts with various experience have annotated the dataset. Apart from gathering the data and creating the annotation, we have performed an agreement study and analyzed the distribution of nuclei staining intensity.

关键词： digital pathology endometrium nuclei detection dataset whole-slide imaging

来源：评论

学校读者我要写书评

暂无评论

OpenFOAM Solver Based on Regularized Hydrodynamic Equations for High Performance Computing

OpenFOAM Solver Based on Regularized Hydrodynamic Equations ...

引用

Ivannikov Memorial Workshop (IVMEM)

作者： Shatskiy, Maxim V. Ryazanov, Daniil A. Vatutin, Kirill A. Kalugin, Michael D. Sibgatullin, Ilias N. RAS Ivannikov Inst Syst Programming Moscow Russia Lomonosov Moscow State Univ Moscow Russia RAS Keldysh Inst Appl Math Moscow Russia Moscow Inst Phys & Technol Moscow Russia Russian Acad Sci Shirshov Inst Oceanol Moscow Russia

ISBN: (纸本)9781728146232

In the paper, we investigate scaling of parallel performance for an implementation of quasi-hydrodynamic (QHD) approach as an OpenFOAM solver. Time-dependent partial differential equations are discretized using Finite volume method (FVM). As a test hydrodynamical problem we take internal wave generation in a bounded tank of trapezoidal shape, and set of parameters, which allows internal wave attractors to evolve. Proper Orthogonal Decomposition was applied to analyze and compare 2D and full 3D simulations.

关键词： HPC Regularized Hydrodynamic Equations Oceanology Attractors of Internal Gravity Waves Stratified Fluid Finite Volume Method

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Configuration of a Secured Distributed Cloud Data Storage 6th

Multi-objective Configuration of a Secured Distributed Cloud...

引用

6th Latin American Conference on High Performance Computing (CARLA)

作者： Enrique Garcia-Hernandez, Luis Tchernykh, Andrei Miranda-Lopez, Vanessa Babenko, Mikhail Avetisyan, Arutyun Rivera-Rodriguez, Raul Radchenko, Gleb Jaime Barrios-Hernandez, Carlos Castro, Harold Drozdov, Alexander Yu CICESE Res Ctr Ensenada 22860 Baja California Mexico North Caucasus Fed Univ Stavropol 355009 Russia RAS Ivannikov Inst Syst Programming Moscow 109004 Russia South Ural State Univ Chelyabinsk 454080 Russia Univ Ind Santander Bucaramanga Colombia Univ Los Andes Bogota Colombia State Univ Moscow Inst Phys & Technol Moscow Russia

ISBN: (纸本)9783030410056;9783030410049

Cloud storage is one of the most popular models of cloud computing. It benefits from a shared set of configurable resources without limitations of local data storage infrastructures. However, it brings several cybersecurity issues. In this work, we address the methods of mitigating risks of confidentiality, integrity, availability, information leakage associated with the information loss/change, technical failures, and denial of access. We rely on a configurable secret sharing scheme and error correction codes based on the Redundant Residue Number system (RRNS). To dynamically configure RRNS parameters to cope with different objective preferences, workloads, and cloud properties, we take into account several conflicting objectives: probability of information loss/change, extraction time, and data redundancy. We propose an approach based on a genetic algorithm that is effective for multi-objective optimization. We implement NSGA-II, SPEA2, and MOCell, using the JMetal 5.6 framework. We provide their experimental analysis using eleven real data cloud storage providers. We show that MOCell algorithm demonstrates best results obtaining a better Pareto optimal front approximation and quality indicators such as inverted generational distance, additive epsilon indicator, and hypervolume. We conclude that multi-objective genetic algorithms could be efficiently used for storage optimization and adaptation in a non-stationary multi-cloud environment.

关键词： Cloud storage Multi-objective optimization Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：