搜寻

基本解释 (translations)

frisking  ·  hunt  ·  scrounge  ·  search  ·  scrounging  ·  hunted  ·  hunts  ·  scrounged  ·  scrounges  ·  searched  ·  searches  ·  Hunt  ·  explorations

词组短语

hunt for · hunt up · look-out · nose about

与搜寻相关的网络例句 [注：此内容来源于网络，仅供参考]

Multiple trials is the basic concept of many parallel simulated annealing. It is to perform multiple trials at the same time to search acceptable solutions. The division simulated annealing with no communication and The clustering simulated annealing are two common types of parallel simulated annealing methods. The division simulated annealing with no communication makes each processor generate its own adjacent solution from its own current solution and compute the acceptance probability for a adjacent solution. Each of the processors searches solutions without communicating each other. Clustering simulated annealing makes each processor generate its own adjacent solution from a common current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should be used to replace current solution according to a pre-specified rule.

许多平行模拟退火法之理论依据为多向试验，利用同一时间探索更多方向的试验来拓展搜寻的广度或深度，不进行沟通的分工模拟退火法(the division simulated annealing with no communication)以及丛集模拟退火法(the clustering simulated annealing)皆为平行化的模拟退火法，前者定义为各个处理器针对各自的起始解进行搜寻，产生各自的搜寻序列，在搜寻过程中处理器不进行任何沟通，各处理器仅针对自身之目前解进行搜寻；而后者定义为让所有处理器针对同一目前解进行运算搜寻各自的可能解，并各自决定其产出解之接受机率，最后根据事先决定之规则进行沟通比较，挑选其中一个可接受解取代目前解。

It provides three functions: 1/ Crossword searches 2/ Anagram searches 3/ Hidden word searches.

它提供了三个功能： 1 /纵横搜寻2 /大战搜寻3 /隐藏Word搜寻。

Based upon the techniques, FAQ-master was developed to contain four agents, namely, Interface Agent, Proxy Agent, Answerer Agent, and Search Agent, which can effectively and efficiently improve the search result from the following three aspects of the Web search activity, namely, user intention, document processing,and website search.

本论文并勾勒出 FAQ-master 的四个主要组件，亦即介面代理人、代取代理人、答覆代理人与搜寻代理人的系统架构，祈能从使用者意图、网页文件处理与网站搜寻等三个观点，有效地改善网际网路搜寻的成果。

By experiments, it is proved that the parabola method is faster and more precise than the golden section method and the Fibonacci method in searching for extremum of compound pendulum. Furthermore, the method can offer some references for the study of other extremum in physics.

文章通过实验采集数据并加以分析，证明了抛物线法搜寻复摆极值点比黄金分割法和Fibonacci法有更好的搜寻效果，并且该方法对于搜寻物理学中其它极值点问题具有参考价值。

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

A person's name is used in the study as a query. After a user inputs a query, we call Google image search engine and obtain related images from Google. Three approaches are also proposed to rank images returned by Google such that the user may find the desired personal data from the fronter images.

在本研究中，我们提出用图片搜寻引擎搜寻个人资，当使用者输入人名后，我们即呼叫Google图片搜寻功能，取得Google所回传的相关图片，并提出三种同的图片排序方式重新排序Google所回传的图片，使使用者能快速从较前面图片找到个人资。

According to this understanding, this thesis tries to modify PSO algorithm in order to improve its quality of solutions. The main approches include: using uniform design to ensure the uniform distribution of initial particles in the design space; adding mutation operation to increase the diversity of particles; decreasing the maximum velocity limitation and the velocity inertia automatically to balance the local and the global search efforts; developing a new approach to treat the design variables exceeding the bounds; using extensive local searches to escape local minimum. The overall effect of these approaches can yield better results for most test problems.

有鉴於此，本文针对粒子群演化法之流程参考相关文献并稍作改变，使得粒子群演算法在结果的收敛上更具优势，本文的主要改进的方法包括：应用均匀设计的概念使得初始的粒子可以更均匀地分布在空间上；利用突变增加粒子之间的差异性与多样性；利用适当控制的最大速度限制及惯性权重控制，达到区域搜寻与全域搜寻的效果；应用新的边界处理机制处理设计变数超过上、下限的问题；利用区域强化搜寻针对粒子附近地区，再作进一步的搜索以得到更佳之结果；将各种方法综合后配合粒子群演算法使用，可以得到不错的结果。

Another student had very definite ideas about search engines and their attributes. He explained that Yahoo!, for example, is for entertainment and Magellan or InfoSeek arefor more scientific material. When searching, he mentioned a couple of times that he could choose another engine, but in reality he always used the search button without selecting a search engine.

