How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the ...How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the element in authenticated skip list efficiently is an important part of authentication. Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for elements in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees.展开更多
In order to effectively solve combinatorial optimization problems,a membrane-inspired quantum bee colony optimization(MQBCO)is proposed for scientific computing and engineering applications.The proposed MQBCO algorith...In order to effectively solve combinatorial optimization problems,a membrane-inspired quantum bee colony optimization(MQBCO)is proposed for scientific computing and engineering applications.The proposed MQBCO algorithm applies the membrane computing theory to quantum bee colony optimization(QBCO),which is an effective discrete optimization algorithm.The global convergence performance of MQBCO is proved by Markov theory,and the validity of MQBCO is verified by testing the classical benchmark functions.Then the proposed MQBCO algorithm is used to solve decision engine problems of cognitive radio system.By hybridizing the QBCO and membrane computing theory,the quantum state and observation state of the quantum bees can be well evolved within the membrane structure.Simulation results for cognitive radio system show that the proposed decision engine method is superior to the traditional intelligent decision engine algorithms in terms of convergence,precision and stability.Simulation experiments under different communication scenarios illustrate that the balance between three objective functions and the adapted parameter configuration is consistent with the weights of three normalized objective functions.展开更多
The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known： Re...The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known： Resolution with restricted number of variables in disjuncts, resolution over Linear Equations, Cutting planes, etc. For Classical, Intuitionistic and Minimal （Johansson＇s） propositional logics, the authors introduce the family of resolution systems with full substitution rule （SRC, SRI and SRM） and with e-restricted substitution rule （SeRC, SeRf and SeRM）, where the number of substituted formula connectives is bounded by . The authors show that for each of mentioned logic the SR-type system （in tree form） is polynomially equivalent to Frege systems by size, but for every ~＇ 〉 0, Se＋lR-type has exponential speed-up over the SeR-type （in tree form）.展开更多
In this paper, we first show that there is a Hom-Lie algebra structure on the set of(σ, σ)-derivations of an associative algebra. Then we construct the dual representation of a representation of a Hom-Lie algebra.We...In this paper, we first show that there is a Hom-Lie algebra structure on the set of(σ, σ)-derivations of an associative algebra. Then we construct the dual representation of a representation of a Hom-Lie algebra.We introduce the notions of a Manin triple for Hom-Lie algebras and a purely Hom-Lie bialgebra. Using the coadjoint representation, we show that there is a one-to-one correspondence between Manin triples for Hom-Lie algebras and purely Hom-Lie bialgebras. Finally, we study coboundary purely Hom-Lie bialgebras and construct solutions of the classical Hom-Yang-Baxter equations in some special Hom-Lie algebras using Hom-O-operators.展开更多
We study a special class of Finsler metrics,namely,Matsumoto metrics F=α2α-β,whereαis a Riemannian metric andβis a 1-form on a manifold M.We prove that F is a(weak)Einstein metric if and only ifαis Ricci flat an...We study a special class of Finsler metrics,namely,Matsumoto metrics F=α2α-β,whereαis a Riemannian metric andβis a 1-form on a manifold M.We prove that F is a(weak)Einstein metric if and only ifαis Ricci flat andβis a parallel 1-form with respect toα.In this case,F is Ricci flat and Berwaldian.As an application,we determine the local structure and prove the 3-dimensional rigidity theorem for a(weak)Einstein Matsumoto metric.展开更多
基金partially supported by the Fundamental Research Funds for the Central Universities of China under Grant No.2015JBM034the China Scholarship Council Funds under File No.201407095023
文摘How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the element in authenticated skip list efficiently is an important part of authentication. Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for elements in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees.
基金Projects(61102106,61102105)supported by the National Natural Science Foundation of ChinaProject(2013M530148)supported by China Postdoctoral Science Foundation+1 种基金Project(HEUCF140809)supported by the Fundamental Research Funds for the Central Universities,ChinaProject(LBH-Z13054)supported by Heilongjiang Postdoctoral Fund,China
文摘In order to effectively solve combinatorial optimization problems,a membrane-inspired quantum bee colony optimization(MQBCO)is proposed for scientific computing and engineering applications.The proposed MQBCO algorithm applies the membrane computing theory to quantum bee colony optimization(QBCO),which is an effective discrete optimization algorithm.The global convergence performance of MQBCO is proved by Markov theory,and the validity of MQBCO is verified by testing the classical benchmark functions.Then the proposed MQBCO algorithm is used to solve decision engine problems of cognitive radio system.By hybridizing the QBCO and membrane computing theory,the quantum state and observation state of the quantum bees can be well evolved within the membrane structure.Simulation results for cognitive radio system show that the proposed decision engine method is superior to the traditional intelligent decision engine algorithms in terms of convergence,precision and stability.Simulation experiments under different communication scenarios illustrate that the balance between three objective functions and the adapted parameter configuration is consistent with the weights of three normalized objective functions.
文摘The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known： Resolution with restricted number of variables in disjuncts, resolution over Linear Equations, Cutting planes, etc. For Classical, Intuitionistic and Minimal （Johansson＇s） propositional logics, the authors introduce the family of resolution systems with full substitution rule （SRC, SRI and SRM） and with e-restricted substitution rule （SeRC, SeRf and SeRM）, where the number of substituted formula connectives is bounded by . The authors show that for each of mentioned logic the SR-type system （in tree form） is polynomially equivalent to Frege systems by size, but for every ~＇ 〉 0, Se＋lR-type has exponential speed-up over the SeR-type （in tree form）.
基金supported by National Natural Science Foundation of China (Grant No. 11471139)Natural Science Foundation of Jilin Province (Grant No. 20170101050JC)Nan Hu Scholar Development Program of Xin Yang Normal University
文摘In this paper, we first show that there is a Hom-Lie algebra structure on the set of(σ, σ)-derivations of an associative algebra. Then we construct the dual representation of a representation of a Hom-Lie algebra.We introduce the notions of a Manin triple for Hom-Lie algebras and a purely Hom-Lie bialgebra. Using the coadjoint representation, we show that there is a one-to-one correspondence between Manin triples for Hom-Lie algebras and purely Hom-Lie bialgebras. Finally, we study coboundary purely Hom-Lie bialgebras and construct solutions of the classical Hom-Yang-Baxter equations in some special Hom-Lie algebras using Hom-O-operators.
基金supported by National Natural Science Foundation of China (Grant No.11171297)Natural Science Foundation of Zhejiang Province (Grant No.Y6110027)
文摘We study a special class of Finsler metrics,namely,Matsumoto metrics F=α2α-β,whereαis a Riemannian metric andβis a 1-form on a manifold M.We prove that F is a(weak)Einstein metric if and only ifαis Ricci flat andβis a parallel 1-form with respect toα.In this case,F is Ricci flat and Berwaldian.As an application,we determine the local structure and prove the 3-dimensional rigidity theorem for a(weak)Einstein Matsumoto metric.
