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

Tomography is Necessary for Universal Entanglement Detection with Single-Copy Observables

Physical Review Letters 2016年第23期116卷 230501-230501页

作者： Dawei Lu Tao Xin Nengkun Yu Zhengfeng Ji Jianxin Chen Guilu Long Jonathan Baugh Xinhua Peng Bei Zeng Raymond Laflamme Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Ontario Canada State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua University Beijing 100084 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia Department of Mathematics and Statistics University of Guelph Guelph Ontario N1G 2W1 Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of China Hefei Anhui 230036 China Canadian Institute for Advanced Research Toronto Ontario M5G 1Z8 Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada

Entanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous tasks of quantum information science. A natural question of both theoretical and experimental importance is whether universal entanglement detection can be accomplished without full state tomography. In this Letter, we prove a no-go theorem that rules out this possibility for nonadaptive schemes that employ single-copy measurements only. We also examine a previously implemented experiment [H. Park et al., Phys. Rev. Lett. 105, 230404 (2010)], which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. In contrast, our simulation and experiment both support the opposite conclusion that the protocol, indeed, leads to full state tomography, which supplements our no-go theorem. These results reveal a fundamental limit of single-copy measurements in entanglement detection and provide a general framework of the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the k-symmetric extendibility.

关键词： Entanglement detection Entanglement measures Quantum tomography Nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Gaussian Mixture Model Based Interest Prediction In Social Networks

Gaussian Mixture Model Based Interest Prediction In Social N...

引用

IEEE International Conference on Cloud computing Technology and science (CloudCom)

作者： Dongyun An Xianghan Zheng Chunming Rong Tahar Kechadi ChongCheng Chen College of Mathematics and Computer Science Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Department of Electrical Engineering and Computer Science Stavanger Norway University College Dublin School of Computer Science and Informatics Ireland

In this paper, we investigate a typical clustering technology, namely, Gaussian mixture model (GMM)-based approach, for user interest prediction in social networks. The establishment of the model follows the following process: collect dataset from 4613 users and more than 16 million messages from Sina Weibo, obtain each user's interest eigenvalue sequence and establish GMM model to clustering users. In theory and experiment, this approach is feasible. The GMM-based approach considers the prediction accuracy and consuming time. A series of experiments are conducted to validate the feasibility and efficiency of the proposed solution and whether it can achieve a higher accuracy of prediction compared with other approaches, such as SVM and K-means. Further experiments show that GMM-based approach could produce higher prediction accuracy of 93.9%, thus leveraging computation complexity.

关键词： Predictive models Feature extraction Social network services Gaussian mixture model Eigenvalues and eigenfunctions Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal simulation of Deutsch gates and the Fredkin gate

引用

Physical Review A 2015年第3期91卷 032302-032302页

作者： Nengkun Yu Mingsheng Ying Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada Department of Mathematics & Statistics University of Guelph Guelph Ontario Canada Center for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 China

In this paper, we study the optimal simulation of the three-qubit unitary using two-qubit gates. First, we completely characterize the two-qubit gate cost of simulating the Deutsch gate (controlled-controlled gate) by generalizing our result on the two-qubit cost of the Toffoli gate. The function of any Deutsch gate is simply a three-qubit controlled-unitary gate and can be intuitively explained as follows: The gate outputs the states of the two control qubits directly, and applies the given one-qubit unitary u on the target qubit only if both the states of the control qubits are |1〉. Previously, it was only known that five two-qubit gates are sufficient for implementing such a gate [Sleator and Weinfurter, Phys. Rev. Lett. 74, 4087 (1995)]. We show that if the determinant of u is 1, four two-qubit gates are optimal. Otherwise, five two-qubit gates are required. For the Fredkin gate (the controlled-swap gate), we prove that five two-qubit gates are necessary and sufficient, which settles the open problem introduced in Smolin and DiVincenzo [Phys. Rev. A 53, 2855 (1996)].

关键词： QUANTUM gates PARTICLE interactions QUBITS QUANTUM information science QUANTUM fluctuations HAMILTONIAN systems QUANTUM states

来源：评论

学校读者我要写书评

暂无评论

Color PNG Image Authentication Scheme Based on Rehashing and Secret Sharing Method

引用

Journal of Information Hiding and Multimedia Signal Processing 2015年第3期6卷 523-533页

作者： Lyu, Wan-Li Chang, Chin-Chen Wang, Feng Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui University Hefei230039 China Department of Information Engineering and Computer Science Feng Chia University 100 Wenhwa Rd Seatwen Taichung40724 Taiwan Department of Mathematics and Physics Fujian University of Technology Fuzhou Fujian350108 China

An authentication scheme that uses rehashing and secret sharing methods to verify the reality of a color image’s content is proposed in this paper. First, the proposed scheme uses Shamir’s secret sharing method to share image features. Second, the proposed scheme innovatively utilizes the rehashing method to overcome easy collisions of the random numbers to enhance the effectiveness against attacks. Third, the proposed method utilizes Portable Network Graphics images to hide authentication messages. Using the rehashing method, the collisions take up little in address space, making the process suitable for processing authentication messages. The experimental results indicated that the proposed scheme had very low false acceptance and rejection ratios and verified that the rehashing method can be used in image authentication applications. © 2009 ISSN 2073-4212.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Risk Management Using Big Real Time Data

