贝卡的历险日记

担心着．担心着．北风来了,冰雪的脚步近了。一切都像没睡醒的样子．昏昏然紧闭着喉。山冷冻起来了．水凉起来了太阳在地平线下躲起来了．海豹偷偷地从水里钻出来．傻傻的．胖胖的．海洋里．浮冰上．瞧去．一大片一大片满是的．坐着．漂着．打两个滚．踢几块．水．赛几趟泳．捉几回迷藏。     

同分布的NA序列加权和的强大数律

讨论了同分布NA随机变量序列加权和的强大数律,所得结果推广了Z．D．Bai和P．E．Cheng及S．H．Sung的结果．     

近程空中目标航路研究

本文在等加速俯冲飞行假定下．分析了近程空中目标航路的特点，并据此提出了目标航路模型．经过投影变换，把目标航路模型转化为二次函数．从而使目标航路的滤波及预报问题得到简化．采用进推最小二乘(RLS)原理．给出了目标航路的在线滤波器及预报器．最后．对本文方法进行了仿真．并对仿真结果进行了分析．     

Dickson多项式与差集

1998年,Maschietti用超卵形线构造了几个循环差集．R．Evans,H．D．L．Holloman, C．Krattnthaler与Qing Xiang等给出了其对应的二元序列具有良好自相关函数的简单代数证明．在本文中,证明了超卵形线与二对一映射有着紧密的联系,并且推广了Maschietti的结果．     

三角Hopf代数表示范畴上的Lie余代数

本文在三角Ｈｏｐｆ代数表示范畴上系统地研究了Ｌｉｅ余代数,在此范畴上 的Ｌｉｅ余代数与Ｈｏｐｆ代数之间建立了重要的联系．主要给出了Ｌｉｅ余代数的余包络 余代数的结构．所得结果自然是关于Ｌｉｅ代数的对偶结果,推广了 Ｓｗｅｅｄｌｅｒ Ｍ． Ｅ．, Ｇｕｒｅｖｉｃｈ Ｄ．Ｉ．, Ｍｉｃｈａｅｌｉｓ Ｗ．和 Ｍａｉｉｄ Ｓ．等人的结果．     

三角Hopf代数表示范畴上的Lie余代数

本文在三角Ｈｏｐｆ代数表示范畴上系统地研究了Ｌｉｅ余代数,在此范畴上 的Ｌｉｅ余代数与Ｈｏｐｆ代数之间建立了重要的联系．主要给出了Ｌｉｅ余代数的余包络 余代数的结构．所得结果自然是关于Ｌｉｅ代数的对偶结果,推广了 Ｓｗｅｅｄｌｅｒ Ｍ． Ｅ．, Ｇｕｒｅｖｉｃｈ Ｄ．Ｉ．, Ｍｉｃｈａｅｌｉｓ Ｗ．和 Ｍａｉｉｄ Ｓ．等人的结果．     

完全分配格上的点式拟一致结构与p．q．度量

在完全分配格上建立了点式拟一致结构理论．讨论了诱导拓扑分子格中闭包，局部基，连续等性质．证明了每个拓扑分子格皆可点式拟一致化．另外借助纯距离函数与真正的远域映射族给出了［８］中ｐ．ｑ．度量的等价定义与刻画，得到了点式拟一致分子格的ｐ．ｑ．度量化定理．     

到复Grassmann流形的多重调和映照的构造

本文给出了一些到复Ｇｒａｓｓｍａｎｎ流形的多重调和映照的构造定理,从而推广了莫小欢,Ｂｕｒｓｔａｌｌ　Ｆ． Ｅ．,Ｗｏｏｄ Ｊ． Ｃ．和 Ｕｄａｇａｗａ Ｓ．的结果．     

S.I.S.向量随机测度在弱拓扑及相容拓扑下的收敛性

本文主要研究ｓ．ｉ．ｓ．向量随机测度在弱拓扑及相容拓扑下的收敛性,给出了ｓ．ｉ．ｓ．向量随机测度在弱拓扑 容拓扑下的Ｖｉｔａｌｉ－Ｈａｌｍ－Ｓａｋｓ定理,作为应用,我们建立了Ｒ＾１－值有界可测函数关于Ｂａｎａｃｈ空间值ｓ．ｉ．ｓ．向量随机测度的随机积分的收敛定理,并得到了具ｔｙｐｅｐ的Ｂａｎａｃｈ空间中ｓ．ｉ．ｓ．向量随机测度的大数定律及中心极限定理。     

D.C.隶属函数模糊集及其应用(Ⅱ)--D.C.隶属函数模糊集的万能逼近性

本文是D．C．隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D．C．隶属函数模糊集，建立了D．C．隶属函数模糊集对模糊集的万有逼近性。探讨了D．C．隶属函数模糊集与模糊数之间的关系，给出了用D．C．隶属函数模糊集逼近模糊数的e-Cellina逼近形式，得到模糊数与D．C．函数之间的一个对应算子，指出了用模糊数表示D．C．函数的问题。     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

递推阻尼最小二乘法的收敛性与稳定性

递推最小二乘法是参数辨识中最常用的方法,但容易产生参数爆发现象.因此对一种更稳定的辨识方法——递推阻尼最小二乘法进行了收敛特性的分析.在使用算法之前先归一化测量向量,结果表明,参数化距离收敛于一个零均值随机变量,并且在持续激励条件下,适应增益矩阵的条件数有界.参数化距离的方差有界.     

An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem

In this paper, the problem of locating new facilities in a competitive environment is considered. The problem is formulated as the firm expected profit maximization and a set of nodes is selected in a graph representing the geographical zone. Profit depends on fixed and deterministic location costs and, since customers are independent decision-makers, on the expected market share. The problem is an instance of nonlinear integer programming, because the objective function is concave and submodular. Due to this complexity a branch & bound method is developed for solving small size problems (that is, when the number of nodes is less than 50), while a heuristic is necessary for larger problems. The branch & bound is called data-correcting method, while the approximate solutions are obtained using the heuristic-concentration method.     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

Banach空间有界线性算子强连续双半群

本文在Ｂａｎａｃｈ空间上研究单参数有界线性算子族－强连续双半群。     

On the density of the minimal subspaces generated by discrete linear Hamiltonian systems

This paper focuses on the density of the minimal subspaces generated by a class of discrete linear Hamiltonian systems. It is shown that the minimal subspace is densely defined if and only if the maximal subspace is an operator; that is, it is single valued. In addition, it is shown that, if the interval on which the systems are defined is bounded from below or above, then the minimal subspace is non-densely defined in any non-trivial case.