精细折线边界的粗拟合

讨论了用较少的折线段来表示精细折线边界的问题 .提出了解决该问题的一个有效算法 ,并对该算法进行了分析     

A local approach to concept generation

Generating concepts defined by a binary relation between a set of properties and a set of objects is one of the important current problems encountered in Data Mining and Knowledge Discovery in Databases. We present a new algorithmic process which computes all the concepts, without requiring an exponential-size data structure, and with a good worst-time complexity analysis, which makes it competitive with the best existing algorithms for this problem. Our algorithm can be used to compute the edges of the lattice as well at no extra cost.      

多示例学习及其研究现状

较全面地介绍和分析了第4种机器学习框架的多示例学习(MIL)．首先通过数学表达式对多示例学习进行描述，概括了其主要性质；然后总结了目前主要的求解多示例学习问题的算法，剖析了这些算法的主要思想；最后对多示例学习的未来发展作了展望．     

利用圆域法进行电算地改值的进一步探讨

本文讨论了重力测量中的方域地形校正方案存在的不足,提出了用矩形网络的高程数据进行圆域地形校正的方案。在计算对比了方域地形校正结果(用压缩物质线和二维数值积分法计算)和圆域地形校正结果与真值之差后,认为本文所提的方案是可行的。     

A Mathematical Interval Model of a Combinatorial Problem of Packing of Color Rectangles

Based on the use of elements of interval geometry, a mathematical model of the problem of packing of color rectangles in a strip with prohibited zones is constructed. The model takes into account errors of initial data.     

Calculation of multicomponent vapor–liquid critical point using the Dividing Rectangles global optimization algorithm

In this paper, the Dividing Rectangles (D.R.) global optimization technique is used to predict the critical temperature and pressure for multicomponent systems. The D.R. optimization algorithm is a fast and reliable optimization method without any need for adjustable parameters, initial guesses or objective function derivation. For calculating the critical point the tangent plane distance (TPD) in terms of the Helmholtz energy is selected. The Peng Robinson (PR) equation of state is applied for determining thermodynamic relations. The procedure of the critical point calculation by means of global optimization is described stepwise in order to clarify the concept and method of programing. The D.R.-based computer program is tested for some multicomponent systems and the results are compared with the Simulated Annealing (SA) global optimization method and with experimental data. The results indicated that the number of the objective function calls (the main parameter that increases the speed and efficiency of an optimization algorithm) is reduced to one twentieth with almost the same accuracy.     

Dynamic Root Rectangles Part One: The Fundamentals

Incommensurable ratios cannot be stated in finite, whole number fractions. But such ratios can organize spatial compositions so that the same ratio persists through endless divisions. We explore this proportioning principle, which Jay Hambidge calls “dynamic symmetry,” as it appears in “root rectangles” of incommensurable proportions.     

多卷材二维下料问题的一种启发式算法

讨论多卷材二维剪切下料问题,即使用多种不同宽度的卷材剪切出若干种一定数量的矩形件,优化目标为材料利用率最高。提出一种顺序启发式下料算法,构造排样方式生成算法,首先根据卷材宽度方向切割废料最小原则,确定矩形件在卷材宽度方向上的排列方式;然后根据卷材长度方向切割废料最小原则,确定卷材的长度以及矩形件在卷材长度方向上的排列方式。按照当前矩形件需求量调用上述排样方式生成算法,生成一个排样方式满足部分矩形件需求量,重复该过程,直到所有矩形件需求量均得到满足为止。采用实际生产中的例题将本文下料算法和文献中排样系统进行比较,数值模拟结果表明:本文算法在优化结果和计算时间两方面均有效。     

当均布垂直荷载作用时半无限弹性体内侧向变位的计算

文献［１］提出了计算地基表面侧向变位的方法，本文则就均布垂直荷载作用的情况下，提出了计算半无限弹性体内侧向变位的方法，可作为文献［１］的补充。     

Output-sensitive generation of the perspective view of isothetic parallelepipeds

We present a new hidden-line elemination technique for displaying the perspective view of a scene of three-dimensional isothetic parallelepipeds (3D-rectangles). We assume that the 3D-rectangles are totally ordered based upon the dominance relation of occlusion. The perspective view is generated incrementally, starting with the closest 3D-rectangle and proceeding away from the view point. Our algorithm is scene-sensitive and uses0((n +d) logn log logn) time, wheren is the number of 3D-rectangles andd is the number of edges of the display. This improves over the heretofore best known technique. The primary data structure is an efficient alternative to dynamic fractional cascading for use with augmented segment and range trees when the universe is fixed beforehand. It supports queries inO((logn +k) log logn) time, wherek is the size of the response, and insertions and deletions inO(logn log logn) time, all in the worst case.An extended abstract of this work appeared inProceedings of the 2nd Scandinavian Workshop on Algorithm Theory (SWAT '90) (edited by J. R. Gilbert and R. Karlsson), Lecture Notes in Computer Science, Volume 447, Springer-Verlag, Berlin, 1990, pp. 71–84. Franco P. Preparata's support was provided in part by NSF research grant CCR-8906419. This research was done while on the faculty of the University of Illinois and partly while visiting Ecole Normale Supérieure in Paris, France. Jeffrey S. Vitter's support was provided in part by NSF Presidential Young Investigator Award CCR-8947808 with matching funds from an IBM research contract and by NSF research grant DCR-8403613. Part of this research was done while visiting Ecole Normale Supérieure in Paris, France. Mariette Yvinec's support was provided by CNRS.