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

Ivannikov Memorial Workshop (IVMEM)

作者： Akopyan, M. S. Belyaeva, O. V. Plechov, T. P. Turdakov, D. Y. RAS Ivannikov Inst Syst Programming Moscow Russia

ISBN: (纸本)9781728146232

Text recognition problem has been studied many years. A few OCR engines exist, which successfully solve the problem for many languages. But these engines work well only with high quality scanned images. Social networks nowadays contain large number of images that need to analyze and recognize the text contained in them, but they have different quality: mixed text with images, poor quality images taken from camera of smartphone, etc. In this paper a text extraction pipeline is provided to address text extraction from various quality images collected form social media. Input images are categorized into different classes and then class specific preprocessing is applied to them (illumination improvement, text localization etc.). Then OCR engine used to recognize text. In the paper we present results of our experiments on dataset collected from social media.

关键词： text recognition social networks image processing deep neural networks

来源：评论

学校读者我要写书评

暂无评论

LR-GD-RNS: Enhanced Privacy-Preserving Logistic Regression Algorithms for Secure Deployment in Untrusted Environments 21

LR-GD-RNS: Enhanced Privacy-Preserving Logistic Regression A...

引用

21st IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGrid)

作者： Cortes-Mendoza, Jorge M. Radchenko, Gleb Tchernykh, Andrei Pulido-Gaytan, Bernardo Babenko, Mikhail Avetisyan, Arutyun Bouvry, Pascal Zomaya, Albert South Ural State Univ Chelyabinsk Russia CICESE Res Ctr Ensenada Baja California Mexico North Caucasus Fed Univ Stavropol Russia RAS Ivannikov Inst Syst Programming Moscow Russia Univ Luxembourg Esch Sur Alzette Luxembourg Univ Sydney Sydney NSW Australia

ISBN: (纸本)9781728195865

The protection of data processing is emerging as an essential aspect of data analytics, machine learning, delegation of computation, Internet of Things, medical and financial analysis, smart cities, genomics, non-disclosure searching, among others. Often, they use sensitive information that cannot be protected by traditional cryptosystems. Homomorphic Encryption (HE) schemes and secure Multi-Party Computation (MPC) are considered suitable solutions for privacy protection. In this paper, we propose and analyze the performance of three homomorphic Logistic Regression (LR) models with Gradient Descent (GD) algorithms based on the Residue Number system (RNS). We compare their performance with four traditional non-homomorphic versions, one homomorphic algorithm based on RNS with Batch GD, and two state-of-the-art homomorphic algorithms. To validate our approach, we consider six public datasets of different medicine domains (diabetes, cancer, drugs, etc.) and genomics. We use a 5-fold cross-validation technique for a fair comparison in terms of the solution quality and training time. The results show that propose homomorphic solutions have similar accuracy with non-homomorphic algorithms, increased classification performance, and decreased training time compared with the state-of-the-art HE algorithms.

关键词： logistic regression residue number system homomorphic encryption cloud security

来源：评论

学校读者我要写书评

暂无评论

ANALYZING ROBUSTNESS OF ANGLUIN'S L∗ ALGORITHM IN PRESENCE OF NOISE

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2024年第1期20卷 22:1-22:23页

作者： Ye, Lina Khmelnitsky, Igor Haddad, Serge Barbot, Benoit Bollig, Benedikt Leucker, Martin Neider, Daniel Roy, Rajarshi Univ Paris Saclay CNRS CentraleSupelec LMFENS Paris Saclay Gif Sur Yvette France Univ Paris Saclay CNRS LMF ENS Paris Saclay Gif Sur Yvette France Univ Paris Est Creteil Creteil France Univ Lubeck Inst Software Engn & Programming Languages Lubeck Germany TU Dortmund Univ Dortmund Germany Univ Alliance Ruhr Ctr Trustworthy Data Sci & Secur Dortmund Germany Max Planck Inst Software Syst Kaiserslautern Germany

