search argument 中文意思是什麼
search argument
解釋
查找變元-
As it can be expressed easily by argument equations, we use the conicoid as the criteria of points " classification. based on the point ' s normal and the adjacent field, corresponding to the conicoid equation such as plane, ball and cylinder, we search the points that fit the equation along the adjacent field. using this method, we realized the automatic classification of unorganized points
本文採用了可以比較方便地用參數方程表示的二次曲面作為數據點的分類標準，根據點的法向量以及其鄰域結點的各種屬性，對應于平面、球面、柱面等二次曲面，依據曲面方程的特點，從起始點開始沿鄰域深度優先遞歸尋找符合方程的數據點，實現了散亂數據點的自動分類。 -
If the function, such as string replacement function, accepts both arrays and single characters as arguments, and if your argument list is not too long, consider writing a few redundant replacement statements, passing one character at a time, instead of one line of code that accepts arrays as search and replace arguments
如果一個字元串替換函數，可接受數組或字元作為參數，並且參數長度不太長，那麼可以考慮額外寫一段替換代碼，使得每次傳遞參數是一個字元，而不是只寫一行代碼接受數組作為查詢和替換的參數。 -
Search the internet for information to help your argument
去網上搜索信息支持你的觀點。 -
A search argument sarg limits a search because it specifies an exact match, a range of values, or a conjunction of two or more items joined by and
搜索參數（ sarg ）可指定精確匹配、值的范圍或由and聯接的兩項或多項的連接，因此能夠限制搜索范圍。 -
In section 1, we first present our argument that the purpose of optimization is to search for the maximum value of a function. the major researches and recent development of the study of non - smooth analysis are reviewed. also included in this section is our discussion of the theoretical importance and wide practical prospects in studying differential properties of a lipschitz function
第一節是引言部分，提出了最優化問題的實質是在給定條件下求一函數的極值點；簡述了非光滑分析的主要研究內容及其發展進程；指出研究lipschitz函數的微分性質，具有深刻的理論意義和廣泛的實用前景。 -
A novel algorithm is presented for task decomposition and assignment, which is used in pursuit and sending task. the argument of its superiority and the analysis of its complexity are given as well. based on the " constriction algorithm " used in searching for the target in the image, the " stretch and constriction algorithm " is presented for target search, which receives a better result
在對任務層規劃的研究中，面向圍獵和押送任務提出了一種新的任務分解分配演算法，並對該演算法進行了較優性證明和復雜度分析；面向目標搜索任務，參考圖像處理中的「收縮式」搜索方法提出了一種「伸縮式」搜索方法，能夠更快的發現目標所處位置。
分享友人