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

arXiv 2020年

作者： Petrovskaia, Anna Jana, Raghavendra B. Oseledets, Ivan V. Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow121205 Russia

Remote sensing images are used for a variety of analyses, from agricultural monitoring, to disaster relief, to resource planning, among others. The images can be corrupted due to a number of reasons, including instrument errors and natural obstacles such as clouds. We present here a novel approach for reconstruction of missing information in such cases using only the corrupted image as the input. The Deep Image Prior methodology eliminates the need for a pre-trained network or an image database. It is shown that the approach easily beats the performance of traditional single-image methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Disaster prevention

来源：评论

学校读者我要写书评

暂无评论

Incorruptible Auditing: Blockchain-Powered Graph database Management

Incorruptible Auditing: Blockchain-Powered Graph Database Ma...

引用

IEEE International Conference on Blockchain and Cryptocurrency (ICBC)

作者： Victor Ermolaev Indrek Klangberg Yash Madhwal Silver Vapper Sjoerd Wels Yury Yanovich Software Department Bitfury Amsterdam The Netherlands Electrical Engineering Mathematics and Computer Science Department University of Twente Enschede The Netherlands Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology (Skoltech) Moscow Russia

ISBN: (数字)9781728166803

ISBN: (纸本)9781728166810

In modern and interconnected world, information is accumulatively stored digitally, making the process of exchanging, gathering and querying the information much easier. Continuously, it has introduced new challenges about how to ensure its consistency and reliability due to the sheer volume of data. A blockchain-based information system can provide an incorruptible record of history, enabling better auditing and data management practices. The paper describes how to combine an Exonum blockchain and a Neo4j graph database into a system that can provide a verifiable audit trail of data integrity and its modifications for information stored in a graph database.

关键词： History Bitcoin Peer-to-peer computing Contracts

来源：评论

学校读者我要写书评

暂无评论

No-Dealer: Byzantine Fault-Tolerant Random Number Generator

No-Dealer: Byzantine Fault-Tolerant Random Number Generator

引用

IEEE Conference on Computer Communications Workshops, INFOCOM Wksps

作者： Mikhail Krasnoselskii Grigorii Melnikov Yury Yanovich Moscow Russia Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology (Skoltech) Moscow Russia Laboratory of Data Mining and Predictive Modeling Institute for Information Transmission Problems (IITP RAS) Moscow Russia

The following topics are dealt with: learning (artificial intelligence); Internet of Things; mobile computing; cloud computing; cryptography; telecommunication traffic; data privacy; autonomous aerial vehicles; resour... 详细信息

ISBN: (数字)9781728186955

ISBN: (纸本)9781728186962

关键词： Fault tolerance Fault tolerant systems Protocols Peer-to-peer computing computational modeling Public key

来源：评论

学校读者我要写书评

暂无评论

Self-torqued harmonics and attosecond pulses driven by time-delayed relativistic vortex lasers

引用

Physical Review A 2022年第3期106卷 033515-033515页

作者： Jingwei Wang Matt Zepf Yuxin Leng Ruxin Li Sergey G. Rykovanov State Key Laboratory of High Field Laser Physics and Chinese Academy of Sciences Center for Excellence in Ultra-Intense Laser Science Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China China-Russian Belt and Road Joint Laboratory on Laser Science Shanghai 201800 China Collaborative Innovation Center of IFSA Shanghai Jiao Tong University Shanghai 200240 China Helmholtz Institute Jena Fröbelstieg 3 07743 Jena Germany Faculty of Physics and Astronomy Friedrich-Schiller-Universität Jena 07743 Jena Germany High Performance Computing and Big Data Laboratory Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow 121205 Russia

Light carrying time-varying orbital angular momentum (OAM) is a recently discovered type of structured electromagnetic field compared with a typical vortex field whose OAM is static. Such so-called self-torqued light is employed for manipulating the fast magnetic, topological, and quantum excitations and increasing its intensity and having access to shorter pulse durations would be of great benefit. Here we theoretically and numerically demonstrate the generation of intense self-torqued harmonics and attosecond pulses in the relativistic regime, driven by two time-delayed relativistic vortex lasers with different OAMs l1 and l2. The OAM of the nth harmonic spans nl1 to nl2, and the OAM of the attosecond pulses changes from l1 to l2. Such intense self-torqued harmonics and attosecond pulses may offer alternative possibilities in ultrafast spectroscopy.

关键词： High intensity laser-plasma interactions High-energy-density plasmas Radiation & particle generation in plasmas Ultrafast phenomena Relativistic plasmas Particle-in-cell methods Relativistic hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Lifted reed-solomon codes and lifted multiplicity codes

arXiv

引用

arXiv 2021年

