检索结果-南通市图书馆

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 10012., 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 100049, 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 {2. of Integrated Services Network Xidian University Xi’an 710071 China state key {2. of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China state key {2. 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 10012.,china 2.state key laboratory of networking and switching technology,beijing University of Posts and {12.-{13.,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 100049,china 1. College of Computer Science and technology Beijing University of Technology Beijing 100124 China 3. state key {2. of Integrated Services Network Xidian University Xi’an 710071 China 4. state key {2. of Information Security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China 2. state key {2. 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

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

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of Posts and tele{2. 2010年第3期17卷 110-117页

作者： LIU Chuan-chang state key {2. of networking and switching technology, beijing University of Posts and telecommunications, beijing 100876, china [a] state key {2. 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

Practical conditions of signal space alignment for generalized MIMO Y channel

在线全文

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2012年第10期55卷 2171-2182页

作者： SHE JiaJu 1,2.CHEN ShanZhi 1,2.HU Bo 1,WANG YingMin 2.& SU Xin 2.1 state key {2. of networking and switching technology,beijing University of Posts and telecommunications,beijing 100876,china 2.state key {2. of Wireless Mobile communications,china Academy of telecommunications technology,beijing 100191,china 1. state key {2. of networking and switching technology Beijing University of Posts and Telecommunications Beijing 100876 China2. State Key Laboratory of Wireless Mobile Communications China Academy of Telecommunications Technology Beijing 100191 China

This paper proposes a generalization for applications of signal space alignment(SSA) in a generalized multiple input multiple output(MIMO) Y channel with K(K 2. nodes and an intermediate *** on that generalization,a method is introduced to determine the practical conditions for *** first study the generalized MIMO Y channel model with general signal demands;then,the degrees of freedom(DoF) achieved are given and are proved using *** SSA could decrease the number of antennas at the relay,it places new restrictions on the numbers of antennas at the *** then introduce a method to compare the models with and without SSA network coding(SSA-NC),mainly from the perspective of the total number of antennas *** results show that if each node must be able to exchange signals with all others,the model with SSA will definitely use more antennas to supply the same DoF,when K > *** it is not necessary for every node to exchange signals with all others,the comparison can still be made by using the method introduced *** a result,the conditions under which SSA-NC is needed are presented.

关键词： Signal space alignment MIMO Y channel degrees of freedom number of antennas

Modified chaotic ant swarm to function optimization

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of china Universities of Posts and tele{2. 2009年第1期16卷 58-63页

作者： LI Yu-ying , WEN Qiao-yan, LI Li-xiang state key {2. of networking and switching technology, beijing University of Posts and telecommunications, beijing 100876, china [a]state key {2. of networking and switching technology beijing University of Posts and tele{2. beijing 100876 china

The chaotic ant swarm algorithm （CAS） is an optimization algorithm based on swarm intelligence theory, and it is inspired by the chaotic and self-organizing behavior of the ants in nature. Based on the analysis of the properties of the CAS, this article proposes a variation on the CAS called the modified chaotic ant swarm （MCAS）, which employs two novel strategies to significantly improve the performance of the original algorithm. This is achieved by restricting the variables to search ranges and making the global best ant to learn from different ants＇ best information in the end. The simulation of the MCAS on five benchmark functions shows that the MCAS improves the precision of the solution.

关键词： chaotic ant swarm benchmark functions modified chaotic ant swarm swarm intelligence

Automatic composition of information-providing web services based on query rewriting

在线全文

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2012年第11期55卷 2428-2444页

作者： ZHAO WenFeng,LIU ChuanChang & CHEN JunLiang state key {2. of networking and switching technology,beijing University of Posts and telecommunications,beijing 100876,china 1. state key {2. of networking and switching technology Beijing University of Posts and Telecommunications Beijing 100876 China

Compared with normal web services,information-providing services have unique features that have seldom been considered in existing research on the automatic composition of web *** this paper,we present a simple,yet well-formed,semantic-based capability model for information-providing web services,which can express such features as not modifying the world state and not requiring all input/output parameters to be supplemented with class information as *** then present a corresponding automatic composition method derived from a query rewriting algorithm,MiniCon,used in the data integration *** method adequately utilizes previous features,enables primitive semantic reasoning,and can generate executable BPEL scripts *** of the method is complementary to traditional search-based *** on a typical type of problem show that the method is usable in practice.

关键词： web services automatic composition query rewriting data integration ontology semantic web

Dynamic weighted random load balancing algorithm for SIP application server

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of china Universities of Posts and tele{2. 2009年第4期16卷 67-70页

作者： TENG Sheng-bo,LIAO Jian-xin,ZHU Xiao-min state key {2. of networking and switching technology,beijing University of Posts and telecommunications,beijing 100876,china [a]state key {2. of networking and switching technology beijing University of Posts and tele{2. beijing 100876 china

A new load balancing algorithm named dynamic weighed random （DWR） algorithm for the session initiation protocol （SIP） application server cluster is proposed. It uses weighted hashing random algorithm that supports dialog in the SIP protocol to distribute messages. The weight of each server is dynamic adaptive with feedback mechanism. DWR insures that the cluster is balanced, and it performs better than the limited resource vector （LRV） algorithm and minimum sessions first （MSF） algorithm.

关键词： dynamic load balancing weighted random sip application server

Decoding algorithms for shortened-extended turbo product codes in WiMAX systems

在线全文

学校读者我要写书评

暂无评论

Science in china(Series F) 2009年第12期52卷 2415-2423页

作者： XU ChangLong1,3,4, YANG Wei1,2.& YE WeiChen4 1 state key {2. of networking and switching technology, beijing University of Posts and telecommunications, beijing 100044, china 2.state key {2. of Rail Traffic Control and Safety, beijing Jiaotong University, beijing 100044, china 3 National Mobile communications Research {2., Southeast University, Nanjing 2.0096, china 4 Intel Corporation, beijing Kerry Center, Guanghua Road 1, beijing 10002., china state key {2. of networking and switching technology Beijing University of Posts and Telecommunications Beijing 100044 China state key {2. of Rail Traffic Control and Safety Beijing Jiaotong University Beijing 100044 China National Mobile communications Research laboratory Southeast University Nanjing 210096 China Intel Corporation Beijing Kerry Center Guanghua Road 1 Beijing 100020 China

The component codes of turbo product codes in WiMAX systems are extended Hamming codes and single parity check codes as well as their shortened forms, In this paper, three novel iterative decoding algorithms based on Chase, MAP algorithms and their combination are proposed for shortened-extended turbo product codes. The iterative decoding algorithm based on Chase algorithm is proposed to reduce the decoding complexity without any performance loss. An efficient MAP algorithm is then proposed to decode the component codes of shortened single parity check codes and shortened-extended Hamming codes. A comprehensive performance comparison of the proposed decoding schemes is conducted for three typical classes of turbo product codes in WiMAX OFDMA systems. The suitable decoding algorithms are recommended for different classes based on the simulation results.

关键词： block code product code iterative decoding

Context-aware end-to-end QoS diagnosis and quantitative guarantee based on Bayesian network

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of Posts and tele{2. 2010年第6期17卷 106-112页

作者： LIN Xiang-tao,CHNEG Bo,CHEN Jun-liang,QIAO Xiu-quan state key {2. of networking and switching technology,beijing University of Posts and telecommunications,beijing 100876,china [a] state key {2. of networking switching technology Beijing University of Posts telecommunications Beijing 100876 China

To support quality of service （QoS） management on current Internet working with best effort,we bring forth a systematic approach for end-to-end QoS diagnosis and quantitative guarantee. For QoS diagnosis,we take contexts of a service into consideration in a comprehensive way that is realized by exploiting causal relationships between a QoS metric and its contexts with the help of Bayesian network （BN） structure learning. Context discretization algorithm and node ordering algorithm are proposed to facilitate BN structure learning. The QoS metric is diagnosed to be causally related to its causal contexts,and the QoS metric can be quantitatively guaranteed by its causal contexts. For quantitative QoS guarantee,those causal relationships are first modeled quantitatively by BN parameter learning. Then,the QoS metric is guaranteed to certain value with a probability given its causal contexts tuned to suitable values,that is,quantitative QoS guarantee is reached. Simulations with three sequential stages：context discretization,QoS diagnosis and quantitative QoS guarantee,on a peer-to-peer （P2.） network,are discussed and our approach is validated to be effective.

关键词： context context discretization QoS qualitative diagnosis QoS quantitative guarantee Bayesian network