膜结构裁剪及展开的修正二次测地线法

对膜结构裁剪分析中目前应用较广的裁剪线的生成方法进行了比较研究，提出修正二次测地线法。确定了采用测地线作为裁剪线及展开图形的基准线。之后对已有图形展开方法——二次测地线法做了适当改进，提出修正二次测地线法。     

A decomposition heuristics for the container ship stowage problem

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases. This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence on Integrated Logistics (CIELI) of the University of Genoa, Italy     

Normalization and noise-reduction algorithm for fringe patterns

This paper presents a fringe pattern normalization and noise-reduction algorithm. Locally the background noise is suppressed, the modulation normalized and the noise smoothed. An expression to calculate the cosine-only term is formulated. It is related to the directional derivatives of the intensity fringes. Two-dimensional Fourier series are used to calculate the parameters needed for the algorithm. Experimental work is presented using diffraction and ESPI images. The programming is relatively simple and involves mainly local convolutions. The processing time using a 2 GHz computer to normalize an image of 256 × 256 pixels is approximately one second.     

The k-means range algorithm for personalized data clustering in e-commerce

This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications.     

基于遗传禁忌算法的双资源约束下并行生产线调度研究

并行生产线调度问题兼有并行机器和流程车间调度问题的特点,是一类新型的调度问题。在考虑遗传算法早熟收敛特性和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传算法和禁忌搜索算法的双资源并行作业车间的调度优化问题算法,即考虑到了产品的调度受到机器、工人等资源制约的影响,对算法中种群的构造,适应度计算,遗传操作等方面进行了研究,最后给出了实例仿真和结论。     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

一种非刚性医学图像点匹配方法

提出了一种非刚性点匹配的算法并把其运用于医学图像配准．该算法采用信号滤波的方法来获得点集间的匹配信息，并运用松弛标记法将各点邻域关系对模糊的匹配信息进行迭代获得明确的匹配关系．在此基础上，利用高斯径向基函数来描述点模式间的弹性形变，在基本的迭代框架下实现问题的求解．实验结果显示在形变程度为5％、出格点比率50％和噪声标准差为5％的情况下该算法的匹配误差能控制在0．13以下，表明了该算法的鲁棒性和有效性，较好地解决了医学非刚性形变的点匹配问题．     

On the multi-attribute stopping problem with general value functions

We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions.     

On local optima in multiobjective combinatorial optimization problems

In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algorithms are given.     

英语专业师范生语音模式规范化的必要性

语音是学任何一门语言的基础。语音的规范化直接影响学习者语言的学习效果，因此对英语专业师范生的语音模式要进行严格规范。