The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algori...The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algorithm and the characteristic polynomial algorithm,which are feasible but not optimized.In this paper,these two algorithms are modified in procedure to get faster execution speed.The complexity of modified algorithms is still,but the number of required operations is reduced,so the execution speed is improved.Besides,a new algorithm relevant with eigenvalues of matrix in representation of Chebyshev polynomials is also presented,which can further reduce the running time of that computation if certain conditions are satisfied.Software implementations of these algorithms are realized,and the running time comparison is given.Finally an efficient scheme for the computation of Chebyshev polynomial over finite field is presented.展开更多
In this paper a feedback control mechanism of Quality of Service （QoS） management is proposed. By measuring and monitoring the operational information of the IP telecommunication network, the feedback control-loops ...In this paper a feedback control mechanism of Quality of Service （QoS） management is proposed. By measuring and monitoring the operational information of the IP telecommunication network, the feedback control-loops tune the network according to the trends of the traffic characteristics in order to gain a favorable network status. With theoretical analysis, it is concluded that the QoS o fan arbitrary k-class flow can be guaranteed when the capacity of the k-class traffic is not fully filled. Thus by distributing the bandwidth of the egress bottleneck link among the ingress links, the congestion can be relieved. Moreover, the capacity of each traffic class that shares the same link affects one another. Therefore, the feedback control also aims at adjusting the capacity proportion among the traffic classes. In order to realize the goals, three feedback control-loops are designed in the QoS management system. A CORBA-based implementation is deployed on the testbed .展开更多
Social tagging is one of the most important characteristics of Web 2.0 services, and social tagging systems （STS） are becoming more and more popular for users to annotate, organize and share items on the Web. Moreov...Social tagging is one of the most important characteristics of Web 2.0 services, and social tagging systems （STS） are becoming more and more popular for users to annotate, organize and share items on the Web. Moreover, online social network has been incorporated into social tagging systems. As more and more users tend to interact with real friends on the Web, personalized user recommendation service provided in social tagging systems is very appealing. In this paper, we propose a personalized user recommendation method, and our method handles not only the users＇ interest networks, but also the social network information. We empirically show that our method outperforms a state-of-the-art method on real dataset from Last.fro dataset and Douban.展开更多
基金supported by the National Basic Research Program of China (2009CB320505)the National Natural Science Foundation of China (61002011)
文摘The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algorithm and the characteristic polynomial algorithm,which are feasible but not optimized.In this paper,these two algorithms are modified in procedure to get faster execution speed.The complexity of modified algorithms is still,but the number of required operations is reduced,so the execution speed is improved.Besides,a new algorithm relevant with eigenvalues of matrix in representation of Chebyshev polynomials is also presented,which can further reduce the running time of that computation if certain conditions are satisfied.Software implementations of these algorithms are realized,and the running time comparison is given.Finally an efficient scheme for the computation of Chebyshev polynomial over finite field is presented.
基金This work is supported by National Natural Science Foundation of China (90204003) , National "863" High Technology Projects of China(2003AA121220 ,2002AA103063) , RFDR(20010013003) and Excellent Young Teachers Programof MOE,China.
文摘In this paper a feedback control mechanism of Quality of Service （QoS） management is proposed. By measuring and monitoring the operational information of the IP telecommunication network, the feedback control-loops tune the network according to the trends of the traffic characteristics in order to gain a favorable network status. With theoretical analysis, it is concluded that the QoS o fan arbitrary k-class flow can be guaranteed when the capacity of the k-class traffic is not fully filled. Thus by distributing the bandwidth of the egress bottleneck link among the ingress links, the congestion can be relieved. Moreover, the capacity of each traffic class that shares the same link affects one another. Therefore, the feedback control also aims at adjusting the capacity proportion among the traffic classes. In order to realize the goals, three feedback control-loops are designed in the QoS management system. A CORBA-based implementation is deployed on the testbed .
基金supported by the National Basic Research Program of China (2009CB320505)the Hi-Tech Research and Development Program of China (20011AA 01A102)+2 种基金the Nuclear High-Based Project of China (2012ZX01039004-008)the National Nature Science Foundation of China (61002011)the Electronic Information Industry Development Fund Program 'The Development and Industrialization of Key Supporting Software in Cloud Computing (Cloud Storage Service)'
文摘Social tagging is one of the most important characteristics of Web 2.0 services, and social tagging systems （STS） are becoming more and more popular for users to annotate, organize and share items on the Web. Moreover, online social network has been incorporated into social tagging systems. As more and more users tend to interact with real friends on the Web, personalized user recommendation service provided in social tagging systems is very appealing. In this paper, we propose a personalized user recommendation method, and our method handles not only the users＇ interest networks, but also the social network information. We empirically show that our method outperforms a state-of-the-art method on real dataset from Last.fro dataset and Douban.
