查询词典 linear search

Based on the formula derived from the concept of phase margin, a new optimization tuning method of PID parameters was proposed. It found out the best value of K and T、T by using twice linear search, respectively. The formula derived in this paper are consistent with those in CHEN's paper where they are derived based on geometric graph, while the former are easy to comprehend.

提出了一种PID参数最优整定方法，两次采用线搜索分别整定出K和T、T根据相位裕度的概念推导出的参数整定公式与基於几何图形推导出的参数整定公式一致，但更容易理解。

Among used machine learning methods, the gradient descent method is widely used to train various classifiers, such as Back-propagation neural network and linear text classifier. However, the gradient descent method is easily trapped into a local minimum and slowly converges. Thus, this study presents a gradient forecasting search method based on prediction methods to enhance the performance of the gradient descent method in order to develop a more efficient and precise machine learning method for Web mining.However, a prediction method with few sample data items and precise forecasting ability is a key issue to the gradient forecasting search method. Applying statistic-based prediction methods to implement GFSM is unsuitable because they require a large number of data items to model a prediction model. In the contrast with statistic-based prediction methods, GM(1,1) grey prediction model does not need a large number of data items to build a prediction model, and it has low computational load. However, the original GM(1,1) grey prediction model uses a mathematical hypothesis and approximation to transform a continuous differential equation into a discrete difference equation in order to model a forecasting model.

其中梯度法是一个最常被使用来实现机器学习的方法之一，然而梯度法具有学习速度慢以及容易陷入局部最佳解的缺点，因此，本研究提出一个梯度预测搜寻法则(gradient forecasting search method， GFSM)来改善传统梯度法的缺点，用来提升一些以梯度学习法则为基础的分类器在资讯探勘上的效率与正确性；而一个所需资料量少、计算复杂度低且精确的预测模型是梯度预测搜寻法能否有效进行最佳解搜寻之关键因素，传统统计为基础之预测方法的缺点是需要较大量的数据进行预测，因此计算复杂度高，灰色预测模型具有建模资料少且计算复杂度低等优点，然而灰色预测理论以连续之微分方程式为基础，并且透过一些数学上的假设与近似，将连续之微分方程式转换成离散之差分方程式来对离散型资料进行建模及预测，这样的作法不尽合理，且缺乏数学理论上的完备性，因为在转换过程中已经造成建模上的误差，且建模过程仅考虑相邻的两个资料点关系，无法正确反应数列未来的变化趋势。

To sum up, a non-interior-point smoothing algorithm for solving the complementarity problem is proposed in this dissertation, which outperforms many existing non-interior-point smoothing algorithms in the sense that only one system of linear equations is solved and one linear search needs to be made for the solution at an iteration step.

特别是，本文提出的非内点光滑型牛顿算法在求解上述问题的过程中，在每一个迭代点处只需要解一个线性方程组和做一次线性搜索，比已有文献中的算法具有更大的优越性。

In chapter 3 constructs firstlya new differential merit function by a perturbation structure of VIP and study theproperties of this merit function.Based on this merit function,a continuation-typeNewton method is proposed,which use the technique of inexact linear search forassuring its global convergence,and improves essentially the method of Taji,Fukushima and Ibaraki which can only solve the strong monotone VIP,and has locallyquadratic convergent rate under some condition.

第三章利用变分不等式问题的一种扰动结构构造了新的可微效用函数，并研究了效用函数的性质；在此基础上，给出了一类求解一般单调变分不等式问题的连续型Newton方法CN，方法采用了不精确的线性搜索技术以确保整体收敛性，从本质上改进了Taji、Fukushima和Ibaraki方法只能求解强单调变分不等式问题的局限性，同时又保持了局部二次收敛率。

Consider, for example, how to write an algorithm that performs linear search through a range.

例如，考虑怎样编写一个在一个范围内执行线性搜索的算法。

A linear search was taking forever, so a binary search was needed.

一个线性查找永远是吸引人的。所以一个二分查找是需要的。

Linear search method is fundamental in non-linear optimization algorithms .

一维寻查方法是非线性最优化方法中的一种基本方法，其效果直接影响算法的收敛速度。

But now most of the search engines present the search result to the end user with linear search result, as there are thousands search results at one time, it make the user feel difficult to find what they really want.

但目前大多数的搜索引擎以线性列表的形式为用户返回搜索结果，而搜索结果往往是成千上万的，这使得用户可能用很多时间才能找到自己需要的结果。

For ensuring both detection speed and precision,and improve the credibility of interesting point,this paper presents linear search and area search methods for credibility enhancement.

为了兼顾检测速度和精度的要求，增强兴趣点的可信度，提出了线性搜索和区域搜索可信度增强方法。

The benefit of successive characters and sorted successive numbers is using binary search instead of linear search during retrieving process.

检索算法利用后继字符和后继编号都升序排列的特点，使用折半查找代替原有的顺序查找，大大优化了检索算法的时间复杂度。

The labia have now been sutured together almost completely.The drains and the Foley catheter come out at the top.

此刻阴唇已经几乎完全的缝在一起了，排除多余淤血体液的管子和Foley导管从顶端冒出来。

To get the business done, I suggest we split the difference in price.

为了做成这笔生意，我建议我们在价格上大家各让一半。