The Lambda Library: unnamed functions in C++

The Lambda Library (LL) adds a form of lambda functions to C++, which are common in functional programming languages. The LL is implemented as a template library using standard C++; thus no language extensions or preprocessing is required. The LL consists of a rich set of tools for defining unnamed functions. In particular these unnamed functions work seamlessly with the generic algorithms in the C++ Standard Library. The LL offers significant improvements, in terms of generality and ease of use, compared to the current tools in the C++ Standard Library. Copyright © 2003 John Wiley & Sons, Ltd.     

Metric-based reasoning about pseudocode design in the partial metrics system

The goal of the PMS project is to produce an environment in which the intelligent online assessment of the design for large-scale ADA programming projects is provided. The focus is on the representation of knowledge about the design process for an individual module. Changes in pseudocode complexity are measured in terms of partial metrics. These metrics can take the designers inferences about the pseudocode program structure into account when assessing module complexity. Next, a model of the stepwise refinement process is given which demonstrates how pseudocode elaboration decisions can be modelled in partial metric terms. Finally, the decisions associated with each refinement step for 17 example refinements taken from the computer science literature are described using partial metrics.     

Fuzzy Multiobjective and Linear Programming Based Management Models for Optimal Land-Water-Crop System Planning

In this article, linear programming and fuzzy optimization models are developed for planning and management of available land-water-crop system of Mahanadi-Kathajodi delta in eastern India. The models are used to optimize the economic return, production and labour utilization, and to search the related cropping patterns and intensities with specified land, water, fertilizer and labour availability, and water use pattern constraints. Due to extreme backwardness of the study area, it has been decided to keep all the three objectives of the linear programming models at the same priority level to obtain the compromised solution in a fuzzy environment that incorporates the imprecision in fuzzy goals and fuzzy constraints. These non-structural models facilitate the conjunctive use of available surface water and groundwater resources. A comparative evaluation along with the benefit-cost ratios of the existing and proposed farming systems is also presented.     

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