Angluin's L & lowast;algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous random membership queries to get a high level confidence to the answer. Thus it can be applied to any kind of device and may be viewed as an algorithm for synthesizing an automaton abstracting the behavior of the device based on observations. Here we are interested on how Angluin's PAC learning algorithm behaves for devices which are obtained from a DFA by introducing some noise. More precisely we study whether Angluin's algorithm reduces the noise and produces a DFA closer to the original one than the noisy device. We propose several ways to introduce the noise: (1) the noisy device inverts the classification of words w.r.t. the DFA with a small probability, (2) the noisy device modifies with a small probability the letters of the word before asking its classification w.r.t. the DFA, (3) the noisy device combines the classification of a word w.r.t. the DFA and its classification w.r.t. a counter automaton, and (4) the noisy DFA is obtained by a random process from two DFA such that the language of the first one is included in the second one. Then when a word is accepted (resp. rejected) by the first (resp. second) one, it is also accepted (resp. rejected) and in the remaining cases, it is accepted with probability 0.5. Our main experimental contributions consist in showing that: (1) Angluin's algorithm behaves well whenever the noisy device is produced by a random process, (2) but poorly with a structured noise, and, that (3) is able to eliminate pathological behaviours specified in a regular way. Theoretically, we show that randomness almost surely yields systems with non-recursively enumerable languages.

关键词： Angluin's algorithm PAC learning noises randomness

来源：评论

学校读者我要写书评

暂无评论

Directed Fuzzing Based on Program Dynamic instrumentation

Directed Fuzzing Based on Program Dynamic Instrumentation

引用

International Conference on Engineering Technologies and Computer Science (EnT) - Innovation and Application

作者： Sargsyan, Sevak Kurmangaleev, Shamil Hakobyan, Jivan Mehrabyan, Matevos Asryan, Sergey Movsisyan, Hovhannes Yerevan State Univ Syst Programming Lab Yerevan Armenia RAS Compiler Technol Ivannikov Inst Syst Programming Moscow Russia

ISBN: (纸本)9781728119151

In this paper we present a new approach for directed fuzzing. It enables faster generation of the input data for the target program's specific instructions execution. Existing fuzzing tools randomly generate or mutate input data to increase code coverage. This approach is not effective for analysis of special code regions. The basic idea behind of this paper is to instrument target program in a such way that interesting code fragments were executed as soon as possible. For that propose we detect all the paths in the program which are connecting program's entry point to the considered instructions. Then we apply two type of instrumentations. In the first case we insert coverage collection instructions only in detected paths, which enables fuzzing tool to consider generated or mutated input data valuable if the distances between executed blocks and target points are reduced. In the second case we additionally insert 'exit(0)' instructions in those basic blocks from which target points are unreachable and their execution has no any influence. It allows repeatedly increase fuzzing speed.

关键词： directed fuzzing instrumentation static analysis path detection

来源：评论

学校读者我要写书评

暂无评论

Prediction of the Free Jet Noise Using Quasi-gas Dynamic Equations and Acoustic Analogy 20th

Prediction of the Free Jet Noise Using Quasi-gas Dynamic Equ...

引用

20th Annual International Conference on Computational Science (ICCS)

作者： Epikhin, Andrey Kraposhin, Matvey RAS Ivannikov Inst Syst Programming Moscow 109004 Russia Bauman Moscow State Tech Univ Moscow 105005 Russia RAS Keldysh Inst Appl Math Moscow 125047 Russia

ISBN: (纸本)9783030504366;9783030504359

The paper is focused on the numerical simulation of acoustic properties of the free jets from circle nozzle at low and moderate Reynolds numbers. The near-field of compressible jet flow is calculated using developed regularized (quasi-gas dynamic) algorithms solver QGDFoam. Acoustic noise is computed for jets with M = 0.9, Re = 3600 and M = 2.1, Re = 70000 parameters. The acoustic pressure in far field is predicted using the Ffowcs Williams and Hawkings analogy implemented in the libAcoustics library based on the OpenFOAM software package. The determined properties of the flow and acoustic fields are compared with experimental data. The flow structures are characterized by the development of the Kelvin-Helmholtz instability waves, which lead to energy outflux in the radial direction. Their further growth is accompanied by the formation of large and small-scale eddies leading to the generation of acoustic noise. The results showed that for selected jets the highest levels of generated noise is obtained at angles around 30 degrees which agrees well with experimental data.

