Solving Neumann Boundary Problem with Kernel-Regularized Learning Approach

We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner product defined on both the unit ball and the unit sphere, construct the kernel-regularized learning algorithm from the view of semi-supervised learning and bound the upper bounds for the learning rates. The theory analysis shows that the learning algorithm has better uniform convergence according to the number of samples. The research can be regarded as an application of kernel-regularized semi-supervised learning.

A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH

A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided.

The Cordiality on the Union of 3-regular Connected Graph and Cycle

Diab proved the following graphs are Cordial;Pm K1,n if and only if(m,n) =(1,2);Cm K1,n;Pm Kn;Cm Kn for all m and n except m ≡ 2(mod 4).In this paper,we proved the Cordiality on the union of 3-regular connected graph K3 and cycle Cm.First we have the Lemma 2,if uv ∈ E(G),G is Cordial,we add 4 vertices x,y,z,w in sequence to the edge uv,obtain a new graph denoted by G*,then G* is still Cordial,by this lemma,we consider four cases on the union of 3-regular connected graph R3,and for every case we distinguish four subcases on the cycle Cm.

Extensions of strongly π-regular general rings

The concept of the strongly π-regular general ring （with or without unity） is introduced and some extensions of strongly π-regular general rings are considered. Two equivalent characterizations on strongly π- regular general rings are provided. It is shown that I is strongly π-regular if and only if, for each x ∈I, x^n =x^n＋1y = zx^n＋1 for n ≥ 1 and y, z ∈ I if and only if every element of I is strongly π-regular. It is also proved that every upper triangular matrix general ring over a strongly π-regular general ring is strongly π-regular and the trivial extension of the strongly π-regular general ring is strongly clean.

COUNTING ROOTED NEAR-4-REGULAR EULERIAN MAPSON SOME SURFACES

In this article the rooted planar near-4-regular Eulerian trails are enum erated and an explicit form ula for such m aps is presented. Further, the rooted near-4-regular Eulerian m aps on the torus are counted in an exact w ay.

Co-regular集的可计算性探讨

引入了在TTE框架下,利用开集和闭集的表示式,定义了度量空间中co-regular集的若干不等价表示式;并对这些表示式的强弱关系进行了论证。研究表明:这些表示式的强弱,有一个明确的顺序;在被引入的不等价表示式中,η:=θ<∧ψ>是co-regular集所有表示式中最强的。

Co-regular集上的可计算算子

Co-regular热集是Rd上的一类集合,在第二类能行性理论(简称TTE)的框架下,研究co-regular集组成的类P上若干算子的可计算性,这些算子主要包括交、并、象、原象、补集的内部运算和开集的co-regularization等.结果表明,此前提出的所有不等价表示式中,只有个别表示式对这些算子是可计算的.

Counting Rooted Nearly 2-regular Planar Maps

The number of rooted nearly 2-regular maps with the valency of root-vertex, the number of non-rooted vertices and the valency of root-face as three parameters is obtained. Furthermore, the explicit expressions of the special cases including loopless nearly 2-regular maps and simple nearly 2-regular maps in terms of the above three parameters are derived.

Cover a 3-regular Claw-free Graph by Induced Matchings

The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪···∪V(Mk)covers V(G).This paper shows that,if G is a 3-regular claw-free graph,then imc(G)∈{2,3}.

On π-regularity of General Rings

A general ring means an associative ring with or without identity.An idempotent e in a general ring I is called left (right) semicentral if for every x ∈ I,xe=exe (ex=exe).And I is called semiabelian if every idempotent in I is left or right semicentral.It is proved that a semiabelian general ring I is π-regular if and only if the set N (I) of nilpotent elements in I is an ideal of I and I /N (I) is regular.It follows that if I is a semiabelian general ring and K is an ideal of I,then I is π-regular if and only if both K and I /K are π-regular.Based on this we prove that every semiabelian GVNL-ring is an SGVNL-ring.These generalize several known results on the relevant subject.Furthermore we give a characterization of a semiabelian GVNL-ring.

MAXIMAL L^(1)-REGULARITY OF GENERATORS FOR BOUNDED ANALYTIC SEMIGROUPS IN BANACH SPACES

In this paper,we prove that the generator of any bounded analytic semigroup in(θ,1)-type real interpolation of its domain and underlying Banach space has maximal L^(1)-regularity,using a duality argument combined with the result of maximal continuous regularity.As an application,we consider maximal L^(1)-regularity of the Dirichlet-Laplacian and the Stokes operator in inhomogeneous B_(q),^(s),1-type Besov spaces on domains of R^(n),n≥2.

cs＊-regular Families and Metrization Theorems

In this paper, we proved that a sequential space has a cs＊-regular cs＊-network （or a cs＊-regular weak base） is metrizable, which generalized related results in [6], [12] and [14].

A Note on the Girth of 3-Regular Hamiltonian Graph

It is well-known that the Petersen graph is nonhamiltonian.A very short proof for this result was presented in[2]due to D.B.West.In this note,by extending the proof technique in[2],we briefly show that the girth of every 3-regular hamiltonian graph on n≥10 vertices is at most(n+4)/3.

I-semi-π-regular Rings

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.

Performance index based learning controls for the partial non-regular systems using lifting technique

Deficiencies of the performance-based iterative learning control （ILC） for the non-regular systems are investigated in detail, then a faster control input updating and lifting technique is introduced in the design of performance index based ILCs for the partial non-regular systems. Two ldnds of optimal ILCs based on different performance indices are considered. Finally, simulation examples are given to illustrate the feasibility of the proposed learning controls.

On P-Regularity of Acts

By a regular act we mean an act that all its cyclic subacts are projective. In this paper we introduce P-regularity of acts over monoids and will give a characterization of monoids by this property of their right (Rees factor) acts.

A Note about σ-locally Finite PF-regular Closed Net

If X = U{Xn: N} is a regular space, Xn has aσ-locally finite PF-regular closed net, and Xn is a closed subset of X for each n N, then X has a σ-locally finite PP-regular closed net;

Tiling a Plane with Semi-Regular Equilateral Polygons with 2m-Sides

In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of 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 , whereare the non-negative integers which are not equal to zero at the same time, and 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.

Non-Regular Example of Confidence-Interval Construction

When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are functions of the parameter, finding good approximation for the sampling distribution of MLE (needed to construct an accurate confidence interval for the parameter’s true value) may get very challenging. We demonstrate the nature of this problem, and show how to deal with it, by a detailed study of a specific situation. We also indicate several possible ways to bypass MLE by proposing alternate estimators;these, having relatively simple sampling distributions, then make constructing a confidence interval rather routine. .

Non-Regular Example of Confidence-Interval Construction

When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are functions of the parameter, finding good approximation for the sampling distribution of MLE (needed to construct an accurate confidence interval for the parameter’s true value) may get very challenging. We demonstrate the nature of this problem, and show how to deal with it, by a detailed study of a specific situation. We also indicate several possible ways to bypass MLE by proposing alternate estimators;these, having relatively simple sampling distributions, then make constructing a confidence interval rather routine. .