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

International Conference on Advances in Databases, Knowledge, and Data Applications, DBKDA

作者： Kuznecov Sergey Kudryavcev Yury Institute of System Programming Russian Academy of Science Moscow Russia Faculty of Computational Mathematics and Cybernetics Moscow State University Moscow Russia

After many years of studies, efficient data cube computation remains an open field of research due to ever-growing amounts of data. One of the most efficient algorithms (quotient cubes) is based on the notion of cube cells closure, condensing groups of cells into equivalence classes, which allows to loss lessly decrease amount of data to be stored. Recently developed parallel computation framework Map-Reduce lead to a new wave of interest to large-scale algorithms for data analysis (and to so called cloud-computing paradigm). This paper is devoted to applying such approaches to data and computation intensive task of OLAP-cube computation. We show that there are two scales of Map-Reduce applicability (for local multicore or multiprocessor server and multi-server clusters), present cube construction and query processing algorithms used at the both levels. Experimental results demonstrate that algorithms are scalable.

关键词： Concurrent computing Clustering algorithms Lattices Multicore processing Aggregates Large-scale systems Partitioning algorithms Databases Mathematical programming Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of Composite Types for Decompilation

Reconstruction of Composite Types for Decompilation

引用

IEEE International Workshop on Source Code Analysis and Manipulation

作者： Katerina Troshina Yegor Derevenets Alexander Chernov Institute of System Programming Russian Academy of Science Moscow Russia Computational Mathematics and Cybernetics Dept Moscow State University Moscow Russia

Decompilation is reconstruction of a program in a high-level language from a program in a low-level language. This paper presents a method for automatic reconstruction of composite types (structures, arrays and combinations of them)in a high-level program during decompilation. Assembly code is obtained by disassembling a binary code or traces collected by a simulator. The proposed method is based on expressing memory access operations as pairs base offset, then building equivalence classes for the bases used in the program and accumulating offsets for each equivalence class. For Strictly conforming C programs our approach is substantiated by the C language semantics as defined in the international standard. However, experimental results have revealed that it is applicable for real-world programs also. Experimental results are obtained for a number of open-source programs as well as for traces collected from them. The method is an essential part of the tool for program decompilation TyDec being developed by the authors. Decompiler TyDec can be used as a standalone tool or as a plug-in for Interactive Trace Explorer TrEx being developed in institute for system programming, Russian Academy of Sciences.

关键词： Registers Assembly Indexes programming Algorithm design and analysis Arrays

来源：评论

学校读者我要写书评

暂无评论

Numeric Truncation Security Predicate

Numeric Truncation Security Predicate

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Timofey Mezhuev Ilay Kobrin Alexey Vishnyakov Daniil Kuts Ivannikov Institute for System Programming of the RAS Moscow Russia Lomonosov Moscow State University Moscow Russia Yandex Cloud Moscow Russia

Numeric truncation is a widely spread error in software written in languages with static data typing, such as C/C++ or Java. It occurs when the significant bits of the value with a bigger type size are truncated during value conversion to the smaller type. Utilizing one of the most powerful methods for path exploration and automated bug detection called dynamic symbolic execution (DSE), we propose the symbolic security predicate for numeric truncation error detection, developed on top of DSE tool Sydr. Firstly, we execute the program on the data, which does not lead to any errors. During program execution we update symbolic shadow stack and shadow registers to track symbolic sizes of the symbolic variables to avoid false positives. Then, if we meet the instruction, which truncates the symbolic variable, we build the security predicate, try to solve it with the SMT-solver and in case of success save new input file to reproduce the error. We tested our approach on Juliet Dynamic test suite for CWE-197 and achieved 100% accuracy. We approved the workability of our approach by detecting 12 new errors of numeric truncation in 5 different real-world open source projects within OSS-Sydr-Fuzz project. All of the errors were reported, most of the reports were equipped with appropriate fixes, successfully confirmed and applied by project maintainers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Optimization of Vehicle Routing with Environmental Penalty 10th

Multi-objective Optimization of Vehicle Routing with Environ...

引用

10th International Conference on Supercomputing, ISUM 2019

作者： Pulido-Gaytan, Luis Bernardo Tchernykh, Andrei Nesmachnow, Sergio Cristóbal-Salas, Alfredo Avetisyan, Arutyun Barrera, Harold Enrique Castro Hernandez, Carlos Jaime Barrios CICESE Research Center EnsenadaBC22860 Mexico Universidad de la República Montevideo Uruguay Universidad Veracruzana Veracruz Mexico Ivannikov Institute for System Programming of the RAS Moscow Russia University of Los Andes Bogotá Colombia Industrial University of Santander Bucaramanga Colombia

ISBN: (纸本)9783030380427

