A new stereological principle for test lines in three-dimensional space

A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples.     

静态球对称时空中的标量场辐射

采用多项式函数代替乌龟坐标的方法,给出静态球对称时空中黑洞事件视界和宇宙视界区域内标量场方程的解,并对事件视界附近势垒的性质进行了讨论。发现对带电量不同的时空,标量场辐射的形式亦有所不同;势垒随宇宙学常数的减小而变窄、变高。     

Cycle detection using a stack

We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.     

Measurement of the coolant flow rate using correlation of temperature fluctuations

The transit time of the coolant, and thus its velocity, has been measured using the temperature fluctuation at the outlet of a reactor core. An impulse response function estimation is introduced, which substitutes the widely used cross-correlation measurement technique. It is shown in theory and practice that the time delay estimation is improved when using the impulse response function instead of the cross-correlation function in parameter estimation. Extremely low velocities (down to 2 cm/sec) have been measured in a natural circulation regime in a research reactor.     

大化肥气化装置安全系统

对大化肥气化装置的安全系统的作用、硬件组成、信号的处理以及顺序控制和安全联锁进行了介绍，并详细描述了气化炉的开、停车及吹扫顺序的过程以及安全联锁的功能。     

一种新的变步长ICA自适应算法

结合互信息极小的优化判据，基于估计函数期望平方准则、外点法和最速下降法的思想，本文导出了一种新的变步长独立分量分析(ICA)自适应算法。该算法克服了固定步长在分离矩阵推导过程中出现的稳态失调问题，比基于模拟退火步长的ICA算法有更快的仞始收敛速度和较高的分离精度。同时，该算法还具有较好的时变系统跟踪能力。理论分析和仿真计算结果证实了其可以有效地提高ICA的自适虚性，更准确地完成盲信号分离。     

Application of piece‐wise linear weight functions for 2D 8‐node quadrilateral element in contact problems

The present study is a continuation of our previous work with the aim to reduce problems caused by standard higher order elements in contact problems. The difficulties can be attributed to the inherent property of the Galerkin method which gives uneven distributions of nodal forces resulting in oscillating contact pressures. The proposed remedy is use of piece‐wise linear weight functions. The methods to establish stiffness and/or mass matrix for 8‐node quadrilateral element in 2D are presented, i.e. the condensing and direct procedures. The energy and nodal displacement error norms are also checked to establish the convergence ratio. Interpretation of calculated contact pressures is discussed. Two new 2D 8‐node quadrilateral elements, QUAD8C and QUAD8D, are derived and tested in many examples, which show their good performance in contact problems. Copyright © 2004 John Wiley & Sons, Ltd.     

浅谈炼钢车间的自动控制系统

介绍了天津钢铁工业结构调整改造后的新钢铁企业炼钢车间的自动控制系统，系统的配置、主要功能，并对系统做出评价。     

Revising threshold functions

A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed.