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

Gaussian-modulated coherent-state measurement-device-independent quantum key distribution

Physical Review A 2014年第4期89卷 042335-042335页

作者： Xiang-Chun Ma Shi-Hai Sun Mu-Sheng Jiang Ming Gui Lin-Mei Liang College of Science National University of Defense Technology Changsha 410073 People's Republic of China Centre for Quantum Information and Quantum Control Department of Physics and Department of Electrical and Computer Engineering University of Toronto Toronto Ontario Canada M5S 3G4 State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 People's Republic of China

Measurement-device-independent quantum key distribution (MDI-QKD), leaving the detection procedure to the third partner and thus being immune to all detector side-channel attacks, is very promising for the construction of high-security quantum information networks. We propose a scheme to implement MDI-QKD, but with continuous variables instead of discrete ones, i.e., with the source of Gaussian-modulated coherent states, based on the principle of continuous-variable entanglement swapping. This protocol not only can be implemented with current telecom components but also has high key rates compared to its discrete counterpart; thus it will be highly compatible with quantum networks.

关键词： GAUSSIAN distribution COHERENT states QUANTUM networks (Optics) QUANTUM entanglement BELL'S theorem PARAMETER estimation

来源：评论

学校读者我要写书评

暂无评论

Study of [Formula: see text] and [Formula: see text] production in [Formula: see text] collisions at [Formula: see text] and search for anomalous quartic gauge couplings with the ATLAS experiment

引用

The European physical journal. C, Particles and fields 2017年第9期77卷 646页

作者： M Aaboud G Aad B Abbott O Abdinov B Abeloos S H Abidi O S AbouZeid N L Abraham H Abramowicz H Abreu R Abreu Y Abulaiti B S Acharya S Adachi L Adamczyk J Adelman M Adersberger T Adye A A Affolder T Agatonovic-Jovin C Agheorghiesei J A Aguilar-Saavedra S P Ahlen F Ahmadov G Aielli S Akatsuka H Akerstedt T P A Åkesson E Akilli A V Akimov G L Alberghi J Albert P Albicocco M J Alconada Verzini S C Alderweireldt M Aleksa I N Aleksandrov C Alexa G Alexander T Alexopoulos M Alhroob B Ali M Aliev G Alimonti J Alison S P Alkire B M M Allbrooke B W Allen P P Allport A Aloisio A Alonso F Alonso C Alpigiani A A Alshehri M I Alstaty B Alvarez Gonzalez D Álvarez Piqueras M G Alviggi B T Amadio Y Amaral Coutinho C Amelung D Amidei S P Amor Dos Santos S Amoroso G Amundsen C Anastopoulos L S Ancu N Andari T Andeen C F Anders J K Anders K J Anderson A Andreazza V Andrei S Angelidakis I Angelozzi A Angerami A V Anisenkov N Anjos A Annovi C Antel M Antonelli A Antonov D J Antrim F Anulli M Aoki L Aperio Bella G Arabidze Y Arai J P Araque V Araujo Ferraz A T H Arce R E Ardell F A Arduh J-F Arguin S Argyropoulos M Arik A J Armbruster L J Armitage O Arnaez H Arnold M Arratia O Arslan A Artamonov G Artoni S Artz S Asai N Asbah A Ashkenazi L Asquith K Assamagan R Astalos M Atkinson N B Atlay K Augsten G Avolio B Axen M K Ayoub G Azuelos A E Baas M J Baca H Bachacou K Bachas M Backes M Backhaus P Bagnaia M Bahmani H Bahrasemani J T Baines M Bajic O K Baker E M Baldin P Balek F Balli W K Balunas E Banas A Bandyopadhyay Sw Banerjee A A E Bannoura L Barak E L Barberio D Barberis M Barbero T Barillari M-S Barisits J T Barkeloo T Barklow N Barlow S L Barnes B M Barnett R M Barnett Z Barnovska-Blenessy A Baroncelli G Barone A J Barr L Barranco Navarro F Barreiro J Barreiro Guimarães da Costa R Bartoldus A E Barton P Bartos A Basalaev A Bassalat R L Bates S J Batista J R Batley M Battaglia M Bauce F Bauer H S Bawa J B Beacham M D Beattie T Beau P H Beauchemin P Bechtle H P Beck H C Beck K Becker M Becker M Beckingham C Becot A J Beddall A Beddall Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco. CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France. Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman OK USA. Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan. LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France. Department of Physics University of Toronto Toronto ON Canada. Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz CA USA. Department of Physics and Astronomy University of Sussex Brighton UK. Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel. Department of Physics Technion: Israel Institute of Technology Haifa Israel. Center for High Energy Physics University of Oregon Eugene OR USA. Department of Physics Stockholm University Stockholm Sweden. The Oskar Klein Centre Stockholm Sweden. INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy. ICTP Trieste Italy. International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan. Faculty of Physics and Applied Computer Science AGH University of Science and Technology Kraków Poland. Department of Physics Northern Illinois University DeKalb IL USA. Fakultät für Physik Ludwig-Maximilians-Universität München Munich Germany. Particle Physics Department Rutherford Appleton Laboratory Didcot UK. Institute of Physics University of Belgrade Belgrade Serbia. Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania. Laboratório de Instrumentação e Física Experimental de Partículas-LIP Lisbon Portugal. Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain. Department of Physics Boston University Boston MA USA. Joint Institute for Nuclear Research JINR Dubna Dubna Russia. INFN Sezione di Roma Tor Vergata Rome Italy. Dipartimento di Fisica Università di Roma

