查询词典 propose

Second, we rewrite the simple path expression into SQL statements. We research the different rewriting techniques for the different mapping nodes and different condition in where clause. For the query optimizing, we propose the path index based on the notion of node equivalence which is computed by bi-simulation algorithm.

第二步把简单路径表达式通过DTD字典重写为SQL语句，主要研究了对于SPE上的结点由于其映射的结点类型不同而进行不同的重写处理，同时研究了对于带有条件的查询在各种情况下的重写过程（如返回路径和条件路径不在一条路径上、多条件查询等）。

In this paper we propose an approach to augment the algorithm described before to improve their performance by defining the conditional probability distribution of different composition of continuous and discrete attributes, and implement these new modified algorithms in Weka. To reduce the storage complexity of the AODE algorithm, we used the selective ensemble method to modify it.

在本文中我们提出了通过有效地定义条件概率分布来改善基于朴素贝叶斯分类器的改进算法的性能的方法，并在Weka的框架下实现了我们提出的改进算法，同时考虑到AODE算法较高的空间复杂度，我们利用选择性集成的思想对AODE算法进行了改进，以降低其存储空间复杂度。

The paper attempts to propose a more powerful explanatory model of semantic domain theory by conflation of both metaphor semantic domain and Merleau-Ponty ' s semantic domain theory.

本文在分析 Lakoff 和Johnson的隐喻语义域和Merleau-Ponty的语义域理论基础上，有机地溶合了心理空间和概念整合理论的观点，提出了一个解释力较强的语义域理论。

In this paper, we conduct an exhaustive survey of text location methods,categorize them, and discuss the advantage and disadvantage of them. Then we propose text location algorithm based on connected component and neural network.

本文考察了现有的主要文本定位方法，分析了其中的优缺点，提出了基于连通域和神经网络的文本区域定位方法。

However, prior works neither clearly specify the connected constraint in the geography domain nor propose efficient algorithms.

然而，之前的研究既没有明确地定义地理位置值域连续性限制，也没有提出足够效率的演算法。

Conscript fathers I propose a formal motion.

议员们，我提议

First, we examine the problem of data consistency in LDAP and propose our solution.

首先，我们讨论在 LDAP 中资料一致性的问题并提出我们的解决方法。

In this paper,we introduce the consistent adjusted least squares estimator and propose a relaxed consistent adjusted least squares method,which can be applied to more general relationship,for registration.

但是，如果由于不确定因素的影响，使得不能获得两幅影像的精确配准，那么同一位置上不同时间的特征差别将会被不同位置上的特征差别所代替[3]。

In the first charpter,response variable is generalized to q dimensions, we propose the concept of QMLE and quasi function in nonlinear models, then under mild conditions, we prove that there exists the solution_n with probability 1 for sufficiently large n, and obtain the strong consistency, some results of asymptotic normality, meanwhile consistent estimator of σ~2 for QMLE for heterosedastic nonlinear models is presented.

在第一章中，我们首先将响应变量由一维推广到了多维，得出了非线性模型的极大拟似然估计的定义和拟似然方程，然后在一定的条件下，证明了当样本量n充分大时，拟似然方程以概率1有解？？_n且收敛于参数的真值(即定理1.2)，并且给出了极大拟似然估计的渐近正态性(即定理1.3，1.4)，最后考虑了异方差非线性模型的离差参数σ~2的相合估计(即定理1.5)。

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

If you were not , and OS X just booted normally, have no fear.

如果你没有，和OS X刚刚启动通常，没有恐惧。

I only want to preserve our all .

我只想保存好我们的一切