离散化

In the process of processing the digital images, a modified, easy and valid algorithm between global binarization and local binarization are researched in case that the processing objects are specific in this paper. Digital images algebraic operation and guide line for wiping the discrete offending points are confirmed. Not only the program that can realize the algorithm but also handling system is built. The applicability that the relative processing method is used to solve the practical application problems is discussed.

本文在对采集到的数字图像进行计算机处理的过程中，针对所处理对象的特殊性，研究了便于处理且有效的融合全局二值化和局部二值化思想的改进的图像二值化处理方法和算法；确定了在比较复杂的背景下提取有用的前景信息的数字图像代数运算方法和离散干扰点的去除判别准则，并编写程序实现了这一算法，建立了比较有效快速的处理系统；探讨了相关处理方法在解决实际应用问题时的适用性。

According to the industrial economics, the development of the industry usually passes through three stages: the scattered competitive market, the consubstantial competitive market and divergent competitive market.

产业经济学理论认为，行业的市场演进一般分为3个阶段：离散竞争市场、同质化竞争市场以及异质化竞争市场，不同的企业在不同的市场演进阶段有不同的经营行为模式和策略导向。

Cu6Zr5, the basic cluster of the primary devitrification phase of Cu-based amorphous alloys, is selected as cluster model based the on structure heredity existing between amorphous alloys and primary devitrification phases.

根据非晶与其晶化相存在结构遗传关系，以Cu-Zr基非晶晶化相Cu10Zr7中的Cu6Zr5阿基米德反棱柱为团簇模型，利用离散变分方法从电子层次研究了Al元素对Cu基非晶合金团簇稳定性的影响。

First, we extend the general finite element method from the function surface to the parameter function. Second, we bring this kind of method into the design of rational Bézier minimal surface. Third, we transform the problem of Dirichlet energy function into the problem of minimizing a discrete objective function.

首先推广了函数曲面中的有限元方法，进而研究如何针对参数曲面使用有限元方法，并把该方法引入到有理Bézier极小曲面造型的设计中，从而将连续的Dirichlet能量函数极小化问题，转化为一个离散形式的目标函数的极小化问题。

Point clouds are discrete data points without the topology relationship between them. So, to facilitate and expedite the extraction of contour points for the late NPR style, firstly we should simplify the point cloud data. In other words, non-contour points should be eliminated but their contour points and feature points should be retained .

点云数据本身是无拓扑关系的离散数据点集，所以，为了方便和加速后期非真实感绘制风格化所需轮廓点的提取，首先对点云数据进行了"粗略"地简化处理，即剔除点云数据中非轮廓点保留了其轮廓点和特征点；然后应用判定准则提取出所表示物体的轮廓点并对其进行"归并"形成便于NPR风格化处理的特征轮廓线；最后再对得到的轮廓线进行NPR风格化效果"加密"处理。

The construction procedures used to establish the theory are based on orthogonal and elementary matrix transformations and can, therefore, be developed to a numerically efficient algorithm.

第一部分，我们想利用状态和微分回馈控制把一个时变周期离散的系统正则化，在这部分我们找到一个可以正则化的充分条件，并利用构造方法证明在这充分条件之下可以构造出状态和微分回馈控制矩阵，使的这周期闭回路系统可以被正则化。

Discrete point data can be applied with other GIS data to address some specific questions in our researches. But how to spatialize the discrete point data has been a question itself.

5离散点数据的连续空间化问题一直是将某些社会经济离散点数据与其他地理空间数据相结合，应用于各项实际研究的瓶颈问题。

Moreover, due to the fine analyses of localization length and the Fourier components, the discrete breathers close to the edge of linear spectrum have some similarities and relevances with linear plane wave solutions of the system.

通过对离散呼吸子解的局域化程度和Fourier分量的细致研究显示出在弱非线性情况下，线性谱附近处离散呼吸子解和线性平面波解的相似性和连续性。

Chapter 4, Analyse the visualization in isoline and contour of discrete element method.

第五章主要是在前两章研究的基础上，开发了离散元计算软件前后处理系统，提高了离散元的可视化和应用水平。

Based on analyzing the algorithms of Delaunay triangulation creation in domestic and abroad, in view of the situation of building DTM and the need of realizing railway 3D visual design, a divide-and-conquer algorithm to build DTM is presented, the algorithm use square grids to manage disordered points, to form triangular meshes in grids, DTM can be obtained by merging the triangular meshes, so that the work of sorting of the disordered points before building DTM is reduced greatly; moreover, the algorithm utilize subarea to control the vertices of convex hull so that the range which support points locate in can be predefined when searching support points, the workload of searching support points can be reduced and the speed of merging two triangulations is raised.

在分析了国内外构建DTM算法的基础上，针对DTM算法的现状及铁路线路三维可视化设计的需要，创立了一种构建DTM的分治算法。算法引入方格网管理离散点数据，在格中构建三角网，然后再将这些三角网合并形成DTM，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

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.

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