search this results 中文意思是什麼
search this results
解釋
在上次查詢結果中再次查詢-
This interactive capability, combined with the artificial intelligence software technology, delivers the results that significantly differentiates accoona in the search space
Accoona人工智慧軟體可以理解搜索請求的意思，通過使用此軟體，用戶可以得到更多的結果。 -
This paper presents an approach to perceptually extract multi - oriented text lines from online handwriting. the approach adopts a bottom - up strategy. by the approach, strokes are first merged into blocks analogous to words, then a link model is constructed upon these blocks. finally, the optimal text line layout is found out by a branch - bound search on the link model. the experimental results show that the approach is effective and also available to extract curved text lines
提出一種多方向手寫筆跡文本行的提取方法.該方法以視覺感知理論為基礎，採取自底向上的策略，先將筆畫組合成類比字元的筆畫塊，然後基於這些筆畫塊建立鏈接模型，最後採用分支限界搜索演算法從鏈接模型中找出最優行排列.實驗結果表明，該方法能有效地提取多方向筆跡行結構，並適用於彎曲文本行的提取 -
This technique avoids computing inverse log - polar mapping ilpm to preserve the quality of the watermarked image, and avoids exhaustive search to save computation time and reduce false detection. experimental results demonstrate that the digital watermarking technique is invariant and robust to rotation, scaling, and translation transformation
在研究中發現，圖像在空域中的旋轉對應于該對數極坐標域中沿著角坐標的位移圖像在空域中的按比例縮放對應于該對數極坐標域中沿著對數半徑坐標的位移而圖像在空域中的水平位移對該對數極坐標域沒有影響。 -
This is the client side display of the search results
Searchresults . html這是搜索結果的客戶機端顯示。 -
The results show that conic interpolation model method is an efficient direct search method. this should be further researched
試驗結果表明錐函數插值模型演算法是一類有效的直接方法，值得進一步研究。 -
Then, in order to reduce the coding time of each image vector, a fast algorithm based on mean - order - search is proposed. the simulation results of this algorithm show that its coding speed is twenty times faster than that of full search algorithm ( fs ), but its reconstructed image is badly ruined
其次，為減少每個矢量的編碼時間，提出一種基於均值排序碼書的快速搜索演算法，測試結果顯示，該演算法編碼速度是窮盡搜索演算法的二十多倍，但是恢復圖像的質量大大地降低了。 -
This property would enable users of the control to personalize how many search results to return per page, if you provided an edit control with the user interface to change the setting in design view
屬性（ attribute ） 。如果提供了具有用戶界面（ ui ）的編輯控制項在「設計」視圖中更改設置，則此屬性將使控制項的用戶能夠個性化設置每一頁要返回的搜索結果數量。 -
Meta search engine ' abilities of locating and collecting has been improved, but the number of results is too large to users find the information that they really need. in order to solve the problem, this paper presents the results optimizes technology of meta search engine based on agent
雖然元搜索引擎增強了定位和收集信息的能力，但由於其檢索結果數量大增，沒有針對用戶個性需求對信息予以優化重組，用戶每一次信息檢索被孤立地對待，割裂了其需求在一定時段內的相關性。 -
A multiloop antenna pointing controller has been designed while three feedforward schemes are used in this control design. the simulation results show that the antenna pointing control system can improve the precision of the attitude angle and the attitude angle rate, and the antenna can slew to the neighborhood of tdrs fast, search and then track tdrs
在設計好的天線跟蹤指向控制系統基礎上，採用前饋+反饋的復合控制策略設計了復合控制器，模擬結果表明設計的天線指向控制系統能夠較好的提高星體的姿態穩定度和控制精度，天線能夠快速回掃至中繼衛星附近並進行跟蹤，天線指向精度滿足設計要求，表明了所設計的天線指向控制系統的合理性和有效性。 -
Users of web search engines are often forced to shift through the long ordered list of document " snippets " returned by the engines. this paper applied web content mining to the field of search engine. search engine results clustering relies on the information returned by the search engine
本文將web內容挖掘技術應用於搜索引擎領域，它依賴于搜索引擎結果所提供的信息來歸納出聚類，使得在搜索引擎返回的非常大的文檔列表中的過濾操作變得十分方便。 -
Abstract : in this paper, we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems. besides the addition of augmented objective, we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem. at the same time, we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method. using the numerous useful solutions we get in the lagrangian relaxation as the original genes, we can improve the solution further. test results show that these methods achieve satisfied outcome for job - shop problems. they can also be applyed to other programming problems with constraints
文摘:針對車間調度問題，提出了一種改進的拉氏鬆弛演算法.在增加輔助目標函數的基礎上，通過對子問題的限制和搜索策略的改變，使拉氏演算法的計算量減少，近優解的搜索能力有很大改善.本文還提出了一種基因優化演算法，充分利用拉氏演算法得到的多個近優解，進一步優化結果.模擬結果表明對車間調度問題得到了較好的結果.本方法也可用於其它有約束的規劃問題 -
It provides users a unique interface, accept the query terms, run and return the results like meta - search engine do. in this paper we have developed a wan search database query system for practice use, and this project is supported by national funds
廣域網數據庫查詢系統提供用戶關于某一類數據庫信息的統一的查詢界面，它調用各個獨立網站數據庫系統對用戶輸入的查詢條件進行實時並發查詢，同時合併查詢結果返回給用戶。 -
This system can realize assemble condition search, blurry search, and separate the search results from pages. safety
查詢的多樣性：本系統可實現任意條件的組合查詢，模糊查詢，以分頁方式輸出查詢結果。 -
According to the shortage of the results given in this thesis, some comments on the improvement of the main frame of the tabu search algorithm are presented
文中還提出了個人對禁忌搜索演算法思想框架的一點改進意見。 -
Abstract : in this paper, first fe simulation algorithms for contact search, contact constraint, and the calculation of contact and friction loads were established based on the analysis for contact friction problem in sheet metal forming. then the fe simulation model for contact friction problem in sheet metal forming was set up. at last, the efficiency & amp; stability of this model was proved to be satisfactory by the comparing numerical example and experiment results of skin stretch forming
文摘:本文在分析了板料成形過程接觸摩擦問題特點的基礎上，提出了接觸搜索、界面滑動約束、法向接觸力以及摩擦力計算等問題的有限元模擬演算法，建立了板料成形過程接觸摩擦問題的有限元模擬模型，最後通過數值算例與飛機蒙皮拉形模擬試驗結果的比較，驗證了此模型計算精度及數值穩定性良好。 -
However, their current status is still far from user ' s satisfaction. lt includes : ( 1 ) the content that search engine returns is a enormous flat bill ( information overloading question ) ; ( 2 ) the items return with search engine are not the content that user requisite in deed ( low precision question ) this paper presents a fuzzy ( soft ) clustering algorithm htsc ( hyperlink - text based soft clustering ) using a mixed similarity metric of document content and inter - document hyperlinks, for clustering web search results from a search engine in order to help users find relevant web information more easily
這主要表現為： （ 1 ）搜索引擎返回的結果是一個龐大的平坦結構的資源清單（即信息負載問題） ； （ 2 ）搜索結果中的信息項並非都是用戶真正需要的信息資源（即低精度問題） ；論文提出了一種基於文檔文本內容和文檔間超鏈信息的混合相似度的模糊（軟）聚類演算法htsc 。該演算法可對搜索引擎返回的結果進行模糊聚類，以方便用戶從中找到真正需要的信息。 -
In this paper, we elaborate an intelligent search agent working on the internet, introduce the conception of ontology into the agent, make use of ability of ontology to describe semantic knowledge, set up a simple model of information agent using ontology to standardize the user ' s requests, analyze the results returned by the search agent and study the user ' s interests in order to let the information agent to retrieve information for users without requests
本文對因特網上的智能搜索agent作了比較深入的研究，將本體引入到智能信息agent中來，利用本體對語義知識描述的特長，在某個領域內建立一個簡單的本體實例，用來規範本體的查詢請求、分析處理搜索代理返回的搜索結果、學習用戶的興趣愛好，使其能自主的為用戶查找用戶感興趣的信息。 -
Simulation results show reconstructed image of this technique has good overall visual effect and has no block profile which may exist in block matching motion estimation method. mrme ' s time requirement approximates that of block logarithm search algorithm
模擬結果表明，該方法重建的解碼圖像整體感好，無塊匹配搜索法的塊輪廓，而編碼速度和塊對數搜索法相當。 -
In this paper we first discuss how to set up and real time update the interests model, then focus on how to use the interests model to optimize the search results
本文詳細論述了建立興趣模型和實時更新興趣模型的相關方法，以及如何利用興趣模型對元搜索引擎的檢索結果進行優化處理。 -
Theoretically, this quadrature can classify image blocks effectively, which bring out big speed - up ratio in fractal encoding ; and this feature is a continuous value, which enables us to adjust the quality of decoded images by changing the number of classes. our experimental results show that, comparing with exhaustive search, when the class number is 25, we obtain 20 times speed - up ratio, with only image degeneration of 2. 08db, at the same compression ratio
_ }速比;這種不變量也是連續量，大量的數值實驗表明，因此還可通過改變分類數目來調竹解碼圖像的質量在壓縮比相同的前提下，與全局搜索法相比，塊分為25類時，可取得約20倍的加速比，而解碼質量只相差2
分享友人