In this article, we consider a backward problem in time of the diffusion equation with local and nonlocal operators. This inverse problem is ill-posed because the solution does not depend continuously on the measured ...In this article, we consider a backward problem in time of the diffusion equation with local and nonlocal operators. This inverse problem is ill-posed because the solution does not depend continuously on the measured data. Inspired by the classical Landweber iterative method and Fourier truncation technique, we develops a modified Landweber iterative regularization method to restore the continuous dependence of solution on the measurement data. Under the a-priori and a-posteriori choice rules for the regularized parameter, the convergence estimates for the regularization method are derived. Some results of numerical simulation are provided to verify the stability and feasibility of our method in dealing with the considered problem.展开更多
We give a neccesary and sufficient condition on a function such that the composition operator (Nemytskij Operator) H defined by acts in the space and satisfies a local Lipschitz condition. And, we prove that ever...We give a neccesary and sufficient condition on a function such that the composition operator (Nemytskij Operator) H defined by acts in the space and satisfies a local Lipschitz condition. And, we prove that every locally defined operator mapping the space of continuous and bounded Wiener p(·)-variation with variable exponent functions into itself is a Nemytskij com-position operator.展开更多
In this paper, we define the localization operator associated with the spherical mean operator, and show that the localization operator is not only bounded, but also in Schatten-Von Neumann class. We also give a trace...In this paper, we define the localization operator associated with the spherical mean operator, and show that the localization operator is not only bounded, but also in Schatten-Von Neumann class. We also give a trace formula when the symbol function is a nonnegative function.展开更多
Let 0<β<1 andΩbe a proper open and non-empty subset of R^(n).In this paper,the object of our investigation is the multilinear local maximal operator Mβ,defined by M_(β)((f))(x)=sup_(Q(∈)xQ∈Fβ)Π_(i=1)^m1/...Let 0<β<1 andΩbe a proper open and non-empty subset of R^(n).In this paper,the object of our investigation is the multilinear local maximal operator Mβ,defined by M_(β)((f))(x)=sup_(Q(∈)xQ∈Fβ)Π_(i=1)^m1/|Q|∫_(Q)|f_(i)(y_(i))|dy_(i),where F_(β)={Q(x,l):x∈Ω,l<βd(x,Ω^(c))},Q=Q(x,l)is denoted as a cube with sides parallel to the axes,and x and l denote its center and half its side length.Two-weight characterizations for the multilinear local maximal operator M_(β)are obtained.A formulation of the Carleson embedding theorem in the multilinear setting is proved.展开更多
In this paper we obtain all other local Nikolskii constants for Baskakov operators by ap- plying a method of asymptotic expansions,give a complete and satisfactory solution of Lehnhoff s open problems[1].
Noiseless linear amplification （NLA）, first proposed by Ralpha et al., is a nondeterministic amplification process which gives gain to the Fock state ｜n） → gn｜n）, with g being the amplification gain. We here gi...Noiseless linear amplification （NLA）, first proposed by Ralpha et al., is a nondeterministic amplification process which gives gain to the Fock state ｜n） → gn｜n）, with g being the amplification gain. We here give a general frame- work for improving the NLA scheme with arbitrary general local unitary operations. We derive the improvement in the amplification gain in 0 1 photon subspace. In particular, we study if the local unitary is composed of sin- gle mode squeezing and coherent displacement operation. Finally, numerical simulations show that local unitary operation could give a further enhancement in the amplification gain as well as the success probability, making the NLA more feasible in future optic quantum communications.展开更多
We investigate entanglement of assistance without and with decoherence using a local non-Hermitian operation, i.e.,parity–time(PT) symmetric operation. First we give the explicit expressions of entanglement of assist...We investigate entanglement of assistance without and with decoherence using a local non-Hermitian operation, i.e.,parity–time(PT) symmetric operation. First we give the explicit expressions of entanglement of assistance for a general W-like state of a three-qubit system under a local parity–time symmetric operation. Then for a famous W state without decoherence, we find that entanglement of assistance shared by two parties can be obviously enhanced with the assistance of the third party by a local parity–time symmetric operation. For the decoherence case, we provide two schemes to show the effects of local parity–time symmetric operation on improvement of entanglement of assistance against amplitude damping noise. We find that for the larger amplitude damping case the scheme of PT symmetric operation performed on one of two parties with the influence of noise is superior to that of PT symmetric operation performed on the third party without the influence of noise in suppressing amplitude damping noise. However, for the smaller amplitude damping case the opposite result is given. The obtained results imply that the local PT symmetric operation method may have potential applications in quantum decoherence control.展开更多
It has been known that two different bipartite unitary operations are perfectly distinguishable by local operations and classical communication(LOCC)when a finite number of queries is allowed.However,it has been a lon...It has been known that two different bipartite unitary operations are perfectly distinguishable by local operations and classical communication(LOCC)when a finite number of queries is allowed.However,it has been a longstanding open problem to determine the optimal number of queries needed to distinguish bipartite unitary operations perfectly by LOCC since 2007.In this paper,we show that if two two-qubit unitary operations are perfectly distinguishable using queries,they are also perfectly distinguishable in the LOCC scenario using queries.As a result,LOCC operations are as powerful as global operations when using constant times the number of queries for the perfect discrimination of two-qubit unitary operations.展开更多
An efficient quantum secure direct communication network protocol with the two-step scheme is proposed by using the Einstein-Podolsky-Rosen （EPR） pair block as the quantum information carrier. The server, say Alice,...An efficient quantum secure direct communication network protocol with the two-step scheme is proposed by using the Einstein-Podolsky-Rosen （EPR） pair block as the quantum information carrier. The server, say Alice, prepares and measures the EPR pairs in the quantum communication and the users perform the four local unitary operations to encode their message. Anyone of the legitimate users can communicate another one on the network securely. Since almost all of the instances in this scheme are useful and each EPR pair can carry two bits of information, the efficiency for qubits and the source capacity both approach the maximal values.展开更多
An effcient multiparty quantum secret sharing scheme is proposed with Greenberger-Horne-Zeilinger （GHZ） states following some ideas in quantum dense coding. The agents take the single-photon measurements on the phot...An effcient multiparty quantum secret sharing scheme is proposed with Greenberger-Horne-Zeilinger （GHZ） states following some ideas in quantum dense coding. The agents take the single-photon measurements on the photons received for eavesdropping check and exploit the four local unitary operations Ⅰ, σx, σx and iσy to code their message. This scheme has the advantage of high capacity as each GHZ state can carry two bits of information. The parties do not need to announce the measuring bases for almost all the photons, which will reduce the classical information exchanged largely. The intrinsic efficiency for qubits and the total effciency both approach the maximal values.展开更多
Recently, several similar protocols [J. Opt. B 4 （2002） 380; Phys. Lett. A 316 （2003） 159; Phys. Lett. A 355 （2006） 285; Phys. Lett. A 336 （2005） 317] for remotely preparing a class of multi-qubit states （i....Recently, several similar protocols [J. Opt. B 4 （2002） 380; Phys. Lett. A 316 （2003） 159; Phys. Lett. A 355 （2006） 285; Phys. Lett. A 336 （2005） 317] for remotely preparing a class of multi-qubit states （i.e, α[0...0〉 ＋β[1... 1〉） were proposed, respectively. In this paper, by applying the controlled-not （CNOT） gate, a new simple protocol is proposed for remotely preparing such class of states. Compared to the previous protocols, both classical communication cost and required quantum entanglement in our protocol are remarkably reduced. Moreover, the difficulty of identifying some quantum states in our protocol is also degraded. Hence our protocol is more economical and feasible.展开更多
We extend the idea of entanglement concentration protocol for pure states （Phys. Rev. Lett. 88, 187903） to the case of entanglement distillation for mixed states. The scheme works only with particle statistics and l...We extend the idea of entanglement concentration protocol for pure states （Phys. Rev. Lett. 88, 187903） to the case of entanglement distillation for mixed states. The scheme works only with particle statistics and local operations, without the need of any other interactions. We show that the maximally entangled state can be distilled out when the initial state is pure, otherwise the entanglement distilled depends on the off-diagonal element of density matrix of the initial state. Because of the requirement for density matrix, the entanglement distilled is always less than one, and this result is the same for both fermionic and bosonic particles. The distillation efficiency is a product of the diagonal elements of the initial state, it takes the maximum 50%, the same as that in the case for pure states.We extend the idea of entanglement concentration protocol for pure states （Phys. Rev. Lett. 88, 187903） to the case of entanglement distillation for mixed states. The scheme works only with particle statistics and local operations, without the need of any other interactions. We show that the maximally entangled state can be distilled out when the initial state is pure, otherwise the entanglement distilled depends on the off-dlagonal element of density matrix of the initial state. Because of the requirement for density matrix, the entanglement distilled is always less than one, and this result is the same for both fermionic and bosonic particles. The distillation effciency is a product of the diagonal elements of the initial state, it takes the maximum 50%, the same as that in the case for pure states.展开更多
We classify biqutrit and triqutrit pure states under stochastic local operations and classical communication. By investigating the right singular vector spaces of the coefticient matrices of the states, we obtain expl...We classify biqutrit and triqutrit pure states under stochastic local operations and classical communication. By investigating the right singular vector spaces of the coefticient matrices of the states, we obtain explicitly two equivalent classes of biqutrit states and twelve equivalent classes of triqutrit states respectively.展开更多
Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so on.In order to solve optimization problems,metaheuristic algorithms are essential.Most of thes...Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so on.In order to solve optimization problems,metaheuristic algorithms are essential.Most of these techniques are influenced by collective knowledge and natural foraging.There is no such thing as the best or worst algorithm;instead,there are more effective algorithms for certain problems.Therefore,in this paper,a new improved variant of a recently proposed metaphorless Runge-Kutta Optimization(RKO)algorithm,called Improved Runge-Kutta Optimization(IRKO)algorithm,is suggested for solving optimization problems.The IRKO is formulated using the basic RKO and local escaping operator to enhance the diversification and intensification capability of the basic RKO version.The performance of the proposed IRKO algorithm is validated on 23 standard benchmark functions and three engineering constrained optimization problems.The outcomes of IRKO are compared with seven state-of-the-art algorithms,including the basic RKO algorithm.Compared to other algorithms,the recommended IRKO algorithm is superior in discovering the optimal results for all selected optimization problems.The runtime of IRKO is less than 0.5 s for most of the 23 benchmark problems and stands first for most of the selected problems,including real-world optimization problems.展开更多
An algorithm for face description and recognition based on multi-resolution with multi-scale local binary pattern （multi-LBP） features is proposed. The facial image pyramid is constructed and each facial image is di...An algorithm for face description and recognition based on multi-resolution with multi-scale local binary pattern （multi-LBP） features is proposed. The facial image pyramid is constructed and each facial image is divided into various regions from which partial and holistic local binary patter （LBP） histograms are extracted. All LBP features of each image are concatenated to a single LBP eigenvector with different resolutions. The dimensionaUty of LBP features is then reduced by a local margin alignment （LMA） algorithm based on manifold, which can preserve the between-class variance. Support vector machine （SVM） is applied to classify facial images. Extensive experiments on ORL and CMU face databases clearly show the superiority of the proposed scheme over some existed algorithms, especially on the robustness of the method against different facial expressions and postures of the subjects.展开更多
A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence ...A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence coding, local collective unitary operations, and entanglement swapping. In this protocol, during the process of trans- mission of particles, the transmitted particles do not carry any secret messages and are transmitted only one time. The protocol has higher source capacity than protocols using symmetric two-dimensional states. The security is ensured by the unitary operations randomly performed on all checking groups before the particle sequence is transmitted and the application of entanglement swapping.展开更多
One of the key problems in collaborative geometric modeling systems is topological entity correspondence when topolog- ical structure of geometry models on collaborative sites changes, ha this article, we propose a so...One of the key problems in collaborative geometric modeling systems is topological entity correspondence when topolog- ical structure of geometry models on collaborative sites changes, ha this article, we propose a solution for tracking topological entity alterations in 3D collaborative modeling environment. We firstly make a thorough analysis and detailed categorization on the altera- tion properties and causations for each type of topological entity, namely topological face and topological edge. Based on collabora- tive topological entity naming mechanism, a data structure called TEST （Topological Entity Structure Tree） is introduced to track the changing history and current state of each topological entity, to embody the relationship among topological entities. Rules and algo- rithms are presented for identification of topological entities referenced by operations for correct execution and model consistency. The algorithm has been verified within the prototype we have implemented with ACIS.展开更多
This paper, by using of windowed Fourier transform (WFT), gives a family of embedding operators , s.t. are reproducing subspaces (n = 0, Bargmann Space); and gives a reproducing kernel and an orthonormal basis (ONB)...This paper, by using of windowed Fourier transform (WFT), gives a family of embedding operators , s.t. are reproducing subspaces (n = 0, Bargmann Space); and gives a reproducing kernel and an orthonormal basis (ONB) of T n L 2(R). Furthermore, it shows the orthogonal spaces decomposition of . Finally, by using the preceding results, it shows the eigenvalues and eigenfunctions of a class of localization operators associated with WFT, which extends the result of Daubechies in [1] and [6].展开更多
The simplified four-qubit cluster state （i.e., （｜0000〉 ＋ ｜0011〉 ＋ ｜1100〉 -｜1111〉）/2） is explored for splitting an arbitrary single-qubit quantum information （QI）. Various feasible distributions of the ...The simplified four-qubit cluster state （i.e., （｜0000〉 ＋ ｜0011〉 ＋ ｜1100〉 -｜1111〉）/2） is explored for splitting an arbitrary single-qubit quantum information （QI）. Various feasible distributions of the four qubits among the Q,I sender and receivers for tri-splitting or hi-splitting are found out. For the distribution representations the corresponding splitting schemes and their LOCCs （local operation and classical communication） are presented amply while others are mentioned concisely.展开更多
A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her M agents first share a sequence of （M ＋ 1）-particle Greenberger-Horne-Zeilinger （GHZ） states that only Alice k...A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her M agents first share a sequence of （M ＋ 1）-particle Greenberger-Horne-Zeilinger （GHZ） states that only Alice knows which state each （M ＋ 1）-particle quantum system is in. Each agent exploits a controlled-not （CNot） gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a aσ∞ operation on her particle in the GHZ state or not. After the GHZ states （the quantum key） are used up, the parties check whether there is a vicious eavesdropper, say Eve, monitoring the quantum line, by picking out some samples from the GHZ states shared and measuring them with two measuring bases. After confirming the security of the quantum key, they use the remaining GHZ states repeatedly for the next round of quantum communication. This scheme has the advantage of high intrinsic efficiency for the qubits and total efficiency.展开更多
基金supported by the NSF of Ningxia(2022AAC03234)the NSF of China(11761004),the Construction Project of First-Class Disciplines in Ningxia Higher Education(NXYLXK2017B09)the Postgraduate Innovation Project of North Minzu University(YCX23074).
文摘In this article, we consider a backward problem in time of the diffusion equation with local and nonlocal operators. This inverse problem is ill-posed because the solution does not depend continuously on the measured data. Inspired by the classical Landweber iterative method and Fourier truncation technique, we develops a modified Landweber iterative regularization method to restore the continuous dependence of solution on the measurement data. Under the a-priori and a-posteriori choice rules for the regularized parameter, the convergence estimates for the regularization method are derived. Some results of numerical simulation are provided to verify the stability and feasibility of our method in dealing with the considered problem.
文摘We give a neccesary and sufficient condition on a function such that the composition operator (Nemytskij Operator) H defined by acts in the space and satisfies a local Lipschitz condition. And, we prove that every locally defined operator mapping the space of continuous and bounded Wiener p(·)-variation with variable exponent functions into itself is a Nemytskij com-position operator.
文摘In this paper, we define the localization operator associated with the spherical mean operator, and show that the localization operator is not only bounded, but also in Schatten-Von Neumann class. We also give a trace formula when the symbol function is a nonnegative function.
基金supported partly by the Natural Science Foundation from the Education Department of Anhui Province(KJ2017A847)The second author was supported by NSFC(11671039,11871101)NSFC-DFG(11761131002).
文摘Let 0<β<1 andΩbe a proper open and non-empty subset of R^(n).In this paper,the object of our investigation is the multilinear local maximal operator Mβ,defined by M_(β)((f))(x)=sup_(Q(∈)xQ∈Fβ)Π_(i=1)^m1/|Q|∫_(Q)|f_(i)(y_(i))|dy_(i),where F_(β)={Q(x,l):x∈Ω,l<βd(x,Ω^(c))},Q=Q(x,l)is denoted as a cube with sides parallel to the axes,and x and l denote its center and half its side length.Two-weight characterizations for the multilinear local maximal operator M_(β)are obtained.A formulation of the Carleson embedding theorem in the multilinear setting is proved.
文摘In this paper we obtain all other local Nikolskii constants for Baskakov operators by ap- plying a method of asymptotic expansions,give a complete and satisfactory solution of Lehnhoff s open problems[1].
基金Supported by the National Natural Science Foundation of China under Grant Nos 11304013,11204197,11204379 and 11074244the National Basic Research Program of China under Grant No 2011CBA00200+1 种基金the Doctor Science Research Foundation of Ministry of Education of China under Grant No 20113402110059Civil Aerospace 2013669
文摘Noiseless linear amplification （NLA）, first proposed by Ralpha et al., is a nondeterministic amplification process which gives gain to the Fock state ｜n） → gn｜n）, with g being the amplification gain. We here give a general frame- work for improving the NLA scheme with arbitrary general local unitary operations. We derive the improvement in the amplification gain in 0 1 photon subspace. In particular, we study if the local unitary is composed of sin- gle mode squeezing and coherent displacement operation. Finally, numerical simulations show that local unitary operation could give a further enhancement in the amplification gain as well as the success probability, making the NLA more feasible in future optic quantum communications.
基金Project supported by China Postdoctoral Science Foundation(Grant No.2017M622582)the Natural Science Foundation of Hunan Province of China(Grant No.2015JJ3092)+2 种基金the Research Foundation of Education Bureau of Hunan Province of China(Grant No.16B177)Applied Characteristic Disciplines in Hunan Province-Electronic Science and Technology of ChinaHunan-Provincial Key Laboratory of Photoelectric Information Integration and Optical Manufacturing Technology
文摘We investigate entanglement of assistance without and with decoherence using a local non-Hermitian operation, i.e.,parity–time(PT) symmetric operation. First we give the explicit expressions of entanglement of assistance for a general W-like state of a three-qubit system under a local parity–time symmetric operation. Then for a famous W state without decoherence, we find that entanglement of assistance shared by two parties can be obviously enhanced with the assistance of the third party by a local parity–time symmetric operation. For the decoherence case, we provide two schemes to show the effects of local parity–time symmetric operation on improvement of entanglement of assistance against amplitude damping noise. We find that for the larger amplitude damping case the scheme of PT symmetric operation performed on one of two parties with the influence of noise is superior to that of PT symmetric operation performed on the third party without the influence of noise in suppressing amplitude damping noise. However, for the smaller amplitude damping case the opposite result is given. The obtained results imply that the local PT symmetric operation method may have potential applications in quantum decoherence control.
基金supported by the National Natural Science Foundation of China under Grant Nos.62332009 and 12347104the Innovation Program for Quantum Science and Technology under Grant No.2021ZD0302901the Natural Science Foundation of Jiangsu Province of China under Grant No.BK20243060.
文摘It has been known that two different bipartite unitary operations are perfectly distinguishable by local operations and classical communication(LOCC)when a finite number of queries is allowed.However,it has been a longstanding open problem to determine the optimal number of queries needed to distinguish bipartite unitary operations perfectly by LOCC since 2007.In this paper,we show that if two two-qubit unitary operations are perfectly distinguishable using queries,they are also perfectly distinguishable in the LOCC scenario using queries.As a result,LOCC operations are as powerful as global operations when using constant times the number of queries for the perfect discrimination of two-qubit unitary operations.
基金Supported by the National Natural Science Foundation of China under Grant Nos 10447106, 10435020, 10254002, A0325401 and 10374010, and Beijing Education Committee under Grant No XK100270454.
文摘An efficient quantum secure direct communication network protocol with the two-step scheme is proposed by using the Einstein-Podolsky-Rosen （EPR） pair block as the quantum information carrier. The server, say Alice, prepares and measures the EPR pairs in the quantum communication and the users perform the four local unitary operations to encode their message. Anyone of the legitimate users can communicate another one on the network securely. Since almost all of the instances in this scheme are useful and each EPR pair can carry two bits of information, the efficiency for qubits and the source capacity both approach the maximal values.
基金Supported by the National Natural Science Foundation of China under Grant No 10447106, and Beijing Education Committee under Grant No XK100270454.
文摘An effcient multiparty quantum secret sharing scheme is proposed with Greenberger-Horne-Zeilinger （GHZ） states following some ideas in quantum dense coding. The agents take the single-photon measurements on the photons received for eavesdropping check and exploit the four local unitary operations Ⅰ, σx, σx and iσy to code their message. This scheme has the advantage of high capacity as each GHZ state can carry two bits of information. The parties do not need to announce the measuring bases for almost all the photons, which will reduce the classical information exchanged largely. The intrinsic efficiency for qubits and the total effciency both approach the maximal values.
基金supported by the Program for New Century Excellent Talents at the University of China under Grant No.NCET-06-0554the National Natural Science Foundation of China under Grant Nos.60677001 and 10747146+3 种基金the Science-Technology Fund of Anhui Province for Outstanding Youth under Grant No.06042087the Key Fund of the Ministry of Education of China under Grant No.206063the Natural Science Foundation of Guangdong Province under Grant Nos.06300345 and 7007806Natural Science Foundation of Hubei Province under Grant No.2006ABA354
文摘Recently, several similar protocols [J. Opt. B 4 （2002） 380; Phys. Lett. A 316 （2003） 159; Phys. Lett. A 355 （2006） 285; Phys. Lett. A 336 （2005） 317] for remotely preparing a class of multi-qubit states （i.e, α[0...0〉 ＋β[1... 1〉） were proposed, respectively. In this paper, by applying the controlled-not （CNOT） gate, a new simple protocol is proposed for remotely preparing such class of states. Compared to the previous protocols, both classical communication cost and required quantum entanglement in our protocol are remarkably reduced. Moreover, the difficulty of identifying some quantum states in our protocol is also degraded. Hence our protocol is more economical and feasible.
基金Supported by NCET of the Education Ministry, and the National Natural Science Foundation of China under Grant Nos 10305002 and 60578014.
文摘We extend the idea of entanglement concentration protocol for pure states （Phys. Rev. Lett. 88, 187903） to the case of entanglement distillation for mixed states. The scheme works only with particle statistics and local operations, without the need of any other interactions. We show that the maximally entangled state can be distilled out when the initial state is pure, otherwise the entanglement distilled depends on the off-diagonal element of density matrix of the initial state. Because of the requirement for density matrix, the entanglement distilled is always less than one, and this result is the same for both fermionic and bosonic particles. The distillation efficiency is a product of the diagonal elements of the initial state, it takes the maximum 50%, the same as that in the case for pure states.We extend the idea of entanglement concentration protocol for pure states （Phys. Rev. Lett. 88, 187903） to the case of entanglement distillation for mixed states. The scheme works only with particle statistics and local operations, without the need of any other interactions. We show that the maximally entangled state can be distilled out when the initial state is pure, otherwise the entanglement distilled depends on the off-dlagonal element of density matrix of the initial state. Because of the requirement for density matrix, the entanglement distilled is always less than one, and this result is the same for both fermionic and bosonic particles. The distillation effciency is a product of the diagonal elements of the initial state, it takes the maximum 50%, the same as that in the case for pure states.
文摘We classify biqutrit and triqutrit pure states under stochastic local operations and classical communication. By investigating the right singular vector spaces of the coefticient matrices of the states, we obtain explicitly two equivalent classes of biqutrit states and twelve equivalent classes of triqutrit states respectively.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University,Saudi Arabia,for funding this work through the Research Group Program under Grant No:RGP.2/108/42.
文摘Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so on.In order to solve optimization problems,metaheuristic algorithms are essential.Most of these techniques are influenced by collective knowledge and natural foraging.There is no such thing as the best or worst algorithm;instead,there are more effective algorithms for certain problems.Therefore,in this paper,a new improved variant of a recently proposed metaphorless Runge-Kutta Optimization(RKO)algorithm,called Improved Runge-Kutta Optimization(IRKO)algorithm,is suggested for solving optimization problems.The IRKO is formulated using the basic RKO and local escaping operator to enhance the diversification and intensification capability of the basic RKO version.The performance of the proposed IRKO algorithm is validated on 23 standard benchmark functions and three engineering constrained optimization problems.The outcomes of IRKO are compared with seven state-of-the-art algorithms,including the basic RKO algorithm.Compared to other algorithms,the recommended IRKO algorithm is superior in discovering the optimal results for all selected optimization problems.The runtime of IRKO is less than 0.5 s for most of the 23 benchmark problems and stands first for most of the selected problems,including real-world optimization problems.
基金supported by the National Natural Science Foundation of China under Grant No. 60973070
文摘An algorithm for face description and recognition based on multi-resolution with multi-scale local binary pattern （multi-LBP） features is proposed. The facial image pyramid is constructed and each facial image is divided into various regions from which partial and holistic local binary patter （LBP） histograms are extracted. All LBP features of each image are concatenated to a single LBP eigenvector with different resolutions. The dimensionaUty of LBP features is then reduced by a local margin alignment （LMA） algorithm based on manifold, which can preserve the between-class variance. Support vector machine （SVM） is applied to classify facial images. Extensive experiments on ORL and CMU face databases clearly show the superiority of the proposed scheme over some existed algorithms, especially on the robustness of the method against different facial expressions and postures of the subjects.
文摘A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence coding, local collective unitary operations, and entanglement swapping. In this protocol, during the process of trans- mission of particles, the transmitted particles do not carry any secret messages and are transmitted only one time. The protocol has higher source capacity than protocols using symmetric two-dimensional states. The security is ensured by the unitary operations randomly performed on all checking groups before the particle sequence is transmitted and the application of entanglement swapping.
文摘One of the key problems in collaborative geometric modeling systems is topological entity correspondence when topolog- ical structure of geometry models on collaborative sites changes, ha this article, we propose a solution for tracking topological entity alterations in 3D collaborative modeling environment. We firstly make a thorough analysis and detailed categorization on the altera- tion properties and causations for each type of topological entity, namely topological face and topological edge. Based on collabora- tive topological entity naming mechanism, a data structure called TEST （Topological Entity Structure Tree） is introduced to track the changing history and current state of each topological entity, to embody the relationship among topological entities. Rules and algo- rithms are presented for identification of topological entities referenced by operations for correct execution and model consistency. The algorithm has been verified within the prototype we have implemented with ACIS.
基金Research supported by 973 Project G1999075105 and NNFS of China,Nos.90104004 and 69735020
文摘This paper, by using of windowed Fourier transform (WFT), gives a family of embedding operators , s.t. are reproducing subspaces (n = 0, Bargmann Space); and gives a reproducing kernel and an orthonormal basis (ONB) of T n L 2(R). Furthermore, it shows the orthogonal spaces decomposition of . Finally, by using the preceding results, it shows the eigenvalues and eigenfunctions of a class of localization operators associated with WFT, which extends the result of Daubechies in [1] and [6].
基金Supported by the Program for New Century Excellent Talents at the University of China under Grant No.NCET-06-0554the National Natural Science Foundation of China under Grant Nos.10975001,60677001,10747146,and 10874122+3 种基金the Science-technology Fund of Anhui Province for Outstanding Youth under Grant No.06042087the Key Fund of the Ministry of Education of China under Grant No.206063 the General Fund of the Educational Committee of Anhui Province under Grant No.2006KJ260Bthe Natural Science Foundation of Guangdong Province under Grant Nos.06300345 and 7007806
文摘The simplified four-qubit cluster state （i.e., （｜0000〉 ＋ ｜0011〉 ＋ ｜1100〉 -｜1111〉）/2） is explored for splitting an arbitrary single-qubit quantum information （QI）. Various feasible distributions of the four qubits among the Q,I sender and receivers for tri-splitting or hi-splitting are found out. For the distribution representations the corresponding splitting schemes and their LOCCs （local operation and classical communication） are presented amply while others are mentioned concisely.
基金Supported by the National Natural Science Foundation of China under Grant No 10447106, and Beijing Education Committee under Grant No XK100270454.
文摘A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her M agents first share a sequence of （M ＋ 1）-particle Greenberger-Horne-Zeilinger （GHZ） states that only Alice knows which state each （M ＋ 1）-particle quantum system is in. Each agent exploits a controlled-not （CNot） gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a aσ∞ operation on her particle in the GHZ state or not. After the GHZ states （the quantum key） are used up, the parties check whether there is a vicious eavesdropper, say Eve, monitoring the quantum line, by picking out some samples from the GHZ states shared and measuring them with two measuring bases. After confirming the security of the quantum key, they use the remaining GHZ states repeatedly for the next round of quantum communication. This scheme has the advantage of high intrinsic efficiency for the qubits and total efficiency.