Risk Management Using Big Real Time Data

引用

IEEE International Conference on Cloud computing Technology and science (CloudCom)

作者： Jie Cheng Chunming Rong Huijuan Ye Xianghan Zheng Department of Electrical Engineering and Computer Science Risk Management Using Big Real Time Data Department of Computer Science and Electronic Engineering University of Stavanger Stavanger Norway College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

Adding to societal changes today, are the miscellaneous big data produced in different fields. Coupled with these data is the appearance of risk management. Admittedly, to predict future trend by using these data is conducive to make everything more efficient and easy. Now, no matter companies or individuals, they increasingly focus on identifying risks and managing them before risks. Effective risk management will lead them to deal with potential problems. This thesis focuses on risk management of flight delay area using big real time data. It proposes two different prediction models, one is called General Long Term Departure Prediction Model and the other is named as Improved Real Time Arrival Prediction Model. By studying the main factors lead to flight delay, this thesis takes weather, carrier, National Aviation System, security and previous late aircraft as analysis factors. By utilizing our models can do not only long time but also short term flight delay predictions. The results demonstrate goodness of fit. Besides the theory part, it also presents a practical and beautiful web application for real time flight arrival prediction based on our second model.

关键词： Delays Biological system modeling Meteorology Atmospheric modeling Predictive models Airports Splines (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Author Correction: The challenge of mapping the human connectome based on diffusion tractography

引用

Nature communications 2019年第1期10卷 5059页

作者： Klaus H Maier-Hein Peter F Neher Jean-Christophe Houde Marc-Alexandre Côté Eleftherios Garyfallidis Jidan Zhong Maxime Chamberland Fang-Cheng Yeh Ying-Chia Lin Qing Ji Wilburn E Reddick John O Glass David Qixiang Chen Yuanjing Feng Chengfeng Gao Ye Wu Jieyan Ma Renjie He Qiang Li Carl-Fredrik Westin Samuel Deslauriers-Gauthier J Omar Ocegueda González Michael Paquette Samuel St-Jean Gabriel Girard François Rheault Jasmeen Sidhu Chantal M W Tax Fenghua Guo Hamed Y Mesri Szabolcs Dávid Martijn Froeling Anneriet M Heemskerk Alexander Leemans Arnaud Boré Basile Pinsard Christophe Bedetti Matthieu Desrosiers Simona Brambati Julien Doyon Alessia Sarica Roberta Vasta Antonio Cerasa Aldo Quattrone Jason Yeatman Ali R Khan Wes Hodges Simon Alexander David Romascano Muhamed Barakovic Anna Auría Oscar Esteban Alia Lemkaddem Jean-Philippe Thiran H Ertan Cetingul Benjamin L Odry Boris Mailhe Mariappan S Nadar Fabrizio Pizzagalli Gautam Prasad Julio E Villalon-Reina Justin Galvis Paul M Thompson Francisco De Santiago Requejo Pedro Luque Laguna Luis Miguel Lacerda Rachel Barrett Flavio Dell'Acqua Marco Catani Laurent Petit Emmanuel Caruyer Alessandro Daducci Tim B Dyrby Tim Holland-Letz Claus C Hilgetag Bram Stieltjes Maxime Descoteaux Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg 69120 Germany. k.maier-hein@dkfz.de. Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg 69120 Germany. Sherbrooke Connectivity Imaging Lab (SCIL) Université de Sherbrooke Sherbrooke QC J1K 0A5 QC Canada. Department of Intelligent Systems Engineering School of Informatics and Computing Indiana University Bloomington IN 47408 USA. Krembil Research Institute University Health Network Toronto Canada M5G 2C4. Department of Neurological Surgery University of Pittsburgh School of Medicine Pittsburgh PA 15213 USA. IMT-Institute for Advanced Studies Lucca 55100 Italy. Department of Diagnostic Imaging St. Jude Children's Research Hospital Memphis TN 38105 USA. University of Toronto Institute of Medical Science Toronto Canada M5S 1A8. Institute of Information Processing and Automation Zhejiang University of Technology Hangzhou 310023 Zhejiang China. United Imaging Healthcare Co Shanghai 201807 China. Shanghai Advanced Research Institute Shanghai 201210 China. Laboratory of Mathematics in Imaging Harvard Medical School Boston MA 02215 USA. Center for Research in Mathematics Guanajuato 36023 Mexico. PROVIDI Lab Image Sciences Institute University Medical Center Utrecht Utrecht 3508 The Netherlands. Cardiff University Brain Research Imaging Centre School of Psychology Cardiff University Maindy Road Cardiff CF24 4HQ UK. Department of Radiology University Medical Center Utrecht Utrecht 3508 The Netherlands. Centre de recherche institut universitaire de geriatrie de Montreal (CRIUGM) Université de Montréal Montreal QC Canada H3W 1W5. Sorbonne Universités UPMC Univ Paris 06 CNRS INSERM Laboratoire d'Imagerie Biomédicale (LIB) 75013 Paris France. Center for Advanced Research in Sleep Medicine Hôpital du Sacré-Coeur de Montréal Montreal Canada H4J 1C5. Neuroimaging Unit Institute of Bioimaging and Molecular Physiology (IBFM) Nat

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compressed sensing based on best wavelet packet basis for image processing

引用

Journal of computers (Finland) 2013年第8期8卷 1947-1950页

作者： Li, Zhe Tao Xie, Jing Xiong Yu, Zu Guo Tu, Deng Biao Choi, Young June The College of Information Engineering Xiangtan University Hunan 411105 China School of Computer National University of Defense Technology Hunan 410073 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 China School of Mathematics and Computational Science Xiangtan University Hunan 411105 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China Department of Information and Computer Engineering Ajou University Suwon 443749 Korea Republic of

In this paper, an algorithm named best wavelet packet tree decomposition (BWPTD) is proposed for image compression. In order to obtain better sparse representation of image, best wavelet packet basis is introduced to decompose image signal in the algorithm. Experimental results show that BWPTD is better than single layer wavelet decompression (SLWD) and original compressed sensing (OCS) in peak signal to noise ratio (PSNR) by 2db and 8db, respectively. In addition, the reconstruction time of BWPTD is only half as that of SLWD and OCS. © 2013 ACADEMY PUBLISHER.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

A novel description of the reproducing kernel support vector machines

A novel description of the reproducing kernel support vector...

引用

IEEE International Conference on computer science and Automation Engineering (CSAE)

作者： Li-xiang Xu Bin Luo Feng-hai Yu Jin Xie Department of Mathematics & Physics Hefei University Hefei China Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Anhui China

Support vector machines (SVMs) and related kernel-based algorithms have become one of the most popular approaches for many machine learning problems. but little is known about the structure of their reproducing kernel Hilbert spaces (RKHS). In this work, based on Mercer's Theorem, the relation among reproducing kernel (RK) and Mercer kernel, and their roles in SVMs are discussed, corresponding to some important theorems and consequences are given. Furthermore, a novel framework of reproducing kernel support vector machines (RKSVM) is proposed. The simulation results are presented to illustrate the feasibility of the proposed method. Choosing a proper Mercer kernel for different tasks is an important factor for studying the result of the SVMs.

关键词： Kernel Support vector machines Hilbert space Equations Mathematical model Resonant frequency Simulation

来源：评论

学校读者我要写书评

暂无评论

Proximity user identification using correlogram

引用

作者： Shahidi, Shervin Mazrooei, Parisa Esfahani, Navid Nasr Saraee, Mohammad Intelligent Databases Data Mining and Bioinformatics Research Laboratory Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan 84156-83111 Iran Isfahan Mathematics House Isfahan 81645-356 Iran School of Computing Science and Engineering University of Salford Greater Manchester United Kingdom

ISBN: (纸本)3642163262

This paper represents a technique, applying user action patterns in order to distinguish between users and identify them. In this method, users' actions sequences are mapped to numerical sequences and each user's profile is generated using autocorrelation values. Next, cross-correlation is used to compare user profiles with a test data. To evaluate our proposed method, a dataset known as Greenberg's dataset is used. The presented approach is succeeded to detect the correct user with as high as 82.3% accuracy over a set of 52 users. In comparison to the existing methods based on Hidden Markov Model or Neural Networks, our method needs less computation time and space. In addition, it has the ability of getting updated iteratively which is a main factor to facilitate transferability. © 2010 IFIP.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

An oscillatory correlation model of object-based attention

An oscillatory correlation model of object-based attention

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Marcos G. Quiles DeLiang Wang Liang Zhao Roseli A. F. Romero De-Shuang Huang Department of Computer Science Institute of Mathematics and Computer Science University of Sao Paulo Sao Paulo Brazil Department of Computer Science & Engineering and Center for Cognitive Science Ohio State Uinversity Columbus OH USA Intelligent Computing Laboratory Hefei Institute of Intelligent Machines Hefei Anhui China

Attention is a critical mechanism for visual scene analysis. By means of attention, it is possible to break down the analysis of a complex scene to the analysis of its parts through a selection process. Empirical studies demonstrate that attentional selection is conducted on visual objects as a whole. We present a neurocomputational model of object-based selection in the framework of oscillatory correlation. By segmenting an input scene and integrating the segments with their conspicuity obtained from a saliency map, the model selects salient objects rather than salient locations. The proposed system is composed of three modules: a saliency map providing saliency values of image locations, image segmentation for breaking the input scene into a set of objects, and object selection which allows one of the objects of the scene to be selected at a time. This object selection system has been applied to real images and the simulation results show its effectiveness.

关键词： Layout Image segmentation computer science Oscillators Image analysis intelligent networks Machine intelligence Neurons Frequency synchronization Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：