C语言编程在智能化重力加速度测试仪中的应用

在基于单片机的智能化重力加速度测试仪中采用Ｃ语言编程简化了程序设计任务，对于汇编语言难于处理的浮点数运算及汉字打印输出可通过Ｃ语言编译器的内部库函数调用实现，介绍了一种专为８０５１系列单片机设计的Ｃ语言编译器Ｆｒａｎｋｉｌｉｎ Ｃ５１，它具有代码优化功能，能产生极高效率的机器码，并且提供了丰富的内部函数库。描述了Ｃ５１函数库所支持的ＩＥＥＥ标准浮点数的内存格式以及采用ｓｐｒｉｎｔｆ（）函数处理包括     

一个矢量形式的双圆弧插值算法

本文在分析数控插补最常用的双圆弧插值算法特点的基础上，将以局部坐标系中的三角运算为核心的传统双圆弧插值算法，改造成为以整体坐标系中的线性运算为核心的矢量形式的双圆弧插值算法，从而减少了计算的复杂性和程序的复杂性，提高了效率和可靠性。     

红外遥感用低温制冷器的进展

低温制冷器与红外探测器配套，是军事现代化、高新技术等急需发展的关键产品。国内研制技术也已接近国际先进水平，基本掌握了小型化、低振动、长寿命、细方形漆包线制作、间隙密封、消除电磁干扰等相关关键技术。本文列出了已研制过的直线电机谐振压缩机的主要技术性能。希望主管、用户、研制、生产各方通力合作，应用－改进－再应用－再改进，实现我国低温制冷器的产业化。     

An eight‐node hybrid‐stress solid‐shell element for geometric non‐linear analysis of elastic shells

This paper presents eight‐node solid‐shell elements for geometric non‐linear analysis of elastic shells. To subdue shear, trapezoidal and thickness locking, the assumed natural strain method and an ad hoc modified generalized laminate stiffness matrix are employed. A selectively reduced integrated element is formulated with its membrane and bending shear strain components taken to be constant and equal to the ones evaluated at the element centroid. With the generalized stresses arising from the modified generalized laminate stiffness matrix assumed to be independent from the ones obtained from the displacement, an extended Hellinger–Reissner functional can be derived. By choosing the assumed generalized stresses similar to the assumed stresses of a previous solid element, a hybrid‐stress solid‐shell element is formulated. Commonly employed geometric non‐linear homogeneous and laminated shell problems are attempted and our results are close to those of other state‐of‐the‐art elements. Moreover, the hybrid‐stress element converges more readily than the selectively reduced integrated element in all benchmark problems. Copyright © 2002 John Wiley & Sons, Ltd.     

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     

The Logarithmic Image Processing Model: Connections with Human Brightness Perception and Contrast Estimators

The logarithmic image processing (LIP) model is amathematical framework based on abstract linear mathematicswhich provides a set of specific algebraic and functionaloperations that can be applied to the processing of intensityimages valued in a bounded range. The LIP model has been provedto be physically justified in the setting of transmitted lightand to be consistent with several laws and characteristics ofthe human visual system. Successful application examples havealso been reported in several image processing areas, e.g.,image enhancement, image restoration, three-dimensional imagereconstruction, edge detection and image segmentation.The aim of this article is to show that the LIP model is atractable mathematical framework for image processing which isconsistent with several laws and characteristics of humanbrightness perception. This is a survey article in the sensethat it presents (almost) previously published results in arevised, refined and self-contained form. First, an introductionto the LIP model is exposed. Emphasis will be especially placedon the initial motivation and goal, and on the scope of themodel. Then, an introductory summary of mathematicalfundamentals of the LIP model is detailed. Next, the articleaims at surveying the connections of the LIP model with severallaws and characteristics of human brightness perception, namelythe brightness scale inversion, saturation characteristic, Weber'sand Fechner's laws, and the psychophysical contrast notion. Finally,it is shown that the LIP model is a powerful and tractable framework for handling the contrast notion. This is done througha survey of several LIP-model-based contrast estimators associated with special subparts (point, pair of points,boundary, region) of intensity images, that are justified bothfrom a physical and mathematical point of view.     

线性时变系统的区间稳定性与鲁棒稳定性

本文应用向量比较定理研究线性时变系统的区间稳定性和具非线性时变摄动的线性时变系统的鲁棒稳定性，所得的新结果包含文献的一些主要结果作为特例，本文的研究方法说明向量比较方法是分析区间稳定性和鲁棒稳定性的一种自然而有力的工具。     

Best L1 Piecewise Monotonic Data Modelling

Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(n^k) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L₁ monotonic calculation. This procedure is highly efficient, requiring at most O(kn²) computer operations and O(n) best L₁ monotonic calculations to subranges of data for a global minimum.     

Running programs backwards: The logical inversion of imperative computation

Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools.     

Practical method for generation expansion planning based on dynamic programming

This paper presents an efficient method which provides the optimal generation mix and the optimal generation construction process. The approximation method in which the dynamic programming technique and gradient method are combined is applied to determine the optimal generation mix with hydropower generation technologies. The successive approximations dynamic programming (SADP) technique, which is very suitable for high-dimensional multistage decision process problems, is used for obtaining the optimal generation construction process. The effectiveness and feasibility of the developed technique are demonstrated on a practical power system model which has five types of generation technologies including a hydropower generation technology.