Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which...Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.展开更多
The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy ...The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.展开更多
Let R be a ring and I an ideal of R. A ring R is called I-semi-π--regular if R/I is π-regular and idempotents of R can be strongly lifted modulo I. Characterizations of I-semi-π-regular rings are given and relation...Let R be a ring and I an ideal of R. A ring R is called I-semi-π--regular if R/I is π-regular and idempotents of R can be strongly lifted modulo I. Characterizations of I-semi-π-regular rings are given and relations between semi-π-regular rings and semiregular rings are explored.展开更多
<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral p...<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of</span><span style="font-family:Verdana;"> the same type. Tiling a plane with semi-regular polygons depends not only on the type of a semi-regular polygon, but also on its interior angles that join at a node. In relation to the interior angles, semi-regular equilateral polygons with the same or different interior angles can be joined in the nodes. Here, we shall first consider tiling a plane with semi-regular equilateral polygons with 2m-sides. The analysis is performed by determining the set of all integer solutions of the corresponding Diophantine equation in the form of <img alt="" src="Edit_c185b1c4-6b78-4af5-b1c2-4932af77bf65.png" />, where<img alt="" src="Edit_2e6548d5-3254-4005-b19e-9d49cd5d6f81.png" />are the non-negative integers which are not equal to zero at the same time, and <img alt="" src="Edit_a6dbde8a-5f3a-43d4-bc89-27dcc3057d23.png" />are the interior angles of a semi-regular equilateral polygon from the characteristic angle. It is shown that of all semi-regular equilateral polygons with 2m-sides, a plane can be tiled only with the semi-regular equilateral quadrilaterals and semi-regular equilateral hexagons. Then, the problem of tiling a plane with semi-regular equilateral quadrilaterals is analyzed in detail, and then the one with semi-regular equilateral hexagons. For these semi-regular polygons, all possible solutions of the corresponding Diophantine equations were analyzed and all nodes were determined, and then the problem for different values of characteristic elements was observed. For some of the observed cases of tiling a plane with these semi-regular polygons, some graphical presentations of tiling constructions are also given.</span> </p>展开更多
We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone ac...We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone acting from a Banach space X to a subset of a Banach space Y with locally closed graph. The convergence of the GG-PPA is present here by choosing a sequence of functions with , which is Lipschitz continuous in a neighbourhood O of the origin and when T is metrically regular. More precisely, semi-local and local convergence of GG-PPA are analyzed. Moreover, we present a numerical example to validate the convergence result of GG-PPA.展开更多
Based on semi - order fuzzy supermaringales andsubmartingales, the semi- order fuzzy supermartingaleand submartingale theory is developed. The main resultis to generalize the Doob decomposition and the Riesz de-compos...Based on semi - order fuzzy supermaringales andsubmartingales, the semi- order fuzzy supermartingaleand submartingale theory is developed. The main resultis to generalize the Doob decomposition and the Riesz de-composition theorems of standard martingale theory tosemi - order fuzzy supermaringales and submartingales.The structure of semi - order fuzzy supermaringales andsubmartingales and the conditions of that they has Doobdecomposition (resp. Riesz decomposition) are discussedin detail.展开更多
In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regul...In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regularization methods to approximate solutions of following variational inequalities: and with operator A being monotone hemi-continuous form real Banach reflexive X into its dual space X*, but instead of knowing the exact data (y<sub>0</sub>, A), we only know its approximate data satisfying certain specified conditions and D is a nonempty convex closed subset of X;the real function f defined on X is assumed to be lower semi-continuous, convex and is not identical to infinity. At the same time, we will evaluate the convergence rate of the approximate solution. The regularization methods here are different from the previous ones.展开更多
基金Supported by the Hi-Tech Research and Development Program of China (No. 2009AAJ130)
文摘Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.
文摘The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.
基金Foundation item:This work is partially supported by the NNSF(10171011)of Chinathe NNSF(10571026)of Chinathe Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutes of MOE,P.R.C.
文摘Let R be a ring and I an ideal of R. A ring R is called I-semi-π--regular if R/I is π-regular and idempotents of R can be strongly lifted modulo I. Characterizations of I-semi-π-regular rings are given and relations between semi-π-regular rings and semiregular rings are explored.
文摘<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of</span><span style="font-family:Verdana;"> the same type. Tiling a plane with semi-regular polygons depends not only on the type of a semi-regular polygon, but also on its interior angles that join at a node. In relation to the interior angles, semi-regular equilateral polygons with the same or different interior angles can be joined in the nodes. Here, we shall first consider tiling a plane with semi-regular equilateral polygons with 2m-sides. The analysis is performed by determining the set of all integer solutions of the corresponding Diophantine equation in the form of <img alt="" src="Edit_c185b1c4-6b78-4af5-b1c2-4932af77bf65.png" />, where<img alt="" src="Edit_2e6548d5-3254-4005-b19e-9d49cd5d6f81.png" />are the non-negative integers which are not equal to zero at the same time, and <img alt="" src="Edit_a6dbde8a-5f3a-43d4-bc89-27dcc3057d23.png" />are the interior angles of a semi-regular equilateral polygon from the characteristic angle. It is shown that of all semi-regular equilateral polygons with 2m-sides, a plane can be tiled only with the semi-regular equilateral quadrilaterals and semi-regular equilateral hexagons. Then, the problem of tiling a plane with semi-regular equilateral quadrilaterals is analyzed in detail, and then the one with semi-regular equilateral hexagons. For these semi-regular polygons, all possible solutions of the corresponding Diophantine equations were analyzed and all nodes were determined, and then the problem for different values of characteristic elements was observed. For some of the observed cases of tiling a plane with these semi-regular polygons, some graphical presentations of tiling constructions are also given.</span> </p>
文摘We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone acting from a Banach space X to a subset of a Banach space Y with locally closed graph. The convergence of the GG-PPA is present here by choosing a sequence of functions with , which is Lipschitz continuous in a neighbourhood O of the origin and when T is metrically regular. More precisely, semi-local and local convergence of GG-PPA are analyzed. Moreover, we present a numerical example to validate the convergence result of GG-PPA.
文摘Based on semi - order fuzzy supermaringales andsubmartingales, the semi- order fuzzy supermartingaleand submartingale theory is developed. The main resultis to generalize the Doob decomposition and the Riesz de-composition theorems of standard martingale theory tosemi - order fuzzy supermaringales and submartingales.The structure of semi - order fuzzy supermaringales andsubmartingales and the conditions of that they has Doobdecomposition (resp. Riesz decomposition) are discussedin detail.
文摘In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regularization methods to approximate solutions of following variational inequalities: and with operator A being monotone hemi-continuous form real Banach reflexive X into its dual space X*, but instead of knowing the exact data (y<sub>0</sub>, A), we only know its approximate data satisfying certain specified conditions and D is a nonempty convex closed subset of X;the real function f defined on X is assumed to be lower semi-continuous, convex and is not identical to infinity. At the same time, we will evaluate the convergence rate of the approximate solution. The regularization methods here are different from the previous ones.