关键词： Aeroacoustics Jet Noise Regularized equations OpenFOAM

来源：评论

学校读者我要写书评

暂无评论

GUEST EDITORIAL :Special Issue on Recent Trends in Advanced Computing, Engineering and Technology: Transformation and Innovation

引用

programming AND COMPUTER SOFTWARE 2022年第8期48卷 485-488页

作者： Tchernykh, Andrei Ramirez, Reyes Juarez Guarda, Teresa Portela, Filipe CICESE Res Ctr Carretera Tijuana Ensenada 3918 Ensenada 22860 BC Mexico RAS Moscow Ivannikov Inst Syst Programming Alexander Solzhenitsyn St 25 Moscow 109004 Russia South Ural State Univ Prospekt Lenina 76 Chelyabinsk 454080 Russia Univ Autonoma Baja California Calzada Univ 14418Parque Ind Int Tijuana Tijuana 22425 Baja California Mexico Univ Estatal Peninsula St Elena Ave principal Libertad St Elena 7047 Ecuador Univ Minho Campus Azurem P-4800058 Guimaraes Portugal

来源：评论

学校读者我要写书评

暂无评论

On the Possibility of Secure Program Obfuscation in Some Model of Cloud Computing

引用

programming AND COMPUTER SOFTWARE 2020年第7期46卷 473-482页

作者： Shokurov, A., V Abramova, I., V Varnovsky, N. P. Zakharov, V. A. Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia State Univ Moscow Inst Phys & Technol Dolgoprudnyi 141700 Moscow Region Russia Lomonosov Moscow State Univ Moscow 119991 Russia Natl Res Univ Higher Sch Econ Moscow 101978 Russia

In this paper, we study the possibility of using a certain cloud computing model supplied with cryptoservers to obfuscate software programs. Earlier, we proposed this cloud computing model in our study of some information security problems for multi-client distributed computing over encrypted data. Based on this model, we proposed a new approach involving the use of threshold homomorphic cryptosystems for program obfuscation. The main result of this paper is a new definition of the resistance of obfuscation of programs in the cloud computing model and a theorem proving the cryptographic strength of the proposed algorithm of obfuscation of programs under the assumption of the existence of cryptographically strong threshold homomorphic encryption systems. The paper is organized as follows. In the introducing section we discuss the main aspects of the information security problems for cloud computing systems. Section 2 provides a description of the obfuscation program objectives, as well as a brief overview of the main achievements in its study. The next section provides general information about homomorphic cryptosystems. Section 4 describes a more special class of homomorphic cryptosystems - threshold homomorphic encryption systems. Section 5 introduces the cloud computing model, which is used as a framework for our program obfuscation techniques. For this computing environment, in Section 6, the definition of the cryptographic strength of program obfuscation is formulated, a new method of program obfuscation using threshold homomorphic cryptosystems is described, and the cryptographic strength of the proposed obfuscation algorithm is proved.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Model of Pixel and Superpixel Clustering for Object Detection

引用

JOURNAL OF IMAGING 2022年第10期8卷 274-274页

作者： Nenashev, Vadim A. Khanykov, Igor G. Kharinov, Mikhail, V St Petersburg State Univ Aerosp Instrumentat Lab Intelligent Technol & Modelling Complex Syst Inst Comp Syst & Programming 67 B Morskaia St St Petersburg 190000 Russia Russian Acad Sci St Petersburg Fed Res Ctr Lab Big Data Technol Sociocyberphys Syst 14 Line VO 39 St Petersburg 199178 Russia

The paper presents a model of structured objects in a grayscale or color image, described by means of optimal piecewise constant image approximations, which are characterized by the minimum possible approximation errors for a given number of pixel clusters, where the approximation error means the total squared error. An ambiguous image is described as a non-hierarchical structure but is represented as an ordered superposition of object hierarchies, each containing at least one optimal approximation in g(0) = 1, 2,..., etc., colors. For the selected hierarchy of pixel clusters, the objects-of-interest are detected as the pixel clusters of optimal approximations, or as their parts, or unions. The paper develops the known idea in cluster analysis of the joint application of Ward's and K-means methods. At the same time, it is proposed to modernize each of these methods and supplement them with a third method of splitting/merging pixel clusters. This is useful for cluster analysis of big data described by a convex dependence of the optimal approximation error on the cluster number and also for adjustable object detection in digital image processing, using the optimal hierarchical pixel clustering, which is treated as an alternative to the modern informally defined "semantic" segmentation.

