Automatic G arc spline interpolation for closed point set

A method for generating an interpolation closed G¹ arc spline on a given closed point set is presented. For the odd case, i.e. when the number of the given points is odd, this paper disproves the traditional opinion that there is only one closed G¹ arc spline interpolating the given points. In fact, the number of the resultant closed G¹ arc splines fulfilling the interpolation condition for the odd case is exactly two. We provide an evaluation method based on the arc length as well such that the choice between those two arc splines is made automatically. For the even case, i.e. when the number of the given points is even, the points are automatically moved based on weight functions such that the interpolation condition for generating closed G¹ arc splines is satisfied, and that the adjustment is small. And then, the G¹ arc spline is constructed such that the radii of the arcs in the spline are close to each other. Examples are given to illustrate the method.     

Efficient parallel recognition of some circular arc graphs,I

We present the first efficient parallel algorithms for recognizing some subclasses of circular arc graphs including circular arc graphs and proper interval graphs. These algorithms run in O(log² n) time withO(n ³) processors on a CRCW PRAM. An intersection representation can also be constructed within the same resource bounds. Furthermore, we propose some new characterizations of circular arc graphs and proper interval graphs.Portions of this paper have appeared in preliminary form in theProceedings of the 1989 IEEE international Symposium on Circuits and Systems [9], theProceedings of the 1989 Workshop on Algorithms and Data Structures [10], and theProceedings of the 1990 Canadian Conference on Computational Geometry [11].     

基于特征的文档图像高速插值算法

提出了一种基于文档图像特征的混合插值算法。该算法通过分析文档图像的像素邻域特征,使用邻近插值、双线性插值和双三次样条插值方法估计插值像素灰度值。其中,三次样条插值方法使用了优化算法,即三次样条卷积模板的整数化运算,其时间复杂度接近双线性插值。给出了算法的实现过程。实验结果表明,该算法输出的图像质量接近双三次样条插值,运行效率高于双线性插值算法,在文档图像扫描过程取得了良好的应用效果。     

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)?χ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)?2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.     

Arc fault tolerance of cartesian product digraphs on hyper arc connectivity

A strongly connected digraph D is hyper-λ if the removal of any minimum arc cut of D results in exactly two strong components, one of which is a singleton. We define a hyper-λ digraph D to be m-hyper-λ if D?S is still hyper-λ for any arc set S with ∣S∣≤m. The maximum integer of such m, denoted by H_λ(D), is said to be the arc fault tolerance of D on the hyper-λ property. H_λ(D) is an index to measure the reliability of networks. In this paper, we study H_λ(D) for the cartesian product digraph D=D₁×D₂. We give a necessary and sufficient condition for D₁×D₂ to be hyper-λ and give the lower and upper bounds on H_λ(D₁×D₂). An example shows that the lower and upper bounds are best possible. In particular, exact values of H_λ(D₁×D₂) are obtained in special cases. These results are also generalized to the cartesian product of n strongly connected digraphs.     

Low complexity speech coding at 1.2 to 2.4 kbps based on waveform interpolation

Low-rate speech coding technology has recently made a significant progress with the introduction of new interpolative algorithms (Shoham, 1993; Kleijn and Haagen, 1995). The inherent complexity of these algorithms is, however too high too be commercially useful for low-cost applications. In this paper we propose new approaches to low-complexity speech coding at coding rates of 1.2 and 2.4 kbps. The proposed methods utilize all the advantages of interpolatve coding but greatly simplify the analysis and synthesis operations to a point where low-cost two-way digital speech communication can be easily implemented on DSP or host platforms. At 2.4 kbps, the complexity of the proposed coder is about 7.5 and 2.5 MFLOPS for the encoder and decoder, respectively. At 1.2 kbps, the complexity is about 6 and 2.3 MFLOPS for the encoder and decoder, respectively. The small computational load of these coders make them suitable for multi-tasking environment and low-cost terminals. Informal subjective evaluation shows that, at 2.4 kbps, good communication quality is obtained. Communication quality is less than toll quality but the perceived coding effects are not annoying and do not prevent long sustained two-way conversation with high degree of intelligibility. The quality does not significantly degrade at 1.2 kbps and it is considered sufficient for messaging applications.     

用二次插值实现近似弧长参数化

分段二次Ｈｅｒｍｉｔｅ插值用来保单调地反插值参数曲线的弧长函数．所作近似弧长参数化曲线在插值节点处,近似弧长是精确的,并且具有与精确弧长参数曲线同方向的单位切矢．在整个近似弧长参数区间,近似弧长的误差可达到０（△ｔ）＾２（△ｔ为节点步长）．数值实例得到了很好的结果．     

参数曲线近似弧长参数化的插值方法

本文提出了参数曲线近似弧长参数化的一种插值方法。参数曲线的弧长函数的单调增的，近似弧长参数化可以转化为弧长函数的保单调分段有理线性插值。用这种插值得到的近似弧长参数化曲线插值原曲线上的一组点，最后，两个实例表明了近似弧长参数化曲线能很好地逼近原曲线，且没有所不希望的波动。     

基于薄板样条插值算法的巨幅影像分块并行处理

