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

IEEE Symposium on High-Performance Computer Architecture

作者： W. Shi J.B. Fryman G. Gu H.-H.S. Lee Y. Zhang J. Yang School of Electrical and Computer Engineering Georgia Tech College of Computing Georgia Institute of Technology Programming System Lab Corporate Technology Intel Corporation USA Department of Computer Science University of Pittsburgh USA Department of Computer Science and Engineering University of California Riverside USA

Cyber theft is a serious threat to Internet security. It is one of the major security concerns by both network service providers and Internet users. Though sensitive information can be encrypted when stored in non-volatile memory such as hard disks, for many e-commerce and network applications, sensitive information is often stored as plaintext in main memory. Documented and reported exploits facilitate an adversary stealing sensitive information from an application's memory. These exploits include illegitimate memory scan, information theft oriented buffer overflow, invalid pointer manipulation, integer overflow, password stealing Trojans and so forth. Today's computing system and its hardware cannot address these exploits effectively in a coherent way. This paper presents a unified and lightweight solution, called InfoShield that can strengthen application protection against theft of sensitive information such as passwords, encryption keys, and other private data with a minimal performance impact. Unlike prior whole memory encryption and information flow based efforts, InfoShield protects the usage of information. InfoShield ensures that sensitive data are used only as defined by application semantics, preventing misuse of information. Comparing with prior art, InfoShield handles a broader range of information theft scenarios in a unified framework with less overhead. Evaluation using popular network client-server applications shows that InfoShield is sound for practical use and incurs little performance loss because InfoShield only protects absolute, critical sensitive information. Based on the profiling results, only 0.3% of memory accesses and 0.2% of executed codes are affected by InfoShield.

关键词： Information security Protection Cryptography Computer security IP networks Web and internet services Nonvolatile memory Hard disks Buffer overflow Hardware

来源：评论

学校读者我要写书评

暂无评论

QUANTUM RANDOM WALKS AND QUANTUM OSCILLATOR IN AN INFINITE-DIMENSIONAL PHASE SPACE

arXiv

引用

arXiv 2024年

作者： Busovikov, Vladimir Pechen, Alexander Sakbaev, Vsevolod Department of Mathematical Methods for Quantum Technologies Steklov Mathematical Institute of Russian Academy of Sciences Gubkina Str. 8 Moscow Russia University of Science and Technology MISIS Leninskiy prosp. 4 Moscow Russia Ivannikov Institute for System Programming of RAS Alexander Solzhenitsyn Str. 25 Moscow Russia

We consider quantum random walks in an infinite-dimensional phase space constructed using Weyl representation of the coordinate and momentum operators in the space of functions on a Hilbert space which are square integrable with respect to a shift-invariant measure. We study unitary groups of shift operators in the phase space and averaging of such shifts by Gaussian vectors, which form semigroups of self-adjoint contractions: we find conditions for their strong continuity and establish properties of their generators. Significant differences in their properties allow us to show the absence of the Fourier transform as a unitary transformation that implements the unitary equivalence of these compressive semigroups. Next, we prove the Taylor formula for a certain special subset of smooth functions for shifting to a non-finite vector. It allows us to prove convergence of quantum random walks in the coordinate representation to the evolution of a diffusion process, as well as convergence of quantum random walks in both coordinate and momentum representations to the evolution semigroup of a quantum oscillator in an infinite-dimensional phase space. We find the special essential common domain of generators of semigroups arising in averaging of random shift operators both in position and momentum representations. The invariance of this common domain with respect to both semigroups allows to establish properties of a convex combination of both generators. That convex combination are Hamiltonians of infinite-dimensional quantum oscillators. Thus, we obtain that a Weyl representation of a random walk in an infinite dimensional phase space describes the semigroup of self-adjoint contractions whose generator is the Hamiltonian of an infinite dimensional harmonic *** Codes 28C20, 81V73, 43A32, 37K06 Copyright © 2024, The Authors. All rights reserved.

关键词： Hilbert spaces

来源：评论

学校读者我要写书评

暂无评论

Performance Impact of Error Correction Codes in RNS with Returning Methods and Base Extension

Performance Impact of Error Correction Codes in RNS with Ret...

引用

Engineering and Telecommunication (En&T), International Conference

作者： Egor Shiryaev Ekaterina Bezuglova Mikhail Babenko Andrei Tchernykh Bernardo Pulido-Gaytan Jorge M. Cortés-Mendoza North-Caucasus Federal University Stavropol Russia North-Caucasus Center for Mathematical Research North-Caucasus Federal University Stavropol Russia CICESE Research Center Ensenada Mexico Ivannikov Institute for System Programming Moscow Russia South Ural State University Chelyabinsk Russia

ISBN: (纸本)9781728183916