This paper presents a study of and triboson production using events from proton-proton collisions at a centre-of-mass energy of recorded with the ATLAS detector at the LHC and corresponding to an integrated luminosity of 20.2 fb . The production cross-section is determined using a final state containing an electron, a muon, a photon, and neutrinos ( ). Upper limits on the production cross-section of the final state and the and final states containing an electron or a muon, two jets, a photon, and a neutrino ( or ) are also derived. The results are compared to the cross-sections predicted by the Standard Model at next-to-leading order in the strong-coupling constant. In addition, upper limits on the production cross-sections are derived in a fiducial region optimised for a search for new physics beyond the Standard Model. The results are interpreted in the context of anomalous quartic gauge couplings using an effective field theory. Confidence intervals at 95% confidence level are derived for the 14 coupling coefficients to which and production are sensitive.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Finding tree symmetries using continuous-time quantum walk

引用

Chinese Physics B 2013年第5期22卷 124-131页

作者：吴俊杰张百达唐玉华强晓刚会权 State Key Laboratory of High Performance Computing National University of Defense Technology School of Computer National University of Defense Technology Center for Quantum Photonics H. H. Wills Physics Laboratory and Department of Electrical and Electronic EngineeringUniversity of Bristol

Quantum walk, the quantum counterpart of random walk, is an important model and widely studied to develop new quantum algorithms. This paper studies the relationship between the continuous-time quantum walk and the symmetry of a graph, especially that of a tree. Firstly, we prove in mathematics that the symmetry of a graph is highly related to quantum walk. Secondly, we propose an algorithm based on the continuous-time quantum walk to compute the symmetry of a tree. Our algorithm has better time complexity O（N3） than the current best algorithm. Finally, through testing three types of 10024 trees, we find that the symmetry of a tree can be found with an extremely high efficiency with the help of the continuous-time quantum walk.

关键词： quantum walk tree symmetry automorphism

来源：评论

学校读者我要写书评

暂无评论

On the Eigenvalues of General Sum-Connectivity Laplacian Matrix

引用

Journal of the Operations Research Society of China 2013年第3期1卷 347-358页

作者： Hanyuan Deng He Huang Jie Zhang College of Mathematics and Computer Science Key Laboratory of High Performance Computing and Stochastic Information Processing(HPCSIP)(Ministry of Education of China)Hunan Normal UniversityChangshaHunan 410081China Computer Science Department Aarhus UniversityAarhusDenmark