薄板样条函数是空间插值中的一种重要方法。对于巨幅影像数据使用薄板样条函数进行空间插值时,可能会出现运行时间太长,以及计算机内存空间不足或程序运行无响应的问题。针对这些问题,根据薄板样条函数光滑、连续的特点,基于GDAL开源函数库,提出对巨幅影像数据的分块读取,在块内利用并行技术求解线性方程组,确定薄板样条函数,最后进行空间插值的方法。结果表明,该方法可以有效的解决这些问题。     

基于CATIA的加油车数字样机建模及应用研究

应用数字样机取代物理样机可有效解决传统装备设计依靠物理样机、需要反复试制物理样机,以致设计周期长、成本高的问题。以加油车的研制为例,对装备数字样机建立的一般方法和基本流程进行研究,应用CATIA建立了加油车数字样机模型,进行了相关检测,验证了基于CATIA创建的数字样机代替物理样机解决和交流设计过程中的问题的可行性,使高质、高效、低成本的装备设计和制造成为可能。     

基于误差控制的自适应3次B样条曲线插值

针对现有曲线插值算法不能有效压缩型值点的缺陷,研究了一种自适应三次B样条曲线插值算法。从型值点序列中选用最少的点插值一条初始曲线,基于提出的点到曲线的最小距离计算方法,分别计算各非插值点对应的插值误差,并从中提取最大插值误差。若最大误差大于给定的误差阈值,则将其对应的型值点加入插值型值点序列,重新插值曲线,直到最大插值误差满足误差要求。与现有曲线插值算法相比,该算法可以在保证插值精度的前提下有效压缩数据量。     

基于粗糙集约简的图像插值方法

提出了一种基于粗糙集约简的支持向量机图像插值方法,目的在于提高基于学习的插值方法的插值效率,改善放大图像边缘模糊现象。首先在原始图像上利用已知的像素灰度值及邻域内像素间的相关性构造训练样本集;然后利用粗糙集约简算法约简掉其中重要度较小的特征,并用约简后的样本集训练支持向量机;再用测试样本及训练好的支持向量机估计偶行偶列的像素灰度值;最后利用测试样本及训练好的支持向量机估计剩余的未知像素灰度值。仿真表明,所提方法有效提高了插值效率,获得了较好的客观指标,得到了满意的插值图像。     

一种基于主备机快速切换的双机容错系统

针对现有容错系统中主备机切换过程时延较大的问题,设计了一种主备机快速切换的容错系统。在该系统中,主备机使用相同IP地址和MAC地址,它们同时接收网络数据,但备机不发送任何网络数据,且该过程对上层应用透明。     

基于三次样条函数的传感器特性曲面二维插值

在传感器输出、输入和环境参量均存在非线性的情况下,传统校准方法遇到困难,为提供一种提高测量精度的新途径,在接受非线性事实的基础上,采用三次样条函数二维插值,建立起传感器传递特性曲面.通过实例计算显示了一个化学传感器特性曲面.所获得的传感器特性曲面光滑性好,在输入和环境参量2个方向的一阶、二阶导数都连续,更符合传感器实际传递特性.     

CAD与CAM系统集成研究与实现

介绍了CAD模型数据的检取技术和格式转换技术,描述了CAD/CAM的总体框架,并对实现该框架所涉及的内容及其实现技术进行了深入研究,同时给出了在Solidworks环境下所实现的CAD/CAM系统集成的实例。     

Automatic Judgement on Form-Position Precision Grade of Features

Based on GB/T1184-1996, four form-position tolerance tables are listed on the appendix B. The regularity of distribution for form-position tolerances is deliberately analyzed. This paper describes a formulated method for identifying the precision grade, deduces the functional relation formulae between the tolerance and its precision grade, and further confirms the automatic judgement method presented by a practical program on PC computed     

基于AIWCPSO算法的三次样条气动参数插值方法

针对飞行仿真建模过程中气动参数以矩阵的形式给出, 大都存在着非线性关系, 提出一种基于自适应惯性权重的混沌粒子群优化(AIWCPSO) 算法的三次样条气动参数插值方法. 首先建立粒子与三次样条插值函数中系数的映射关系; 然后利用AIWCPSO 算法对三次样条插值函数的系数进行寻优, 将获得的最优解近似看作三次样条插值函数的系数; 最后计算得到离散点的气动参数. 仿真实验结果表明, 所提出的方法能有效地解决飞行气动参数插值问题.     

一种相容矩阵的启发式属性约简算法

针对不完备决策表,黄兵给出一种基于容差关系的相容矩阵的属性约算法,但算法比较费时,其时间复杂度为[O(|C|3|U|2)]。为降低原算法的时间复杂度,以矩阵距离为启发信息,并运用矩阵合取的特性,设计了一个新的属性约简算法,算法时间复杂度降为[O(|C|2|U|2)]。通过实例验证了该算法。     

基于线性插值填充的帧内运动补偿

帧内运动补偿被认为是H.264/AVC中具有潜力的改进方向之一。提出了一种线性插值填充算法来改进帧内运动补偿的编码效率。与Dong等人提出的自适应填充算法相比,线性插值填充能更精确地预测出填充区域内的像素,从而使得帧内运动补偿效率更高。实验测试表明,基于线性插值填充的改进算法可以使帧内运动补偿块数量增加4.58%~84.7%,从而令帧内编码的率失真性能得到提高。