关键词： color image object detection pixel clustering piecewise constant approximations hierarchical sequence total squared error

来源：评论

学校读者我要写书评

暂无评论

Using Natural Version Redundancy of FPGA Projects in Area of Critical Applications 11

Using Natural Version Redundancy of FPGA Projects in Area of...

引用

IEEE 11th International Conference on Dependable systems, Services and Technologies (DESSERT) - IoT, Big Data and AI for a Safe & Secure World and Industry 4.0

作者： Drozd, Oleksandr Romankevich, Vitaliy Kuznietsov, Mykola Drozd, Myroslav Martynyuk, Oleksandr Odessa Natl Polytech Univ Dept Comp Intelligent Syst & Networks Odessa Ukraine Natl Tech Univ Ukraine Igor Sikorsky Kyiv Polytech Inst Syst Programming & Specialized Comp Syst Kiev Ukraine Odessa Natl Polytech Univ Odessa Dept Informat Syst Odessa Ukraine

ISBN: (纸本)9781728199573

The paper focuses on the role of version redundancy, which increases with the expansion of critical applications and the tightening of their functional safety requirements. International standards governing these requirements have already fixed the importance of version redundancy to counter common cause failures in safety-related systems. The problem of hidden faults inherent in these systems is equally acute, undermining confidence in the fault tolerance of circuit solutions important for functional safety. We suggest that this problem be seen as a growth problem where the system rises to the level of diversification in modes of operation by dividing them into normal and emergency and checkability circuits, but components continue to be stamped at a lower level of replication. Then the solution to the problem is to raise the components to the level of the system by developing their version redundancy. We demonstrate this development for FPGA components with LUT-oriented architecture and offer a method to improve the FPGA-ready project by natural version redundancy of its program code. The method generates a set of program code versions and selects versions that improve the checkability of circuits with respect to constant faults and the trustworthiness of results, respectively, in normal and emergency mode to reduce a set of hidden faults. The method is illustrated by an iterative array multiplier implemented in an FPGA project. Versions are generated, evaluated, and selected using the program developed for this.

来源：评论

学校读者我要写书评

暂无评论

Analysis of Program Patches Nature and Searching for Unpatched Code Fragments

Analysis of Program Patches Nature and Searching for Unpatch...

引用

Ivannikov Memorial Workshop (IVMEM)

作者： Arutunian, Mariam Aslanyan, Hayk Vardanyan, Vahagn Sirunyan, Vahagn Kurmangaleev, Shamil Gaissaryan, Sergey Russian Armenian Univ Russian Acad Sci Ivannikov Inst Syst Programming Yerevan Armenia Russian Acad Sci Ivannikov Inst Syst Programming Yerevan Armenia Lomonosov Moscow State Univ Yerevan Russian Acad Sci Ivannikov Inst Syst Programming Yerevan Armenia

ISBN: (纸本)9781728146232

Software developers often copy and paste code within a project. Due to the possible existence of defects in the initial code fragment, this can lead to defects propagation across the project. Software changes in new version (patches) usually contain bug fixes, which can be used for detecting similar defects in a project. The purpose of this work is to develop method for analyzing the nature of patches between versions of executables and finding unpatched code fragments. At first, two versions of executables are compared for finding common and changed parts of code. Then, the method determines patches that can possibly be fixes of bugs. The final step is detection of unpatched code fragments. It is based on finding all clones of the buggy code fragments found in previous step which are not patched in the new version of the program. These fragments possibly contain defects. Developed tool allows to analyze programs of several architectures (x86, x86-64, arm, mips, powerpc). The experimental results show that the average percentage of true positive rate on the CoreBench test suite is 73%.

关键词： code static analysis patch analysis code clones binarycode analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：