检索结果-南通市图书馆

An efficient quantum secret sharing protocol with orthogonal product states

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2007年第3期50卷 331-338页

作者： YANG YuGuang1,2, WEN QiaoYan3 & ZHU FuChen4.1 School of Computer, beijing university of Technology, beijing 100022, China 2 State Key Laboratory of Information Security, Graduate university of Chinese Academy of Sciences, beijing 100022, China 3 School of Science, beijing university of posts and Telecommunications, beijing 100876, China 4.National Key Laboratory for Modern Communications, Chengdu 61004., China 1. School of Computer Beijing University of Technology Beijing 100022 China 2. State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100022 China 3. School of Science Beijing University of Posts and Telecommunications Beijing 100876 China 4. National Key Laboratory for Modern Communications Chengdu 610041 China

An efficient quantum secret sharing protocol with orthogonal product states in the 33 Hilbert space is presented. The particles in the orthogonal product states form two particle sequences. One sequence is sent to Bob and the other is sent to Charlie after rearranging the particle orders. With the help of Alice, Bob and Charlie make the corresponding local measurement to obtain the information of the or- thogonal product states prepared. This protocol has many distinct features such as great capacity and high efficiency.

关键词： quantum secret sharing orthogonal product state orthogonal measurement

Construction of nonbinary quantum cyclic codes by using graph method

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2005年第6期48卷 693-702页

作者： LIU Tailin1,2,3, WEN Qiaoyan1 & LIU Zihui4.1. School of Science, beijing university of posts and Telecommunications, beijing 100876, China 2. State Key Laboratory of Integrated Services Network, Xidian university, Xi’an 710071,China 3. Shandong Finance Institute, Jinan 250014. China 4. School of Mathematical Sciences, Peking university, beijing 100871, China 1. School of Science Beijing University of Posts and Telecommunications 100876 Beijing China 2. State Key Laboratory of Integrated Services Network Xidian University 710071 Xi’an China 3. Shandong Finance Institute 250014 Jinan China 4. School of Mathematical Sciences Peking University 100871 Beijing China

