在算法上

When the viewpoint is changing quickly, the rendering algorithm ignores some details of the diffuse component, otherwise the scene is rendered more precisely. The Specula highlight is dependent of the viewpoint, it must be processed in real time. We present an algorithm to get rid of the area that does not contain specula highlight quickly and calculate only the area that contains the specula highlight. In order to calculate the specula reflection and refraction component, we presented a new raytracing algorithm based on the environment map transformation. The environment maps are constructed at the sample points of the scene in the preprocessing phase. We add depth information in the environment maps and generate the exact reflection and refraction intensity with the transformation of a few pixels.

对于表面光亮度漫射分量，由于它与视点无关，可以把面片按照光照细节的分布预剖分成层次结构，然后在实时漫游时根据场景变化的快慢决定绘制的细致程度；对于镜面高光分量，由于它与视点有关，必须实时处理，我们提出了一种快速高光裁剪算法，通过简单测试，去除那些不包含高光的区域，只处理包含高光的区域；对于镜面反射分量和折射分量，我们提出了一种基于环境映照变换的快速光线跟踪算法，预先在场景的离散采样点处建立环境映照，然后根据入射点的位置，把邻近采样点处的环境映照上相关象素处的可见点变换过来，求取反射分量和折射分量。

Basic operators of color image morphology are established.The result of the experiment demonstrates that the color vector order has good property.The algorithm of color image morphology based on this order can better keep the peripheral information and hue of the image and has the strong point of unnecessity of exchanging between different color spaces.

实验结果表明提出的颜色向量序性能良好，建立在该向量序上的彩色图像形态学算法能够较好的保持图像的边缘信息和色调，并且亮度均匀，与原图像相比对比度均匀增强，重构开算法的实验结果比原文献中方法有了较大的改进；具有不需要在不同的颜色空间之间转换的优点。

On the foundation of standard UKF algorithm, the ratio of the theoretical value to the practical ones of the innovation's covariance was taken as the input of the FLAC to reduce the dependency of FLAC on the filter model, the generality of the fussy adaptive UKF algorithm was intensified; In the procedure of adjusting the measurement noise's covariance dynamically, the adjusted range could be amplified or minified to different extent by setting the exponential adjusting parameter, so the adjusting velocity and precision of the algorithm was controlled.

在标准的非线性UKF算法基础上，以残差的实际方差与理论方差的比值作为FLAC的输入，使FLAC对滤波模型的依赖性减弱，强化了模糊自适应UKF方法的通用性；在对量测噪声方差阵进行动态调节的过程中，通过设置指数调节参数可不同程度地放大或缩小调节的幅度，使算法的调节速度和精度得到控制。

For the usual algorithm of deciding the initial structure of Elman depends on expert knowledge, an improved species niching PSO was presented in order to optimize the structure and parameters of Elman simultaneously. From the results obtained in this thesis, the improved PSO algorithms based Elman neural networks are of excellent performance. The improved PSO algorithms have strong global search ability while improving the convergence speed and accuracy so that it can be used in various fields.

通过本文的研究可以看出，将改进的PSO算法应用于Elman网络的设计具有很好的性能，两种改进PSO算法不仅具有很强的全局搜索能力，而且在收敛速度和精度上有了明显的提高，它们不但在Elman网络权值学习中获得很好的训练精度，还具有一定的普遍适应性，可以用来解决其它组合优化问题。

Experimental results on various datasets indicate that the precessing number of XML element in AllTwigList is smaller than other algorithms, and AllTwigList is more efficient than other algorithms.

在不同数据集上的实验表明，AllTwigList算法相比于其他算法，在查询过程中需要处理的XML元素规模较少，查询效率高。

This chapter is separated into two parts. The first part introduces the encode and decode scheme which applies the TCQ in DCT field, then corresponding implement algorithm and its simulation are given. The latter part excludes the operation that quantizes only one pixel every time, and adopts the VQ method, then brings forward the TCVQ algorithm in DCT field. Finally corresponding implementation algorithms along with its simulation results are given.

本章分成两部分第一部分详细介绍了运用DCT域TCQ方法进行编码、解码的方案，并提出具体实现算法和进行了仿真计算；第二部分在DCT域TCQ基础上，摈弃在DCT域单个量化的做法，采用矢量量化的方法，提出了DCT域TCVQ的实现算法，同时也进行了仿真。

By introducing safe-inserted-node and safe-deleted-node concept into the structure, the performance of tree creation is reenforced. The algorithms are also given for the creation of ER-Tree. The empirical test results show that (1) the tree creation algorithm proposed is about 10 times faster than R*-Tree.

Rivest，Cleary以及 Arya和 Mount在假设点集为均匀分布的情况下分析了这类算法的平均复杂度为 O（2〕目前最好的静态索引结构和检索算法是 Arya和 Mountl'在Friedman，Bentley和Finkel等人工作的基础上提出来的。

The key point is the convex hull and triangulated irregular network and their arithmetics and realizations.

在总结了前人在这些方面所做的工作的基础上，重点研究了凸壳算法和生成，基于不规则三网地形模型的算法和生成及详细的步骤。

In these boundary conditions, Boundary Integral Method has been discussed as the most important part. We use the hybrid FEM combined with BIM to analyze the electromagnetic scattering properties of objects and discuss the advantages of this hybrid method in truncating computational region、 accuracy、efficiency、 versatility and so on .

重点在于应用结合边界积分方程这一开域边界条件的混合有限元算法实现对目标散射特性问题的分析，探讨和研究此混合算法在求解目标散射问题时在缩减求解域、实施的难易程度、精度、效率和通用性等方面上的优势。

Center and width of the subjection functions can be optimized automatically with the arithmetic. After analyzing work principle for clinker flow of grate cooler, the model of clinker flow is built by using the arithmetic.

在分析篦冷机熟料流动工作原理的基础上，利用该算法建立的篦式冷却机熟料流动模型，通过仿真研究表明该算法具有很强的非线性逼近能力，所建模型输出与实际输出相对误差在1%以内。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。