查询词典 hidden line algorithm

The thesis studies the difference between GWSs composition and traditional workflow applications, proposes the implement mechanism and technical architecture of GWSs composition and defines the reference model of GWSs composition platform, which provide holistic framework and top-level guidance for studying dynamic GWSs composition technology, designing GWSs composition platform, and implementing representative composite service applications.2、Theories and methods of composite process modeling and process analysis. This thesis proposes a meta-model of Geo-spatial Web services composition process defining from two aspects, i.e. process and resource. According to the process definition meta-model, we propose a new Geo-spatial Web services composition Process/Resource model based on extended WF-net, which effectively resolves the problems on uncertain activity option and dynamic variation of service in composite process model. A notion with regard to soundness of process model is proposed from three aspects, i.e. the structural correctness of process model, validity of data link and validity of resource. The notion of soundness definitely gives a dividing line on correctness of composite GWS process. This thesis analyzes sufficient and essential terms of soundness, and studies compositional property of WSCP/R-net models which provides an effective method to construct a soundness WSCP/R-net model. According to WSCP/R-net, the thesis proposes composition algebra and studies the properties of it. Based on the composition algebra, 6 kinds of composite process reduction rules are induced to optimize the process.3、Geo-spatial Web service QoS model and its application architecture. This thesis proposes an extendable GWS QoS model from three aspects, i.e. Geo-spatial Web Service itself, networking conditions and service consumer which can be used to distinguish GWSs with overlapping or identical functionality. We work over the QoS evaluation methods of composite GWS process which can be used to guide the execution, monitor and service selection of composition process. Aming at some disadvantages in traditional Web service discovery model for its lacking of QoS supporting, this thesis proposes a new service discovery model SDMQ supporting QoS constraints.4、Technologies of composite service executing. SSPL, a new composite service process language, is defined to overcome the disadvantages of existing composite services process languages which can not adapt to the dynamic variation of Geo-spatial Web Services. An algorithm is described to translate WSCP/R-net model into SSPL. The thesis studies the model of dynamic services selection with QoS global optimization, presenting an algorithm GODSS to resolve dynamic services selection with QoS global optimization in GWSs Composition.5、Design and implement experimental system and representative applications. According to the research findings presented above, we design and implement an experimental system and construct two representative applications to show that our achievements are effective and practical.

针对当前空间信息服务聚合研究中存在的若干不足，本文重点在基于工作流的空间信息服务聚合框架、空间信息服务聚合流程建模和分析技术、空间信息服务QoS模型及应用体系以及空间信息服务聚合流程执行等几个方面进行深入研究，主要工作和创新点包括：1、基于工作流的空间信息服务动态聚合框架：研究了空间信息服务动态聚合和传统工作流应用的不同，在此基础上提出了基于工作流技术的空间信息服务动态聚合实现机制、技术体系和参考模型，为研究空间信息服务聚合的关键技术、开发服务聚合支撑平台以及在此基础上构造特定的空间信息服务聚合应用提供了总体框架和顶层指导。2、空间信息服务聚合流程建模和分析技术：首先基于动态服务聚合流程建模的需求和空间信息服务动态变化的应用实际，从服务聚合的过程维和资源维出发定义了服务聚合流程定义元模型；与之相对应，对基本的WF-net进行扩展，提出服务聚合流程/资源网作为空间信息服务聚合流程的形式化描述模型，有效解决了现有的基于基本Petri网和工作流网的服务聚合建模方法所不能解决的不确定路径选择和服务的动态变化性问题；从流程结构正确性、数据依赖有效性和资源实现有效性三个方面提出了WSCP/R-net健壮性的概念，明确界定了聚合流程正确性的标准，并对WSCP/R-net模型的健壮性分析方法和WSCP/R-net模型的组合特性进行了研究；提出了空间信息服务聚合代数算子并对其性质进行了研究，在此基础上提出了6种聚合流程约简规则，从而可达到优化聚合流程、提高聚合流程执行效率的目的。3、空间信息服务QoS模型和应用体系：从服务本身、网络环境和服务消费者三个层次出发，提出了一个可扩展的空间信息服务QoS模型GSQM，实现了对空间信息服务的度量和评价，并对GSQM不同质量要素信息的客观、公正采集方法进行了研究；研究了空间信息服务聚合流程QoS评价方法，有效支持了空间信息服务聚合流程的执行、监控以及服务选择等操作；针对目前的服务发现模型仅支持服务功能性描述、不能有效满足空间信息服务应用需求的现状，提出了一种新的支持QoS约束的服务发现模型SDMQ，并对模型的实现框架进行了研究。4、空间信息服务聚合流程执行技术：针对现有的服务聚合流程描述语言不能有效满足空间信息服务动态聚合流程描述的特点，基于BPEL4WS提出了一种新的空间信息服务聚合流程描述语言SSPL；研究了满足健壮性要求的WSCP/R-net模型向SSPL的转换算法，在此基础上可以满足用户无显式编码来实现空间信息服务聚合应用的目的；研究了服务动态选择QoS全局优化模型，并在此基础上提出了一种解决服务动态选择QoS全局优化问题的实现算法GODSS.5、基于论文研究成果，设计实现了"空间信息服务聚合实验系统"，并构建了"矿产资源评价"和"城市消防应急响应"两个典型应用案例，对论文所述模型、方法的可行性和有效性进行了验证。

