In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mat...In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mathematical problems. Combining the E1Gamal scheme based on the discrete logarithm problem and the OSS scheme based on the factoring problem, a digital signature scheme based on these two cryptographic assumptions is proposed. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring problem and the discrete logarithm problem. So the signature scheme will be still secure under the situation that any one of the two hard-problems is solved. Compared with previous schemes, the proposed scheme is more efficient in terms of space storage, signature length and computation complexities.展开更多
A new method for combining features via importance-inhibition analysis (IIA) is described to obtain more effective feature combination in learning question classification. Features are combined based on the inhibiti...A new method for combining features via importance-inhibition analysis (IIA) is described to obtain more effective feature combination in learning question classification. Features are combined based on the inhibition among features as well as the importance of individual features. Experimental results on the Chinese questions set show that, the IIA method shows a gradual increase in average and maximum accuracies at all feature combinations, and achieves great improvement over the importance analysis(IA) method on the whole. Moreover, the IIA method achieves the same highest accuracy as the one by the exhaustive method, and further improves the performance of question classification.展开更多
This paper discusses a fictitious domain method for the linear Dirichlet problem and its applications to the generalized Stokes problem. This method treats Dirichlet boundary condit ion via a Lagrange multiplier tec...This paper discusses a fictitious domain method for the linear Dirichlet problem and its applications to the generalized Stokes problem. This method treats Dirichlet boundary condit ion via a Lagrange multiplier technique and is well suited to the no-slip bound ary condition in viscous flow problems. In order to improve the accuracy of solu tions, meshes are refined according to the a posteriori error estimate. The mini -element discretization is applied to solve the generalized Stokes problem. Fin ally, some numerical results to validate this method are presented for partial d ifferential equations with Dirichlet boundary condition.展开更多
The existence of solutions for singular nonlinear two point boundary value problems subject to Sturm Liouville boundary conditions with p Laplacian operators is studied by the method of upper and lower solution...The existence of solutions for singular nonlinear two point boundary value problems subject to Sturm Liouville boundary conditions with p Laplacian operators is studied by the method of upper and lower solutions. The proof is based on an application of Schauder’s fixed point theorem to a modified problem whose solutions are that of the original one. At the same time, Arzela Ascoli theorem is used to prove that the defined operator N is a compact map.展开更多
In this paper we investigate the existence of positive solution for a class of fourth_order superlinear semipositone eigenvalue problems. This class of problems usually describes the deformation of the elastic beam wh...In this paper we investigate the existence of positive solution for a class of fourth_order superlinear semipositone eigenvalue problems. This class of problems usually describes the deformation of the elastic beam whose both end_points are fixed.展开更多
To improve question answering (QA) performance based on real-world web data sets,a new set of question classes and a general answer re-ranking model are defined.With pre-defined dictionary and grammatical analysis,t...To improve question answering (QA) performance based on real-world web data sets,a new set of question classes and a general answer re-ranking model are defined.With pre-defined dictionary and grammatical analysis,the question classifier draws both semantic and grammatical information into information retrieval and machine learning methods in the form of various training features,including the question word,the main verb of the question,the dependency structure,the position of the main auxiliary verb,the main noun of the question,the top hypernym of the main noun,etc.Then the QA query results are re-ranked by question class information.Experiments show that the questions in real-world web data sets can be accurately classified by the classifier,and the QA results after re-ranking can be obviously improved.It is proved that with both semantic and grammatical information,applications such as QA, built upon real-world web data sets, can be improved,thus showing better performance.展开更多
In this paper,a nonconforming rectangular plate element,the modified incomplete biquadratic plate element,is considered. The asympotic optimal L~∞-error estimate is obtained for the plate bending problem. This proof ...In this paper,a nonconforming rectangular plate element,the modified incomplete biquadratic plate element,is considered. The asympotic optimal L~∞-error estimate is obtained for the plate bending problem. This proof is based on the method of regularized Green's function and 'the trick of auxiliary element'.展开更多
This paper focuses on the 2-median location improvement problem on tree networks and the problem is to modify the weights of edges at the minimum cost such that the overall sum of the weighted distance of the vertices...This paper focuses on the 2-median location improvement problem on tree networks and the problem is to modify the weights of edges at the minimum cost such that the overall sum of the weighted distance of the vertices to the respective closest one of two prescribed vertices in the modified network is upper bounded by a given value.l1 norm and l∞norm are used to measure the total modification cost. These two problems have a strong practical application background and important theoretical research value. It is shown that such problems can be transformed into a series of sum-type and bottleneck-type continuous knapsack problems respectively.Based on the property of the optimal solution two O n2 algorithms for solving the two problems are proposed where n is the number of vertices on the tree.展开更多
The corresponding solution for a class of disturbed KdV equation is considered using the analytic method. From the generalized variational iteration theory, the problem of solving soliton for the corresponding equatio...The corresponding solution for a class of disturbed KdV equation is considered using the analytic method. From the generalized variational iteration theory, the problem of solving soliton for the corresponding equation translates into the problem of variational iteration. And then the approximate solution of the soliton for the equation is obtained.展开更多
Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimiza- tion problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. ...Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimiza- tion problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization (PSO) algorithm is developed for nonlinear optimization problems with both contin- uous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem.展开更多
基金The National Natural Science Foundation of China(No60402019)the Science Research Program of Education Bureau of Hubei Province (NoQ200629001)
文摘In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mathematical problems. Combining the E1Gamal scheme based on the discrete logarithm problem and the OSS scheme based on the factoring problem, a digital signature scheme based on these two cryptographic assumptions is proposed. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring problem and the discrete logarithm problem. So the signature scheme will be still secure under the situation that any one of the two hard-problems is solved. Compared with previous schemes, the proposed scheme is more efficient in terms of space storage, signature length and computation complexities.
基金The National Natural Science Foundation of China(No.61003112,61170181)the Open Research Fund of State Key Laboratory for Novel Softw are Technology of China(No.KFKT2010B02)the Key Project of Natural Science Research for Anhui Colleges of China(No.KJ2011A048)
文摘A new method for combining features via importance-inhibition analysis (IIA) is described to obtain more effective feature combination in learning question classification. Features are combined based on the inhibition among features as well as the importance of individual features. Experimental results on the Chinese questions set show that, the IIA method shows a gradual increase in average and maximum accuracies at all feature combinations, and achieves great improvement over the importance analysis(IA) method on the whole. Moreover, the IIA method achieves the same highest accuracy as the one by the exhaustive method, and further improves the performance of question classification.
文摘This paper discusses a fictitious domain method for the linear Dirichlet problem and its applications to the generalized Stokes problem. This method treats Dirichlet boundary condit ion via a Lagrange multiplier technique and is well suited to the no-slip bound ary condition in viscous flow problems. In order to improve the accuracy of solu tions, meshes are refined according to the a posteriori error estimate. The mini -element discretization is applied to solve the generalized Stokes problem. Fin ally, some numerical results to validate this method are presented for partial d ifferential equations with Dirichlet boundary condition.
文摘The existence of solutions for singular nonlinear two point boundary value problems subject to Sturm Liouville boundary conditions with p Laplacian operators is studied by the method of upper and lower solutions. The proof is based on an application of Schauder’s fixed point theorem to a modified problem whose solutions are that of the original one. At the same time, Arzela Ascoli theorem is used to prove that the defined operator N is a compact map.
文摘In this paper we investigate the existence of positive solution for a class of fourth_order superlinear semipositone eigenvalue problems. This class of problems usually describes the deformation of the elastic beam whose both end_points are fixed.
基金Microsoft Research Asia Internet Services in Academic Research Fund(No.FY07-RES-OPP-116)the Science and Technology Development Program of Tianjin(No.06YFGZGX05900)
文摘To improve question answering (QA) performance based on real-world web data sets,a new set of question classes and a general answer re-ranking model are defined.With pre-defined dictionary and grammatical analysis,the question classifier draws both semantic and grammatical information into information retrieval and machine learning methods in the form of various training features,including the question word,the main verb of the question,the dependency structure,the position of the main auxiliary verb,the main noun of the question,the top hypernym of the main noun,etc.Then the QA query results are re-ranked by question class information.Experiments show that the questions in real-world web data sets can be accurately classified by the classifier,and the QA results after re-ranking can be obviously improved.It is proved that with both semantic and grammatical information,applications such as QA, built upon real-world web data sets, can be improved,thus showing better performance.
文摘In this paper,a nonconforming rectangular plate element,the modified incomplete biquadratic plate element,is considered. The asympotic optimal L~∞-error estimate is obtained for the plate bending problem. This proof is based on the method of regularized Green's function and 'the trick of auxiliary element'.
基金The National Natural Science Foundation of China(No.10801031)
文摘This paper focuses on the 2-median location improvement problem on tree networks and the problem is to modify the weights of edges at the minimum cost such that the overall sum of the weighted distance of the vertices to the respective closest one of two prescribed vertices in the modified network is upper bounded by a given value.l1 norm and l∞norm are used to measure the total modification cost. These two problems have a strong practical application background and important theoretical research value. It is shown that such problems can be transformed into a series of sum-type and bottleneck-type continuous knapsack problems respectively.Based on the property of the optimal solution two O n2 algorithms for solving the two problems are proposed where n is the number of vertices on the tree.
基金Supported by the National Natural Science Foundation of China under Grant No. 40876010the Knowledge Innovation Project of Chinese Academy of Sciences under Grant No. KZCX2-YW-Q03-08+3 种基金the R & D Special Fund for Public Welfare Industry (meteorology) under Grant No. GYHY200806010the LASG State Key Laboratory Special Fundthe E-Institutes of Shanghai Municipal Education Commission under Grant No. E03004the Natural Science Foundation of Zhejiang Province under Grant No. Y6090164
文摘The corresponding solution for a class of disturbed KdV equation is considered using the analytic method. From the generalized variational iteration theory, the problem of solving soliton for the corresponding equation translates into the problem of variational iteration. And then the approximate solution of the soliton for the equation is obtained.
基金Supported by the National 863 Project (No. 2003AA412010) and the National 973 Program of China (No. 2002CB312201)
文摘Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimiza- tion problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization (PSO) algorithm is developed for nonlinear optimization problems with both contin- uous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem.