Differentiable spaces that are subcartesian

We show that the differential structure of the orbit space of a proper action of a Lie group on a smooth manifold is weakly reflexive. This implies that the orbit space is a differentiable space in the sense of Smith, which ensures that the orbit space has an exterior algebra of differential forms, that satisfies Smith’s version of de Rham’s theorem. Because the orbit space is a locally closed subcartesian space, it has vector fields and their flows.     

基于虚拟仪器的换热器智能控制系统设计

换热器广泛应用于建筑工程领域及工业过程中,其出口介质温度的有效控制是保证质量、节能和安全生产的重要条件,因此换热器出口水温的控制是过程控制中的重要课题。本文以西门子SMPT1000换热器温度控制系统为研究对象,建立基于虚拟仪器的智能温度控制平台。该平台在实现传统PID控制的基础上,又增加了智能控制算法,斯密斯控制和模糊控制。实验证明该智能控制平台具有修改参数简易方便、曲线准确的优点,具有良好的动静态特性,且市场应用价值高。     

Iterated monoidal categories

We develop a notion of an n-fold monoidal category and show that it corresponds in a precise way to the notion of an n-fold loop space. Specifically, the group completion of the nerve of such a category is an n-fold loop space, and free n-fold monoidal categories give rise to a finite simplicial operad of the same homotopy type as the classical little cubes operad used to parametrize the higher H-space structure of an n-fold loop space. We also show directly that this operad has the same homotopy type as the n-th Smith filtration of the Barratt-Eccles operad and the n-th filtration of Berger's complete graph operad. Moreover, this operad contains an equivalent preoperad which gives rise to Milgram's small model for when n=2 and is very closely related to Milgram's model of for n>2.     

-actions whose fixed data has a section

Given a collection of real vector bundles over a closed manifold , suppose that, for some is of the form , where is the trivial one-dimensional bundle. In this paper we prove that if is the fixed data of a -action, then the same is true for the Whitney sum obtained from by replacing by . This stability property is well-known for involutions. Together with techniques previously developed, this result is used to describe, up to bordism, all possible -actions fixing the disjoint union of an even projective space and a point.     

Computation of Spatial Covariance Matrices

In an earlier article, Ghosh derived the density for the distance between two points uniformly and independently distributed in a rectangle. This article extends that work to include the case where the two points lie in two different rectangles in a lattice. This density allows one to find the expected value of certain functions of this distance between rectangles analytically or by one-dimensional numerical integration.

In the case of isotropic spatial models or spatial models with geometric anisotropy terms for agricultural experiments one can use these theoretical results to compute the covariance between the yields in different rectangular plots. As the numerical integration is one-dimensional these results are computed quickly and accurately. The types of covariance functions used come from the Matérn and power families of processes. Analytic results are derived for the de Wijs process, a member of both families and for the power models also.

Software in R is available. Examples of the code are given for fitting spatial models to the Fairfield Smith data. Other methods for the estimation of the covariance matrices are discussed and their pros and cons are outlined.     

Hermite and Smith normal form algorithms over Dedekind domains

We show how the usual algorithms valid over Euclidean domains, such as the Hermite Normal Form, the modular Hermite Normal Form and the Smith Normal Form can be extended to Dedekind rings. In a sequel to this paper, we will explain the use of these algorithms for computing in relative extensions of number fields.

     

4G手机无线接入系统设计及实现

用射频微波电路集成技术设计第4代(4G)手机无线接入系统．从分布参数概念出发，主要在smith圆图上进行电路设计．由微带线进行电路的实现，电路将各功能单元集成在微带基板上，具有体积小、重量轻、可靠性高、与手机其他电路易于共形等特点．运用网络转移参量矩阵理论进行了系统响应预估，结果表明所设计的无线接入系统满足4G移动终端的性能要求．     

六元gcd封闭集上Smith矩阵的整除性

我们给出了关于六元gcd封闭集S的充分必要条件,使得在整数矩阵环M_6(Z)中,定义在S上的e次幂GCD矩阵(S~e)整除e次幂LCM矩阵[S~e].这部分解决了Hong在2002年提出的一个公开问题.     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.