一类分形曲线的构造算法及维数

以分形理论为依据,根据分形几何描绘自然景物的基本思想,论述了一类分形曲线的递归算法和生成过程,通过参数控制,研究了如何使一条直线段生成了3种不同结构的分形曲线,运用C 编程绘出3种不同结构的分形曲线的图形;同时对Hausdorff维数理论进行了深入的研究与探讨,并且以Hausdorff维数理论为依据分析了由直线分形演绎生成的分形曲线的维数,把维数理论与实践应用相结合。本研究为分形曲线的生成和实践应用提供了理论依据。     

对于离散曲线上逐点切线方向估计的一种改进算法

在图像分析中,离散曲线的切线估计是一个重要的步骤。作者提出一种基于离散直线段识别的切线估计算法,对于离散曲线上的每一点,通过寻找过该点的最长离散直线段来估算该点的切线。为了检测新算法的有效性和精确性,新算法与传统算法被用在不同精度的圆和椭圆上进行实验,实验比较了两种不同算法的平均错误和最大错误,实验结果表明新算法具有更好的性能。     

NURBS曲面在数控加工中的应用

以NURBS为数学模型,对曲面造型及加工系统进行了研究。在对各种算法分析、研究和改进的基础上,完成了一个集CAD／CAM于一体具有多种功能的曲面造型及加工系统,合理地将NURBS的主要核心配套技术和各种算法运用于NURBS造型系统中,通过交互方式成功实现了对多种曲线曲面（直线、圆弧、二次曲线、自由曲线、平面、二次曲面、旋转面、直纹面、雕塑曲面、截线面曲面、自由曲面、复杂组合曲面等）的造型生成。     

平面参数三次样条曲线的优化光顺算法

给出了基于Kjellander和离散曲率的平面参数三次样条曲线的一种优化光顺算法.首先介绍了离散曲率和Kjellander的光顺法,进而给出了一个带有修改因子λ的目标函数,并通过求解得到λ值和光顺后的型值点,最后得到光顺后的曲线.此法使曲线的曲率变化均匀,使光顺后的曲线与原曲线的偏差小,并且算法简单易行,计算量较小.     

LED光源相关色温计算新方法

分别讨论了直接内插法,曲线拟合法和逐点法3种计算LED光源相关色温的经典方法,并在此基础上提出了等间隔法新方法.用MATLAB软件编程实现上述几种算法,并通过以上各种方法的运算速度和运算结果的对比,得出等间隔法能使计算速度和精度达到一个比较理想的结果.     

基于投影的二阶段空问圆线拟合算法

对空间圆线精确拟合算法进行研究.线性和非线性最小二乘法是拟合规则曲线和曲面方程的常见方法.空间圆线作为规则的二次曲线,由于没有特定的曲线方程无法直接使用线性和非线性最小二乘法来进行求解.由于空间圆线可以被看作平面和球面相交形成,圆线特征值可以通过平面和球面特征值求解.提出了基于投影二阶段拟合算法完成空间圆线拟合的方法.对空间圆线拟合原理进行了介绍,通过数据验证了算法的正确性、可行性和精确程度.使用程序进行了算法实现.与贝塞尔和B样条曲线算法精度进行了比较,表明该算法在精度方面具有优势,可用于逆向工程中提高空间拟合算法的精确度.     

基于投影的二阶段空间圆线拟合算法

对空间圆线精确拟合算法进行研究．线性和非线性最小二乘法是拟合规则曲线和曲面方程的常见方法．空间圆线作为规则的二次曲线,由于没有特定的曲线方程无法直接使用线性和非线性最小二乘法来进行求解．由于空间圆线可以被看作平面和球面相交形成,圆线特征值可以通过平面和球面特征值求解．提出了基于投影二阶段拟合算法完成空间圆线拟合的方法．对空间圆线拟合原理进行了介绍,通过数据验证了算法的正确性、可行性和精确程度．使用程序进行了算法实现．与贝塞尔和B样条曲线算法精度进行了比较,表明该算法在精度方面具有优势,可用于逆向工程中提高空间拟合算法的精确度．     

基于Hough变换的三次方Bezier曲线检测算法研究

