图

To resolve the algorithm of the chromatic number of a graph,a special method is adopt to remember the coloring process of graph,and the method does different jobs for four given cases during the coloring process.The adjacent strong edge chromatic number of join graph of star and path is obtained.

为了解决图的邻强边染色问题中一个图的色数算法问题，通过特别的方法来记图的染色过程，同时分4种情况讨论了星和路联图的邻强边染色问题，指出在染色过程中给定的4种情况的染色方法各不相同，并通过对图的着色得到了星和路联图的邻强边色数。

Feature of principal lines spatial distribution: detect the principal lines through edge detecting technology, and then divide the image of palmprint into blocks with same dimension, compute the mean and variance as feature; Feature of palmprint direction: divide the image into sub-images; compute the max angle of projection and coordinate of each sub-image, which stand for the direction and location of the line on the palm; Feature of moment invariants: compute the moment invariants of each sub-image and the whole image as feature.

掌纹主线空间分布特征：利用边缘检测技术检测出掌纹的主线，将图像分割成相同大小互不重叠的子图，提取每一个子图的均值和方差作为特征；掌纹线方向特征：将图像分成不重叠的子图，利用Radon变换求出每一个子图的最大投影角度和坐标，也就是子图内掌纹线的方向和位置，构造特征向量；掌纹不变矩特征：提取图像整体和分割后的子图的不变矩作为特征。

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

For the bottom-up attention process, areas of interest that deserve visual attention are formed by a sequentially extracting of feature map, conspicuity map, and interesting map. Firstly, based on Treisman's feature integration theory and the characteristics of orientation and frequency selective nerve cells in biological cortex, we propose a new 2D optimal quadrature filter in the meaning of minimum energy loss to extract intensity, edge, orientation, symmetry, curvature and comer features to form the feature maps. Then based on the local competent and global cooperative perception character of biological vision, we design a kind of competent/cooperative filter and use a set of such filters to extract conspicuous locations that will most likely to cause visual attention from feature maps to form conspicuity maps.

我们根据Treisman〓的特征整合理论，结合生物视觉皮层的方向、频率敏感性神经元，提出采用一组调制在不同尺度和方向上的新的最佳正交特征滤波器并行地提取图象的亮度、边缘、方向、对称性、曲率和角度等特征作为注意线索，构成特征图；在此基础上，基于生物视觉的局部竞争和全局协作特性，本文设计了一种竞争协作滤波器用于从特征图中提取可能引起视觉注意的显著位置构成显著图，各显著图进一步通过本文提出的融合算法和非线性松弛迭代算法生成自底向上兴趣图。

An algorithm about picking element is presented in this paper: First,getting certain amounts of boundary points by contour tracing from a point near an element and calculating primal parameters; Then, picking the element completely by element tracing guided by these initial parameters, jumping over broken points and intersecting points; At last,deleting the picked element from the raster image and renewing other elements' information intersecting with the picked element.

本文提出一种图元拾取算法：首先从图元附近一点开始，经轮廓跟踪、参数拟合得到图元的初始参数；然后在初始参数引导下，对图元定向跟踪，跳过断点和交点，最大限度的拾取整个图元；最后在光栅图像上删除该图元，并恢复与之相交的其它图元的交点信息。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

Supported by GIS, maps were overlapped of normalized vegetation index, topograph, soils, government districts, yearly rainfall, yearly mean temperature, accumulated temperature during growing period of wheat, so as that ecological layers for wheat were stratified objectively and a base graph of non wheat image cell was plotted for average year.

在地理信息系统支持下，将处理好的归一化植被指数图与地形图、土壤质地图、政区图、年降水量图、年平均气温图、小麦生育期积温图等背景图件叠加，进行比较客观的小麦遥感生态分层，并制成常年非麦象元分布底图。

According to the topology of real network 's not always being close in , an improved disjointing algorithm for calculating the reliability of networks is put forward .

本文针对现实的网络图的非封闭性特点，对计算网络可靠性的不交化算法进行了改进，其主要思想就是根据网络图的最小路集把网络图分解成若干子图，求出这些子图各自的最小路集并对它们进行不交化运算求出所有子图的可靠性，进而求出整个网络图的可靠性。

On the basement of conventional direct fan-beam reconstruction, this paper gives a newly improved algorithm-"fast filtering-backprojection". This method utilizes the symmetrical circle geometry to sample projection data, and reconstructs image on the Polarcoordinate firstly, then translates this reconstructed image onto the cartesian coordinate system with two interpolating operations so that the computer can show the result image on the VGA screen. This algorithm rebates the calculating backprojection greatly, and shortens a few times of reconstructing time than same kinds of means. With the size of image enlarging, the reconstructing time abates with 2 exponent times. In addition, according to the idea of parallel-beam, we rearrange the fan-beams and reconstruct image using parallel-beam method fastly. The rearranging constraint condition is given here.

本文首先在传统的扇束直接重建方法的基础上，提出了一个改进的快速滤波反投影重建算法，它利用旋转采集投影数据的圆周对称的几何关系，先在极坐标系统内进行图象的重建，然后通过两次内插运算再将图象转换到计算机显示方式下的笛卡尔坐标系中去，该方法将以往的直接重建方法中的反投影时所需的运算大大降低，并将重建时间比同类方法缩短了几倍，而且随着重建图象的尺寸的增大，重建时间以2的指数次方倍相对缩短，并获得了较好质量的重建图象；另外，又根据平行束投影重建图象的思想，对扇形射束进行了重排，然后利用平行束重建图象的方法进行扇束的重建，并推导了&扇束重排重建图象&方法的约束条件。

To deal with the problems and present situation of field data capture by computer in geological mapping in 20 years, this paper has created PRB digital mapping techniques to standardize the digital mapping process and discussed PRB mapping technique-method system, including PRB digital mapping techniques, the model of PRB data and the related process, combinational regulations of PRB process, common mechanism and basic procedure of PRB process, data processing and dictionary of PRB, three-class PRB system,...

从近 2 0年地质填图中计算机野外数据采集技术研究的现状和存在的问题入手，在确定地质填图空间数据表达的基础上，遵循传统地质填图的规律，在不约束地质学家地质思维的前提下，既能满足计算机处理的需要，又能保证地质工作者取全、取准各项地质观测数据，在描述各类地质信息空间关系的基础上，创建了数字地质填图过程标准化和规范化的PRB数字填图技术，并对构成PRB数字填图技术、PRB数据模型、PRB基本过程、PRB基本过程组合的规则、PRB过程的公共机制、PRB过程基本程式、PRB数据操作、PRB字典、三级PRB体系、PRB数据流&栈&、PRB数据质量定量评价体系的PRB数字填图技术与方法体系进行了讨论。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。