search sequence 中文意思是什麼
search sequence
解釋
探索次序-
In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree
特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。 -
A database search revealed that the putative sequence of the red gene shows 40 - 50 % identity with those of uroporphyrinogen iii methyltransferase ( encoded by coba gene ) from various kinds of bacteria. an over - expression of the coba gene in e. coli was reported to lead to an accumulation of trimethylated derivative of porphyrin termed trimethylpyrrocorphin and factor ii, which emit strong red fluorescence under uv
在ddbj中搜索到多種細菌來源的coba基因（編碼uroporph仰nogenhmethyltransferase ）與redsene有40 50的同源性，並據報道，其中一個來源於pmpboibaclerilllaslldelll切chit的coba的基因，轉人大腸桿菌、酵母菌及動物細胞后能使表達載體在紫外線下發射紅色熒光。 -
Quick search algorithm of finding similar sequence
相似時間序列的快速檢索演算法 -
Besides character input function, q9 cis contains other enhanced functions for education purpose such as name roll recall, phonetic search, stroke sequence, stroke order, traditional and simple character input, pin yin input and chinese - english bi - directional dictionary
除了基本的索字功能外，更配備教學功能如百家姓近音字筆順筆劃繁簡體輸入拼音輸入及中英文雙向字典等索字功能。 -
6 we present the query optimization method. for the clustered time series database, the query sequence is classified to one of the cluster, and the efficiency of querying is improved for the similarity search space is limited in the cluster, . 7 we implement a client / server query system and test the presented methods
根據序列數據庫的聚類結果，將序列數據庫劃分為若干層次的簇結構，通過對查詢序列進行k最鄰近分類，確定查詢序列所屬的簇，然後在相應的簇中執行相似性查詢，實驗結果表』明，基於簇的查詢顯著提高了查詢效率。 -
For problems whose objective function or constraint functions have sharp curves on their contour maps ( such as the rosenbrock ' s function which has banana shape contours ), monotonicity may cause a series of very small steps, causing a huge number of iteration to reach their solutions. by using the nonmonotone technique, we get the sequence of successful interative point which should make the objective function mono - tonically decreasing. hence, we use both trust region strategy and line search technique and make each iterate generate an acceptable trial step in interior feasible set as next interative point
我們利用非單調技術得到使目標函數非單調下降的迭代點，因為非單調克服高度非線性化函數的求解問題，從而避免了只使用單調搜索在「峽谷」現象局部最優解被卡的情況，我們用信賴域策略和非單調線搜索技術相結合的方法，使演算法產生的迭代步落在可行域內點，同時又在信賴域內滿足接受準則。 -
One method was supervised recognition, which was to take advantage of some known information to determine a given sequence whether contained some specific functional elements ; the other way was unsupervised learning, which was to utilize some measures of comparability and some search algorithm to discovery some potential signals in biosequences
一種是有指導的識別方法，即利用已知的信息判讀一段未知的序列中是否含有某種功能元件;另一種是無指導的學習方法，即利用一些相似性指標，通過搜索演算法發現序列中可能蘊含的信號。 -
Through chaos optimization method embedded into the genetic algorithm. the algorithm with the combination the advantages of the genetic algorithm and chaos optimization method which need not the optimal problem function ' s differential and promote the ability of the genetic algorithm ' s locally meticulous search can be obtained with the faster convergence and the greater probability for the global solution. a chaotic sequence is inserted into the search procedure of genetic algorithm, which can overcome premature of the search by genetic algorithm and the speed of convergence is faster than standard genetic algorithm
對遺傳演算法進行了理論分析，並且研究了遺傳演算法的設計與實現；利用混沌優化方法不依賴于梯度信息的性質，將其與遺傳演算法相結合，提出了一種求解連續不可微函數優化問題的混合遺傳演算法；基於對于符號動力系統的研究，利用混沌序列的遍歷性，將混沌序列引入遺傳演算法中，提出一種嵌入哈爾濱工程大學博土學位論文一混飩序列的遺傳演算法，該演算法有效地克服了標準遺傳演算法中的早熟現象，並且具有更快的收斂速度。 」 -
In this paper ， an optimal search strategy by dividing the whole surveillance area into regions is presented so that the optimal search can be adaptively implemented in phased array radar. firstly ， the inherent relationship among average discovering time ， radar resources consumption ， search frame period and target distribution density is studied. secondly ， parameters for the region search are optimized to achieve the optimal search performance inside regions. then ， the optimal search frame period for each region is derived to minimize the average discovering time of targets ， where the constraint of radar time resource and the importance of each region are taken into account. finally ， the adaptability of this search strategy is discussed. only if the optimal parameters for each region are utilized and the beams are scheduled according to the optimal frame period under the radar time constraint ， the optimal distribution and the optimal scanning sequence of beams can be implemented adaptively. thus ， optimal search is adaptively implemented in the whole surveillance area
本文提出一種分區搜索演算法，實現了相控陣雷達的自適應最優搜索.首先，研究了各區域平均發現一個目標消耗的雷達資源和目標被發現的平均時間同搜索幀周期以及目標強度的關系；然後，研究了在各區域採用兩步搜索演算法的最優參數設計，實現了局部區域的最優搜索；其次，在雷達時間資源有限和區域重要性加權的約束條件下，導出了使目標被發現的平均時間最小的區域最優幀周期；最後，討論了分區搜索演算法的自適應性.只要採用各區域的最優參數，按最優幀周期調度雷達波束，就可以自適應地實現使目標被發現的平均時間最短的波束的最優分佈和掃描順序，即自適應最優搜索 -
To validate the performance of the proposed scheme, the scheme is simulated with fpga, and the simulation result indicates that compared with the conventional pn acquisition schemes, the pn acquisition using auxiliary sequence and binary search can decrease the acquisition time greatly on the same condition
同時，為了進一步驗證該同步捕獲方案的捕獲性能，文中採用fpga器件對捕獲方案進行模擬，分析結果表明：與傳統的序列捕獲方案相比，基於輔助序列和二分法的同步捕獲方案可以在系統復雜度和性能不變的前提下，大大縮短捕獲時間，實現擴頻序列的快速捕獲。 -
Then, introducing something about spread spectrum technique. and deciding to select direct - sequence spread spectrum ( ds ) in underwater acoustic communications by comparing ds to fh according to the properties of underwater acoustic channels. after that, discussing something about rake receiver, simulating the path - search algorithms, synchronization circuits and rake receiver in low speed underwater acoustic communications and analyzing some major factors influencing the performance of systems
然後介紹了rake接收技術的基本原理，並對rake接收系統中的路徑搜索和同步系統進行了討論和模擬分析，另外還對rake接收技術在低速水聲通信系統中的應用作了模擬分析，並討論了一些影響rake接收系統性能的主要因素。 -
Incremental dft based quick search algorithm of finding similar sequence
的相似時序檢索演算法 -
With the tests on artificial data and biological data, sca guaranteed to find the potential patterns in given sequence if they existed, and with scc as pruning rule, sca could accomplish the search in less time and with less memory
通過模擬數據和生物數據的測試，該演算法能確保發現序列中蘊含的所有模式，同時由於將信號相容性條件作為剪枝準則，該演算法具有計算時間短，佔用內存少的優點。 -
Forecasting subtle trap by sequence stratigraphy and 3d seismic data is a sensitive topic in hydrocarbon exploration. search for subtle trap by geophysical data is the most popular and difficulty
如何有效地應用層序地層學理論和三維地震資料進行隱蔽油氣藏預測是目前進行隱蔽油氣藏勘探中最敏感的課題。 -
The sequences are transformed to a relative sequence, in which all the segments are normalized by the previous segment. the relative sequences are categorized and indexed by suffix tree, and the result of the suffix tree search is the potential similar subsequences
通過將序列變換為相對序列，實現了對序列中任意位置、任意長度子序列的規范化；為了提高查詢效率，將相對序列的特徵向量進行離散化分類，並使用后綴樹進行索引。 -
Because of the benefit of the bbl design mode and the insufficiency of the work on it, this dissertation merges the popular representation - " sequence pair " of the placement and the tabu search algorithm, then applies to solve the bbl placement
基於bbl模式的優點和目前對其研究發展的不充分，本文將當前主流之一的布局表徵? ?序列對與禁忌搜索演算法相結合，研究了其在bbl布局中的應用。 -
In upper level optimization, the thickness and geometry factors of composite skins and webs as well as other structural dimensions are taken as design variables. then, considering the behavior constraints and the side constraints, the structural mass is minimized by the mathematical programming technique. in lower level optimization, the mathematical programming technique or the genetic algorithm ( ga ) is used to search the practical stacking sequence of composite skins and webs to realize the given thickness and geometry factors from upper level optimization
底層優化設西北工業大學博士學位論文計以復合材料蒙皮和腹板等層合板各分層的厚度（或鋪層數） 、鋪層角和鋪層順序為設計變量，以層合板的幾何因子與頂層優化設計給出的最優幾何因子之間的誤差最小為目標，考慮層合板厚度和製造工藝性約束，採用數學規劃方法或遺傳演算法（ geneticalgorithm ，簡稱ga ）求出底層最優設計變量。 -
The method was correlate search and fft carrier detection, which could solve the problem of the capture of the spread spectrum code under the condition of low snr and big frequency offset. we also put forward a method, shift receiving window and correlate with local sequence, which not only could solve the problem of symbol synchronization but also could acquire the statistics of the multipath. then we utilized the results of the channel estimation and the technology of rake receiver to decode the received spread spectrum sequence and acquire rude information
方案中提出了：相關搜索、 fft檢測信號載波的方法，解決了低信噪比、大頻差條件下擴頻碼的同步捕獲難題；滑動相關完成位同步的方法，解決了低信噪比下的同步問題；在時域利用相關進行通道估計，然後利用rake接收技術完成相關解擴的方法，一定程度上解決了多徑衰落影響解擴性能的問題。 -
The process of the moving target tracking includes many stages such as image sequence acquisition, image preprocessing, background image ascertain, moving target extraction, correlation matching search of moving target and so on
運動目標跟蹤的整個過程包括圖像序列採集、圖像預處理、背景提取、運動目標提取、運動目標相關匹配搜索。 -
Once patterns that match the search sequence are found, more accurate and intensive algorithms may be applied
檢索到與檢索序列匹配的模式后，需要進一步使用更加準確和深入的演算法。
分享友人