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

Science China(Physics,Mechanics & Astronomy) 2014年第10期57卷 1913-1917页

作者： WANG Feng LUO MingXing CHEN XiuBo YANG YiXian WANG XiaoJun College of mathematical sciences Dezhou University Information Security and National Computing Grid Laboratory Southwest Jiaotong University State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications School of Electronic Engineering Dublin City University

A universal entangler is a very powerful fault-tolerant entangling device for generating quantum entanglements from any joint states. Our paper aims to address the construction of universal entanglers. We prove that universal entanglers may be obtained from random unitary gates according to the Harr measure. The success probability is close to 1 for large system spaces. This result represents the typical density of entanglement subspaces in large state spaces. It also partially solves an open problem of universal bipartite entanglers and is explained by some experiment simulations.

关键词： universal bipartite entangler random unitary gate entanglement

来源：评论

学校读者我要写书评

暂无评论

Shape Matching Optimization via Atomic Potential Function and Artificial Bee Colony Algorithms with Various Search Strategies

Shape Matching Optimization via Atomic Potential Function an...

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： Bai Li Hongxin Cao Mandong Hu Changjun Zhou College of Control Science and Engineering Zhejiang University Hangzhou China Zhejiang University Hangzhou Zhejiang CN College of Software Technique Qingdao University Qingdao China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian China

ISBN: (纸本)9781467395885

Visual shape matching is a critical topic in pattern recognition applications. Atomic potential matching (APM) model is a relatively new shape matching methodology inspired by potential field attractions. Compared to the conventional edge potential function model, APM not only encourages the right matching parts through attraction, but also repels the wrong matching parts. This feature enables APM to cope with targets that hide in the intricate background. This study comprehensively investigates the convergence performances of various state-of-the-art artificial bee colony (ABC) algorithms in shape matching problems on the basis of APM framework. Repeated simulations are conducted to evaluate the optimization abilities of the concerned ABC variants and experimental results indicate that the prevailing remedies for the conventional ABC algorithm, especially efforts made in the local exploitation phase, are not efficacious to promote optimization capability. Explanations regarding the comparative results are provided as well.

关键词： Shape Optimization Image edge detection Algorithm design and analysis Aircraft Visualization mathematical model

来源：评论

学校读者我要写书评

暂无评论

Migration of CUDA Program Based on a Divide-and-Conquer Method

Migration of CUDA Program Based on a Divide-and-Conquer Meth...

引用

IEEE International Conference on Computational Science and engineering, CSE

作者： Nan Li Jianmin Pang Zheng Shan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan China

ISBN: (纸本)9781479979820

Porting CUDA program to other heterogeneous and many-core platform especially native processor is very meaningful for extending the range of the CUDA application, taking advantage of many-core on target platform and supporting national industries. Traditional binary translation technique is not competent to this task. On the point of software reverse engineering, it is feasible to design a new migration framework to port CUDA program in which the host-end codes and device-end codes are translated separately based on a method of Divide-and-Conquer. In the course of migration, the solutions of several key problems are described emphatically such as the extraction of device-end codes, the mapping of computing model and storage model, synchronization barrier and instruction translation. The experimental result validates the system's accuracy.

关键词： Graphics processing units Synchronization Instruction sets Computational modeling Kernel Computer architecture Programming

来源：评论

学校读者我要写书评

暂无评论

Measurement of a Topological Edge Invariant in a Microwave Network

引用

Physical Review X 2015年第1期5卷 011012-011012页

作者： Wenchao Hu Jason C. Pillay Kan Wu Michael Pasek Perry Ping Shum Y. D. Chong Centre for Disruptive Photonic Technologies Nanyang Technological University Singapore 637371 Singapore Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University Singapore 637371 Singapore State Key Laboratory of Advanced Optical Communication Systems and Networks Department of Electronic Engineering Shanghai Jiao Tong University Shanghai 200240 China

We report on the measurement of topological invariants in an electromagnetic topological insulator analog formed by a microwave network, consisting of the winding numbers of scattering matrix eigenvalues. The experiment can be regarded as a variant of a topological pump, with nonzero winding implying the existence of topological edge states. In microwave networks, unlike most other systems exhibiting topological insulator physics, the winding can be directly observed. The effects of loss on the experimental results, and on the topological edge states, are discussed.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Low-lying structure and shape evolution in neutron-rich Se isotopes

引用

Physical Review C 2017年第4期95卷 041302(R)-041302(R)页

