贝卡的历险日记

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

同分布的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余代数

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

关于N.A.Menger PN-空间中概率收缩偶与非线性方程组的解的注记

引进了（Х,△）－型概率收缩偶的概念,它简化并减弱了张石生给出的概率收缩偶的定义,在Ｎ．Ａ．ＭｅｎｇｅｒＰＮ－空间中研究了具有这类概率收缩偶的非线性算子方程组的解的存在性与唯一性问题,改进并推广了Ｍ．Ａｌｔｍａｎ,Ａ．Ｃ．Ｌｅｅ．Ｗ．Ｊ．Ｐａｄｇｅｔｔ,张石生等人的相应结果。     

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

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

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

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

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

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

SU(1,1)对称量子系统时间最优控制

基于李群分解,讨论了控制不受限情况下SU(1,1)对称量子控制系统的时间最优控制问题.针对系统控制哈密顿项为椭圆型和抛物型这两种情形,分别给出了实现任意演化矩阵所需要的最短时间.针对系统控制哈密顿项为双曲型情形,给出了实现任意演化矩阵所需要最短时间的一个上界.     

Central intertwining lifting,maximum entropy and their permanence

The central intertwining lifting is used to establish a maximum principle for the commutant lifting theorem. This maximum principle is used to prove that the central intertwining lifting is also a maximal entropy solution for the commutant lifting theorem, when T is a unilateral shift of finite multiplicity. The maximum principle is based on the residual spaces for intertwining liftings, and is motivated by Robinson's minimum energy delay principle for outer functions. A permanence property for the central intertwining lifting is also given.     

A NEW STEPSIZE FOR THE STEEPEST DESCENT METHOD

The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction may converge very slowly. An important result was given by Barzilar and Borwein, which is proved to be superlinearly convergent for convex quadratic in two dimensional space, and performs quite well for high dimensional problems. The BB method is not monotone, thus it is not easy to be generalized for general nonlinear functions unless certain non-monotone techniques being applied. Therefore, it is very desirable to find stepsize formulae which enable fast convergence and possess the monotone property. Such a stepsize αk for the steepest descent method is suggested in this paper. An algorithm with this new stepsize in even iterations and exact line search in odd iterations is proposed. Numerical results are presented, which confirm that the new method can find the exact solution within 3 iteration for two dimensional problems. The new method is very efficient for small scale problems. A modified version of the new method is also presented, where the new technique for selecting the stepsize is used after every two exact line searches. The modified algorithm is comparable to the Barzilar-Borwein method for large scale problems and better for small scale problems.     

Dual simplex method for GUB problems

The dual simplex method for generalized upper bound (GUB) problems is presented. One of the major operations in the dual simplex method is to update the elements of therth row, wherer is the index for the leaving basic variable. Those updated elements are used for the ratio test to determine the entering basic variabble. A very simple formula for therth row update for the dual simplex method for a GUB problem is derived, which is similar to the formula for the standard linear program. This derivation is based on the change key operation, which is to exchange the key column and its counterpart in the nonkey section. The change key operation is possible because of a theorem that guarantees the existence of such a counterpart.     

Empirical likelihood for semiparametric regression model with missing response data

A bias-corrected technique for constructing the empirical likelihood ratio is used to study a semiparametric regression model with missing response data. We are interested in inference for the regression coefficients, the baseline function and the response mean. A class of empirical likelihood ratio functions for the parameters of interest is defined so that undersmoothing for estimating the baseline function is avoided. The existing data-driven algorithm is also valid for selecting an optimal bandwidth. Our approach is to directly calibrate the empirical log-likelihood ratio so that the resulting ratio is asymptotically chi-squared. Also, a class of estimators for the parameters of interest is constructed, their asymptotic distributions are obtained, and consistent estimators of asymptotic bias and variance are provided. Our results can be used to construct confidence intervals and bands for the parameters of interest. A simulation study is undertaken to compare the empirical likelihood with the normal approximation-based method in terms of coverage accuracies and average lengths of confidence intervals. An example for an AIDS clinical trial data set is used for illustrating our methods.     

Analysis of a mathematical model for tumor growth under indirect effect of inhibitors with time delay in proliferation

In this paper, a mathematical model for tumor growth with time delay in proliferation under indirect effect of inhibitor is studied. The delay represents the time taken for cells to undergo mitosis. Nonnegativity of solutions is investigated. The steady-state analysis is presented with respect to the magnitude of the delay. Existence of Hopf bifurcation is proved for some parameter values. Local and global stability of the stationary solutions are proved for other ones. The analysis of the effect of inhibitor's parameters on tumor's growth is presented. The results show that dynamical behavior of solutions of this model is similar to that of solutions for corresponding non-retarded problems for some parameter values.     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…     

Cubature Formulas of a Nonalgebraic Degree of Precision

We deal with cubature formulas that are exact for polynomials and also for polynomials multiplied by r, where r is the Euclidean distance to the origin. A general lower bound for the number of nodes for a specified degree of precision is given. This bound is improved for centrally symmetric integrals. A set of constraints (consistency conditions) is introduced for the construction of fully symmetric formulas. For one dimension and arbitrary degree, it is shown that the lower bound is sharp for centrally symmetric integrals. For higher dimensions, as an illustration, cubature formulas are only constructed for low degrees. March 6, 2000. Date revised: April 30, 2001. Date accepted: May 31, 2001.     

Testing for increasing convex order in several populations

Increasing convex order is one of important stochastic orderings. It is very often used in queueing theory, reliability, operations research and economics. This paper is devoted to studying the likelihood ratio test for increasing convex order in several populations against an unrestricted alternative. We derive the null asympotic distribution of the likelihood ratio test statistic, which is precisely the chi-bar-squared distribution. The methodology for computing critical values for the test is also discussed. The test is applied to an example involving data for survival time for carcinoma of the oropharynx.