Using the graph method proposed by Schlingemann and Werner, this paper introduces a technique to construct nonbinary quantum cyclic codes and provides a specific example. We also construct the quantum codes [[8, 2, 4.... 详细信息

关键词： nonbinary quantum stabilizer codes quantum cyclic codes

TWO-AGENT PARETO OPTIMAL COOPERATIVE INVESTMENT IN INCOMPLETE MARKET:AN EQUIVALENT CHARACTERIZATION

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2011年第4期24卷 701-710页

作者： Qing ZHOU School of Science Beijing University of Posts and Telecommunications Beijing 100876 China.

This paper studies the following cooperative investment game with two agents. At the start of the game, both the agents＇ capital are collected. The total capital are then invested according to a certain trading strategy. At a certain time To one agent quits the cooperation and they divide the wealth among themselves. During the remaining period [To, T], the other agent invests his/her capital following a possibly different trading strategy. By stochastic optimization method combined with the theory of Backward Stochastic Differential Equations （BSDEs, for short）, we give an equivalent characterization of the Pareto optimal cooperative strategies.

关键词： Backward stochastic differential equation cooperative investment incomplete market,Pareto optimum stochastic utility.

Search recommendation model based on user search behavior and gradual forgetting collaborative filtering strategy

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of posts and Telecommunications 2010年第3期17卷 110-117页

作者： LIU Chuan-chang State Key Laboratory of Networking and Switching Technology, beijing university of posts and Telecommunications, beijing 100876, China [a] State Key Laboratory of Networking Switching Technology Beijing University of Posts Telecommunications Beijing 100876 China

The existing search engines are lack of the consideration of personalization and display the same search results for different users despite their differences in interesting and purpose. By analyzing user＇s dynamic search behavior, the paper introduces a new method of using a keyword query graph to express user＇s dynamic search behavior, and uses Bayesian network to construct the prior probability of keyword selection and the migration probability between keywords for each user. To reflect the dynamic changes of the user＇s preference, the paper introduces non-lineal gradual forgetting collaborative filtering strategy into the personalized search recommendation model. By calculating the similarity between each two users, the model can do the recommendation based on neighbors and be used to construct the personalized search engine.

关键词： search recommendation model search behavior expression keyword query graph gradual forgetting collaborative filtering

Generllzation of Direct Product and Generation of Sets of Orthogonal Functions

在线全文

学校读者我要写书评

暂无评论

数学研究与评论 1989年第3期 413-422页

作者： Wang Zhongde(beijing university of posts & Telecommunications)

Two new kinds of direct product of matrices are defined. Their properties are investigated. Direct products of matrix and set of continuous functions are also defined. Many complete sets of orthogonal functions, such as those sets given by Walsh [2], Paley [3], Chrestenson[4., and Watari [5], may be generated by these newkinds of direct product. Direct products are also applicable to the generation of sets of piecewise orthogonal functions.

关键词： piecewise symmetric matrices Walsh dimensions applicable diagonal permutation ordering difficulty

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2005年第6期48卷 706-715页

作者： ZHANG Jingfu1, XIE Jingyi2, WANG Chuan1, DENG Zhiwei3, LU Zhiheng4. & LONG Guilu1,5 1. Key Laboratory For Quantum Information and Measurements of MOE, Department of Physics, Tsinghua university, beijing 100084.China 2. Department of Materials Science and Engineering, beijing Normal university, beijing 100875, China 3. Testing and Analytical Center, beijing Normal university, beijing 100875,China 4. Department of Physics, beijing Normal university, beijing 100875, China 5. Key Laboratory For atomic and Molecular Nanosciences, Tsinghua university, beijing 100084.China 1. Key Laboratory For Quantum Information and Measurements of MOE Department of Physics Tsinghua University 100084 Beijing China 2. Department of Materials science and Engineering Beijing Normal University 100875 Beijing China 3. Testing and Analytical Center Beijing Normal University 100875 Beijing China 4. Department of Physics Beijing Normal University 100875 Beijing China 5. Key Laboratory For Atomic and Molecular Nanosciences Tsinghua University 100084 Beijing China

A multiple round quantum dense coding scheme based on the quantum phase estimation algorithm is proposed and implemented in a three qubit nuclear magnetic resonance (NMR) quantum computer. Using an m + 1 qubit system, Bob can transmit one of 2m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for m rounds. The information capacity is enhanced to m + 1 bits as compared to m bits in a classical scheme. The scheme has been demonstrated in NMR system, and the experimental results show a good agreement between theory and experiment.

关键词： quantum dense coding, multiple round, nuclear magnetic resorance

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network

在线全文

学校读者我要写书评

暂无评论

China Communications 2017年第10期14卷 164-179页

作者： Xiaojuan Wang Mei Song Deyu Yuan Xiangru Liu beijing university of posts and Telecommunications Beijing 100876 China People's Public Security university of China Beijing China

Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.

关键词： large-scale network component connectivity virtual network embedding SDN

Quantum threshold group signature

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4.1 College of Computer Science and Technology, beijing university of Technology, beijing 100124. China 2 State Key Laboratory of Integrated Services Network, Xidian university, Xi’an 710071, China 3 State Key Laboratory of Information Security (Graduate university of Chinese Academy of Sciences), beijing 10004., China 4.State Key Laboratory of Networking and Switching Technology, beijing university of posts and Tele-communications, beijing 100876, China College of Computer Science and Technology Beijing University of Technology Beijing 100124 China State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

Threshold proxy quantum signature scheme with threshold shared verification

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

作者： YANG YuGuang1,3,4.& WEN QiaoYan2 1 College of Computer Science and Technology,beijing university of Technology,beijing 100124.China 2 State Key Laboratory of Networking and Switching Technology,beijing university of posts and Tele-communications,beijing 100876,China 3 State Key Laboratory of Integrated Services Network,Xidian university,Xi’an 710071,China 4.State Key Laboratory of Information Security(Graduate university of Chinese Academy of Sciences) ,beijing 10004.,China 1. College of Computer Science and Technology Beijing University of Technology Beijing 100124 China 3. State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China 4. State Key Laboratory of Information Security (Graduate university of Chinese Academy of Sciences) Beijing 100049 China 2. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1 or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1 or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification