For a n-dimensional vector fields preserving some n-form, the following conclusion is reached by the method of Lie group. That is, if it admits an one-parameter, n-form preserving symmetry group, a transformation inde...For a n-dimensional vector fields preserving some n-form, the following conclusion is reached by the method of Lie group. That is, if it admits an one-parameter, n-form preserving symmetry group, a transformation independent of the vector field is constructed explicitly, which can reduce not only dimesion of the vector field by one, but also make the reduced vector field preserve the corresponding ( n - 1)-form. In partic ular, while n = 3, an important result can be directly got which is given by Me,ie and Wiggins in 1994.展开更多
A group oriented cryptosystem for the vector space access structure was proposed. This cryptosystem adopts self-certified public keys. It allows the participants of an authorized subset to cooperatively access an encr...A group oriented cryptosystem for the vector space access structure was proposed. This cryptosystem adopts self-certified public keys. It allows the participants of an authorized subset to cooperatively access an encrypted message. All data delivered in the cryptosystem are public. Therefore it does not need a partial decrypting results combiner and any secure communication channel. The security of the group oriented cryptosystem is based on the intractability of the discrete log problem and difficulty of factoring large integers. The suspected attacks can not break it.展开更多
The purpose of this paper is to construct near-vector spaces using a result by Van der Walt, with Z<sub>p</sub> for p a prime, as the underlying near-field. There are two notions of near-vector spaces, we ...The purpose of this paper is to construct near-vector spaces using a result by Van der Walt, with Z<sub>p</sub> for p a prime, as the underlying near-field. There are two notions of near-vector spaces, we focus on those studied by André [1]. These near-vector spaces have recently proven to be very useful in finite linear games. We will discuss the construction and properties, give examples of these near-vector spaces and give its application in finite linear games.展开更多
分析了空间低轨目标群的运行特点,提出了基于时序向量相似性的空间目标群匹配算法,提高了对低轨巨型星座的识别管理能力。首先,介绍了时序向量的降维方法,将目标群高维观测时序向量简化为空间构型序列;而后,提出了基于动态时间规整(Dyna...分析了空间低轨目标群的运行特点,提出了基于时序向量相似性的空间目标群匹配算法,提高了对低轨巨型星座的识别管理能力。首先,介绍了时序向量的降维方法,将目标群高维观测时序向量简化为空间构型序列;而后,提出了基于动态时间规整(Dynamic Time Warping,DTW)的目标群空间构型序列相似性判别算法;最后,利用星链卫星目标群仿真和实测数据对算法的匹配能力进行验证。结果表明该算法可实现空间目标群监测数据快速匹配,仿真数据匹配过程中,在群内目标缺失30%的条件下匹配成功率可达100%,在低缺失条件下(缺失率5%以内)群内目标识别成功率平均超过75%;实测数据匹配成功率可达100%。展开更多
In this paper, by applying a vector-valued inequality we obtained a decomposition theorem on Herz spaces over locally compact Vilenkin groups with new range 0<q≤1.
This paper is made out of necessity as a doctoral student taking the exam from Lie groups. Using the literature suggested to me by the professor, I felt the need to, in addition to that literature, and since there was...This paper is made out of necessity as a doctoral student taking the exam from Lie groups. Using the literature suggested to me by the professor, I felt the need to, in addition to that literature, and since there was more superficial in that book with some remarks about the examples given in relation to the left group. I decided to try a little harder and collect as much literature as possible, both for the needs of me and the others who will take after me. Searching for literature in my mother tongue I could not find anything, in English as someone who comes from a small country like Montenegro, all I could find was through the internet. I decided to gather what I could find from the literature in my own way and to my observation and make this kind of work. The main content of this paper is to present the Lie group in the simplest way. Before and before I started writing or collecting about Lie groups, it was necessary to say something about groups and subgroups that are taught in basic studies in algebra. In them I cited several deficits and an example. The following content of the paper is related to Lie groups primarily concerning the definition of examples such as <i>The General Linear Group GL(n, R)</i>, The <i>Complex General Linear Group GL(n, C)</i>, <i>The Special Linear Group SL(n, R)=SL(V)</i>, <i>The Complex Special Linear Group SL(n, C)</i>, <i>Unitary and Orthogonal Groups</i>, <i>Symplectic Group</i>, <i>The groups R*, C*, S<sup>1</sup> and R<sup>n</sup></i> and others. In addition, invariant vector fields and the exponential map and the lie algebra of a lie group. For me, this work has the significance of being useful to all who need it.展开更多
In this paper.we discuss Lagrangian vector field on Kahler manifold and use it to describe and solve some problem in Newtonican and Lagrangian Mechanics on Kahler Manifold.
In this paper,some existence results for the fourth order nonlinear subelliptic equations on the Heisenberg group are given by means of variational methods.
A novel approach for near-lossless compression of Color Filtering Array (CFA) data in wireless endoscopy capsule is proposed in this paper. The compression method is based on pre-processing and vector quantization. Fi...A novel approach for near-lossless compression of Color Filtering Array (CFA) data in wireless endoscopy capsule is proposed in this paper. The compression method is based on pre-processing and vector quantization. First, the CFA raw data are low pass filtered and rearranged during pre-processing. Then, pairs of pixels are vector quantized into macros of 9 bits by applying block par-tition and index mapping in succession. These macros are entropy compressed by Joint Photographic Experts Group-Lossless Standard (JPEG-LS) finally. The complex step of codeword searching in Vector Quantization (VQ) is avoided by a predefined partition rule, which is suitable for hardware imple-mentation. By control of the pre-processor and VQ scheme, either high quality compression under un- filtered case or high ratio compression under filtered case can be realized, with the average Peak Sig-nal-to-Noise Ratio (PSNR) more than 43dB and 37dB respectively. Compared with the state-of-the-art method and the previously proposed method, our compression approach outperforms in compression performance as well as in flexibility.展开更多
文摘For a n-dimensional vector fields preserving some n-form, the following conclusion is reached by the method of Lie group. That is, if it admits an one-parameter, n-form preserving symmetry group, a transformation independent of the vector field is constructed explicitly, which can reduce not only dimesion of the vector field by one, but also make the reduced vector field preserve the corresponding ( n - 1)-form. In partic ular, while n = 3, an important result can be directly got which is given by Me,ie and Wiggins in 1994.
文摘A group oriented cryptosystem for the vector space access structure was proposed. This cryptosystem adopts self-certified public keys. It allows the participants of an authorized subset to cooperatively access an encrypted message. All data delivered in the cryptosystem are public. Therefore it does not need a partial decrypting results combiner and any secure communication channel. The security of the group oriented cryptosystem is based on the intractability of the discrete log problem and difficulty of factoring large integers. The suspected attacks can not break it.
文摘The purpose of this paper is to construct near-vector spaces using a result by Van der Walt, with Z<sub>p</sub> for p a prime, as the underlying near-field. There are two notions of near-vector spaces, we focus on those studied by André [1]. These near-vector spaces have recently proven to be very useful in finite linear games. We will discuss the construction and properties, give examples of these near-vector spaces and give its application in finite linear games.
文摘分析了空间低轨目标群的运行特点,提出了基于时序向量相似性的空间目标群匹配算法,提高了对低轨巨型星座的识别管理能力。首先,介绍了时序向量的降维方法,将目标群高维观测时序向量简化为空间构型序列;而后,提出了基于动态时间规整(Dynamic Time Warping,DTW)的目标群空间构型序列相似性判别算法;最后,利用星链卫星目标群仿真和实测数据对算法的匹配能力进行验证。结果表明该算法可实现空间目标群监测数据快速匹配,仿真数据匹配过程中,在群内目标缺失30%的条件下匹配成功率可达100%,在低缺失条件下(缺失率5%以内)群内目标识别成功率平均超过75%;实测数据匹配成功率可达100%。
基金Supported by the Natural Science Foundation of Zhejiang Province(102005)Supported by the Natural Science Foundation of Henan University(XK03YBSX002)
文摘In this paper, by applying a vector-valued inequality we obtained a decomposition theorem on Herz spaces over locally compact Vilenkin groups with new range 0<q≤1.
基金Supported by National Basic Research Program of China （973 Program） （2005CB321902） National Natural Science Foundation of China （90916024,60727002,60774003）+1 种基金 the Ph.D. Programs Foundation of Ministry of Education of China （20030006003） the Commission on Science,Technology,and Industry for National Defense （A2120061303）
文摘This paper is made out of necessity as a doctoral student taking the exam from Lie groups. Using the literature suggested to me by the professor, I felt the need to, in addition to that literature, and since there was more superficial in that book with some remarks about the examples given in relation to the left group. I decided to try a little harder and collect as much literature as possible, both for the needs of me and the others who will take after me. Searching for literature in my mother tongue I could not find anything, in English as someone who comes from a small country like Montenegro, all I could find was through the internet. I decided to gather what I could find from the literature in my own way and to my observation and make this kind of work. The main content of this paper is to present the Lie group in the simplest way. Before and before I started writing or collecting about Lie groups, it was necessary to say something about groups and subgroups that are taught in basic studies in algebra. In them I cited several deficits and an example. The following content of the paper is related to Lie groups primarily concerning the definition of examples such as <i>The General Linear Group GL(n, R)</i>, The <i>Complex General Linear Group GL(n, C)</i>, <i>The Special Linear Group SL(n, R)=SL(V)</i>, <i>The Complex Special Linear Group SL(n, C)</i>, <i>Unitary and Orthogonal Groups</i>, <i>Symplectic Group</i>, <i>The groups R*, C*, S<sup>1</sup> and R<sup>n</sup></i> and others. In addition, invariant vector fields and the exponential map and the lie algebra of a lie group. For me, this work has the significance of being useful to all who need it.
文摘In this paper.we discuss Lagrangian vector field on Kahler manifold and use it to describe and solve some problem in Newtonican and Lagrangian Mechanics on Kahler Manifold.
文摘In this paper,some existence results for the fourth order nonlinear subelliptic equations on the Heisenberg group are given by means of variational methods.
基金the National Natural Science Foundation of China (No. 60506007).
文摘A novel approach for near-lossless compression of Color Filtering Array (CFA) data in wireless endoscopy capsule is proposed in this paper. The compression method is based on pre-processing and vector quantization. First, the CFA raw data are low pass filtered and rearranged during pre-processing. Then, pairs of pixels are vector quantized into macros of 9 bits by applying block par-tition and index mapping in succession. These macros are entropy compressed by Joint Photographic Experts Group-Lossless Standard (JPEG-LS) finally. The complex step of codeword searching in Vector Quantization (VQ) is avoided by a predefined partition rule, which is suitable for hardware imple-mentation. By control of the pre-processor and VQ scheme, either high quality compression under un- filtered case or high ratio compression under filtered case can be realized, with the average Peak Sig-nal-to-Noise Ratio (PSNR) more than 43dB and 37dB respectively. Compared with the state-of-the-art method and the previously proposed method, our compression approach outperforms in compression performance as well as in flexibility.