另外一个学生对於搜寻引擎有非常清楚的主意，他解释关於雅虎，举例来说：它可以提供足够的资料在Magellan or InfoSeek，当搜寻的时候，他提及很多的时间，他能够选择另外的引擎，但是实际上他总是使用使用搜寻的按钮而没有使用选择一个搜寻引擎。

The time and frequency of the polecat searching different preys and burrows were nearly the same. The polecat attacked virtually all prey offered and thus exhibited opportunistic foraging behaviour. However, it did not captured all prey with equal sequence. It first captured the zokor, then the pika and last for the root vole. In addition to using the typical musteline killing method of biting the nape of the neck, the polecat evolved a variety of killing methods suited to a range of prey types depending on the activity, size and anti-predation ability of prey. The zokor was bitten on the head, whereas the pika was killed by bites to the head or throat and the root vole was killed by bites to the head or chest. The time polecats pursued the root vole was the longest, followed by that used in pursuing the pika and the zokor.

实验结果表明：艾虎对三种猎物的搜寻时间和搜寻频次基本一致，在搜寻猎物的过程中并非已知洞道系统中所存在的食物信息，是一种机会主义的捕食者；艾虎除了具有典型鼬科动物捕杀猎物的方法外，能够根据猎物的大小、活动性和反捕食能力采用不同的捕杀方法，在捕杀猎物的过程中首先捕杀高原鼢鼠，其致死部位全部为头部，其次捕杀高原鼠兔，其致死部位除了头部外，明显增加了颈部的比例，最后捕杀根田鼠，其致死部位主要是头部和胸部；艾虎在捕杀猎物的过程中，追击根田鼠的时间最多，追击鼢鼠的时间最少，而用于捕杀根田鼠的时间最少，用于捕杀鼢鼠的时间最多，艾虎捕杀高原鼠兔后单位时间内获得的能量值最大，其次为捕杀高原鼢鼠，而捕杀根田鼠后单位时间内活动的能量值最小。

A critical step, to that end, is the service discovery. The current method to find web services in UDDI registry is based on the keyword and the category. These kinds of methods are not effective. For the moment, service requesters are hard to search the desired web services.

然而要达到上述理想中的愿景，有一个关键的步骤必须先被达成，那就是网路服务的搜寻，软体工程师必须要能找到他们理想中的服务方能达成此愿景，目前在UDDI上的搜寻方法是以关键字和服务分类为基础的搜寻方法，这种方法并不能有效地帮助使用者找到他们所需要的服务，因此目前网路服务的搜寻仍是一个有待解决的议题。

与搜寻相关的网络解释 [注：此内容来源于网络，仅供参考]

Heuristic Searching：试探搜寻

试探搜寻技术 heuristic search techniques | 试探搜寻 heuristic searching | 试探技术 heuristic technique

linear search：线性搜寻

线性搜寻 (linear search)是最单纯的搜寻方式,把资料以阵列来表示,然后用搜寻键一一比对,遇到相等的就把资料所在的索引记录下来,整个阵列比对完后,搜寻就完成了,我们可以用图9-41里的演算法来描述线性搜寻,

search, linear：线性搜寻

search, internal 内部搜寻 | search, linear 线性搜寻 | search, sequential 顺序搜寻

Search engine optimization：搜寻引擎最佳化

搜寻引擎最佳化 (Search Engine Optimization) 是什麼?近年来,搜寻引擎优化(SEO)的概念甚嚣尘上,网站经营者莫不乐於借力使力,调整自己的网站架构和资讯脉络让网站能在搜寻引擎上发光发热. 理想情况下,搜寻引擎的使用者如果够多,对於资料的应用够聪明,

search process：搜寻过程

搜寻程序 search procedure | 搜寻过程 search process | 搜寻处理器 search processor

bidirectional search process：双向搜寻处理

双向搜寻 bidirectional search | 双向搜寻处理 bidirectional search process | 等速双向搜寻 bidirectional search with equal speed

searchable information：可搜寻资讯

"搜寻字","search word" | "可搜寻资讯","searchable information" | "搜寻及破坏模式","search-and-destroy mode"

searchable information：可搜寻信息

搜寻字 search word | 可搜寻信息 searchable information | 搜寻及破坏模式 search-and-destroy mode

library searching：程序馆搜寻,图书馆搜寻

图书馆显示器操控制系统 library scope operation control system,LOCS | 程序馆搜寻,图书馆搜寻 library searching | 程序馆服务,图书馆服务 library services,LIBS

uninformed graph search：无启动图搜寻,无信息的图形搜寻

未实作使用者操作 unimplemented user operations | 无启动图搜寻,无信息的图形搜寻 uninformed graph search | 未起始化状态 un-initialized state