The connectivity index was introduced by Randi´c(***.97(23):6609–6615,1975)and was generalized by Bollobás and Erdös(Ars Comb.50:225–233,1998).It studies the branching property of graphs,and has been applied to studying network *** this paper we focus on the general sum-connectivity index which is a variant of the connectivity *** characterize the tight upper and lower bounds of the largest eigenvalue of the general sum-connectivity matrix,as well as its spectral *** show the corresponding extremal *** addition,we show that the general sum-connectivity index is determined by the eigenvalues of the general sum-connectivity Laplacian matrix.

关键词： Connectivity index Eigenvalue Laplacian matrix

来源：评论

学校读者我要写书评

暂无评论

Improved multi-objective evolutionary algorithm for multi-agent coalition formation

Journal of Software

引用

Journal of Software 2013年第12期8卷 2991-2995页

作者： Xu, Bo Zhang, Ruizhe Yu, Jian Ping Department of Computer Science and Technology of Guangdong University of Petrochemical Technology Guangdong Province China Computer Science and Technic Academy Department Pingdingshan University Henan Province China College of Mathematics and Computer Science Key Laboratory of High Performance Computing and Stochastic Information Processing Hunan Normal University Hunan Province China

One of the key problems in multi-agent coalition formation is to optimally assign and schedule resources. An improved multi-objective evolutionary Algorithm (IMOEA) is proposed to solve this problem. Compared with several well-known algorithms such as NSGA, MOEA, experimental results show the algorithm is very suitable for coalition formation problem. © 2013 Academy Publisher.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Stretchable Electronics: Epidermal Electronics with Advanced Capabilities in Near-Field Communication (Small 8/2015)

引用

Small 2015年第8期11卷

作者： Jeonghyun Kim Anthony Banks Huanyu Cheng Zhaoqian Xie Sheng Xu Kyung-In Jang Jung Woo Lee Zhuangjian Liu Philipp Gutruf Xian Huang Pinghung Wei Fei Liu Kan Li Mitul Dalal Roozbeh Ghaffari Xue Feng Yonggang Huang Sanjay Gupta Ungyu Paik John A. Rogers Department of Materials Science and Engineering Frederick Seitz Materials Research Laboratory University of Illinois at Urbana-Champaign Urbana IL 61801 USA Department of Materials Science and Engineering Department of Energy Engineering Hanyang University Seoul 133–791 Republic of Korea Department of Mechanical Engineering Civil and Environmental Engineering Center for Engineering and Health and Skin Disease Research Center Northwestern University Evanston IL 60208 USA Department of Engineering Mechanics Center for Mechanics and Materials Tsinghua University Beijing 100084 China Department of Civil and Environmental Engineering Northwestern University Evanston IL 60208 USA Institute of High Performance Computing 1 Fusionopolis Way #16–16 Connexis Singapore 138632 Singapore Functional Materials and Microsystems Research Group School of Electrical and Computer Engineering RMIT University Melbourne VIC 3000 Australia MC10 Inc. Cambridge Massachusetts 02140 USA Department of Engineering Mechanics Tsinghua University Beijing 100084 China

来源：评论

学校读者我要写书评

暂无评论

Efficient scheduling of recursive control flow on GPUs 13

Efficient scheduling of recursive control flow on GPUs

引用

27th ACM International Conference on Supercomputing, ICS 2013

作者： Huo, Xin Krishnamoorthy, Sriram Agrawal, Gagan Department of Computer Science and Engineering Ohio State University Columbus OH United States High Performance Computing Group Pacific Northwest National Laboratory Richland WA United States

ISBN: (纸本)9781450321303

