A new approach based on multiwavelets transformation and singular value decomposition (SVD) is proposed for the classification of image textures. Lower singular values are truncated based on its energy distribution to...A new approach based on multiwavelets transformation and singular value decomposition (SVD) is proposed for the classification of image textures. Lower singular values are truncated based on its energy distribution to classify the textures in the presence of additive white Gaussian noise (AWGN). The proposed approach extracts features such as energy, entropy, local homogeneity and max-min ratio from the selected singular values of multiwavelets transformation coefficients of image textures. The classification was carried out using probabilistic neural network (PNN). Performance of the proposed approach was compared with conventional wavelet domain gray level co-occurrence matrix (GLCM) based features, discrete multiwavelets transformation energy based approach, and HMM based approach. Experimental results showed the superiority of the proposed algorithms when compared with existing algorithms.展开更多
Let F q be a finite field with qelements where q=p~α. In the present paper, the authors study the existence and structure of Carter subgroups of singular symplectic group Sp (n+t,n)(F q), singular unitary group U (n+...Let F q be a finite field with qelements where q=p~α. In the present paper, the authors study the existence and structure of Carter subgroups of singular symplectic group Sp (n+t,n)(F q), singular unitary group U (n+t,n)(F (q^2)) and singular orthogonal group O (n+t,n)(F q)(n is even) over finite fields F q.展开更多
Fully normalized associated Legendre functions(fnALFs)are a set of orthogonal basis functions that are usually calculated by using the recurrence equation.This paper presented the applicability and universality of the...Fully normalized associated Legendre functions(fnALFs)are a set of orthogonal basis functions that are usually calculated by using the recurrence equation.This paper presented the applicability and universality of the standard forward column/row recurrence equation based on the isolated singular factor method and extended-range arithmetic.Isolating a singular factor is a special normalization method that can improve the universality of the standard forward row recurrence equation to a certain extent,its universality can up to degree hundreds.However,it is invalid for standard forward column recurrence equation.The extended-range arithmetic expands the double-precision number field to the quad-precision numberfield.The quad-precision numberfield can retain more significant digits in the operation process and express larger and smaller numbers.The extended-range arithmetic can significantly improve the applicability and universality of the standard forward column/row recurrence equations,its universality can up to degree several thousand.However,the quad-precision numberfield operation needs to occupy more storage space,which is why its operation speed is slow and undesirable in practical applications.In this paper,the X-number method is introduced in the standard forward row recurrence equation for thefirst time.With the use of the X-number method,fnALFs can be recursed to 4.2 billion degree by using standard forward column/row recurrence equations.展开更多
Let F be an algebraically closed field of prime characteristic p > 2,and g be a simple Lie superalgebra of special type or Hamiltonian type over F.We construct the simple g-modules with non-singular characters of h...Let F be an algebraically closed field of prime characteristic p > 2,and g be a simple Lie superalgebra of special type or Hamiltonian type over F.We construct the simple g-modules with non-singular characters of height more than one,and some simple modules with singular characters of height more than five.Furthermore,for the case of special type Lie superalgebras,we also construct a class of simple modules with regular semisimple characters of height one.All those simple modules mentioned above are proved to be reduced Kac modules.展开更多
In this paper, explicit determination of the cyclotomic numbers of order l and 2l, for odd prime l ≡ 3 (mod 4), over finite field Fq in the index 2 case are obtained, utilizing the explicit formulas on the correspond...In this paper, explicit determination of the cyclotomic numbers of order l and 2l, for odd prime l ≡ 3 (mod 4), over finite field Fq in the index 2 case are obtained, utilizing the explicit formulas on the corresponding Gauss sums. The main results in this paper are related with the number of rational points of certain elliptic curve, called "Legendre curve", and the properties and value distribution of such number are also presented.展开更多
New embeddings of some weighted Sobolev spaces with weights a(x)and b(x)are established.The weights a(x)and b(x)can be singular.Some applications of these embeddings to a class of degenerate elliptic problems of the f...New embeddings of some weighted Sobolev spaces with weights a(x)and b(x)are established.The weights a(x)and b(x)can be singular.Some applications of these embeddings to a class of degenerate elliptic problems of the form-div(a(x)?u)=b(x)f(x,u)in?,u=0 on??,where?is a bounded or unbounded domain in RN,N 2,are presented.The main results of this paper also give some generalizations of the well-known Caffarelli-Kohn-Nirenberg inequality.展开更多
According to the requirements of the increasing development for optical transmission systems,a novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on the subgroup of the finite fiel...According to the requirements of the increasing development for optical transmission systems,a novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on the subgroup of the finite field multiplicative group is proposed.Furthermore,this construction method can effectively avoid the girth-4 phenomena and has the advantages such as simpler construction,easier implementation,lower encoding/decoding complexity,better girth properties and more flexible adjustment for the code length and code rate.The simulation results show that the error correction performance of the QC-LDPC(3 780,3 540) code with the code rate of 93.7% constructed by this proposed method is excellent,its net coding gain is respectively 0.3dB,0.55dB,1.4dB and 1.98dB higher than those of the QC-LDPC(5 334,4 962) code constructed by the method based on the inverse element characteristics in the finite field multiplicative group,the SCG-LDPC(3 969,3 720) code constructed by the systematically constructed Gallager(SCG) random construction method,the LDPC(32 640,30 592) code in ITU-T G.975.1 and the classic RS(255,239) code which is widely used in optical transmission systems in ITU-T G.975 at the bit error rate(BER) of 10-7.Therefore,the constructed QC-LDPC(3 780,3 540) code is more suitable for optical transmission systems.展开更多
By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Ni...By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.展开更多
文摘A new approach based on multiwavelets transformation and singular value decomposition (SVD) is proposed for the classification of image textures. Lower singular values are truncated based on its energy distribution to classify the textures in the presence of additive white Gaussian noise (AWGN). The proposed approach extracts features such as energy, entropy, local homogeneity and max-min ratio from the selected singular values of multiwavelets transformation coefficients of image textures. The classification was carried out using probabilistic neural network (PNN). Performance of the proposed approach was compared with conventional wavelet domain gray level co-occurrence matrix (GLCM) based features, discrete multiwavelets transformation energy based approach, and HMM based approach. Experimental results showed the superiority of the proposed algorithms when compared with existing algorithms.
文摘Let F q be a finite field with qelements where q=p~α. In the present paper, the authors study the existence and structure of Carter subgroups of singular symplectic group Sp (n+t,n)(F q), singular unitary group U (n+t,n)(F (q^2)) and singular orthogonal group O (n+t,n)(F q)(n is even) over finite fields F q.
文摘Fully normalized associated Legendre functions(fnALFs)are a set of orthogonal basis functions that are usually calculated by using the recurrence equation.This paper presented the applicability and universality of the standard forward column/row recurrence equation based on the isolated singular factor method and extended-range arithmetic.Isolating a singular factor is a special normalization method that can improve the universality of the standard forward row recurrence equation to a certain extent,its universality can up to degree hundreds.However,it is invalid for standard forward column recurrence equation.The extended-range arithmetic expands the double-precision number field to the quad-precision numberfield.The quad-precision numberfield can retain more significant digits in the operation process and express larger and smaller numbers.The extended-range arithmetic can significantly improve the applicability and universality of the standard forward column/row recurrence equations,its universality can up to degree several thousand.However,the quad-precision numberfield operation needs to occupy more storage space,which is why its operation speed is slow and undesirable in practical applications.In this paper,the X-number method is introduced in the standard forward row recurrence equation for thefirst time.With the use of the X-number method,fnALFs can be recursed to 4.2 billion degree by using standard forward column/row recurrence equations.
基金supported by National Natural Science Foundation of China(Grant Nos.11126062 and 11201293)the Innovation Program of Shanghai Municipal Education Commission(Grant No.13YZ077)
文摘Let F be an algebraically closed field of prime characteristic p > 2,and g be a simple Lie superalgebra of special type or Hamiltonian type over F.We construct the simple g-modules with non-singular characters of height more than one,and some simple modules with singular characters of height more than five.Furthermore,for the case of special type Lie superalgebras,we also construct a class of simple modules with regular semisimple characters of height one.All those simple modules mentioned above are proved to be reduced Kac modules.
基金supported by National Natural Science Foundation of China(Grant Nos.10990011,11001145 and 61170289)the Science and Technology on Information Assurance Laboratory Foundation(Grant No.KJ-12-01)
文摘In this paper, explicit determination of the cyclotomic numbers of order l and 2l, for odd prime l ≡ 3 (mod 4), over finite field Fq in the index 2 case are obtained, utilizing the explicit formulas on the corresponding Gauss sums. The main results in this paper are related with the number of rational points of certain elliptic curve, called "Legendre curve", and the properties and value distribution of such number are also presented.
基金supported by National Natural Science Foundation of China (Grant Nos. 11171092, 11571093 and 11371117)
文摘New embeddings of some weighted Sobolev spaces with weights a(x)and b(x)are established.The weights a(x)and b(x)can be singular.Some applications of these embeddings to a class of degenerate elliptic problems of the form-div(a(x)?u)=b(x)f(x,u)in?,u=0 on??,where?is a bounded or unbounded domain in RN,N 2,are presented.The main results of this paper also give some generalizations of the well-known Caffarelli-Kohn-Nirenberg inequality.
基金supported by the Program for Innovation Team Building at Institutions of Higher Education in Chongqing(No.J2013-46)the National Natural Science Foundation of China(Nos.61472464 and 61471075)+1 种基金the Natural Science Foundation of Chongqing Science and Technology Commission(Nos.cstc2015jcyj A0554 and cstc2013jcyj A40017)the Program for Postgraduate Science Research and Innovation of Chongqing University of Posts and Telecommunications(Chongqing Municipal Education Commission)(No.CYS14144)
文摘According to the requirements of the increasing development for optical transmission systems,a novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on the subgroup of the finite field multiplicative group is proposed.Furthermore,this construction method can effectively avoid the girth-4 phenomena and has the advantages such as simpler construction,easier implementation,lower encoding/decoding complexity,better girth properties and more flexible adjustment for the code length and code rate.The simulation results show that the error correction performance of the QC-LDPC(3 780,3 540) code with the code rate of 93.7% constructed by this proposed method is excellent,its net coding gain is respectively 0.3dB,0.55dB,1.4dB and 1.98dB higher than those of the QC-LDPC(5 334,4 962) code constructed by the method based on the inverse element characteristics in the finite field multiplicative group,the SCG-LDPC(3 969,3 720) code constructed by the systematically constructed Gallager(SCG) random construction method,the LDPC(32 640,30 592) code in ITU-T G.975.1 and the classic RS(255,239) code which is widely used in optical transmission systems in ITU-T G.975 at the bit error rate(BER) of 10-7.Therefore,the constructed QC-LDPC(3 780,3 540) code is more suitable for optical transmission systems.
基金supported by National Natural Science Foundation of China(Grant Nos.61272481 and 61402352)the China Scholarship Council,Beijing Natural Science Foundation(Grant No.4122089)+1 种基金National Development and Reform Commission(Grant No.20121424)the Norwegian Research Council
文摘By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.