A hybrid ANN-Lagrangian relaxation approach for generating unit commitment , and for the disadvantages of BP algorithm, a new conjugate gradient algorithm without line searches is used to speed up convergemce.

混合ANN和Lagrange松弛法用于解机组最优投入问题，并针对BP算法不足，利用一种不用精确搜索的共扼梯度训练算法，加速了网络的收敛。

To overcome the premature of simple genetic algorithm, the calculating efficiency of SGA is improved by the following two ways; Firstly, in order to ensure convergence of algorithm and reduce influence factor of convergence, elitist selection and adapted crossover and mutation operator are adopted. Secondly, because this study deals with finding minimize volume of structure, to quicken convergence of this problem, in line with mechanics criterion the paper carry out mutation to some genes in chromosome according to variations of internal force. This will let algorithms to search answer with our hoping directions.

针对基本遗传算法存在早熟的问题，本文主要从两个方面进行了改进，首先为了保证算法的收敛和减少影响算法收敛因素，采用了最优保护策略和自适应的交叉和变异算子；其次，由于本文研究内容涉及求结构最小体积问题，为了加快此类问题的收敛速度，本文结合结构优化中的力学准则，对个体染色体中的某一段基因按照内力变化进行变异操作，使得算法按一定方向进行搜索最优解。

Aiming at shadow influence problem in vision navigation process of agricultural robot, illumination invariant image based on shadow removal algorithm was introduced. An enhanced OSTU image segmentation method was used, and an optimized Hough transformation algorithm was used to extract crop line, and coordinate transform was applied to obtain navigation parameters.

该研究针对农业机器人视觉导航中存在的阴影干扰问题，采用基于光照无关图的方法去除导航图像中的阴影，然后采用增强的最大类间方差法进行图像分割和优化的Hough变换提取作物行中心线，最终通过坐标转换获得导航参数。

The method combines 3D datum line least cost algorithm and dynamic 2D assignment algorithm.

该方案是将三维空间的基准线最小代价算法与动态2D指派算法相结合。

The system parameters are determined by optimizing an output-error cost function. To deal with the non-uniqueness of the fully parameterized state-space system, a projected gradient search algorithm is presented by restricting the update of the parameters to the tangent space to the manifold of observationally equivalent state-space systems. The sufficient condition to employ L-M algorithm for optimizing parameters is also introduced. The proposed hierarchical optimization identificationmethod includes two steps: First, the parameter search direction is determined by the proposed adaptive L-M projected gradient approach; Second, the optimum step size is computed according to a line search method.

通过极小化输出误差目标函数获得了系统参数估计；提出了正交梯度搜索方法用于解决系统参数的非唯一性问题，正交梯度搜索的本质是在输入-输出等价类相切平面的正交垂空间更新系统参数；给出了用 L-M 算法进行参数优化的充分条件；提出的系统参数递阶优化辨识方法包括两步：首先用给出的自适应 L-M 算子正交梯度方法确定参数优化方向；其次由一维搜索方法计算最佳步长。

To solve the problem that accuracy of traditional fault location algorithm for traction networks is affected by integer, non-integer harmonics, electric locomotive and fluctuation of traction line s parameters, a novel fault location algorithm is presented which uses fault-generated transient voltages measured at single terminal.

针对牵引网目前广泛应用的故障测距算法易受整次、非整次谐波、机车负荷以及线路参数波动的影响，提出一种利用线路单端暂态电压进行精确故障测距的新算法。

In order to solve the disadvantage of robust filter algorithm which has great calculation and complicated deduce processing, an improved decentralized robust filter algorithm was designed through equipollent deduction and the on-line alterable value of γ f.

针对鲁棒滤波法计算量大和递推过程复杂的不足，通过等价推导，在线改变γf的值，设计了分散优化鲁棒滤波法，使得鲁棒滤波算法递推简单，避免了直接计算滤波增益阵，并减小了主滤波器计算负荷。

To each scheme of DG's site and size generated by genetic algorithm, this paper considers the effect of DG on power flow and line loading ability of distribution network. After processing distribution network expansion planning using branch exchange based simulated annealing algorithm, every result of integrated DG and network scheme is judged by economic evaluation.

对于遗传过程中每个分布式电源位置和容量方案个体，考虑了分布式电源对配电网潮流和线路负载能力的影响，运用基于支路交换的模拟退火算法规划扩展网络，对分布式电源和网络的综合规划结果进行经济性评估以衡量个体方案的优劣。

Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics.

由于经典的Bresenham直线生成算法一次计算只能生成一个像素点，效率较低。

Don not attempt to do something which you can not to do.

不要企图做那些办不到的事情。

The expression of CTGF and TNF-αweredetected by immunochemistry and the number of Clara Cells was calculated.

光镜下观察肺组织的病理变化，采用免疫组化染色观察肺组织中结缔组织生长因子和肿瘤坏死因子-α的表达和Clara细胞的数量。