Forcing with Proper Classes

ＦｏｒｃｉｎｇｗｉｔｈＰｒｏｐｅｒＣｌａｓｓｅｓＬｉＮａ（ＤｅｐａｒｔｍｅｎｔｏｆＰｏｌｉｔｉｃｓ，ＨｅｎａｎＵｎｉｖｅｒｓｄｙ，Ｋａｉｆｅｎｇ，４７５００１）Ａｂｓｔｒａｃｔ：Ｔｈｉｓｐａｐｅｒ，ｕｓｉｎｇｔｈｅｍｏｄｅｌＲΔ（Ｂ）－ａｇｅｎｅｒａ...     

Stability of Linear Integrodifferential Systems with Time-varied Confficients with Large Scale

51.IntroductionConsideralinearintegrodifferentialsystemswithtime-variedconfficientswherex6R",A(t)isanXnrealmatrixfunctioncontinuousforoO.ManyscholarshavecontributedtheirpaPers[1-4]todiscussstabilityofzerosolutionofsystem(1.l).Inthispaper,weassumethatsystem(1.1)canbedecomPOsedintotheform=n,A,j(t)isaniXnjrealmatrixfunctioncontinuousforo相似文献   

On wheel–rail contact problem with material properties varying with depth

Numerous laboratory experiments indicate that the use of a layer or a coating material attached to the conventional steel body reduce the magnitude of contact stress. Therefore in this paper we solve numerically the wheel–rail contact problem with friction and wear assuming the existence of a small elastic layer on the rail surface. Material properties of this layer are changing with its depth. The friction between the bodies is governed by Coulomb law. In contact zone Archard's law of wear is assumed. We take special features of this rolling contact problem and use so-called quasistatic approach to solve this contact problem. Finite element method is used as a discretization method. The numerical results including the distribution of normal stress along the contact boundary are provided and discussed. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Counting and Probably with Overlap

LastfallatCentralMiddleSchool,43boysand 5 4girlsplayedonasoccerteam .Sincethereisnooverlapbetweenboysandgirls,itiseasytofindhowmanystudentsplayedsoccer .UsethePutting TogetherModelforAdditiontoget 43 + 5 4=97.Youcandrawapicture ,calledaVenndiagram ,toillus tratethissituation ,Separatecirclesrepresentquantitieswithnooverlap .CountingWhenThereIsOverlapSituationswithoverlaparemorecomplicated .Example3 7girlsfromCentralMiddleSchoolplayedbasketballinthewinter .If 9girlsplayedbothsoccerandba…     

Collocation with WEB–Splines

We describe a collocation method with weighted extended B–splines (WEB–splines) for arbitrary bounded multidimensional domains, considering Poisson’s equation as a typical model problem. By slightly modifying the B–spline classification for the WEB–basis, the centers of the supports of inner B–splines can be used as collocation points. This resolves the mismatch between the number of basis functions and interpolation conditions, already present in classical univariate schemes, in a simple fashion. Collocation with WEB–splines is particularly easy to implement when the domain boundary can be represented as zero set of a weight function; sample programs are provided on the website http://www.web-spline.de. In contrast to standard finite element methods, no mesh generation and numerical integration is required, regardless of the geometric shape of the domain. As a consequence, the system equations can be compiled very efficiently. Moreover, numerical tests confirm that increasing the B–spline degree yields highly accurate approximations already on relatively coarse grids. Compared with Ritz-Galerkin methods, the observed convergence rates are decreased by 1 or 2 when using splines of odd or even order, respectively. This drawback, however, is outweighed by a substantially smaller bandwidth of collocation matrices.     

Graphlike Manifolds with Contraction 

Ｇｒａｐｈｌｉｋｅ　Ｍａｎｉｆｏｌｄｓ　ｗｉｔｈ　Ｃｏｎｔｒａｃｔｉｏｎ　ＧｒａｐｈｌｉｋｅＭａｎｉｆｏｌｄｓｗｉｔｈＣｏｎｔｒａｃｔｉｏｎＬｉｕＸｉａｏｚｈｅｎ（ＨｅｎａｎＩｎｓｔｉｔｕｔｅｏｆＦｉｎａｎｃｅａｎｄＥｃｏｎｏｍｉｃｓ，Ｚｈｅｎｇｚ...     

π-Formulas with free parameters

In terms of the hypergeometric method, we establish ten general $\pi$-formulas with free parameters which include several known results as special cases.     

Littlewood-Paley operators with variable kernels

