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.     

某警戒雷达机内测试设备的分析与评估

本文结合某新型警戒雷达的实际使用情况,分析了该雷达机内测试设备(BITE)的设计特点和几个实例,指出了设计的优点和存在的问题,从中得到新雷达BITE设计的几点启示和建议。     

NEUMANN SERIES SOLUTION TO A NEUTRON TRANSPORT EQUATION OF SLAB GEOMETRY

This paper deals with the solution to an energy, dependent stationary neutrontransport equation of slab geometry. In L~p space, the equation is converted into an equiva-lent integral equation. By the study of the corresponding integral operator and its spectralradius, results of Neumann series solution are obtained, and an easy-verified condition thatthe transport equation has a nonnegative solution 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.     

An Algorithm to Identify Positive Cycles in GPRs

The purpose of this paper is to identify cycles,and in particular positive cycle(s),in anactivity network under generalized precedence relations(GPRs).An algorithm is provided to searchfor such cycle(s).An improved depth-first search is adopted.An efficient arc-oriented representationis used in the algorithm to save on computer storage requirement.     

基于Neuro-Fuzzy方法的Web服务器访问流量预测

Neuro Fuzzy方法是将神经网络和模糊逻辑有机的结合 ,用于解决复杂的非线性问题 ;用它来进行Web服务器流量预测 ,是一种新的思路和方法 .主要介绍了模型构造的基本思想、结构、算法以及实验数据     

DOCCII-based electronically tunable current-mode biquadratic filters

1.INTRODUCTION Recently,aconsiderableportionofresearchoncontinuous timefiltersconcernscurrent modefiltersbasedCCIIthat canachievehighersignalbandwidth,greaterlinearityand largerdynamicrangethanvoltage modefilters,allkinds ofdifferentcurrent modefiltersaregreatlypresentedand wildlyresearched[1～3]. Manyapplicationsrequirefilterthatcanelec tronicallytune,especially,sophisticatedtechniquesof signalprocessingdemandthefiltertovaryfilter’spa rameterselectronicallyanddynamically.Incurrent …     

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.     

与最新LEP实验结果一致的现实的大统一前子模型

CERN1989年下半年安装完毕的正负电子对撞机LEP给出的最新实验结果表明,标准模型中存在具有轻中微子的夸克和轻子的代数是3。按此结果要求,我们得出一个手征的、给出三代轻粒子的现实的禁闭弱作用大统一前子模型。