类似经典Hough变换中对直线(段)、圆(弧)、椭圆、抛物线等解析曲线的检测,论文研究了三次方Bezier曲线的检测算法,提出了离散Bezier曲线的特征建模方法和使用R函数的Hough变换曲线检测快速算法。该算法能够根据所给出的待检测目标点阵图像建立形状参数模型,然后检测该曲线在复杂图像中出现的位置、大小和方向。实验表明,该法能够有效地检测任意三次方Bezier曲线,且精确度优于目前广泛用于曲线检测的广义Hough变换。     

坐标测量机技术综述

传统的几何量计量技术中，测量仪器的主要原理是通过与机械方法产生一维或二维的标准长度、标准直线或曲线进行比较。例如圆度仪是通过精密轴系产生了高精度的标准厕，通过被测厕与标准圆的比较，得到被测量圆的圆度误差。     

一种新的基于圆锥滤波的直线反走样生成技术

介绍了圆锥滤波器的直线反走样生成算法,针对其中存在的不足进行了有效的改进,将所选代表性的直线条数增加为16条,扩展了采样数组中的元素,从而提高了各像素权值取值的准确性。结合直线对称生成算法,提出了一种新的直线反走样生成算法。利用VC 6.0进行调试,结果表明,新算法的直线生成速度显著加快,平滑效果好,具有较好的应用前景。     

工程图数字水印技术研究

该文在分析工程图数字水印特点的基础上,采用微小扰动法,在工程图的编码冗余信息中嵌入水印。详细讨论了工程图中直线段、圆弧和圆的水印嵌入算法和水印检测算法,由于扰动量很小,因而不会被人感知,也不影响工程图的功能。随后,从理论和实例上分析了算法对平移、旋转、缩放、增加、删除等的抗攻击能力。     

AMBO: All Members-Based Optimizer for Solving Optimization Problems

There are many optimization problems in different branches of science that should be solved using an appropriate methodology. Population-based optimization algorithms are one of the most efficient approaches to solve this type of problems. In this paper, a new optimization algorithm called All Members-Based Optimizer (AMBO) is introduced to solve various optimization problems. The main idea in designing the proposed AMBO algorithm is to use more information from the population members of the algorithm instead of just a few specific members (such as best member and worst member) to update the population matrix. Therefore, in AMBO, any member of the population can play a role in updating the population matrix. The theory of AMBO is described and then mathematically modeled for implementation on optimization problems. The performance of the proposed algorithm is evaluated on a set of twenty-three standard objective functions, which belong to three different categories: unimodal, high-dimensional multimodal, and fixed-dimensional multimodal functions. In order to analyze and compare the optimization results for the mentioned objective functions obtained by AMBO, eight other well-known algorithms have been also implemented. The optimization results demonstrate the ability of AMBO to solve various optimization problems. Also, comparison and analysis of the results show that AMBO is superior and more competitive than the other mentioned algorithms in providing suitable solution.     

一种基于字符点阵式编码的工程图信息隐藏算法

针对工程图的版权保护和现有相关算法鲁棒性不强的特点,提出了一种基于字符点阵式编码的工程图信息隐藏算法。该算法首先对隐藏信息进行点阵式编码处理,然后根据使用Logistic混沌系统产生的二值化混沌序列选择其中部分线段实体,结合HVS和隐藏信息对工程图的线宽进行微小修改,从而实现信息隐藏。实验结果显示该算法对工程图的平移、旋转、缩放和编辑等攻击具有较好的鲁棒性。     

Efficient encoding algorithms for computer-aided design of diffractive optical elements by the use of electron-beam fabrication

One of the general requirements of a computer-aided design system is the existence of efficient (in data size and running time) algorithms that are generally reliable for the broadest range of design instances. The restricted data formats of the electron-beam machines impose difficulties in developing algorithms for the design of diffractive optical elements (DOE's) and computer-generated holograms (CGH's). Issues that are related to the development of CGH algorithms for e-beam fabrication of DOE's and CGH's are discussed. We define the problems the CGH algorithms need to solve, then introduce general curve drawing algorithms for the e-beam data generation of diffractive optical components. An efficient algorithm for general aspherical DOE's is proposed. Actual design and fabrication examples are also presented.     

VCAD—一种基于作图辅助线的二维参数化系统

