System identification based on distribution theory and wavelet transform

A review of system identification based on distribution theory is given. By the Schwartz kernel theorem, to every continuous linear system there corresponds a unique distribution, called kernel distribution. Formulae using wavelet transform to access time--frequency information of kernel distributions are deduced. A new wavelet-based system identification method for health monitoring systems is proposed as an application of a discretized formula using stationary wavelet transform.     

关于我国体质指数BMI的分布研究

生活水平的提高,使肥胖症患的人数逐年增加。大量研究证明,肥胖是诱发高血压、冠心病、糖尿病、高脂血症等慢性病的一种主要危险因素,对肥胖症的预防是主要的。确定肥胖的一个简单而又有效的办法是利用世界卫生组织推荐的体质指数ＢＭＩ（Ｂｏｄｙ Ｍａｓｓ Ｉｎｄｅｘ）。本基于上海市延吉地区近万名３０岁以上成年人的调查结果,对体质指数的分布进行了研究,并利用被污染的正态分布族模型对其进行了拟合。     

非合作n人投标报价服从N(μ,σ~2)分布时局中人投标报价策略的研究

推导了矩阵对策模型 ,对非合作 n人投标报价的分布进行 x2 检验。当非合作 n人投标报价服从N (μ,σ2 )分布时 ,根据参数区间公式 ,估计非合作 n人有效报价平均数的范围 ,局中人 最佳报价可根据矩阵对策模型来确定。该方法确定的报价与最佳标底的误差能控制在较小的范围内 ,适用于招标中合成标底的评标办法 ,对确定报价具有一定的实用价值。     

一般线性李超代数及其超群的无穷小子群的表示

在索特征代数闭域上考虑一般线性李超代数gl(m |n)的限制表示与超群GL(m | n)的有理表示以及它们的关系.主要结果为: (1)对gl(m | n)的不可约限制表示进行分类,其中某些单模恰是Kac-模.类似于复数域情形,给出了Kac-模不可约的充要条件; (2)当m≠n(mod p)以及p≥2h-2(h=max{m,n})时,gl(m | n)的限制投射模可以被提升为有理GL(m | n)-模,并且证明了不可约表示的投射覆盖具有Z-滤过,即滤过中的每个子商同构于"baby Vlerma模";(3)得到了一般线性超群G=GL(m | n)的r阶nobenius核的反转公式,它反映了单Gγ-模的投射覆盖的Z-滤过重数与广义baby Verma模的合成因子效之间的关系.     

Distribution dependent stochastic differential equations

Due to their intrinsic link with nonlinear Fokker-Planck equations and many other applications, distribution dependent stochastic differential equations (DDSDEs) have been intensively investigated. In this paper, we summarize some recent progresses in the study of DDSDEs, which include the correspondence of weak solutions and nonlinear Fokker-Planck equations, the well-posedness, regularity estimates, exponential ergodicity, long time large deviations, and comparison theorems.     

On the concept of point value in the infinite-dimensional realization theory

In this article, we study the effect of the chosen representation of a point value (and point evaluation) on the class of periodic signals realizable using a certain type of infinite-dimensional linear system. By suitably representing the point evaluation at the origin in a Hilbert space, we are able to give a complete characterization of its extensions. These extensions involve a new concept called δ-sequence, the use of which as an observation operator of an infinite-dimensional linear system is studied in this article. In particular, we consider their use in the realization of periodic signals. We also investigate how the use of δ-sequences affects the convergence properties of such realizations; we consider the rate and character of convergence and the removal of the Gibbs phenomenon. As still a further demonstration of the significance of the chosen concept of a point value, we discuss the use of distributional point values in the realization of periodic distributions. The possible applications of this work lie in regulator problems of infinite-dimensional control theory, as is indicated by the well-known internal model principle.     

Distribution dependent SDEs for Landau type equations

The distribution dependent stochastic differential equations (DDSDEs) describe stochastic systems whose evolution is determined by both the microcosmic site and the macrocosmic distribution of the particle. The density function associated with a DDSDE solves a nonlinear PDE. Due to the distribution dependence, some standard techniques developed for SDEs do not apply. By iterating in distributions, a strong solution is constructed using SDEs with control. By proving the uniqueness, the distribution of solutions is identified with a nonlinear semigroup $P_t^1$ on the space of probability measures. The exponential contraction as well as Harnack inequalities and applications are investigated for the nonlinear semigroup $P_t^1$ using coupling by change of measures. The main results are illustrated by homogeneous Landau equations.     

按序列分布混沌与拓扑混合

本文讨论了按序列分布混沌与拓扑混合的关系,并证明了:若X为至少两点的可分局部紧致度量空间,连续映射f:X→X是拓扑混合的,则对于任一正整数递增序列{mi},存在X的c-稠密Fσ子集D是f按{mi}的某子序列的分布混沌集.     

Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep

We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation are our implementations of distribution sweep and three variations of plane sweep. Distribution sweep is specifically designed for the situations in which the problem is too large to be solved in internal memory, and theoretically has optimal I/O cost. Plane sweep is a well-known and powerful technique in computational geometry, and is optimal for this particular problem in terms of internal computation. The three variations of plane sweep differ by the sorting methods (external versus internal sorting) used in the preprocessing phase and the dynamic data structures (B-tree versus 2-3-4-tree) used in the sweeping phase. We generate the test data by three programs that use a random number generator while producing some interesting properties that are predicted by our theoretical analysis. The sizes of the test data range from 250 thousand segments to 2.5 million segments. The experiments provide detailed quantitative evaluation of the performance of the four algorithms, and the observed behavior of the algorithms is consistent with their theoretical properties. This is, to the best of our knowledge, the first experimental algorithmic study comparing the practical performance between external-memory algorithms and conventional algorithms with large-scale test data.