基于平行截面上轮廓之间重构问题的研究

研究了基于平行截面上两多边形轮廓重构的基本问题,给出了利用体积最大化作为度量标准来求得一个"较好"并且合法的重构的目标函数,然后得出:其中一个多边形轮廓在其所在的截面上沿着法向平移、在截面内平移和在截面内等比例缩放都不影响最大化体积后的结果。该结论对于三维实体的可视化和几何造型领域具有重要的实用价值。     

Matlab和C++接口中函数注册的实现

函数注册在Matlab和C 接口中起着重要的作用。在介绍函数注册作用的基础上 ,详细分析了函数注册的过程及应当注意的问题 ,并给出了一种实现函数注册的最简单的方法。用实例展示了函数注册的具体实现过程。     

A Jacobi-type method for computing balanced realizations

A new numerical scheme for computing balancing coordinate transformations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and nonorthogonal Jacobi-type rotations is considered. The algorithm is shown to be globally convergent to a balancing transformation that arranges the Hankel singular values in a prescribed ordering. Local quadratic convergence of the algorithm is shown.     

Solving multiple objective quasi-convex goal programming problems by linear programming

This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi-convex linear penalty functions. The proposed method initially expresses a quasi-convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi-objective quasi-convex GP problem into large sub-problems as in conventional methods. Some illustrative examples are provided.     

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.     

运用EXCEL函数进行完全随机试验设计

完全随机设计的实质是将供试单位随机分组。该文通过对完全随机设计实质的分析,对运用EXCEL进行完全随机试验设计的方法进行了介绍。结果认为只要每一独立供试单位在组间随机排列,始终贯穿随机精神以最大限度地减少系统误差,灵活利用Excel的随机函数如RANDOM、RANDOMBETWEEN等和排序按钮,用任何一种方法都可以快速的进行完全随机试验设计。     

从修辞学的角度对设计符号学中象征功能的再认识

我试图通过解读修辞学的发展历程,探究符号学发展的必然性,由本不存在修辞,到需要修辞,再到修辞的消亡的逻辑关系,联想到设计符号学的发展历程竟与其如此惊人的相似,由仅追求原始功能,到添加装饰满足非本质的需求,继而又摒弃装饰成分,聚焦其本质所在的现代设计,就像我在文章开头说的乙杂邢薜姆绞奖硐治尴蘧褪敲烙是象征的精髓一样,以最简洁的形式传达了最准确的信息,是设计符号学的核心所在。     

一种非线性和时滞系统自适应控制方法

提出一种新的基于高斯基函数(GPFN-G aussian potential function networks)网络的内模控制算法,并对高斯基函数网络内部模 型和内模控制器的建立进行了深入分析．仿真及实时控制结果表明该算法是有效的,具有很 好的自适应性和鲁棒性,可以应用于具有时滞和非线性时变系统中．     

On the analysis of stochastic divide and conquer algorithms

This paper develops general tools for the analysis of stochastic divide and conquer algorithms. We concentrate on the average performance and the distribution of the running time of the algorithm. As a special example we analyse the average performance and the running time distribution of the (2k + 1)-median version of Quicksort. Online publication October 13, 2000.     

高雷诺数流动的平均化差分格式

本文在N—S方程涡量一流函数形式的经典ADI格式和SOR松驰迭代公式的基础上,对其“外来项”进行平均化处理,构造出了平均化差分格式及迭代求解程序。对雷诺数Re=100,1000,10000的空腔流动分别进行了数值计算,并与各数值方法的结果及实验资料进行了比较,结果令人满意。