测量输入光窗台阶指标的指示表的选择

阐述了对近贴聚焦型微通道板像增强管中输入光窗台阶高度和平整度指标进行测量时，所用指示仪表的选择依据，并详细分析了指示表在检定过程中的误差来源，进一步计算出其合成标准不确定度和扩展不确定度，从而选定可用于测试的指标表。     

无线局域网技术及应用

无线局域网技术是目前发展迅速的技术，相对于有线局域网有许多优点。随着无线网络产品性能的提高和价格的不断下降，无线局域网技术有着广泛的应用前景。据此对无线局域网的基本概念、特点及其技术作了简单的介绍，提出了无线局域网面向应用的几种解决方案，并对发展前景作了预测。     

碰撞能量对He-N2的散射截面的影响

用密耦近似方法计算了He和N2体系的微分截面和总截面及转动激发分波截面,得出微分截面及总截面随入射能量变化的规律.     

椭圆强非局域空间光孤子

对傍轴椭圆高斯光束在具有椭圆对称响应特性的强非局域非线性介质中的演化规律进行研究，得到了光束各参量演化的精确解析解，分析了单向空间光孤子和强非局域椭圆空间光孤子的形成条件，发现了椭圆光孤子的相移与介质响应函数的椭圆率有关. 关键词： 椭圆对称强非局域响应介质 椭圆强非局域空间光孤子 相移     

Performance Analysis for Mobile Ad Hoc Network in Random Graph Models with Spatial Reuse

In this paper,we present a random graph model with spatial reuse for a mobile ad hoc network(MANET) based on the dynamic source routing protocol.Many important performance parameters of theMANET are obtained,such as the average flooding distance (AFD),the probability generating function of theflooding distance,and the probability of a flooding route to be symmetric.Compared with the random graphmodel without spatial reuse,this model is much more effective because it has a smaller value of AFD and alarger probability for finding a symmetric valid route.     

空气比热容比实验的非绝热问题

通过一系列的实验数据分析，发现空气比热容比实验中非绝热现象不可以忽略．     

Hydrodynamical limit for a drift-diffusion system modeling large-population dynamics

In this paper we study the stability of the following nonlinear drift-diffusion system modeling large population dynamics ∂_tρ+div(ρU−ε∇ρ)=0, divU=±ρ, with respect to the viscosity parameter ε. The sign in the second equation depends on the attractive or repulsive character of the field U. A proof of the compactness and convergence properties in the vanishing viscosity regime is given. The lack of compactness in the attractive case is caused by the blow-up of the solution which depends on the mass and on the space dimension. Our stability result is connected, depending of the character of the potentials, with models in semiconductor theory or in biological population.     

Vassiliev invariants for braids on surfaces

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.

     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.