Cities host more than half of the population in only 2% of the earth’s surface and consume 75% of the resources extracted from the planet, this abrupt demographic growth in urban areas has worsened the level of pollution in the city, as well as the problems of road congestion. Therefore, smart cities propose the incorporation of technologies to optimize the use of existing infrastructure and thus, achieve a sustainable and inclusive city. In this context, we propose an optimization method based on a multi-objective cellular genetic algorithm to determine an adequate routing of vehicles that allows to diminish the environmental impact in highly concurred areas, while providing alternative routes that minimize the associated costs of moving from one place to another, this under the premise that not always the shortest path represents the best solution. The presented algorithm simultaneously minimizes three important objectives: the time, the amount of pollutants emitted and an environmental penalty, where the latter represents the implicit cost of moving through a certain segment of the map. That is, an approximate set of Pareto is obtained, which contains alternative routes that avoid traveling through areas with a high degree of pollution and that, in turn, minimize the time and quantity of emissions when traveling through a certain network of routes. Our experimental analysis based on several quality indicators, like Hypervolume and Spread, shows a competitive performance of the proposed approach in terms of convergence and diversity, this with respect to NSGA II and SPEA2, well-known multi-objective algorithms in the literature. © Springer Nature Switzerland AG 2019.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Logistic Regression as a Cloud Service Based on Residue Number system 6th

Privacy-Preserving Logistic Regression as a Cloud Service Ba...

引用

6th Russian Supercomputing Days, RuSCDays 2020

作者： Cortés-Mendoza, Jorge M. Tchernykh, Andrei Babenko, Mikhail Pulido-Gaytán, Luis Bernardo Radchenko, Gleb Leprevost, Franck Wang, Xinheng Avetisyan, Arutyun South Ural State University Chelyabinsk Russia CICESE Research Center EnsenadaBC Mexico Ivannikov Institute for System Programming Moscow Russia North-Caucasus Federal University Stavropol Russia University of Luxembourg Esch-sur-Alzette Luxembourg Xi’an Jiaotong-Liverpool University Suzhou China

ISBN: (纸本)9783030646158

The security of data storage, transmission, and processing is emerging as an important consideration in many data analytics techniques and technologies. For instance, in machine learning, the datasets could contain sensitive information that cannot be protected by traditional encryption approaches. Homomorphic encryption schemes and secure multi-party computation are considered as a solution for privacy protection. In this paper, we propose a homomorphic Logistic Regression based on Residue Number system (LR-RNS) that provides security, parallel processing, scalability, error detection, and correction. We verify it using six known datasets from medicine (diabetes, cancer, drugs, etc.) and genomics. We provide experimental analysis with 30 configurations for each dataset to compare the performance and quality of our solution with the state of the art algorithms. For a fair comparison, we use the same 5-fold cross-validation technique. The results show that LR-RNS demonstrates similar accuracy and performance of the classification algorithm at various thresholds settings but with the reduction of training time from 85.9% to 96.1%. © 2020, Springer Nature Switzerland AG.

关键词： Data Analytics

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Model for Predicting Failures in the Context of Autonomous Vehicles 7

Machine Learning Model for Predicting Failures in the Contex...

引用

7th International Conference on system Reliability and Safety, ICSRS 2023

作者： Krini, Abderrahim Ouertani, Aymen Börcsök, Habil. Josef Robert Bosch GmbH Engineering of Reliability and Quality Functional Safety Schwäbisch Gmünd Germany Institute of Functional Safety & Cyber Security Baden-Wuerttemberg Cooperative State University Lörrach Germany University of Kassel Computer Architecture und System Programming Kassel Germany

ISBN: (纸本)9798350306057

In general, failure data is obtained in the automotive industry during the warranty period. If these contain the expression of a service life characteristic for each failure, statements can be made about the reliability and availability of the systems. For this purpose, estimation methods are used to adapt empirical lifetime distributions to theoretical lifetime distributions. By means of the distribution characteristics, a prognosis of the reliability and availability to be expected is also possible beyond the observation time. In addition to the data basis to be investigated, which is available completely in test bench and experimental trials or re-censored in the field, various methods can be used for estimation. In the past, several methods have been used, such as the estimators according to Eckel [1], Kaplan-Meier [2] or the estimators according to Pauli [3]. In general, a field failure is subject to several stresses, which can be described by expressions of several lifetime characteristics. For this application case, which occurs in the automotive industry, the known estimation methods, [1]-[3], cannot be used. In this paper, the necessity of multidimensional estimation methods will be introduced first. Then, a new estimation method for multidimensional metrics is presented. In a further step, mathematical proof is given that the new method can provide realistic results. Finally, two example data sets from bench testing and field are presented. Furthermore, some recommendations for the use of the new method are concretized in this context. © 2023 IEEE.

关键词： Automotive industry

来源：评论

学校读者我要写书评

暂无评论

Simulation of viscoelastic flow past circular airfoil by using the modified LS-STAG immersed boundary method 10

Simulation of viscoelastic flow past circular airfoil by usi...

引用

10th All-Russian Conference on Irreversible Processes in Nature and Technology

作者： Puzikova, Valeria V. Applied Mathematics Department Bauman Moscow State Technical University 2-ya Baumanskaya st. 5 str. 1 Moscow105005 Russia Compiler Technology Department Ivannikov Institute for System Programming of the RAS Alexander Solzhenitsyn st. 25 Moscow109004 Russia

