find algorithm 中文意思是什麼
find algorithm
解釋
尋找演算法-
A computer algorithm is used to find the minimum travel time between all consumer nodes and all bank locations.
利用計算機程序找出所有消費者點和所有銀行點間的最少往來時間。 -
Optimized association rules are permitted to contain uninstantiated attributes. the optimization procedure is to determine the instantiations such that some measures of the roles are maximized. this paper tries to maximize interest to find more interesting rules. on the other hand, the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence. a naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute. unfortunately, that results in a poor performance. a heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance. the experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes. the experiments with real data set show the approximate linear scalability and good accuracy of the algorithm
優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度 -
This paper studies several interestingness and contingency table standardization to find a more robust algorithm instead of using support and confidence
通過對有趣度參數和列聯表規整化的研究，進一步改進了對關聯規則挖掘演算法。 -
We ca n ' t divide the multiple streams time series into singleness times series simply in the research of multiple streams time series, we ' ll dissever the relation between the events of the multiple streams. although the msdd can find the dependency relationship of multiple streams, but it have n ' t the initialization of the events, the express of the time relationship between events is not frank, the cost of the algorithm is expensive ( o ( n5 ) ), i ca n ' t find much more knowledge in multiple time series, it find the dependency patterns only of the multiple time series, so there need a new more effective, frank, complete algorithm to find the knowledge
研究多流時序不能簡單地將它割裂為單流時序，因為這樣就割裂了數據流事件之間的關系。雖然msdd能夠發現多流時間序列中的依賴模式，但是由於其缺少對數據的初始化、事件之間時間關系的表示不直觀、演算法執行的時間空間開銷很大（ o （ n ~ 5 ） ） 、不能夠充分發現多流時間序列包含的知識，它只發現依賴關系，因此研究新的，高效，全面的發現多流時間序列事件之間關系的演算法成為必要。本文分析了單一和多流時間序列中的知識發現，把多流時間序列事件內部存在的關系表示為：關聯模式、依賴模式、突變模式。 -
In sequential pattern, we describe mfr and the algorithm on how to find frequent access paths. in mining association rules, we introduce famous apriori algorithm and propose the optimized dhp algorithm with hashing
在關聯規則的挖掘中，深入的分析了經典的apriori演算法，並運用哈希技術改進它得到dhp演算法，其中詳細闡述了該演算法改進的思路。 -
And an exhaust - search sample - driven algorithm, signal compatible algorithm which can find monad patterns, was proposed, and the search algorithm was depth - limit algorithm
在此基礎上，針對單一模式發現問題，文提出並實現了一種窮舉搜索的模式發現演算法? ?信號相容性演算法（ signalcompatiblealgorithm ， sca ） 。 -
This paper develops a deterministic inventory model for perishable items with a mixture of back orders and lost sales under inflation and time discounting, where the backlogged demand rate is dependent on the negative inventory level during the stock out period. the main differences from the existing related models are that the present model takes the maximum present value of profit in a repeatable order cycle as the objective function and proposes a more practical constraint of maximum customer - waiting time to ensure a proper customer service level. then the existence and the uniqueness of the solution to relevant systems are examined and a solution algorithm is shown to find the optimal replenishment policy. at last, some numerical examples are presented to illustrate the applicatioh of the model
本文建立了一種考慮通貨膨脹與時間價值的變質性物品的庫存模型，在模型中允許短缺發生且拖后的需求速率與在缺貨期間已經發生的缺貨量有關.和已有相關模型的主要區別在於本模型把一個可重復的訂貨周期內的最大平均利潤的凈現值作為目標函數，且增加了在缺貨期間最長顧客等待時間的限制，以確保庫存系統擁有較高的服務水平.然後討論了模型最優解的存在性與唯一性，並提供了尋求模型整體最優解的演算法.最後用實例說明了此模型在實際中的應用 -
Crackers will do a simple text search for this message inside the disassembled or decompiled output and chances are, when they find it, they will be very close to your sensitive time lock algorithm
黑客會執行一個簡單的文本搜索，在反匯編或反編譯的輸出中查找此消息；如果他們找到此消息，則他們會很快破解敏感的時間鎖定演算法。 -
On the basis of algorithm analysis, from aspects of detecting principle, detecting steps and computer emulation, the authors expatiate how to use wavelet transform to detect backscatter signals ' time difference and find the fantastic point of backscatter signal ( the time point when backscatter signal reaches ), finally to find the location of the object being detected
在演算法分析基礎上，從檢則原理、檢測步驟、計算機模擬方面闡述如何利用小波變換檢測回波信號時差，以確定回波信號的奇異點（回波信號到達時間點） ，進而確定被探測目標的位置。 -
To deal with the question that how we can guarantee the dna sequences which are stored in the personal dna database are anonymous, that no one can find out whom a special dna sequence is collected from, this paper get a new method ? savior, by improve dnala ( dna lattice anonymization ), which is a method settling this question. savior replaces the multiple alignment in dnala with pairwise alignment between every tow sequences, and replaces the greedy algorithm in dnala with stochastic hill - climbing. for doing this, it can save the time for data pretreatment, and add the precision of classing
針對個人dna數據的隱私保護問題，即:如何保證無法將存儲在數據庫中的dna序列信息與其提供者的個人身份信息（如:姓名，身份證號碼等）聯系起來，本文對一種新近開發的隱私保護方法? dnala （ dnalatticeanonymization ）進行了改進，在數據預處理階段，用兩兩雙序列比對代替了原演算法中的多序列比對，在不降低處理精度的情況下減少了數據預處理所耗費的時間;用隨機爬山法代替了原演算法中的貪心策略，增加了演算法後期處理的精度，從而形成了一種新的演算法? savior 。 -
In the leach - new protocol, the mainly improvement of the leach protocol exhibits as follow : for the sake of balancing the network load, the network choose the clusters based on the residual energy ; we take multi - hop communication between sensors instead of single - hop communication, which results in the reduction of energy consumption of clusters ; the new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link ; the algorithm for assigning tdma time slot reduces overall delays of network
在leach - new協議中，對leach協議的改進主要體現在以下幾個方面:根據節點剩餘能量選擇簇頭，以平衡網路負載;節點間採用多跳路由，降低簇頭能量消耗;節點根據能量消耗的代價來選擇至簇頭的路由，通過擴散演算法來廣播代價消息，採用貪婪演算法來選擇能量消耗最小的路徑;採用tdma時隙分配演算法減少網路時延。最後，利用ns2模擬軟體進行驗證。 -
Via this neural network, we can eliminate those regions which contain no plate and then use color information to modify the correct region and find the accurate position of car plate finally ; 3 ) in the progress of recognition, we apply the structural alternative covering algorithm and only use some basic techniques to process the image
將構造性的覆蓋演算法應用於牌照的定位，在對這些區域進行分析后提取出各自的特徵並進行學習，構造出相應的神經網路，用來排除假的干擾區域，同時結合圖像的顏色信息來對前期的定位結果進行修正，最終得到正確的車牌位置： 3 -
In the case of the maximal observing time model, the solving problem can be break up into small problem which is find the elevation having maximal observing time of every access. thus, a simple enumeration algorithm can be used to solve it
對時間覆蓋率優先問題，通過對這類模型的求解問題的特點進行分析，將問題轉化成為求解單次訪問的時間最長觀測帶這一等價問題，實現了最優求解。 -
Next, introduct the technology of the protocol analysis. it means when examin the data packet, wo can use the protocol analysis technology to distinguish the protocol type of the data, then use the corresponding data analysis procedure to examin the data packet. so the examination efficiency can improved. finally, the k - r algorithm used for system data analysis module is parallelized design. and through the comparision the original algorithm and parallel algorithm, we can find that under the
即在對截獲的數據包進行檢測時，先使用協議分析的技術辨別數據包的協議類型，再使用相應的數據分析程序來檢測數據包，從而提高了系統的檢測效率; 5 ）對系統數據分析模塊中使用的k - r模式匹配演算法進行了并行化設計，並比較了原演算法和并行演算法的時間復雜度和執行代價。 -
Genetic algorithm is used to find arrangement information after first phase matching. rough match result of one arrangement is used as its fitness value in the paper
第一個階段匹配后，本文使用遺傳演算法尋找圖像序列位置關系，該遺傳演算法使用粗略匹配得到的結果作為一種位置關系的適應度。 -
In order to calculate difficult transportation cost between plants and distribution centers in the fitness value function, flow prediction algorithm was presented to find an minimum - cost flow patterns on an network composed of plants, consolidation centers and distribution centers with concave transportation costs and to obtain the appropriate fitness value
為了解決適應度函數中的工廠與分銷中心之間的運輸成本計算困難的問題，提出了流預測演算法，用於確定產品在工廠、集貨中心和分銷中心構成的凹費用流網路中的最優運輸路徑，進而獲得適應度函數值。 -
As for single axis, pewin, the software given by the programmable multi - axis controller ( pmac ), is used to find the best parameters of the pid controller and feedforward compensation controller. then, the nonlinear friction in the system is compensated by the friction compensation controller with genetic algorithm ( ga ). the compensation controller can improve the system performance effectively
對于單軸系統首先利用美國deltatau公司的可編程多軸控制器pmac自帶的控制軟體pewin進行pid參數的整定以及前饋補償環節的參數整定，然後分析系統存在的非線性摩擦力，利用遺傳演算法尋優摩擦力補償環節的參數，達到補償摩擦力的效果，有效地提高了系統的控制性能。 -
Generally speaking, division algorithm and factor resolution can be used to find the greatest common factor of the two multinomial
摘要求兩個多項式的最大公因式，可以用輾轉相除法及分解因式法。 -
Under mild assumptions on the inexactness, we can find an e - approximate solution of the socp by using this algorithm
在相對不精確的假設下，利用該演算法可找到二次錐規劃的-近似解。 -
The primary advantage that elliptic curve systems have over systems based on the multiplicative group of a finite field ( and also over systems based on the intractability of integer factorization ) is the absence of a subexponential - time algorithm ( such as those of index calculus type ) that could find discrete logs in these groups
與基於有限域的乘法群系統（及基於整數分解的難解性之上的系統）相比，橢圓曲線系統的優勢在於，迄今為止還沒找到這類群上離散對數的次指數時間演算法（如微積分類）
分享友人