基于进化规划的自适应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.     

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     

最小生成树的高效异步并行算法

在ＭＩＭＤ－ＳＭ并行计算模型上，本文给出了时间复杂性为Ｏ（ｎ（ｎ／ｐ＋ｌｏｇｐ））的最小生成树的异步并行算法，其中ｎ，ｐ（１≤ｐ≤ｎ）分别表示图的顶点数和处理机的个数。     

不同预载下的球轴承变形的程序设计

球轴承作为重要的支承部件，广泛用于惯性仪表之中。通过对球轴承的变形理论进行分析，建立了轴承的总体平衡方程，并将轴承的变形问题转化为数学上求解目标函数的极小值问题，用ＰＯＷＥＬＬ优化方法编制了能不同排列形向心推力球轴承在不同预载下及在径向、轴向联合工作负荷作用下的变形、接触应力进行计算的ＦＯＲＴＲＡＮ程序，解决了手工计算解决了不的问题，从而为分析不同结构参数和载荷对球轴承刚度的影响提供了重要手段，为     

单词排版的两种算法

在对英文排版时，我们既应考虑单词之间的间隔，以便清晰可读，又应考虑节省版面，以便降低费用，本文通过详细地讨论两种算法可以解决这一矛盾。