Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil s...Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].展开更多
Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularizatio...Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.展开更多
We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt（G, x） = ∑in=yt（G） dr（G, i） x＇, where dr（G, i） is the cardinality of total dominating sets of...We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt（G, x） = ∑in=yt（G） dr（G, i） x＇, where dr（G, i） is the cardinality of total dominating sets of G of size i, and yt（G） is the total domination number of G. In [7] We have obtained some properties of Dt（G, x） and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V（G）, dt（G, i） = 7 dt（V）（G, i）, 1 〈 i 〈 n. And, for any k-regular graph of order n, dr（G, i） = （7）, i 〉 n-k and d,（G, n-k） = （kn） - n. We have calculated the total domination polynomial of Petersen graph D,（P, x） = 10X4 ＋ 72x5 ＋ 140x6 ＋ 110x7 ＋ 45x8 ＋ [ 0x9 ＋ x10. Also, for any two vertices u and v of a k-regular graph Hwith N（u） ≠ N（v） and if Dr（G, x） = Dt（ H, x ）, then G is also a k-regular graph.展开更多
In this paper, we first introduce the concept of the inclusive regular separation in L-fuzzy topological spaces. Then we compare the inclusive regular separation with pointed regular separation and regular separation,...In this paper, we first introduce the concept of the inclusive regular separation in L-fuzzy topological spaces. Then we compare the inclusive regular separation with pointed regular separation and regular separation, and discuss the implicative and non-implicative relations among the above three separations. Finally, we illustrate that the inclusive regular separation is harmonic with the inclusive normal separation and inclusive completely regular separation.展开更多
In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic character...In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic characterization of regularity, the authors give a characterization of monotone normality of ordered spaces. A new proof of the UrysohnNachbin lemma is presented which is quite different from the classical one.展开更多
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a...A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a classification of all s-regular cyclic coverings of the complete bipartite graph of order 6 was given in [8] for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. In this paper, the authors classify all s-regular dihedral coverings of the complete graph of order 4 for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. As a result, a new infinite family of cubic 1-regular graphs is constructed.展开更多
This paper is concerned with the global existence and the partial regularity for the weak solution of the Landau-Lifshitz-Maxell system in two dimensions with Neumann boundary conditions.
In standard canonical correlation analysis (CCA), the data from definite datasets are used to estimate their canonical correlation. In real applications, for example in bilingual text retrieval, it may have a great po...In standard canonical correlation analysis (CCA), the data from definite datasets are used to estimate their canonical correlation. In real applications, for example in bilingual text retrieval, it may have a great portion of data that we do not know which set it belongs to. This part of data is called unlabeled data, while the rest from definite datasets is called labeled data. We propose a novel method called regularized canonical correlation analysis (RCCA), which makes use of both labeled and unlabeled samples. Specifically, we learn to approximate canonical correlation as if all data were labeled. Then, we describe a generalization of RCCA for the multi-set situation. Experiments on four real world datasets, Yeast, Cloud, Iris, and Haberman, demonstrate that, by incorporating the unlabeled data points, the accuracy of correlation coefficients can be improved by over 30%.展开更多
基金The research is supported by the NSFC(No.10961014)the NSF of Jiangxi Provincethe SF of Education Department of Jiangxi Province and the SF of Jiangxi Normal University.
基金supported by the Natural Science Foundation of China (No.11901062)the Sichuan Natural Science Foundation (No.2024NSFSC0417)。
文摘Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].
基金supported by the Natural Science Foundation of China(No.61273179)Department of Education,Science and Technology Research Project of Hubei Province of China(No.D20131206,No.20141304)
文摘Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.
文摘We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt（G, x） = ∑in=yt（G） dr（G, i） x＇, where dr（G, i） is the cardinality of total dominating sets of G of size i, and yt（G） is the total domination number of G. In [7] We have obtained some properties of Dt（G, x） and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V（G）, dt（G, i） = 7 dt（V）（G, i）, 1 〈 i 〈 n. And, for any k-regular graph of order n, dr（G, i） = （7）, i 〉 n-k and d,（G, n-k） = （kn） - n. We have calculated the total domination polynomial of Petersen graph D,（P, x） = 10X4 ＋ 72x5 ＋ 140x6 ＋ 110x7 ＋ 45x8 ＋ [ 0x9 ＋ x10. Also, for any two vertices u and v of a k-regular graph Hwith N（u） ≠ N（v） and if Dr（G, x） = Dt（ H, x ）, then G is also a k-regular graph.
基金the National Natural Science Foundation of China (10471083)Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE
文摘In this paper, we first introduce the concept of the inclusive regular separation in L-fuzzy topological spaces. Then we compare the inclusive regular separation with pointed regular separation and regular separation, and discuss the implicative and non-implicative relations among the above three separations. Finally, we illustrate that the inclusive regular separation is harmonic with the inclusive normal separation and inclusive completely regular separation.
基金Project supported by the National Natural Science Foundation of China (No.19831040) the Science Foundation of the Ministry of Education of China and the Jiangxi Provincial Natural Science Foundation of China.
文摘In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic characterization of regularity, the authors give a characterization of monotone normality of ordered spaces. A new proof of the UrysohnNachbin lemma is presented which is quite different from the classical one.
基金the Excellent Young Teachers Program of the Ministry of Education of Chinathe National Natural Science Foundation of China+1 种基金 the Scientific Research Foundation for the Returned Overseas Chinese Scholars the Ministry of Education of China and the Com2MaC-KOSEF in Korea.
文摘A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a classification of all s-regular cyclic coverings of the complete bipartite graph of order 6 was given in [8] for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. In this paper, the authors classify all s-regular dihedral coverings of the complete graph of order 4 for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. As a result, a new infinite family of cubic 1-regular graphs is constructed.
文摘This paper is concerned with the global existence and the partial regularity for the weak solution of the Landau-Lifshitz-Maxell system in two dimensions with Neumann boundary conditions.
基金Project (No. 5959438) supported by Microsoft (China) Co., Ltd
文摘In standard canonical correlation analysis (CCA), the data from definite datasets are used to estimate their canonical correlation. In real applications, for example in bilingual text retrieval, it may have a great portion of data that we do not know which set it belongs to. This part of data is called unlabeled data, while the rest from definite datasets is called labeled data. We propose a novel method called regularized canonical correlation analysis (RCCA), which makes use of both labeled and unlabeled samples. Specifically, we learn to approximate canonical correlation as if all data were labeled. Then, we describe a generalization of RCCA for the multi-set situation. Experiments on four real world datasets, Yeast, Cloud, Iris, and Haberman, demonstrate that, by incorporating the unlabeled data points, the accuracy of correlation coefficients can be improved by over 30%.
