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

Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm

Physical Review Research 2022年第3期4卷 033140-033140页

作者： Jean-Loup Ville Alexis Morvan Akel Hashim Ravi K. Naik Marie Lu Bradley Mitchell John-Mark Kreikebaum Kevin P. O'Brien Joel J. Wallman Ian Hincks Joseph Emerson Ethan Smith Ed Younis Costin Iancu David I. Santiago Irfan Siddiqi Quantum Nanoelectronics Laboratory Dept. of Physics University of California at Berkeley Berkeley California 94720 USA Computational Research Division Lawrence Berkeley National Lab Berkeley California 94720 USA Materials Sciences Division Lawrence Berkeley National Lab Berkeley California 94720 USA Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Inst. for Quantum Computing and Dept. of Applied Mathematics University of Waterloo Waterloo Ontario Canada N2L 3G1 Quantum Benchmark Inc. Kitchener Ontario Canada N2H 5G5

Recent progress in noisy intermediate-scale quantum (NISQ) hardware shows that quantum devices may be able to tackle complex problems even without error correction. However, coherent errors due to the increased complexity of these devices is an outstanding issue. They can accumulate through a circuit, making their impact on algorithms hard to predict and mitigate. Iterative algorithms like quantum imaginary time evolution are susceptible to these errors. This article presents the combination of both noise tailoring using randomized compiling and error mitigation with purification. We also show that cycle benchmarking gives an estimate of the reliability of the purification. We apply this method to the quantum imaginary time evolution of a transverse field Ising model and report an energy estimation error and a ground-state infidelity both below 1%. Our methodology is general and can be used for other algorithms and platforms. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.

关键词： Measurement-based quantum computing Quantum algorithms Quantum benchmarking Quantum computation Quantum control Quantum information processing Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Enhanced blind calibration of uniform linear arrays with one-bit quantization by kullback-leibler divergence covariance fitting

arXiv

引用

arXiv 2020年

作者： Weiss, Amir Yeredor, Arie Dept. of Computer Science and Applied Mathematics Weizmann Institute of Science Herzl St 234 Rehovot Israel School of Electrical Engineering Tel-Aviv University Tel Aviv-Yafo Israel

One-bit quantization has recently become an attractive option for data acquisition in cutting edge applications, due to the increasing demand for low power and higher sampling rates. Subsequently, the rejuvenated one-bit array processing field is now receiving more attention, as "classical" array processing techniques are adapted / modified accordingly. However, array calibration, often an instrumental preliminary stage in array processing, has so far received little attention in its one-bit form. In this paper, we present a novel solution approach for the blind calibration problem, namely, without using known calibration signals. In order to extract information within the second-order statistics of the quantized measurements, we propose to estimate the unknown sensors’ gains and phases offsets according to a Kullback-Leibler Divergence (KLD) covariance fitting criterion. We then provide a quasi-Newton solution algorithm, with a consistent initial estimate, and demonstrate the improved accuracy of our KLD-based estimates in simulations. Copyright © 2020, The Authors. All rights reserved.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Assuring the Integrity of Videos from Wireless-based IoT Devices using Blockchain

arXiv

引用

arXiv 2020年

作者： Danko, Dominik Mercan, Suat Cebe, Mumin Akkaya, Kemal Dept. of Math and Computer Science Clark University WorcesterMA01610 United States Dept. of Elec. and Comp. Engineering Florida International University MiamiFL33174 United States

—Blockchain technology has drawn attention from various communities. The underlying consensus mechanism in Blockchain enables a myriad of applications for the integrity assurance of stored data. In this paper, we utilize Blockchain technology to verify the authenticity of a video captured by a streaming IoT device for forensic investigation purposes. The proposed approach computes the hash of video frames before they leave the IoT device and are transferred to a remote base station. To guarantee the transmission, we ensure that this hash is sent through a TCP-based connection. The hash is then stored on multiple nodes on a permissioned blockchain platform. In case the video is modified, the discrepancy will be detected by investigating the previously stored hash on the blockchain and comparing it with the hash of the existing frame in question. In this work, we present the prototype as proof-of-concept with experiment results. The system has been tested on a Raspberry Pi with different quality of videos to evaluate performance. The results show that the concept can be implemented with moderate video resolutions. Copyright © 2020, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

"Double-DIP": Unsupervised Image Decomposition via Coupled Deep-Image-Priors

"Double-DIP": Unsupervised Image Decomposition via Coupled D...

引用

IEEE/CVF Conference on computer Vision and Pattern Recognition

作者： Yossi Gandelsman Assaf Shocher Michal Irani Dept. of Computer Science and Applied Mathematics The Weizmann Institute of Science

ISBN: (纸本)9781728132945

