In this paper, the notion of orthogonal vector-valued wavelet packets of space L2 （R^s, C^n） is introduced. A procedure for constructing the orthogonal vector-valued wavelet packets is presented. Their properties ar...In this paper, the notion of orthogonal vector-valued wavelet packets of space L2 （R^s, C^n） is introduced. A procedure for constructing the orthogonal vector-valued wavelet packets is presented. Their properties are characterized by virtue of time-frequency analysis method, matrix theory and finite group theory, and three orthogonality formulas are obtained. Finally, new orthonormal bases of space L2（R^s,C^n） are extracted from these wavelet packets.展开更多
The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing....The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.展开更多
This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and th...This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and the constraint set in normed linear spaces. The constraint set is the set of weakly effcient solutions of vector equilibrium problem, and perturbed by the perturbation of the criterion mapping to the vector equilibrium problem.展开更多
In this paper, by using Ljusternik＇s theorem and the open mapping theorem of convex process, the author gives necessary conditions for the efficient solution to the vector optimization problems without requiring that...In this paper, by using Ljusternik＇s theorem and the open mapping theorem of convex process, the author gives necessary conditions for the efficient solution to the vector optimization problems without requiring that the ordering cone in the objective space has a nonempty interior.展开更多
基金Foundation item： Supported by the Natural Science Foundation of China（10571113）
文摘In this paper, the notion of orthogonal vector-valued wavelet packets of space L2 （R^s, C^n） is introduced. A procedure for constructing the orthogonal vector-valued wavelet packets is presented. Their properties are characterized by virtue of time-frequency analysis method, matrix theory and finite group theory, and three orthogonality formulas are obtained. Finally, new orthonormal bases of space L2（R^s,C^n） are extracted from these wavelet packets.
基金supported by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant No.2011CDB453,2014CFB440)
文摘The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.
基金supported by the National Natural Science Foundation of China under Grant Nos.1106102311201216and 11471291
文摘This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and the constraint set in normed linear spaces. The constraint set is the set of weakly effcient solutions of vector equilibrium problem, and perturbed by the perturbation of the criterion mapping to the vector equilibrium problem.
基金supported by the Natural Science Foundation of China under Grant No.11061023Natural Science Foundation of Jiangxi Province,China
文摘In this paper, by using Ljusternik＇s theorem and the open mapping theorem of convex process, the author gives necessary conditions for the efficient solution to the vector optimization problems without requiring that the ordering cone in the objective space has a nonempty interior.
