基于进化规划的自适应IIR滤波

针对基于梯度下降算法的自适应IIR滤波器（AIIRF）具有潜在的不稳定性和性能指标函数容易陷入局部极小而导致性能下降等问题，本文将进化规划用于AI－IRF的优化设计，不仅解决了AIIRF系统稳定性问题，而且有效地实现了滤波器性能指标函数的全局寻优和快速收敛，同时允许大动态范围的输入号。计算机仿真结果验证了基于进化规划算法的AIIRF的性能优于基于梯度算法的AIIRF，尤其对高阶、极点靠近单位圆的自适应IIR滤波器。     

一种探测二维电磁目标的新方法

电磁目标的探测对通信而言有着十分重要的意义。本文描述一种收敛迅速、结果准确、抗强随机噪声的探测二维电磁目标的新方法。首先从体等效原理出发得到一个积分方程组，此方程组可求解散射问题。随后，对此方程组求变分，变形后得到散射场变化与介电参数变化之间关系的矩阵方程，即反演方程。文中列举了几个例子，通过数值实验结果证明本法收敛速度快、反演精度高、适应复杂目标的能力强，能抗强随机噪声干扰     

A machine learning system for identifying transmembrane domains from amino acid sequences

We present our machine learning system, that uses inductive logic programming techniques to learn how to identify transmembrane domains from amino acid sequences. Our system facilitates the use of operators such as ‘contains’, that act on entire sequences, rather than on individual elements of a sequence. The prediction accuracy of our new system is around 93%, and this compares favourably with earlier results. This work was carried out with the support of a research grant from ISIS, Fujitsu Laboratories.     

Sub-optimal solutions to track detection problem using graph theoretic concepts

This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity.     

新型迷宫式气锚及其应用

新型迷宫式气锚将重力分离原理和离心分离原理有机地结合在一起，其基本型气锚主要由上、下两级组成。上级为离心式螺旋气锚，下级为重力分离式和离心分离式综合气锚，可使油气流经同一长度锚筒时，达到双倍的分离效果。可根据油井气量的大小（气液比值）组成任意级数，实现油气的高效分离。还可对低产能井、沉没度易出现负值的油井进行油气分离，维持油井一定时间的生产。现场28口井的应用表明，新型迷宫式气锚油气分离效果理想，能有效地提高泵效，平均泵效由原来的28．9％提高到43．8％。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

直缝焊管机组生产冷弯型钢产品初探

主要介绍了φ２１９直缝焊管机组生产高速公路护栏 成型原理、工艺布置、变形方式、变形图和轧辊设计。     

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

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

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