HIS变换用于数字化航空片影象同多光谱影象的复合

本文探讨ＨＩＳ变换对数字化航空片影象与ｌａｎｄｓａｔ ＴＭ多光谱影象进行复合的方法，并在此基础上提出一种改进的方法。试验结果表明本文提出的方法是一种非常行之有效的方法。复合后的影象不仅保留了ＴＭ影像的光谱特征，而且将其空间分解力由３０ｍ提高到１０ｍ，清晰度也提高了。因而复合后的影像能提高分类精度，制作专题图的精度、多时相监测能力和解译水平等。     

暴雨洪水流域系统随机模拟(研究之三)

本文提出的移置特大暴雨的不连序序列的随机插补方法,以及利用W—H逆变换法将偏态暴雨序列转为正态序列和随机扣除模拟的暴雨过程损失量等方法,基本是可行的,对提高模型的代表性、稳定性和实用性有重要作用。     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

配极变换及其在求解锥面截交线中的应用

本文应用配极变换的几何性质来确定锥面截交线的中心及其主要轴线，这对于准确地绘制或使用数控绘图机来绘制二次曲线．是很有意义的．     

3D Motion Estimation and Motion Fusion by Affine Region Matching

In this paper,a new method is presented for 3D motion estimation by image region correspondences using stereo cameras.Under the weak perspectivity assumption.we first employ the moment tensor theory (Cyganski and Orr^[11]) to compute the monocular affine transformations relating images taken by the same camera at different time instants and the binocular affine transformations relating images taken by different cameras at the same time instant.We then show that 3D motion can be recovered from these 2D transformations.A space-time fusion strategy is proposed to aim at robust results.No knowledge of point correspondences if requred in the above processes and the computations involved are linear.To find corresponding image regions,new affine invariants,which show stronger invariance,are derived in term of tensor contraction theory.Experiments on real motion images are conducted to verify the proposed method.     

二阶A型Cooper变换的增强型

对二阶Ａ型Ｃｏｏｐｅｒ变换进行增强，放宽可用性条件，并证明了其正确性，最后举例说明其应用。     

On the stability preserving property of the double bilinear transformation on a class of 2-D transfer functions

This paper addresses the BIBO (bounded-input bounded-output) stability of a class of discrete 2-D quarter-plane filters in the presence of nonessential singularities of the second kind (NSSK's) on the unit bidisk. Conditions under which the double bilinear transformation (DBT) preserves stability are derived. The results presented here also extend the class of systems whose stability can be predicted. Use of the inverse DBT to produce a continuous equivalent of the discrete 2-D transfer function allows easy application of a continuous-domain equivalent of a criterion developed by Dautov. The necessary and sufficient condition for stability derived in this work provides a simple check for the class of systems under consideration. From this class of systems, it is also possible to construct stable pairs of mutually inverse transfer functions.     

铝电解槽料箱排气管结构的优化改造

简要介绍了铝电解槽料箱排气管在原设计上存在的缺陷和不足，针对缺陷产生的原因进行了结构优化改造。     

Validation of a Method of Determination of Apparent Diffusivity Versus Composition in Solids

A method is presented for computing the values of apparent diffusivity in solids with respect to the concentration of the diffusing substance (water or sodium chloride). This method does not require any assumption upon the mathematical relationship between diffusivity and concentration. It can be applied to experimental measurements of local concentration versus position within the solid (profiles) with relatively few measurements (circa 10) and a mathematical smoothing of the experimental data by using an artificial neural network model. The method was first validated on simulated data obtained by using a constant diffusivity value and on experimental profiles when the relation between diffusivity and concentration was given. It was then applied to original experimental moisture profiles obtained by putting gelatin gels with different initial moisture contents into contact for up to 14 days. The method was also successfully applied to five sets of experimental moisture and sodium chloride profiles taken from the literature and obtained from different food products. Apparent diffusivities calculated by our method were found in agreement with those obtained by authors using different numerical methods to compute the diffusivity values.     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.