Shor proposed a polynomial time algorithm for computing the order of one element in a multiplicative group using a quantum computer. Based on Miller’s randomization, he then gave a factorization algorithm. But the al...Shor proposed a polynomial time algorithm for computing the order of one element in a multiplicative group using a quantum computer. Based on Miller’s randomization, he then gave a factorization algorithm. But the algorithm has two shortcomings, the order must be even and the output might be a trivial factor. Actually, these drawbacks can be overcome if the number is an RSA modulus. Applying the special structure of the RSA modulus, an algorithm is presented to overcome the two shortcomings. The new algorithm improves Shor’s algorithm for factoring RSA modulus. The cost of the factorization algorithm almost depends on the calculation of the order of 2 in the multiplication group.展开更多
Abstract Accurate forecast of future container throughput of a port is very important for its con struction, upgrading, and operation management. This study proposes a transfer forecasting model guided by discrete par...Abstract Accurate forecast of future container throughput of a port is very important for its con struction, upgrading, and operation management. This study proposes a transfer forecasting model guided by discrete particle swarm optimization algorithm （TF-DPSO）. It firstly transfers some related time series in source domain to assist in modeling the target time series by transfer learning technique, and then constructs the forecasting model by a pattern matching method called analog complexing. Finally, the discrete particle swarm optimization algorithm is introduced to find the optimal match between the two important parameters in TF-DPSO. The container throughput time series of two im portant ports in China, Shanghai Port and Ningbo Port are used for empirical analysis, and the results show the effectiveness of the proposed model.展开更多
First, the authors give a GrSbner-Shirshov basis of the finite-dimensional irre- ducible module Vq（λ） of the Drinfeld-Jimbo quantum group Uq（G2） by using the double free module method and the known GrSbner-Shirsh...First, the authors give a GrSbner-Shirshov basis of the finite-dimensional irre- ducible module Vq（λ） of the Drinfeld-Jimbo quantum group Uq（G2） by using the double free module method and the known GrSbner-Shirshov basis of Uq（G2）. Then, by specializing a suitable version of Uq （G2） at q = 1, they get a GrSbner-Shirshov basis of the universal enveloping algebra U（G2） of the simple Lie algebra of type G2 and the finite-dimensional irreducible U（G2）-module V（λ）.展开更多
In this paper we propose a possible explanation to the Fermion mass hierarchy problem by fitting the type-II seesaw mechanism into the Higgs doublet sector, such that their vacuum expectation values are hierarchal. We...In this paper we propose a possible explanation to the Fermion mass hierarchy problem by fitting the type-II seesaw mechanism into the Higgs doublet sector, such that their vacuum expectation values are hierarchal. We extend the Standard Model with two extra Higgs doublets as well as a spontaneously broken U X(1) gauge symmetry. All the fermion Yukawa couplings except that of the top quark are of O(10^(-2)) in our model. Constraints on the parameter space of the model from low energy processes are studied. Besides, the lightest one of the neutral fermion fields, which is introduced to cancel the anomalies of the U(1)X gauge symmetry can be the cold dark matter candidate. We investigate its signature in the dark matter direct detection.展开更多
文摘Shor proposed a polynomial time algorithm for computing the order of one element in a multiplicative group using a quantum computer. Based on Miller’s randomization, he then gave a factorization algorithm. But the algorithm has two shortcomings, the order must be even and the output might be a trivial factor. Actually, these drawbacks can be overcome if the number is an RSA modulus. Applying the special structure of the RSA modulus, an algorithm is presented to overcome the two shortcomings. The new algorithm improves Shor’s algorithm for factoring RSA modulus. The cost of the factorization algorithm almost depends on the calculation of the order of 2 in the multiplication group.
基金partly supported by the Natural Science Foundation of China under Grant Nos.71101100 and 70731160635New Teachers’Fund for Doctor Stations,Ministry of Education under Grant No.20110181120047+5 种基金Excellent Youth Fund of Sichuan University under Grant No.2013SCU04A08China Postdoctoral Science Foundation under Grant Nos.2011M500418,2012T50148 and 2013M530753Frontier and Cross-innovation Foundation of Sichuan University under Grant No.skqy201352Soft Science Foundation of Sichuan Province under Grant No.2013ZR0016Humanities and Social Sciences Youth Foundation of the Ministry of Education of China under Grant No.11YJC870028Selfdetermined Research Funds of CCNU from the Colleges’ Basic Research and Operation of MOE under Grant No.CCNU13F030
文摘Abstract Accurate forecast of future container throughput of a port is very important for its con struction, upgrading, and operation management. This study proposes a transfer forecasting model guided by discrete particle swarm optimization algorithm （TF-DPSO）. It firstly transfers some related time series in source domain to assist in modeling the target time series by transfer learning technique, and then constructs the forecasting model by a pattern matching method called analog complexing. Finally, the discrete particle swarm optimization algorithm is introduced to find the optimal match between the two important parameters in TF-DPSO. The container throughput time series of two im portant ports in China, Shanghai Port and Ningbo Port are used for empirical analysis, and the results show the effectiveness of the proposed model.
基金supported by the National Natural Science Foundation of China(Nos.11061033,11361056)
文摘First, the authors give a GrSbner-Shirshov basis of the finite-dimensional irre- ducible module Vq（λ） of the Drinfeld-Jimbo quantum group Uq（G2） by using the double free module method and the known GrSbner-Shirshov basis of Uq（G2）. Then, by specializing a suitable version of Uq （G2） at q = 1, they get a GrSbner-Shirshov basis of the universal enveloping algebra U（G2） of the simple Lie algebra of type G2 and the finite-dimensional irreducible U（G2）-module V（λ）.
基金Supported in part by the Wisconsin Alumni Research Foundation
文摘In this paper we propose a possible explanation to the Fermion mass hierarchy problem by fitting the type-II seesaw mechanism into the Higgs doublet sector, such that their vacuum expectation values are hierarchal. We extend the Standard Model with two extra Higgs doublets as well as a spontaneously broken U X(1) gauge symmetry. All the fermion Yukawa couplings except that of the top quark are of O(10^(-2)) in our model. Constraints on the parameter space of the model from low energy processes are studied. Besides, the lightest one of the neutral fermion fields, which is introduced to cancel the anomalies of the U(1)X gauge symmetry can be the cold dark matter candidate. We investigate its signature in the dark matter direct detection.