Many seemingly unrelated computer vision tasks can be viewed as a special case of image decomposition into separate layers. For example, image segmentation (separation into foreground and background layers);transparent layer separation (into reflection and transmission layers);Image dehazing (separation into a clear image and a haze map), and more. In this paper we propose a unified framework for unsupervised layer decomposition of a single image, based on coupled "Deep-image-Prior" (DIP) networks. It was shown that the structure of a single DIP generator network is sufficient to capture the low-level statistics of a single image. We show that coupling multiple such DIPs provides a powerful tool for decomposing images into their basic components, for a wide variety of applications. This capability stems from the fact that the internal statistics of a mixture of layers is more complex than the statistics of each of its individual components. We show the power of this approach for Image-Dehazing, Fg/Bg Segmentation, Watermark-Removal, Transparency Separation in images and video, and more. These capabilities are achieved in a totally unsupervised way, with no training examples other than the input image/video itself.

关键词： images Image decomposition basic component coupling Image Imagery (Psychotherapy) Dip computer vision Dehazing Videotapes Reflection spacer layer

来源：评论

学校读者我要写书评

暂无评论

Android CompCache based on Graphics Processing Unit

Android CompCache based on Graphics Processing Unit

引用

International Conference on Software Defined Systems (SDS)

作者： Muder Almiani Abdul Razaque Shen Ziqi Ge Yaqin Saleh Atiewi Mohammed Alweshah Ayman Al-Dmour Basel Magableh College of Information Technology Al-Hussein Bin Talal University Jordan Dept. of Computer Engineering & Telecommunication International IT University Almaty Department of Computer Science New York Institute of Technology Nanjing Campus China Al-Balqa Applied University Amman Jordan Department of Computer Science Applied Science University Manama Bahrain Technological University Dublin Ireland

ISBN: (数字)9781728172194

ISBN: (纸本)9781728172200

Android systems have been successfully developed to meet the demands of users. The following four methods are used in Android systems for memory management: backing swap, CompCache, traditional Linux swap, and low memory killer. These memory management methods are fully functioning. However, Android phones cannot swap memory into solid-state drives, thus slowing the processor and reducing storage lifetime. In addition, the compression and decompression processes consume additional energy and latency. Therefore, the CompCache requires an extension. An extended Android CompCache using a graphics processing unit to compress and decompress memory pages on demand and reduce the latency is introduced in this paper. This paper characterizes each data compression and decompression utility by measuring compression ratio, compression and decompression throughput, and energy efficiency to validate the process. Experimental results prove that data compression and decompression utilities can be beneficial to reduce the latency and perform faster compression and decompression compared with existing approaches.

关键词： Throughput Task analysis Graphics processing units Smart phones Energy efficiency Data compression

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Design of High Power UWB Monocycle Generator for Radar Sensor applied in The Fourth Industry Revolution

引用

Procedia Manufacturing 2020年 46卷 730-737页

作者： Younes Ahajjam Otman Aghzout Josè M. Catala-Civera Felipe Peñaranda-Foix Abdellah Driouach Instituto ITACA. Universitat Politècnica de València. Camino de Vera s/n. Valencia 46022 España Dept. of Physics Faculty of Science UAE Abdelmalek Essaadi University Tetouan 93000 Morocco Dept. of Computer science Engineering National School of Applied Sciences Abdelmalek Essaadi University Tetouan Morocco

This paper presents a high power monocycle generator for Radar Sensor detection in IoT application. The generator was made up of three essential parts-circuits, an avalanche transistor, an Step Recovery Diode (SRD) pulse sharping and an Monocycle Forming Network (MFN). The main idea in this work is to generate a high power monocycle pulse with a minimum of ringing in the output waveform. To overcome this challenge, a useful technique consists of introducing a twice stage of the transistor after the triggering with an overvoltage. The measurement results give an output waveform of 2.3 volts in amplitude with a minimum ringing around 3.6% in overshoot at 1 MHz, which is nearly fourfold of the peak power produced by a single transistor. The generator circuit is completely fabricated using microstrip structure technology characteristics. Good agreements between the measured and theoretical results are achieved which can consider very attractive in many application fields.

关键词： IoT Radar Sensor High Power Pulse Generator Industry

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of a synthetic prediction market using dynamic convex sets

arXiv

引用

arXiv 2021年

作者： Nakshatri, Nishanth Menon, Arjun Giles, C. Lee Rajtmajer, Sarah Griffin, Christopher Dept. of Computer Science and Engineering Pennsylvania State University University ParkPA16802 United States College of Information Sciences and Technology Pennsylvania State University University ParkPA16802 United States Applied Research Laboratory Pennsylvania State University University ParkPA16802 United States

We present a synthetic prediction market whose agent purchase logic is defined using a sigmoid transformation of a convex semi-algebraic set defined in feature space. Asset prices are determined by a logarithmic scoring market rule. Time varying asset prices affect the structure of the semi-algebraic sets leading to time-varying agent purchase rules. We show that under certain assumptions on the underlying geometry, the resulting synthetic prediction market can be used to arbitrarily closely approximate a binary function defined on a set of input data. We also provide sufficient conditions for market convergence and show that under certain instances markets can exhibit limit cycles in asset spot price. We provide an evolutionary algorithm for training agent parameters to allow a market to model the distribution of a given data set and illustrate the market approximation using two open source data sets. Results are compared to standard machine learning methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

MULTIPLIER IDEALS OF NORMAL SURFACE SINGULARITIES