In this paper, we study techniques of correction codes for systems based on the Residue Number system (RNS). Self-correcting and error detection are important properties of RNS that allow the development of distributed data storage systems. However, the complexity of several approaches have a significant influence on system performance, it mostly depends on two methods: expanding the number base in the residual class and converting numbers from the residual system to the positional system. In this work, we review the state-of-the-art methods in the field and show that the most efficient error correction method combines the syndrome method and our method to expand the number base.

关键词： Buffer storage system performance Table lookup Error correction codes Error correction Complexity theory Arithmetic

来源：评论

学校读者我要写书评

暂无评论

A Simple and Effective Method of Cross-Lingual Plagiarism Detection

arXiv

引用

arXiv 2023年

作者： Avetisyan, Karen Malajyan, Arthur Ghukasyan, Tsolak Avetisyan, Arutyun Institute for System Programming The Russian Academy of Sciences Alexander Solzhenitsyn 25 Moscow109004 Russia Russian-Armenian University Hovsep Emin 123 Yerevan0051 Armenia ISP RAS Research Center for Trusted Artificial Intelligence Alexander Solzhenitsyn 25 Moscow109004 Russia

We present a simple cross-lingual plagiarism detection method applicable to a large number of languages. The presented approach leverages open multilingual thesauri for candidate retrieval task and pre-trained multilingual BERT-based language models for detailed analysis. The method does not rely on machine translation and word sense disambiguation when in use, and therefore is suitable for a large number of languages, including under-resourced languages. The effectiveness of the proposed approach is demonstrated for several existing and new benchmarks, achieving state-of-the-art results for French, Russian, and Armenian languages. Copyright © 2023, The Authors. All rights reserved.

关键词： Thesauri

来源：评论

学校读者我要写书评

暂无评论

Equivalence checking and intersection of deterministic timed finite state machines

arXiv

引用

arXiv 2021年

作者： Bresolin, Davide El-Fakih, Khaled Villa, Tiziano Yevtushenko, Nina Dipartimento di Matematica University of Padova Italy American University of Sharjah Sharjah United Arab Emirates Dipartimento di Informatica University of Verona Italy Ivannikov Institute for System Programming of the Russian Academy of Sciences National Research University Higher School of Economics Moscow Russia

There has been a growing interest in defining models of automata enriched with time, such as finite automata extended with clocks (timed automata). In this paper, we study deterministic timed finite state machines (TFSMs), i.e., finite state machines with a single clock, timed guards and timeouts which transduce timed input words into timed output words. We solve the problem of equivalence checking by defining a bisimulation from timed FSMs to untimed ones and viceversa. Moreover, we apply these bisimulation relations to build the intersection of two timed finite state machines by untiming them, intersecting them and transforming back to the timed intersection. © 2021, CC BY.

关键词： Clocks

来源：评论

学校读者我要写书评

暂无评论

Ti-Patch: Tiled Physical Adversarial Patch for no-reference video quality metrics

arXiv

引用

arXiv 2024年

作者： Leonenkova, Victoria Shumitskaya, Ekaterina Antsiferova, Anastasia Vatolin, Dmitriy Lomonosov Moscow State University Leninskiye Gory 1 Moscow119991 Russia ISP RAS Research Center for Trusted Artificial Intelligence Ivannikov Institute for System Programming of the RAS Alexander Solzhenitsyn st. 25 Moscow109004 Russia MSU Institute for Artificial Intelligence Lomonosovskiy Prospekt 27/1 Moscow119192 Russia

Objective no-reference image- and video-quality metrics are crucial in many computer vision tasks. However, state-of-the-art no-reference metrics have become learning-based and are vulnerable to adversarial attacks. The vulnerability of quality metrics imposes restrictions on using such metrics in quality control systems and comparing objective algorithms. Also, using vulnerable metrics as a loss for deep learning model training can mislead training to worsen visual quality. Because of that, quality metrics testing for vulnerability is a task of current interest. This paper proposes a new method for testing quality metrics vulnerability in the physical space. To our knowledge, quality metrics were not previously tested for vulnerability to this attack;they were only tested in the pixel space. We applied a physical adversarial Ti-Patch – Tiled Patch – attack to quality metrics and did experiments both in pixel and physical space. We also performed experiments on the implementation of physical adversarial wallpaper. The proposed method can be used as additional quality metrics in vulnerability evaluation, complementing traditional subjective comparison and vulnerability tests in the pixel space. We made our code and adversarial videos available on GitHub: https://***/leonenkova/Ti-Patch. © 2024, CC BY.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Scientific Data Lake for High Luminosity LHC project and other data-intensive particle and astro-particle physics experiments 5

Scientific Data Lake for High Luminosity LHC project and oth...

引用

5th International Conference on Particle Physics and Astrophysics, ICPPA 2020

