RELIABILITY BOUNDS IN NWUE CLASS WITH KNOWN MEAN AND VARIANCE

Let. F∈NWUE with known mean and variance. In this note a simple sharplower bound of F=1-F(t) is given.     

A FURTHER GENERALIZATION OF JUNG''''S THEOREM

Let G be a graph of order n. We define the distance between two vertices u andv in G, denoted by d(u, v), as the minimum value of the lengths of all u-v paths. We writeσ_k(G)=min{∑_i=1~k d(v_i)|{v_1, v_2,…, v_k} is an independent set in G} and NC2(G)=min {|N(u)∪N(v)| | d(u, v)=2}. We denote by ω(G) the number of components of agraph G. A graph G is called 1-tough if ω(G\S)≤|S| for every subset S of V(G) withω(G\S)>l. By c(G) we denote the length of the longest cycle in G; in particular, G iscalled a Hamiltonian graph if c(G)=n. H.A. Jung proved that every 1-tough graphwith order n≥11 and σ2≥n-4 is Hamiltonian. We generalize it further as follows: ifG is a 1-tough graph and σ3(G)≥n, then c(G)≥min {n,2NC2(G)+4}. Thus, theconjecture of D. Bauer, G. Fan and H.J. Veldman in [2] is completely solved.     

ASYMPTOTIC ANALYSIS OF THE OPTIMAL CONTROL OF AN ELASTODYNAMIC SYSTEM

Based on the idea of the reduction of optimal control systems in singularperturbations of Lions and a priori estimates in [4], we prove the convergence of theoptimal control, state and the cost function between a singular linear elastodynamic systemand a limit system. Our asymptotic analysis is applicable to the optimal control of flexiblerobotic manipulators.     

The Interactive Method: A New Approach to Solving a Kind of Mixed Integer Programming

Porduction planning often comes up in the form of programming problems with continuous variables, where investment project planing usually reduces to zero-one programming. Combination of the choices of investment projects with the existent production capacity, therefore, yields mixed integer programming. With this background, this paper provides a new approach to solving mixed integer programming problems by combining the man-machine interactive method for multiobjective programming with graphics generating techniques.     

黄头鹡鸰雏鸟生长能学的研究

在黄头 (Motacillacitreola)自然生长状态下 ,通过测定雏鸟气体代谢和身体组织能量积累的方法 ,研究了它们在生长期间的能量投入 .最小能量投入在 0～ 1d (d为日龄 ,用t表示 ) ,为 10 82kJ/d . 1只雏鸟需要能量为 414 2 6kJ,其中生产能为 15 3 14kJ,用于维持的能量是 2 6 1 12kJ .     

A CONVERGENCE RESULT OF PROJECTION INDEX CONCERNING INVERSE REGRESSION

To find out the interesting structure of high-dimensional data, a transforma-tion method based on the projection pursuit technique was proposed by Li in [1]: In thispaper, a convergence result. of the first direction of the projection index concerning inverseregression is obtained.     

静压下GaAs_(1-x)P_x:N(x≤0.88)中N等电子陷阱的束缚激子发光

通过研究77 K温度下不同组份的GxAs_(1-x)P_x:N(x≤0.88)的静压光致发光,在x=0.88的样品中首次观察到NH_3 的发光,压力使N_x谱带窄化及其LO声子伴线的黄昆因子变小等现象。结果表明,压力使得混晶无序效应减弱,加强了激子从N_x?NN_i的能量转移过程。     

ON THE FOUNDATION OF ALGEBRAIC DIFFERENTIAL GEOMETRY

An algebraic differential variety is defined as the zero-set of a differentialpolynomial set,and algebraic differential geometry is devoted to the study of such varieties.We give various decomposition formulas for the structures of such zero-sets which imply inparticular,the unique decomposition of an algebraic differential variety into its irreduciblecomponents.These formulas will find applications in various directions including mechanicaltheorem-proving of differential geometries.     

应用软件系统人机界面的设计

在应用软件系统的开发中,人们日益认识到应当重新评价人在人—机系统中的地位。程序设计的基本框架从告诉计算机“如何去做”;告诉计算机“应该做些什么”;发展为人与计算机“共同来做”。与此同时,人机界面的概念也发生了显著的变化。新的人机界面结构体系和设计原则成了近几年有关学术讨论会议和文章的热门话题之一。