The boundness and compactness of products of multiplication,composition and differentiation on weighted Bergman spaces in the unit ball are studied.We define the differentiation operator on the space of holomorphic fu...The boundness and compactness of products of multiplication,composition and differentiation on weighted Bergman spaces in the unit ball are studied.We define the differentiation operator on the space of holomorphic functions in the unit ball by radial derivative.Then we extend the Sharma's results.展开更多
In this paper,we study multiplication operators on weighted Dirichlet spaces D_(β)(β∈R).Let n be a positive integer and β∈R,we show that the multiplication operator M_(z)^(n) on D_(β) is similar to the operator ...In this paper,we study multiplication operators on weighted Dirichlet spaces D_(β)(β∈R).Let n be a positive integer and β∈R,we show that the multiplication operator M_(z)^(n) on D_(β) is similar to the operator ⊕_(1)^(n)M_(z)on the space⊕_(1)^(n)D_(β).Moreover,we prove that M_(z)^(n)(≥2)on Dβis unitarily equivalent to ⊕_(1)^(n)M_(z) on⊕_(1)^(n)D_(β) if and only if β=0.In addition,we completely characterize the unitary equivalence of the restrictions of M_(z)^(n) to different invariant subspaces z^(k)D_(β)(k≥1),and the unitary equivalence of the restrictions of M_(z)^(n) to different invariant subspaces S_(j)(0≤j<n).Abkar,Cao and Zhu[Complex Anal Oper Theory,2020,14:Art 58]pointed out that it is an important,natural,and difficult question in operator theory to identify the commutant of a bounded linear operator.They characterized the commutant A′( M_(z)^(n))of M_(z)^(n)on a family of analytic function spaces A_(α)^(2)(α∈R)on D(in fact,the family of spaces A_(α)^(2)(α∈R)is the same with the family of spaces D_(β)(β∈R))in terms of the multiplier algebra of the underlying function spaces.In this paper,we give a new characterization of the commutant A′( M_(z)^(n))of M_(z)^(n)on D_(β),and characterize the self-adjoint operators and unitary operators in A'(M_(z)^(n)).We find that the class of self-adjoint operators(unitary operators)in A'(M_(z)^(n))when β≠0 is different from the class of self-adjoint operators(unitary operators)in A′( M_(z)^(n))when β=0.展开更多
Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4))...Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.展开更多
Cylindrical vector beams(CVBs)hold significant promise in mode division multiplexing communication owing to their inherent vector mode orthogonality.However,existing studies for facilitating CVB channel processing are...Cylindrical vector beams(CVBs)hold significant promise in mode division multiplexing communication owing to their inherent vector mode orthogonality.However,existing studies for facilitating CVB channel processing are confined to mode shift conversions due to their reliance on spin-dependent helical modulations,overlooking the pursuit of mode multiplication conversion.This challenge lies in the multiplicative operation upon inhomogeneous vector mode manipulation,which is expected to advance versatile CVB channel switching and routing.Here,we tackle this gap by introducing a raytracing control strategy that conformally maps the light rays of CVB from the whole annulus distribution to an annular sector counterpart.Incorporated with the multifold conformal annulus-sector mappings and polarization-insensitive phase modulations,this approach facilitates the parallel transformation of input CVB into multiple complementary components,enabling the mode multiplication conversion with protected vector structure.Serving as a demonstration,we experimentally implemented the multiplicative operation of four CVB modes with the multiplier factors of N=+2 and N=−3,achieving the converted mode purities over 94.24%and 88.37%.Subsequently,200 Gbit/s quadrature phase shift keying signals were successfully transmitted upon multiplicative switching of four CVB channels,with the bit-error-rate approaching 1×10^(−6).These results underscore our strategy’s efficacy in CVB mode multiplication,which may open promising prospects for its advanced applications.展开更多
This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularl...This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.展开更多
This paper aims to treat a study of generators of the cyclic group of higher even, odd, and prime order for composition being multiplication. In fact we developed order of a group, order of element of a group and gene...This paper aims to treat a study of generators of the cyclic group of higher even, odd, and prime order for composition being multiplication. In fact we developed order of a group, order of element of a group and generators of the cyclic group in real numbers. Also we express cyclic and generators of the group for composition in real numbers. Here we discuss the higher order of groups in different types of order, and generators of the cyclic group which will give us practical knowledge to see the applications of the composition. In order to find out the order of an element am∈Gin which an=e= identity element, then find Highest Common Factor i.e. (H.C.F) of mand n. When Gis a finite group, every element must have finite order but the converse is false. There are infinite groups where each element has a finite order. There may be more than one generator of a cyclic group. Also every cyclic group is necessarily abelian. But show that every infinite cyclic group contains only two generators. Finally, we find out the generators of the cyclic group of higher even, odd and prime order in different types of the group for composition being multiplication.展开更多
基金Supported by Natural Science Foundation of Guangdong Province in China(2018KTSCX161)。
文摘The boundness and compactness of products of multiplication,composition and differentiation on weighted Bergman spaces in the unit ball are studied.We define the differentiation operator on the space of holomorphic functions in the unit ball by radial derivative.Then we extend the Sharma's results.
基金supported by the National Natural Science Foundation of China(12101179,12171138,12171373)the Natural Science Foundation of Hebei Province of China(A2022207001)。
文摘In this paper,we study multiplication operators on weighted Dirichlet spaces D_(β)(β∈R).Let n be a positive integer and β∈R,we show that the multiplication operator M_(z)^(n) on D_(β) is similar to the operator ⊕_(1)^(n)M_(z)on the space⊕_(1)^(n)D_(β).Moreover,we prove that M_(z)^(n)(≥2)on Dβis unitarily equivalent to ⊕_(1)^(n)M_(z) on⊕_(1)^(n)D_(β) if and only if β=0.In addition,we completely characterize the unitary equivalence of the restrictions of M_(z)^(n) to different invariant subspaces z^(k)D_(β)(k≥1),and the unitary equivalence of the restrictions of M_(z)^(n) to different invariant subspaces S_(j)(0≤j<n).Abkar,Cao and Zhu[Complex Anal Oper Theory,2020,14:Art 58]pointed out that it is an important,natural,and difficult question in operator theory to identify the commutant of a bounded linear operator.They characterized the commutant A′( M_(z)^(n))of M_(z)^(n)on a family of analytic function spaces A_(α)^(2)(α∈R)on D(in fact,the family of spaces A_(α)^(2)(α∈R)is the same with the family of spaces D_(β)(β∈R))in terms of the multiplier algebra of the underlying function spaces.In this paper,we give a new characterization of the commutant A′( M_(z)^(n))of M_(z)^(n)on D_(β),and characterize the self-adjoint operators and unitary operators in A'(M_(z)^(n)).We find that the class of self-adjoint operators(unitary operators)in A'(M_(z)^(n))when β≠0 is different from the class of self-adjoint operators(unitary operators)in A′( M_(z)^(n))when β=0.
文摘Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.
基金supported by the National Natural Science Foundation of China(Grant No.62271322)the Guangdong Basic and Applied Basic Research Foundation(Grant No.2023A1515030152)+1 种基金the Shenzhen Science and Technology Program(Grant No.JCYJ20210324095610027)the Natural Science Foundation of Top Talent of SZTU(Grant No.GDRC202204)。
文摘Cylindrical vector beams(CVBs)hold significant promise in mode division multiplexing communication owing to their inherent vector mode orthogonality.However,existing studies for facilitating CVB channel processing are confined to mode shift conversions due to their reliance on spin-dependent helical modulations,overlooking the pursuit of mode multiplication conversion.This challenge lies in the multiplicative operation upon inhomogeneous vector mode manipulation,which is expected to advance versatile CVB channel switching and routing.Here,we tackle this gap by introducing a raytracing control strategy that conformally maps the light rays of CVB from the whole annulus distribution to an annular sector counterpart.Incorporated with the multifold conformal annulus-sector mappings and polarization-insensitive phase modulations,this approach facilitates the parallel transformation of input CVB into multiple complementary components,enabling the mode multiplication conversion with protected vector structure.Serving as a demonstration,we experimentally implemented the multiplicative operation of four CVB modes with the multiplier factors of N=+2 and N=−3,achieving the converted mode purities over 94.24%and 88.37%.Subsequently,200 Gbit/s quadrature phase shift keying signals were successfully transmitted upon multiplicative switching of four CVB channels,with the bit-error-rate approaching 1×10^(−6).These results underscore our strategy’s efficacy in CVB mode multiplication,which may open promising prospects for its advanced applications.
文摘This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.
文摘This paper aims to treat a study of generators of the cyclic group of higher even, odd, and prime order for composition being multiplication. In fact we developed order of a group, order of element of a group and generators of the cyclic group in real numbers. Also we express cyclic and generators of the group for composition in real numbers. Here we discuss the higher order of groups in different types of order, and generators of the cyclic group which will give us practical knowledge to see the applications of the composition. In order to find out the order of an element am∈Gin which an=e= identity element, then find Highest Common Factor i.e. (H.C.F) of mand n. When Gis a finite group, every element must have finite order but the converse is false. There are infinite groups where each element has a finite order. There may be more than one generator of a cyclic group. Also every cyclic group is necessarily abelian. But show that every infinite cyclic group contains only two generators. Finally, we find out the generators of the cyclic group of higher even, odd and prime order in different types of the group for composition being multiplication.