The LS-STAG immersed boundary cut-cell method modification for viscoelastic flow computations is presented. Rate type viscoelastic flow models (linear and quasilinear) are considered. Rate type viscoelastic flow models (linear and quasilinear) are considered. The obtained numerical method is implemented in the LS-STAG software package developed by the author. This software allows to simulate viscous incompressible flows by using the LS-STAG method and it modifications. The LS-STAG-discretization of extra-stress equations for viscoelastic Maxwell, Jeffreys, upper-convected Maxwell, Maxwell-A, Oldroyd-B, Oldroyd-A, Johnson Segalman fluids was developed. Formulae for differential types of convected time derivatives (Oldroyd, Cotter-Rivlin, Jaumann-Zaremba-Noll derivatives) the LS-STAG discretization was obtained. Normal non-newtonian stresses are computed at the centers of base LS-STAG mesh cells and shear non-newtonian stresses are computed at the cell corners. Time-stepping algorithm is based on the first order predictor-corrector scheme. To validate developed numerical method the test problem about viscoelastic Oldroyd-B flow past a circular airfoil was used. Computational experiments were carried out at Weissenberg number in the range from 0 to 4. The computed values of the drag coefficients and the wake length are in good agreement with the experimental data. © Published under licence by IOP Publishing Ltd.

关键词： Airfoils

来源：评论

学校读者我要写书评

暂无评论

Faster rendering of large pseudo-dynamic scenes using hierarchical dynamic lods 13

Faster rendering of large pseudo-dynamic scenes using hierar...

引用

13th International Conference on Interfaces and Human Computer Interaction 2019, IHCI 2019, 12th International Conference on Game and Entertainment Technologies 2019, GET 2019 and 13th International Conference on Computer Graphics, Visualization, Computer Vision and Image Processing 2019, CGVCVIP 2019

作者： Semenov, Vitaly Shutkin, Vasily Zolotov, Vladislav Ivannikov Institute for System Programming of the Russian Academy of Sciences 25 Alexander Solzhenitsyn st. Moscow109004 Russia 9 Institutskiy per. Dolgoprudny Moscow Region141701 Russia National Research University Higher School of Economics 20 Myasnitskaya Ulitsa Moscow101000 Russia

ISBN: (纸本)9789898533913

Rendering of large dynamic scenes with a convincing level of realism is a challenging problem of computer graphics. One of the promising approaches to rendering such scenes is a simplification of models and the use of multiresolution series of models with levels of detail (LOD) appropriate for the current view-dependent context. Nowadays, different simplification techniques, including hierarchical level of details (HLOD), have been proposed and widely applied. However, these techniques face dramatic difficulties when scenes undergo modifications. Known attempts of their adaptation for dynamic scenes have not resulted in significant progress. In the paper an alternative approach to rendering pseudo-dynamic scenes is presented. Such scenes have numerous industrial applications, in particular, visual spatial-temporal modeling of complex construction projects, city infrastructure programs, and machinery assembly production. A concept of hierarchical dynamic levels of details (HDLOD) is introduced and complementary methods for generation of HDLODs and their visualization are proposed. The results of computational experiments are also presented. © Copyright 2019 IADIS Press. All rights reserved.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for fixed-dimensional linear programming

引用

Parallel Algorithms and Applications 1995年第1期6卷 17-24页

作者： Kuzyurin, Nikolai N. Shabanov, Leonid V. Institute of System Programming Russian Academy of Science Moscow 109004 B. Communisticheskaja 25 Russian Federation

Simple parallel algorithm for fixed-dimensional Linear programming is developed. It provides a straight-forward implementation on MIMD architectures with high efficiency. The implementation on transputer arrays is described and numerical results of performance are presented. © 1995, Taylor & Francis Group, LLC. All rights reserved.

关键词： Linear programming MIMD architecture Transputer array

来源：评论

学校读者我要写书评

暂无评论

SELF-TRAINED MODEL FOR ECG COMPLEX DELINEATION

arXiv

引用

arXiv 2024年

作者： Avetisyan, Aram Khachaturov, Nikolas Asatryan, Ariana Tigranyan, Shahane Markin, Yury Institute for System Programming Russian Academy of Sciences Moscow Russia Moscow State University Yerevan Armenia Russian-Armenian University Yerevan Armenia

Electrocardiogram (ECG) delineation plays a crucial role in assisting cardiologists with accurate diagnoses. Prior research studies have explored various methods, including the application of deep learning techniques, to achieve precise delineation. However, existing approaches face limitations primarily related to dataset size and robustness. In this paper, we introduce a dataset for ECG delineation and propose a novel self-trained method aimed at leveraging a vast amount of unlabeled ECG data. Our approach involves the pseudolabeling of unlabeled data using a neural network trained on our dataset. Subsequently, we train the model on the newly labeled samples to enhance the quality of delineation. We conduct experiments demonstrating that our dataset is a valuable resource for training robust models and that our proposed self-trained method improves the prediction quality of ECG delineation. © 2024, CC BY-NC-SA.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：