紧凑 Tokamak(球形环)聚变堆第一壁及中心导体柱上中子负荷及核热计算与分析

采用通用蒙特卡罗粒子输运程序ＭＣＮＰ／３８计算低环径比Ｔｏｋａｍａｋ（紧凑环或球形环）聚变堆第一壁及中心导体上的中子壁负荷分布和核热沉积分布，并与常规Ｔｏｋａｍａｋ堆第一壁上中子壁负荷分布和核热沉积分布进行比较、分析。结果表明，在中子壁负荷归一化为１ＭＷ／ｍ２时，与常规Ｔｏｋａｍａｋ相比，在低环径比Ｔｏｋａｍａｋ堆第一壁及中心柱表面上中子壁负荷分布峰值并不比常规Ｔｏｋａｍａｋ堆第一壁上的峰值高，而且低于低环径比Ｔｏｋａｍａｋ堆整个第一壁上的平均值，而中心柱上的核热沉积峰值稍高于常规Ｔｏｋａｍａｋ堆第一壁上的核热沉积峰值，但对较高中子壁负荷情况，中心导体柱上的核热沉积和辐照损伤仍可能是比较严重和值得特别研究的问题。     

Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times

In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.     

Optimal search for signals in a multichannel system: Arbitrary initial distribution in state space merging scheme

Markovian and semi-Markovian random processes are used to analyze the problem of optimal search for signals in a multichannel communication system with arbitrarily distributed random outputs. The search efficiency factor is found in explicit form based on state space merging, and a mathematical programming problem is set up to find a numerical suboptimal solution. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 144–150, May–June 2007.     

Cubic Bézier approximation of a digitized curve

In this paper we present an efficient technique for piecewise cubic Bézier approximation of digitized curve. An adaptive breakpoint detection method divides a digital curve into a number of segments and each segment is approximated by a cubic Bézier curve so that the approximation error is minimized. Initial approximated Bézier control points for each of the segments are obtained by interpolation technique i.e. by the reverse recursion of De Castaljau's algorithm. Two methods, two-dimensional logarithmic search algorithm (TDLSA) and an evolutionary search algorithm (ESA), are introduced to find the best-fit Bézier control points from the approximate interpolated control points. ESA based refinement is proved to be better experimentally. Experimental results show that Bézier approximation of a digitized curve is much more accurate and uses less number of points compared to other approximation techniques.     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

A novel document similarity measure based on earth mover’s distance

In this paper we propose a novel measure based on the earth mover’s distance (EMD) to evaluate document similarity by allowing many-to-many matching between subtopics. First, each document is decomposed into a set of subtopics, and then the EMD is employed to evaluate the similarity between two sets of subtopics for two documents by solving the transportation problem. The proposed measure is an improvement of the previous OM-based measure, which allows only one-to-one matching between subtopics. Experiments have been performed on the TDT3 dataset to evaluate existing similarity measures and the results show that the EMD-based measure outperforms the optimal matching (OM) based measure and all other measures. In addition to the TextTiling algorithm, the sentence clustering algorithm is adopted for document decomposition, and the experimental results show that the proposed EMD-based measure does not rely on the document decomposition algorithm and thus it is more robust than the OM-based measure.     

广义AND／OR图的自底向上的启发式搜索算法BHAO

本文首先根据三角模概念，定义了一类新的更具普遍意义的广义ＡＮＤ／ＯＲ图．根据新定义的启发式函数ｈ（ｎ，ｘ）以及广义ＡＮＤ／ＯＲ图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义ＡＮＤ／ＯＲ图的自底向上的启发式搜索算法ＢＨＡＯ．文中证明了算法ＢＨＡＯ的可采纳性．本文还提出了两类新的启发式函数的单调限制概念，并据此研究了算法ＢＨＡＯ的单调限制性质，研究了两个ＢＨＡＯ算法间的比较性质．     

初至波走时层析成像中的正则化方法

 波场的等效性、观测数据的有限性和观测误差等因素导致地球物理反演本身具有严重的多解性，降低这种多解性的一种重要途径就是对反演过程进行约束。传统的初至波走时层析成像方法，通常是在外部对模型空间施加显式的约束和平滑处理，这样就会破坏模型参数与传播算子之间的相关性，难以达到有效利用先验信息的目的, 甚至会影响反演的稳定性。针对这一问题，本文将先验信息分为三类，在此基础上阐述了通过正则化手段将各种先验信息纳入到反演方程当中，替代传统的外部约束模式。理论试验结果表明，正则化方法比外部约束方法有效地提高了反演的精度和分辨率；将该正则化方法应用于实际二维资料处理，也得到了比较好的反演结果。     

以数字搜索树表示的二值图象的几何变换

本文介绍以数字搜索树表示的二值图象的一种几何变换算法，文中讨论了四分区与正四边区的基本关系，输出ＤＳＴ结点成立的充分条件，给出了完整的几何变换算法并对算法的复杂性作了分析。