作者： S. Chen P. Doornenbal A. Obertelli T. R. Rodríguez G. Authelet H. Baba D. Calvet F. Château A. Corsi A. Delbart J.-M. Gheller A. Giganon A. Gillibert V. Lapoux T. Motobayashi M. Niikura N. Paul J.-Y. Roussé H. Sakurai C. Santamaria D. Steppenbeck R. Taniuchi T. Uesaka T. Ando T. Arici A. Blazhev F. Browne A. M. Bruce R. Caroll L. X. Chung M. L. Cortés M. Dewald B. Ding F. Flavigny S. Franchoo M. Górska A. Gottardo A. Jungclaus J. Lee M. Lettmann B. D. Linh J. Liu Z. Liu C. Lizarazo S. Momiyama K. Moschner S. Nagamine N. Nakatsuka C. R. Nita C. Nobs L. Olivier R. Orlandi Z. Patel Zs. Podolyak M. Rudigier T. Saito C. Shand P.-A. Söderström I. Stefan V. Vaquero V. Werner K. Wimmer Z. Xu School of Physics and State Key Laboratory of Nuclear Physics and Technology Peking University Beijing 100871 China RIKEN Nishina Center Wako Saitama 351-0198 Japan IRFU CEA Université Paris-Saclay 91191 Gif-sur-Yvette France Departamento de Física Teórica Universidad Autónoma de Madrid 28049 Madrid Spain Department of Physics University of Tokyo 7-3-1 Hongo Bunkyo Tokyo 113-0033 Japan GSI Helmholtzzentrum für Schwerionenforschung GmbH 64291 Darmstadt Germany Institut für Kernphysik Universität zu Köln 50923 Köln Germany School of Computing Engineering and Mathematics University of Brighton Brighton BN2 4GJ United Kingdom Department of Physics University of Surrey Guildford GU2 7XH United Kingdom Institute for Nuclear Science and Technique VINATOM 179 Hoang Quoc Viet Road Cau Giay Hanoi Vietnam Institut für Kernphysik Technische Universität Darmstadt 64289 Darmstadt Germany Institute of Modern Physics Chinese Academy of Sciences Lanzhou 730000 China Institut de Physique Nucléaire CNRS-IN2P3 Université Paris-Sud Université Paris-Saclay 91406 Orsay Cedex France Instituto de Estructura de la Materia CSIC 28006 Madrid Spain Department of Physics The University of Hong Kong Pokfulam Hong Kong Department of Physics Faculty of Science Kyoto University Kyoto 606-8502 Japan Horia Hulubei National Institute of Physics and Nuclear Engineering (IFIN-HH) R-077125 Bucharest Romania Advanced Science Research Center Japan Atomic Energy Agency Tokai Ibaraki 319-1195 Japan

Neutron-rich Se88,90,92,94 isotopes were studied via in-beam γ-ray spectroscopy after nucleon removal reactions at intermediate energies at the Radioactive Isotope Beam Factory. Based on γ−γ coincidence analysis, low-lying excitation level schemes are proposed for these nuclei, including the 21+, 41+ states and 22+ states at remarkably low energies. The low-lying 22+ states, along with other features, indicate triaxiality in these nuclei. The experimental results are in good overall agreement with self-consistent beyond-mean-field calculations based on the Gogny D1S interaction, which suggests both triaxial degree of freedom and shape coexistence playing important roles in the description of intrinsic deformations in neutron-rich Se isotopes.

关键词： Collective levels Collective models Nuclear structure & decays 90 ≤ A ≤ 149 Radioactive beams

来源：评论

学校读者我要写书评

暂无评论

Secondary structure element alignment kernel method for prediction of protein structural classes

引用

Current Bioinformatics 2014年第3期9卷 253-257页

作者： Han, Guo-Sheng Yu, Zu-Guo Anh, Vo Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q 4001 Australia

In this paper, we aim at predicting protein structural classes for low-homology data sets based on predicted secondary structures. We propose a new and simple kernel method, named as SSEAKSVM, to predict protein structural classes. The secondary structures of all protein sequences are obtained by using the tool PSIPRED and then a linear kernel on the basis of secondary structure element alignment scores is constructed for training a support vector machine classifier without parameter adjusting. Our method SSEAKSVM was evaluated on two low-homology datasets 25PDB and 1189 with sequence homology being 25% and 40%, respectively. The jackknife test is used to test and compare our method with other existing methods. The overall accuracies on these two data sets are 86.3% and 84.5%, respectively, which are higher than those obtained by other existing methods. Especially, our method achieves higher accuracies (88.1% and 88.5%) for differentiating the α+ β class and the α/β class compared to other methods. This suggests that our method is valuable to predict protein structural classes particularly for low-homology protein sequences. The source code of the method in this paper can be downloaded at http://***/myphp/math/research/source/SSEAK_source_***. © 2014 Bentham Science Publishers.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

引用

Current Bioinformatics 2014年第3期9卷 218-227页

作者： Chen, Xiao-Su Yu, Zu-Guo Zheng, Juan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 BrisbaneQ 4001 Australia School of Information and Engineering Xiangtan University Hunan411105 China