作者： Alekseev, A. Kiryanov, A. Klimentov, A. Korchuganova, T. Mitsyn, V. Oleynik, D. Smirnov, A. Smirnov, S. Zarochentsev, A. Compiler Technology Department Ivannikov Institute for System Programming of the Ras Moscow109004 Russia Cloud Technologies and Big Data Analytics Laboratory Plekhanov Russian University of Economics Moscow117997 Russia Atlas Group Universidad Andres Bello Santiago7550196 Chile Department of Computing Resources and Technologies Nrc "kurchatov Institute"-PNPI Gatchina188300 Russia Physics Department Brookhaven National Laboratory UptonNY11973 United States Laboratory of Information Technologies Joint Institute for Nuclear Research Dubna141980 Russia Institute of Nuclear Physics and Engineering National Research Nuclear University MEPhI Moscow115409 Russia Laboratory of Ultra-High Energy Physics Saint Petersburg State University Saint Petersburg198504 Russia

The next phase of LHC Operations-High Luminosity LHC (HL-LHC), which is aimed at ten-fold increase in the luminosity of proton-proton collisions at the energy of 14 TeV, is expected to start operation in 2027-2028 and will deliver an unprecedented scientific data volume of multi-exabyte scale. This amount of data has to be stored and the corresponding storage system should ensure fast and reliable data delivery for processing by scientific groups distributed all over the world. The present LHC computing and data processing model will not be able to provide the required infrastructure growth even taking into account the expected hardware technology evolution. To address this challenge the new state-of-The-Art computing infrastructure technologies are now being developed and are presented here. The possibilities of application of the HL-LHC distributed data handling technique for other particle and astro-particle physics experiments dealing with large-scale data volumes like DUNE, LSST, Belle-II, JUNO, SKAO etc. are also discussed. © Published under licence by IOP Publishing Ltd.

关键词： Luminance

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on system Reliability and Science (ICSRS)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High-probability convergence for composite and distributed stochastic minimization and variational inequalities with heavy-tailed noise 24

High-probability convergence for composite and distributed s...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Eduard Gorbunov Abdurakhmon Sadiev Marina Danilova Samuel Horváth Gauthier Gidel Pavel Dvurechensky Alexander Gasnikov Peter Richtárik Mohamed bin Zayed University of Artificial Intelligence UAE King Abdullah University of Science and Technology KSA Moscow Institute of Physics and Technology Russia Université de Montréal and Mila Canada and Canada CIFAR AI Chair Weierstrass Institute for Applied Analysis and Stochastics Germany University Innopolis Russia and Ivannikov Institute for System Programming RAS Russia and Moscow Institute of Physics and Technology Russia and Skolkovo Institute of Science and Technology Russia

High-probability analysis of stochastic first-order optimization methods under mild assumptions on the noise has been gaining a lot of attention in recent years. Typically, gradient clipping is one of the key algorithmic ingredients to derive good high-probability guarantees when the noise is heavy-tailed. However, if implemented naïvely, clipping can spoil the convergence of the popular methods for composite and distributed optimization (Prox-SGD/Parallel SGD) even in the absence of any noise. Due to this reason, many works on high-probability analysis consider only unconstrained non-distributed problems, and the existing results for composite/distributed problems do not include some important special cases (like strongly convex problems) and are not optimal. To address this issue, we propose new stochastic methods for composite and distributed optimization based on the clipping of stochastic gradient differences and prove tight high-probability convergence results (including nearly optimal ones) for the new methods. In addition, we also develop new methods for composite and distributed variational inequalities and analyze the high-probability convergence of these methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparison of Propeller Wake Characteristics With/Without Duct Against a Vertical Wall

SSRN

引用

SSRN 2024年

作者： Wang, Mengfei Liang, Bingchen Zhang, Qin Wang, Zhicheng Epikhin, Andrey College of Engineering Ocean University of China 238 Songling Road Qingdao266100 China Shandong Provincial Key Laboratory of Ocean Engineering 238 Songling Road Qingdao266100 China Institute for System Programming of the Russian Academy of Sciences Alexander Solzhenitsyn st. 25 Moscow Russia

This paper conducts highly-refined numerical simulations to study the wake dynamics of the propeller, with and without duct, with a vertical wall. The arbitrary mesh interfaces (AMI) method and delayed detached-eddy simulation (DDES) turbulence models are employed with structured grids to detail the jet wake. The wake field's vortex generation, evolution, and dissipation processes are analyzed. It is found that the wall intensifies the diffusion, turning, and vortex breaking of wake, and a large number of vortex clouds are formed near the wall. Compared with the non-ducted propeller, the constraint of the duct makes the tip leakage vortex more slender and smaller vortex spacing, and the hub vortex is no longer spirally curved and is more slender. The jet spreading behaviour gradually weakens with increasing wall distance from 1D to 3D, where D is the propeller diameter. The spreading behaviour of the 4D wall distance jet tends to become stable gradually. Finally, 1D wall distance is the dividing line, whether the vertical wall affects the maximum axial velocity. © 2024, The Authors. All rights reserved.

关键词： Vortex flow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：