ＶＣＡＤ系统采用作用辅助线的方法即先勾划总体轮廓，然后再作细化处理输入工程图纸。系统把几何约束蕴含于数据结构之中，建立起几何元素之间的约束关系．由于作图过程的每一步骤都是确定的，每一条辅助线都只依赖于至多一个变量，因而所有计算都是局部的，封闭于每条几何定义语句的自身范围内，算法效率高、可靠性好。     

Three-dimensional reference pulse linear and circular interpolators for CNC systems

Three-dimensional (3D) linear and circular interpolations are a basic element in the machining of complex shapes. Because of the lack of accurate and efficient algorithms for the generation of 3D lines and circles, a full realization for the available machine tool resolution is difficult. This paper presents new algorithms for 3D linear and circular interpolation in the reference pulse technique. In 3D space, the line or circle cannot be represented as a general implicit equation. The natural way to represent a line or circle is as the intersection of two surfaces. Based on these facts, interpolation algorithms were designed to follow intersection curves in searching for a minimum path error strategy, and a real-time 3D linear and circular interpolator was developed in software using a PC. The software implementations in a PC and the hardware implementation on a retrofitted milling machine have shown promising results in interpolation error and speed performance. It is expected that this can be applied to the computerized numerical control systems for the machining of 3D lines, circles and some other complex shapes.     

Finite-circle method for component approximation and packing design optimization

In this article, the finite-circle method is introduced for 2D packing optimization. Each component is approximated with a group of circles and the non-overlapping constraints between components are converted into simple constraints between circles. Three new algorithms—the bisection algorithm, the three-step algorithm, and the improved three-step algorithm with gap—are developed to automatically generate fewer circles approximating the components. The approximation accuracy, the circle number, and the computing time are analyzed in detail. Considering the fact that packing optimization is an NP-hard problem, both genetic and gradient-based algorithms are integrated in the finite-circle method to solve the problem. A mixed approach is proposed when the number of components is relatively large. Various tests are carried out to validate the proposed algorithms and design approach. Satisfactory results are obtained.     

基于HT的显微视觉亚像素定位算法

根据显微图像的几何特点,提出了基于HT（Hough Transform）十字显微图像亚像素定位算法（SLACHT）和基于HT近似圆显微图像亚像素定位算法（SLARHT）,对显微图像特征中的直线和近似圆的亚像素定位做了深入的研究。通过与经典直线HT定位算法和经典随机HT圆定位算法进行实验对比,验证了该定位算法的优越性;通过与Matlab中的直线HT定位算法和圆HT定位算法进行实验对比,验证了该算法的可靠性。大量实验表明,该算法的定位精度优于0．01像素,具有运行速度快、鲁棒性强的特点。     

Using response surface design to determine the optimal parameters of genetic algorithm and a case study

Genetic algorithms (GAs) are efficient stochastic search techniques for approximating optimal solutions within complex search spaces and used widely to solve NP-hard problems. Genetic algorithm includes a number of parameters whose different levels strictly affect the performance of the algorithm. The general approach to determine the appropriate parameter combination of GA depends on too many trials of different combinations, and the best one of them that produces good results is selected for the programme, which would be used for problem solving. A few researchers studied on the parameter optimisation of GA. In this paper, response surface-dependent parameter optimisation is proposed to determine the optimal parameters of GA. Results are tested for benchmark problems that are most common in mixed-model assembly line balancing problems of type-I.     

New centralised adaptive load-shedding algorithms to mitigate power system blackouts

Conventional under-frequency load-shedding scheme is designed to retrieve the balance of generation and consumption following a disturbance. In the conventional load-shedding method, frequency settings, timedelay settings and the amount of load to be shed in each step are constant values. The loads to be shed by this scheme are also constant load feeders and not selected adaptively. This constant non-adaptive load-shedding algorithm is not the most efficient scheme for all power system disturbances. Application of centralised loadshedding algorithms could enhance adaptability of the load-shedding schemes. Two centralised adaptive loadshedding algorithms are proposed. The first algorithm is response-based and the second one is a combination of event-based and response-based methods. The proposed methods are capable of preserving power system instability even for large disturbances and combinational events. They use both frequency and voltage variables to select appropriate amount of load shedding. Parameters of the suggested schemes are also selected adaptively based on the magnitude of the disturbance. Performances of the proposed algorithms are evaluated by the application of the adaptive algorithms to the distributed and dynamic simulated model of a real power system. Obtained simulation results confirm that by using these algorithms various power system blackouts may be prevented.