In this paper we study a certain directional Hilbert transform and the bound-edness on some mixed norm spaces. As one of applications, we prove the Lp-boundedness of the Littlewood-Paley operators with variable kernels. Our results are extensions of some known theorems.     

Graphlike Manifolds with Contraction 

ＧｒａｐｈｌｉｋｅＭａｎｉｆｏｌｄｓｗｉｔｈＣｏｎｔｒａｃｔｉｏｎ ＬｉｕＸｉａｏｚｈｅｎ（刘晓真）Ｇｒａｐｈｌｉｋｅ　Ｍａｎｉｆｏｌｄｓ　ｗｉｔｈ　Ｃｏｎｔｒａｃｔｉｏｎ ￥ＬｉｕＸｉａｏｚｈｅｎ（ＨｅｎａｎＩｎｓｔｉｔｕｔｅｏｆＦｉｎａｎｃｅａｎ...     

Testing for additivity with B-splines

Regression splines are often used for fitting nonparametric functions, and they work especially well for additivity models. In this paper, we consider two simple tests of additivity: an adaptation of Tukey's one degree of freedom test and a nonparametric version of Rao's score test. While the Tukey-type test can detect most forms of the local non-additivity at the parametric rate of O(n-1/2), the score test is consistent for all alternative at a nonparametric rate. The asymptotic distribution of these test statistics is derived under both the null and local alternative hypotheses. A simulation study is conducted to compare their finite-sample performances with some existing kernel-based tests. The score test is found to have a good overall performance.     

Chaos in a simple nonlinear system with Atangana–Baleanu derivatives with fractional order

Recently, Atangana and Baleanu proposed a derivative with fractional order to answer some outstanding questions that were posed by many researchers within the field of fractional calculus. Their derivative has a non-singular and nonlocal kernel. In this paper, we presented further relationship of their derivatives with some integral transform operators. New results are presented. We applied this derivative to a simple nonlinear system. We show in detail the existence and uniqueness of the system solutions of the fractional system. We obtain a chaotic behavior which was not obtained by local derivative.     

Extended partial geometries with minimal μ

Recently Fisher and Hobart extended the original work of Buekenhout and Hubaut on extended generalized quadrangles with a certain minimal value (minimal ) for the nonempty residue intersections. We show that there is another minimal which is sometimes better than the earlier one, and we extend all this to the case of extended partial geometries. We examine especially the triangular case, and find only a few new possibilities, which we are unable to settle, although some of these look extremely interesting.     

On Graphlike Manifolds with Contraction

ＯｎＧｒａｐｈｌｉｋｅＭａｎｉｆｏｌｄｓｗｉｔｈＣｏｎｔｒａｃｔｉｏｎＹｕａｎＦｕｙｏｎｇ（袁夫永）（ＵｎｉｖｅｒｓｉｔｙｏｆｓｔａｆｆａｎｄＷｏｒｋｅｒｓｏｆＡｇｒｉｃｕｌｔｕｒｅＲｅｃｌａｍａｔｉｏｎ）ＬｉｕＹａｘｉｎｇ（刘亚星）（Ｄｅｐａｒｔ...     

Generalized Maupertuis’ principle with applications

We give a rigorous proof of the equivalence of Ma's supercritical potential and the minimal action with respect to an associated Jacobi-Finsler metric. As a consequence, we give an explicit representation of the weak KAM solutions of one-dimensional mechanical systems without the quadratic assumption on the kinetic energy term of the Hamiltonians, and a criterion of the integrability result for such a system of arbitrary degree of freedom by the regularity assumption on Mather's α-function is discussed.     

On Projective Modules with Constant Ranks

On Projective Modules with Constant RanksIn this paper,we investigate module structures of rings over which every finitely generated projective module with constant rank is stably free. As applications,we give characterizations of some related rings.     

Meromorphic Convex Functions with Negative Coefficients

Let σ_k(a) be the class of functions f(f)=1/z-sur from n=1 to ∞(|a_n|z~n), regular in the punctured disk E={z:0<|z|<1} and satisfying Re(1 zf"(z)/f'(z))<-a (0≤a<1) for z∈E. In this paper we obtain coefficient inequalities, distortion and closure Theorems for the class σ_k(a). Further we obtain the class preserving integral operator of the form     

DNA labelled graphs with DNA computing

Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l_1(x),..., l_k(x))to each point x of D such that l_j(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(l_k-i 1(x),..., l_k(x))=(l_1(y),..., l_i(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph.