动态力识别的时域方法

本文提出一种识别动态力的非直接量测时域方法。首先将结构系统进行模态坐 标变换而得到无耦合的运动方程，然后把在一定微小时间间隔内的动态载荷作为一 个阶跃函数，再由实际量测或有限元分析得到系统的频响特性和量测到的该动态力 的结构响应确定模态坐标中的这一阶跃函数，就可得到动态力的时间历程。 以一个仿真实例说明方法的应用，其结果表明精度是好的，并对该方法应用中 的一些问题进行了探讨。     

用多距离特征识别三维物体的表面形状

本文讨论一种识别物体的方法。三维空间中的物体表面可以由部分球面、柱面和平面来近似,并且这些面是能够被识别的。处理方法是通过分割图象成为区域(Region)且并行处理这些区域来实现。文内叙述一种技术。这种技术应用具有激光扫描器的摄象机系统获取图象。测量三维物体相应表面点的座标。然后用相应区域中的三点决定一个参考平面,进而计算区域中的特征点到参考平面的距离。这些多距离特征可被用来识别相应区域中的物体表面是球面、柱面还是平面。这些面的方向,可用具有两个斜角的表面法线方向来描述。这种技术在自动装配线上和工业监视检验中是很有用的。可用其找出另件在三维空间中的位置和方向,计算检验另件表面形状外形尺寸等等。     

微机控制离子质量数监控与锁定装置的研制

本文在离子注入机设备领域中,提出一种新的检测控制装置.用于解决VISI和LSI 芯片生产的离子注入机设备中确保掺杂的纯度;提高低剂量注入下重复精度及操作的自动化等问题.在离子注入机的头部高压包内,使用微机进行实时控制.即检测当前质量数,用闭环调节激磁电流的方法调整B,使被分选的离子质量数自动锁定在给定值.锁定精度与高质量数的范围,优于±0.3a.m.u.本文阐述了质量数锁定的理论,实施方法和数据采集、闭环控制、系统接口防护等主要技术关键问题.     

Exact Buffer Overflow Calculations for Queues via Martingales

Let _n be the first time a queueing process like the queue length or workload exceeds a level n. For the M/M/1 queue length process, the mean _n and the Laplace transform e^-sn is derived in closed form using a martingale introduced in Kella and Whitt (1992). For workload processes and more general systems like MAP/PH/1, we use a Markov additive extension given in Asmussen and Kella (2000) to derive sets of linear equations determining the same quantities. Numerical illustrations are presented in the framework of M/M/1 and MMPP/M/1 with an application to performance evaluation of telecommunication systems with long-range dependent properties in the packet arrival process. Different approximations that are obtained from asymptotic theory are compared with exact numerical results.     

Uniform l1 behaviour for time discretization of a Volterra equation with completely monotonic kernel: I. stability

This paper is the first of two papers on the time discretizationof the equation u_t + ^t ₀ ß (t — s) Au (s) ds= 0, t > 0, u (0) = u₀, where A is a self-adjoint denselydefined linear operator on a Hilbert space H with a completeeigensystem {_m, _m}_{m = 1}, and ß (t) is completely monotonicand locally integrable, but not constant. The equation is discretizedin time using first-order differences in combination with order-oneconvolution quadrature. The stability properties of the timediscretization are derived in the l¹_t (0, ; H) norm.     

On Short Time Asymptotic Behavior of Some Symmetric Diffusions on General State Spaces

For conservative symmetric diffusions on a general state space (X,m), the short time asymptotic behavior of tlog _X 1 _A T _t 1 _B dm is investigated, where T _t is the associated semigroup and A and B are measurable subsets of X. It is proved that the superior limit is dominated by the inferior limit up to some absolute constant. When ₂ of the associated Dirichlet form is lower bounded, it is shown that the limit exists for any A and B, and is described by the intrinsic metric between them. Applications to infinite-dimensional spaces and fractals are given.     

Large time behavior of small solutions to subcritical derivative nonlinear Schrödinger equations

We consider the derivative nonlinear Schrödinger equations

where the coefficient satisfies the time growth condition

is a sufficiently small constant and the nonlinear interaction term consists of cubic nonlinearities of derivative type

where and . We suppose that the initial data satifsfy the exponential decay conditions. Then we prove the sharp decay estimate , for all , where . Furthermore we show that for there exist the usual scattering states, when and the modified scattering states, when

     

The Flooding Time in Random Graphs

Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class G _p (N) of random graphs, the corresponding flooding time is investigated. The flooding time T _N (p) is the minimum time needed to reach all other nodes from one node. We show that, after scaling, the flooding time T _N (p) converges in distribution to the two-fold convolution ^(2*) of the Gumbel distribution function (z)=exp (–e ^–z ), when the link density p _N satisfies Np _N /(log N)³ if N .     

The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results

We study a one-dimensional spin (interacting particle) system, with product Bernoulli (p) stationary distribution, in which a site can flip only when its left neighbor is in state +1. Such models have been studied in physics as simple exemplars of systems exhibiting slow relaxation. In our East model the natural conjecture is that the relaxation time (p), that is 1/(spectral gap), satisfies log (p) as p0. We prove this up to a factor of 2. The upper bound uses the Poincaré comparison argument applied to a wave (long-range) comparison process, which we analyze by probabilistic techniques. Such comparison arguments go back to Holley (1984, 1985). The lower bound, which atypically is not easy, involves construction and analysis of a certain coalescing random jumps process.     

一种时序逻辑网络的快速设计方法

引用1984年尹克震提出的“开关函数的反演公式”,采用伪随机序列技术的思想,提出移位寄存器型时序逻辑网络的一种快速设计方法。