arXiv

引用

arXiv 2024年

作者： Koltai, László László, Tamás Némethi, András Hun-Ren Alfréd Rányi Institute of Mathematics Reáltanoda UTCA 13-15 BudapestH-1053 Hungary ELTE - Faculty of Science Dept. of Geometry Pázmány Péter Sétány 1/A Budapest1117 Hungary Babeş-Bolyai University Str. Mihail Kogalniceanu Nr. 1 Cluj-Napoca400084 Romania Simion Stoilow Institute of Mathematics of The Romanian Academy Bucharest Romania BBU - Babeă-Bolyai Univ. Str M. Kogalniceanu 1 Cluj-Napoca400084 Romania BCAM - Basque Center for Applied Math. Mazarredo 14 E48009 Bilbao Basque Country Spain

We study the multiplier ideals and the corresponding jumping numbers and multiplicities {m(c)}c∈ in the following context: (X,o) is a complex analytic normal surface singularity, a ⊂ OX,o is an mX,o-primary ideal, φ : X → X is a log resolution of a such that aOX = OX(−F), for some nonzero effective divisor F supported on φ−1(0). A priori, {m(c)}c∈ depends on the Hilbert function associated with the resolution and F. We prove that {m(c)}c>0 is combinatorially computable from F and the resolution graph Γ of φ, and we provide several formulae. We also extend Budur's result (valid for (X,o) = (ℂ2,0)), which makes an identification of ∑c∈[0,1]m(c)tc with a certain Hodge spectrum. In our general case we use Hodge spectrum with coefficients in a mixed Hodge module. We show that {m(c)}c≤0 usually depends on the analytic type of (X,o). However, for some distinguished analytic types we determine it concretely. E.g., when (X,o) is weighted homogeneous (and F is associated with the central vertex), we recover ∑cm(c)tc from the Poincaré series of (X,o). Also, when (X,o) is a splice quotient then we recover ∑cm(c)tc from the multivariable topological Poincaré (zeta) function of Γ.MSC Codes 14B05, 14Fxx, 32S05, 32S10, 32S25 © 2024, CC BY.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

STEIN FILLINGS VS. MILNOR FIBERS

arXiv

引用

arXiv 2024年

作者： Inanc Baykur, V. Némethi, András Plamenevskaya, Olga Department of Mathematics and Statistics University of Massachusetts AmherstMA01003 United States HUN-REN Alfréd Rényi Institute of Mathematics Reáltanoda utca 13-15 BudapestH-1053 Hungary ELTE - Faculty of Science Dept. of Geometry Pázmány Péter sétány 1/A Budapest1117 Hungary BBU - Babeş-Bolyai Univ. Str M. Kogalniceanu 1 Cluj-Napoca400084 Romania BCAM - Basque Center for Applied Math. Mazarredo Basque Country Bilbao14 E48009 Spain Department of Mathematics Stony Brook University Stony BrookNY11794 United States

Given a link of a normal surface singularity with its canonical contact structure, we compare the collection of its Stein fillings to its Milnor fillings (that is, Milnor fibers of possible smoothings). We prove that, unlike Stein fillings, Milnor fillings of a given link have bounded topology;for links of sandwiched singularities, we further establish that there are only finitely many Milnor fillings. We discuss some other obstructions for a Stein filling to be represented by a Milnor fiber, and for various types of singularities, including simple classes like cusps and triangle singularities, we produce Stein fillings that do not come from Milnor fibers or resolutions. Meanwhile, we discover that there are many contact 3–manifolds that admit infinitely many Stein fillings but do not admit arbitrarily large ones. Copyright © 2024, The Authors. All rights reserved.

关键词： Filling

来源：评论

学校读者我要写书评

暂无评论

InGAN: Capturing and Retargeting the “DNA” of a Natural Image

InGAN: Capturing and Retargeting the “DNA” of a Natural Im...

引用

International Conference on computer Vision (ICCV)

作者： Assaf Shocher Shai Bagon Phillip Isola Michal Irani Dept. of Computer Science and Applied Math The Weizmann Institute of Science Weizmann Artificial Intelligence Center (WAIC) Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Generative Adversarial Networks (GANs) typically learn a distribution of images in a large image dataset, and are then able to generate new images from this distribution. However, each natural image has its own internal statistics, captured by its unique distribution of patches. In this paper we propose an "Internal GAN'' (InGAN) - an image-specific GAN - which trains on a single input image and learns its internal distribution of patches. It is then able to synthesize a plethora of new natural images of significantly different sizes, shapes and aspect-ratios - all with the same internal patch-distribution (same "DNA'') as the input image. In particular, despite large changes in global size/shape of the image, all elements inside the image maintain their local size/shape. InGAN is fully unsupervised, requiring no additional data other than the input image itself. Once trained on the input image, it can remap the input to any size or shape in a single feedforward pass, while preserving the same internal patch distribution. InGAN provides a unified framework for a variety of tasks, bridging the gap between textures and natural images.

关键词： Gallium nitride Shape Generators Task analysis DNA Visualization Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：