In this paper,we principally introduce the concept of quasiprincipally k-projective semimodules,on the basis of the theories of k-projective semimodules and quasi-principally modules,we get some good properties of qua...In this paper,we principally introduce the concept of quasiprincipally k-projective semimodules,on the basis of the theories of k-projective semimodules and quasi-principally modules,we get some good properties of quasi-principally k-projective semimodules,therefore generalize some properties of quasi-principally modules of ring and k-projective semimodules of semiring to quasi-principally k-projective semimodules of semiring.展开更多
The extended F-expansion method or mapping method is used to construct exact solutions for the coupled KleinGordon Schr/Sdinger equations (K-G-S equations) by the aid of the symbolic computation system Mathematica. ...The extended F-expansion method or mapping method is used to construct exact solutions for the coupled KleinGordon Schr/Sdinger equations (K-G-S equations) by the aid of the symbolic computation system Mathematica. More solutions in the Jacobi elliptic function form are obtained, including the single Jacobi elliptic function solutions, combined Jacobi elliptic function solutions, rational solutions, triangular solutions, soliton solutions and combined soliton solutions.展开更多
With the (k,n) -threshold scheme of secret sharing in the field of information security technology asan application background,the concept of set ( k,n)-exact cover is presented in this paper.It is a modificationof th...With the (k,n) -threshold scheme of secret sharing in the field of information security technology asan application background,the concept of set ( k,n)-exact cover is presented in this paper.It is a modificationof the original concept of set covering problem.It is also different from the concept of exact coverdefined by J.E.Hopcroft.Some properties of ( k,n) -exact cover are investigated;a sufficient conditionfor a set to be ( k,n ) -exactly coverable is given.It follows that a feasible assignment scheme of a set forthe (k,n) -exact cover is obtained if this set satisfies the sufficient condition.展开更多
基金Supported by the Science Foundation of Tianjin(08JCYBJC13900) Supported by the Civil Aviation University of China(2010kys06)
文摘In this paper,we principally introduce the concept of quasiprincipally k-projective semimodules,on the basis of the theories of k-projective semimodules and quasi-principally modules,we get some good properties of quasi-principally k-projective semimodules,therefore generalize some properties of quasi-principally modules of ring and k-projective semimodules of semiring to quasi-principally k-projective semimodules of semiring.
基金Project supported by the National Nature Science Foundation of China (Grant No 49894190) of the Chinese Academy of Science (Grant No KZCXI-sw-18), and Knowledge Innovation Program.
文摘The extended F-expansion method or mapping method is used to construct exact solutions for the coupled KleinGordon Schr/Sdinger equations (K-G-S equations) by the aid of the symbolic computation system Mathematica. More solutions in the Jacobi elliptic function form are obtained, including the single Jacobi elliptic function solutions, combined Jacobi elliptic function solutions, rational solutions, triangular solutions, soliton solutions and combined soliton solutions.
基金Supported by the National Natural Science Foundation of China (No. 60673053 90718011 )
文摘With the (k,n) -threshold scheme of secret sharing in the field of information security technology asan application background,the concept of set ( k,n)-exact cover is presented in this paper.It is a modificationof the original concept of set covering problem.It is also different from the concept of exact coverdefined by J.E.Hopcroft.Some properties of ( k,n) -exact cover are investigated;a sufficient conditionfor a set to be ( k,n ) -exactly coverable is given.It follows that a feasible assignment scheme of a set forthe (k,n) -exact cover is obtained if this set satisfies the sufficient condition.