Whole genome sequences are generally accepted as excellent tools for studying evolutionary relationships. Due to the problems caused by the uncertainty in alignment, existing tools for phylogenetic analysis based on multiple alignments could not be directly applied to the whole-genome comparison and phylogenomic studies. There has been a growing interest in alignment-free methods for phylogenetic analysis using complete genome data. The "distances" used in these alignment-free methods are not proper distance metrics in the strict mathematical sense. In this study, we first review them in a more general frame — dissimilarity. Then we propose some new dissimilarities for phylogenetic analysis. Last three genome datasets are employed to evaluate these dissimilarities from a biological point of view. © 2014 Bentham Science Publishers.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Cross-platform parallel programming in PARRAY: A case study

Cross-platform parallel programming in PARRAY: A case study

引用

11th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2014

作者： Cui, Xiang Li, Xiaowen Chen, Yifeng HCST Key Lab. School of EECS Peking University Beijing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China Air Defense Forces Academy Zhengzhou China College of Computer and Information Engineering Henan University Kaifeng China

ISBN: (纸本)9783662449165

PARRAY (or Parallelizing ARRAYs) is an extension of C language that supports system-level succinct programming for heterogeneous parallel systems. Parray extends mainstream C programming with novel array types. This leads to shorter, more portable and maintainable parallel codes, while the programmer still has control over performance-related features necessary for deep manual optimization. This paper uses the case study on stepwise program refinement of matrix transposition to illustrate the basic techniques of PARRAY programming. © 2014 IFIP International Federation for Information Processing.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Cross-Speed Gait Recognition Using Speed-Invariant Gait Templates and Globality-Locality Preserving Projections

引用

IEEE Transactions on Information Forensics and Security 2015年第10期10卷 2071-2083页

作者： Huang, S. Elgammal, A. Lu, J. Yang, D. School of Software Engineering Chongqing University Chongqing401331 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing400044 China Department of Computer Science Rutgers University PiscatawayNJ08854 United States Advanced Digital Sciences Center Singapore138632 Singapore

We present a novel manifold-based approach for cross-speed gait recognition. In our approach, the walking action is considered as residing on a manifold, in the feature space, that is homomorphic to a unit circle. We employ thin plate spline (TPS) kernel-based radial basis function (RBF) interpolation to fit such manifold. TPS kernel-based RBF interpolation separates the learned coefficients into an affine component and a nonaffine component, which, respectively, encodes the dynamic and static characteristics of the gait manifold. We introduce the use of the nonaffine component as a cross-speed gait representation, and denote it speed invariant gait template (SIGT). We also propose an enhanced locality preserving projections (LPP) algorithm named globality LPP (GLPP) for reducing the dimension of SIGT. In GLPP, the graph Laplacians of intrasubject part and intersubjects part are separately constructed, and then to combine as a new graph Laplacian. Finally, a manifold learning-based classifier named normalized hypergraph classifier is employed for classification. Experimental results on two gait databases demonstrate the effectiveness of our proposed approach in comparison with the state-of-the-art gait recognition methods. © 2005-2012 IEEE.

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

Crowdsourcing with Tullock contests: A new perspective

Crowdsourcing with Tullock contests: A new perspective

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Tie Luo Salil S. Kanhere Hwee-Pink Tan Fan Wu Hongyi Wu Institute for Infocomm Research A STAR Singapore School of Computer Science and Engineering The University of New South Wales Australia Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China Center for Advanced Computer Studies University of Louisiana at Lafayette USA

Incentive mechanisms for crowdsourcing have been extensively studied under the framework of all-pay auctions. Along a distinct line, this paper proposes to use Tullock contests as an alternative tool to design incentive mechanisms for crowdsourcing. We are inspired by the conduciveness of Tullock contests to attracting user entry (yet not necessarily a higher revenue) in other domains. In this paper, we explore a new dimension in optimal Tullock contest design, by superseding the contest prize - which is fixed in conventional Tullock contests - with a prize function that is dependent on the (unknown) winner's contribution, in order to maximize the crowdsourcer's utility. We show that this approach leads to attractive practical advantages: (a) it is well-suited for rapid prototyping in fully distributed web agents and smartphone apps; (b) it overcomes the disincentive to participate caused by players' antagonism to an increasing number of rivals. Furthermore, we optimize conventional, fixed-prize Tullock contests to construct the most superior benchmark to compare against our mechanism. Through extensive evaluations, we show that our mechanism significantly outperforms the optimal benchmark, by over three folds on the crowdsourcer's utility cum profit and up to nine folds on the players' social welfare.

关键词： Crowdsourcing Benchmark testing Bayes methods Computers Cost accounting Conferences Games

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：