Graphics processing units (GPUs) have rapidly emerged as a very significant player in high performance computing. Single instruction multiple thread (SIMT) pipelines are typically used in GPUs to exploit parallelism and maximize performance. Although support for unstructured control flow has been included in GPUs, efficiently managing thread divergence for arbitrary parallel programs remains a critical challenge. In this paper, we focus on the problem of supporting recursion in modern GPUs. We design and comparatively evaluate various algorithms to manage thread divergence encountered in recursive programs. The results improve upon traditional post-dominator based reconvergence mechanisms designed to handle thread divergence due to control flow within a procedure. © 2013 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Aligning multi sequences on GPUs

Aligning multi sequences on GPUs

引用

1st International Conference on Context-Aware Systems and Applications, ICCASA 2012

作者： Pham, Hong Phong Nguyen, Huu Duc Nguyen, Thanh Thuy Department of Information System Hanoi University of Science and Technology NOT Is High Performance Computing Center Viet Nam Department of Computer Science VNU - University of Engineering and Technology Viet Nam

ISBN: (纸本)9783642366413

Implementing Multi Sequence Alignment (MSA) problem using the method of progressive alignment is not feasible on common computing systems;it takes several hours or even days for aligning thousands of sequences if we use sequential versions of the most popular MSA algorithm - Clustal. In this paper, we present our parallel algorithm called CUDAClustal, a MSA parallel program. We have paralleled the first stage of the algorithm Clustal and achieved a significant speedup when compared to the sequential program running on a computer of Pentium 4 3.0 GHz processor. Our tests were performed on one GPU Geforce GTX 295 and they gave a great computing performance: the running time of CUDAClustal is smaller approximately 30 times than Clustal for the first stage. This shows the large benefit of GPU for solving the MSA problem and its high applicability in bioinformatics. © 2013 ICST Institute for computer science, Social Informatics and Telecommunications engineering.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An improved voting algorithm for planted (l, d) motif search

An improved voting algorithm for planted (l, d) motif search

引用

作者： Xu, Yun Yang, Jiaoyun Zhao, Yuzhong Shang, Yi Department of Computer Science University of Science and Technology of China Hefei Anhui 230026 China Key Laboratory on High Performance Computing Hefei Anhui 230026 China Department of Computer Science University of Missouri-Columbia Columbia MO United States

The planted motif search problem is a classical problem in bioinformatics that seeks to identify meaningful patterns in biological sequences. As an NP-complete problem, current algorithms focus on improving the average time complexity and solving challenging instances within an acceptable time. In this paper, we propose a new exact algorithm CVoting that improves the state-of-the-art Voting algorithm. CVoting uses a new hash technique to reduce the space complexity to O(mn + N(l, d)) and a new pruning technique to reduce the average time complexity to Om2nN(l,d)14+3ll. Experimental results show that CVoting outperforms competing algorithms, including PMS1, RISOTTO, Voting and Pmsprune, in both space and time: up to an order of magnitude faster and using less memory in solving challenging instances. The software of the proposed algorithm is publicly available at http://***/xuyun/motif. © 2013 Elsevier Inc. All rights reserved.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Maximal constraint satisfaction problems solved by continuous hopfield networks

引用

WSEAS Transactions on computers 2013年第2期12卷 29-40页

作者： Ettaouil, Mohamed Loqman, Chakir Haddouch, Khalid Hami, Youssef UFR: Scientific Computing and Computer sciences Engineering Sciences Modeling and Scientific Computing Laboratory Faculty of Science and Technology of Fez University Sidi Mohammed ben Abdellah Box 2202 Fez Morocco Department of Computer Engineering High School of Technology Moulay Ismaïl University B. P. 3103 50000 Toulal Meknes Morocco

In this paper, we propose a new approach to solve the maximal constraint satisfaction problems (Max-CSP) using the continuous Hopfield network. This approach is divided into two steps: the first step involves modeling the maximal constraint satisfaction problem as 0-1 quadratic programming subject to linear constraints (QP). The second step concerns applying the continuous Hopfield network (CHN) to solve the QP problem. Therefore, the generalized energy function associated with the CHN and an appropriate parametersetting procedure about Max-CSP problems are given in detail. Finally, the proposed algorithm and some computational experiments solving the Max-CSP are shown.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：