算法的

There is important realism meaning in-depth researching for arithmetic of logic function complement set .

逻辑函数的求补在逻辑综合中最为常见，求补算法的优劣直接关系到逻辑优化算法的时效，在逻辑优化算法中由于会频繁调用逻辑函数求补运算过程[1~3]，因此逻辑函数的求补是逻辑优化算法的基础。

Based on an analysis of the internal relation between binary and sets ,a novel idea of binary-based set operation is presented in this paper.

通过比较二进制与集合之间的内在联系，提出了基于二进制的集合运算思想，给出了基于二进制的各种集合运算算法，该算法有效解决了传统集合操作算法中运算速度慢，效率低的不足，并提供了求幂集，交集，并集等集合运算算法的c语言源程序。

The diagonal loading factor anti convergence performance were analyzed and the convergence scope of robust constrained LMS algorithm was also given.

针对上述问题，考虑信号方向向量的偏差对LMS算法性能的影响，提出了一种基于对角载入的鲁棒约束LMS算法，并对算法的对角载入因子和收敛性能进行了分析，给出了保证算法收敛的步长取值范围。

Then, we study Rough Set Theory approach to KDD, develop two algorithms for deriving Reduct and propose the integration of domain knowledge into Rough Set Theory to mining multiple-level rules.

本文在分析了传统的关联规则挖掘算法的基础上，给出了几个挖掘算法和一个递增修正算法；提出了模糊关联规则的概念及其挖掘算法；研究了结合背景知识的多层次关联规则的挖掘方法。

This paper extends the ant colony algorithm which is used for solving 0-1 knapsack problem in reference [7], and gets enlightenment from the ant colony algorithm with 2-opt local optimization for solving traveling salesman problems: Exchange strategy can make the algorithm have faster convergence rate and get better quality solution. So this paper presents the ant colony algorithm based on exchange stragegy.

本文推广了文献[7]中求解单维0-1背包问题的蚁群算法，并从结合2-opt等局部优化的蚁群算法求解旅行商问题中得到启示：通过交换策略可以加快算法的收敛速度和获取更高质量的解，因此提出了基于交换策略的蚁群算法。

The cause of the target fade-out in Neural Network nonuniformity correction scheme for infrared focal plane arraywas studied. Based on analyzing the strength and limitation of edge-directed NN scheme and nonuniformity correction combining one-point calibration and NN-NUC, a new combinational algorithm for nonuniformity correction was proposed.

中文摘要：分析了传统神经网络非均匀性校正算法在空域处理过程中产生目标退化的原因，在总结基于边缘指导的神经网络校正算法与一点定标和神经网络结合的校正算法的基础上，提出了新的组合校正算法。

Digital receiver and its forepart operational principle are discussed, then me...

本文讨论了数字接收机以及前端的工作过程，然后详细阐述了瞬时自相关、短时傅立叶变换、WD算法、过零检测和小波分析等各种算法在脉内调制分析上的应用，分析了各算法的优缺点，提出一种并行处理模式：即针对不同的信号采用不同的算法对脉内调制信号进行分析。

The main work and innovation1 In general , a image compression method has different effect to different image . Some are fit for image which has much high frequency . Some are fit for image which has much low frequency .This paper analysis the applicability of fractal algorithm . In this dissertation , an improved algorithum is given . The basic algorithum without eight change and the joint use of quantitative coding , The compression ratio and PSNR can be adjusted , and it can get more quickly speed of coding .2 To a group of exact fractal code , the decoding image can be any resolution .With this characteristic ,choose the proper domain block and range block,this paper get an algorithum which can get higher decoding PSNR and speed than the basic fractal algorithum.3 Give a new method to calculate the scale factor . The calculation of basic algorithum is complex and enormous . The factor of scale is an important variable of the basic algorithm. Now there are two methods to calculate the factor of scale .A new method was given to calculate the factor of scale. The calculation load and complexity are reduced by the new method. Compared with the basic algorithm , the method can reduce coding time.4 The basic fractal algorithum is based on the Collage theorem and contraction mapping theorem . A mathematic model based on basic fractal algorithum is given .

本文的主要工作及创新点主要包括以下几点：1一般情况下，一种图像压缩的方法对不同特点的图像，压缩效果会有所不同，本文利用分形压缩编码对不同特点的图像进行编码，分析了分形编码对不同图像的编码适用性，利用去掉8种变换的分形编码算法与简单的均匀量化编码方案相结合，得到了一种可以调节压缩比与解码质量的分形编码方案，该提高编码速度6倍以上。2分形编码的特点之一是分形解码的分辨率无关性，即对于一组分形编码可以将其解码到任意分辨率下，本文利用分形编码的这一特点，结合不同的量化编码方案，选择合适的定义域块与值域块及适当的编解码分辨率，得到了一种提高解码质量，编码速度提高12倍以上的加速算法。3比例因子是基本分形算法中的一个重要变量，目前有两种计算比例因子的方法，文中给出了一种新的求比例因子的方法，该方法简化了求比例因子的计算，从整体上减小了基本分形算法的计算量，简化了算法4分形压缩的数学基础是不动点定理与拼贴定理，本文根据基本的自动分形编码方法，建立数学模型对其进行推导，得到了用普通数学的极限理论解释分形编码的数学表达式，从而对由基本分形编码得到的解码图像中的像素点的值给出了确定的表达式。

The embedded coding is introduced in order to control the data rate accurately, then the principle of EZWis analyzed. The priciples of the improved algorithms such as SPIHT(Set Partitioning in Hierarchical Trees), SPECK(Set Partitioned Embedded Block Coder)are discussed then.

为了实现视频图像传输码率的精确控制，介绍了嵌入式编码的概念，分析了嵌入式零树小波编码算法，讨论了两个基于EZW算法的改进方案，即多级树集合分裂算法和集合分裂嵌入块编码，对这些算法的原理和编码结果进行了比较和讨论。

A smooth approximation algorithm is then proposed based on hinge-finding algorithm via curved faces approximated to the hinging hyperplanes model, which can obtain a smooth approximation result and hold some good properties of hinge-finding algorithm such as simplicity and effectiveness.

本文对找链接算法做了两点改进，其一是扩充了链接超平面模型，在二维空间上弥补了链接超平面模型表示能力不足这一弱点。仿真实验显示使用扩充后的模型得到了更好的分片线性逼近结果。另一点改进是使用双曲光滑函数构造出了基于找链接算法的光滑逼近算法。理论分析证明了算法的可行性。仿真实验验证了理论分析。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。