作者： Holzbaur, Lukas Polyanskaya, Rina Polyanskii, Nikita Vorobyev, Ilya Yaakobi, Eitan Institute for Communications Engineering Technical University of Munich Germany Institute for Information Transmission Problems Russian Academy of Sciences Russia Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Russia Computer Science Department Technion — Israel Institute of Technology Israel

Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific sets of m-variate polynomials. These codes allow for the design of high-rate codes that can recover every codeword or information symbol from many disjoint sets. Recently, the underlying approaches have been combined for the bi-variate case to construct lifted multiplicity codes, a generalization of lifted codes that can offer further rate improvements. We continue the study of these codes by first establishing new lower bounds on the rate of lifted Reed-Solomon codes for any number of variables m, which improve upon the known bounds for any m ≥ 4. Next, we use these results to provide lower bounds on the rate and distance of lifted multiplicity codes obtained from polynomials in an arbitrary number of variables, which improve upon the known results for any m ≥ 3. Specifically, we investigate a subcode of a lifted multiplicity code formed by the linear span of m-variate monomials whose restriction to an arbitrary line in Fmq is equivalent to a low-degree univariate polynomial. We find the tight asymptotic behavior of the fraction of such monomials when the number of variables m is fixed and the alphabet size q = 2 is large. Using these results, we give a new explicit construction of batch codes utilizing lifted Reed-Solomon codes. For some parameter regimes, these codes have a better trade-off between parameters than previously known batch codes. Further, we show that lifted multiplicity codes have a better trade-off between redundancy and the number of disjoint recovering sets for every codeword or information symbol than previously known constructions, thereby providing the best known PIR codes for some parameter regimes. Additionally, we present a new local self-correction algorithm for lifted multiplicity codes. Copyright © 2021, The Authors. All rights reserved.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

Average age of information of irregular repetition slotted ALOHA

arXiv

引用

arXiv 2020年

作者： Munari, Andrea Frolov, Alexey Wessling82234 Germany Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow121205 Russia

Flanking traditional metrics such as throughput and reliability, age of information (AoI) is emerging as a fundamental tool to capture the performance of IoT systems. In this context, we focus on a setup in which a large number of nodes attempt delivery of time-stamped updates to a common destination over a shared channel, and investigate the ability of different grant-free access strategies to maintain fresh information at the receiver. Specifically, we derive for the first time an exact closed-form expression of the average AoI achieved by irregular repetition slotted ALOHA (IRSA), and compare its performance to that of a slotted ALOHA approach. Our analysis reveals the potential of modern random access schemes, and pinpoints some fundamental trade-offs, providing useful hints for proper system design. Copyright © 2020, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Realizing Body-Machine Interface for Quadrotor Control Through Kalman Filters and Recurrent Neural Network

Realizing Body-Machine Interface for Quadrotor Control Throu...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Alexander Menshchikov Daniil Lopatkin Evgeny Tsykunov Dzmitry Tsetserukou Andrey Somov Center for Computational and Data-Intensive Science and Engineering (CDISE) Skolkovo Institute of Science and Technology Moscow Russia Space Center Skolkovo Institute of Science and Technology Moscow Russia

ISBN: (数字)9781728189567

ISBN: (纸本)9781728189574

Unmanned Aerial Vehicles (UAV) have been recently applied in several various civilian applications. Based on this, there is a growing need for intuitive UAV control interfaces. In this work, we report on the Body-Machine Interface (BMI), helping a human operator to control a quadrotor through the gesture commands. We perform the human motion capture through wearable sensors and Kalman filter to reduce the noise. For the gesture command recognition, we designed the Recurrent Neural Network recognizing gestures within 65 ms. For the quadrotor orientation estimation, we designed the Extended Kalman Filter (EKF). We assess the proposed BMI via the simulations and experiments: the standard deviation of the trajectories varies for up to 10 cm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Duplication with transposition distance to the root for q-ary strings

Duplication with transposition distance to the root for q-ar...

引用

IEEE International Symposium on Information Theory

作者： Nikita Polyanskii Ilya Vorobyev Institute for Communications Engineering Technical University of Munich Munich Germany Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow Russia

ISBN: (数字)9781728164328

ISBN: (纸本)9781728164335

We study the duplication with transposition distance between strings of length n over a q-ary alphabet and their roots. In other words, we investigate the number of duplication operations of the form x = (abcd) →y = (abcbd), where x and y are strings and a, b, c and d are their substrings, needed to get a q-ary string of length n starting from the set of strings without duplications. For exact duplication, we prove that the maximal distance between a string of length at most n and its root has the asymptotic order n/logn. For approximate duplication, where a β-fraction of symbols may be duplicated incorrectly, we show that the maximal distance has a sharp transition from the order n/logn to logn at β = (q - 1)/q. The motivation for this problem comes from genomics, where such duplications represent a special kind of mutation and the distance between a given biological sequence and its root is the smallest number of transposition mutations required to generate the sequence.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stochastic gradient algorithms from ode splitting perspective

arXiv

引用

arXiv 2020年

作者： Merkulov, Daniil Oseledets, Ivan Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Bolshoy Boulevard 30 bld. 1 Moscow121205 Russia

We present a different view on stochastic optimization, which goes back to the splitting schemes for approximate solutions of ODE. In this work, we provide a connection between stochastic gradient descent approach and first-order splitting scheme for ODE. We consider the special case of splitting, which is inspired by machine learning applications and derive a new upper bound on the global splitting error for it. We present, that the Kaczmarz method is the limit case of the splitting scheme for the unit batch SGD for linear least squares problem. We support our findings with systematic empirical studies, which demonstrates, that a more accurate solution of local problems leads to the stepsize robustness and provides better convergence in time and iterations on the softmax regression problem. Copyright © 2020, The Authors. All rights reserved.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

Average Age of Information of Irregular Repetition Slotted ALOHA

Average Age of Information of Irregular Repetition Slotted A...

引用

GLOBECOM 2020 - 2020 IEEE Global Communications Conference

作者： Andrea Munari Alexey Frolov Institute of Communications and Navigation of the German Aerospace Center (DLR) Wessling Germany Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow Russia

ISBN: (数字)9781728182988

ISBN: (纸本)9781728182995

关键词： Peer-to-peer computing Protocols Receivers Throughput Information age Tools Internet of Things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：