subset algorithm 中文意思是什麼
-
To detect both known and unknown intrusion patterns, the system introduces a blended frame that makes use of both misuse detection approach and anomaly detection approach. the one of the highlight of the architecture is introduction of data mining technique, and the other is introduction of genetic algorithms. the ids uses data mining algorithms to abstract key features of system runtime status from security audit data, and it uses genetic algorithm to select the feature subset to reduce the amount of data that must be obtained from running processes and classified
本文陳述了所研究系統的主要特點和技術：將智能體（ agent ）技術應用於入侵檢測系統，解決了傳統入侵檢測系統的集中式解決方案的弊病，充分利用網路資源協同完成入侵檢測任務；利用基於主機和基於網路的數據源，形成一種完整的混合型的結構，從而能收集到更加全面的信息；使用了異常檢測技術和誤用檢測技術，採用一種混合型的結構，既能檢測已知的攻擊模式，又能發現新的攻擊模式。 -
Abstract : based on the iterative bit - filling procedure, a computationally efficient bit and power allocation algorithm is presented. the algorithm improves the conventional bit - filling algorithms by maintaining only a subset of subcarriers for computation in each iteration, which reduces the complexity without any performance degradation. moreover, a modified algorithm with even lower complexity is developed, and equal power allocation is introduced as an initial allocation to accelerate its convergence. simulation results show that the modified algorithm achieves a considerable complexity reduction while causing only a minor drop in performance
文摘:基於迭代的比特和功率分配機制，提出了一種低復雜度的比特和功率分配演算法.與傳統的迭代分配演算法不同，該演算法在每次迭代中只需要比較幾個特定的子載波.該方法在保持傳統迭代演算法性能的前提下極大地減小了迭代分配演算法的復雜度.此外，通過選擇等功率分配方案作為初始方案加快了演算法的收斂速度，進一步降低了演算法復雜度.模擬結果表明，提出的改進演算法在基本不犧牲系統性能的前提下有效地降低了演算法復雜度 -
Computes the hash value of a subset of the specified byte array using the specified hash algorithm, and signs the resulting hash value
使用指定的哈希演算法計算指定位元組數組子集的哈希值，並對結果哈希值簽名。 -
This paper analyzes and develops the existing risk analysis model bases on term rewriting system. it divides the group of assets into critical and normal subset, and performs the analysis in separate procedure. this reduces the system complexity, guarantee the priority of the critical assets ; it also introduces and / or attack tree into the attack scenario, cut down the system requirement of space, and provides support for both the coming graph rewriting model and decision selection algorithm
本文針對項重寫風險分析模型中資產的關鍵性級別，劃分出關鍵資產，通過分步的風險分析，實現不僅可以降低系統復雜度，還能有效保證關鍵資產的優先處理;引入了與或攻擊樹構建攻擊場景，節約了運行所需的空間，為后來的決策選擇打下基礎，同時也為以後的圖重寫的風險分析提供依據。 -
In the module of vehicle license plate detection, a novel classifier fusion - based algorithm is proposed. after locating candidate license plate regions, features of these regions are extracted for the optimal feature subset by exhaustive search strategy. based on classifier fusion theory, simple average ( sa ) method and two weighted average ( wa ) methods are applied
針對車輛牌照的檢測模塊，提出了一種新的基於分類器融合技術的車輛牌照檢測演算法：從候選車牌區域中提取車牌區域特徵，搜索出候選車牌區域的最佳特徵組合，應用簡單平均運算元和加權平均運算元進行融合判斷，定位車牌區域。 -
If you require c14n to be strictly limited to a document subset, then you must use the related algorithm
如果需要把c14n嚴格限制在一個文檔子集中，就必須使用相關的演算法 -
We use it to realize the computation of transition from nfa to dfa by reducing the number of the transition matrix dimensions from a three - dimensional array in traditional subset approach to a two dimensional array in the new algorithm
將此數據結構應用於nfa轉換為dfa的計算，將傳統的子集法中狀態轉換矩陣，由三維數組降低為二維數組。 -
If / is the column index subset which we have known, then we choose a column index i * from the residual subset i0 i, such that which k is the rank of a ( :, i ). this method is called the forward - choice greedy algorithm
實際上，在第三章中，我們只是解決了原矩陣a是列可分的lrms問題，那麼對于原矩陣a是列不可分的lrms問題，該如何求解呢 -
The proposed algorithm for knapsack problem is based on mimd. the sort algorithm by sampling is introduced in the sorting stage. the stages of generating subset - sum and searching are also optimized
并行背包演算法基於mimd結構，在排序過程中引入基於采樣的排序演算法，然後對子集和生成和搜索過程加以優化。 -
What is more, based on the computing model of the finishing time per piece of flow shop scheduling in the parallel movement, the paper analyzes the subordinate function of its finishing time per piece in respective conditions of definite due date and fuzzy due date, and mutual relationship of two objective functions between minimization of delayed term and maximization of general satisfaction, pointing that the former is the subset of the latter. and representing the satisfaction level of the manager toward finishing time of the piece with the subordinate function of fuzzy due date, making general satisfaction level as objective function, the paper accordingly sets up a mathematical model in the condition of fuzzy due date, and designs a computer simulating system in light of genetic algorithm to carry on an emulation experiment
在平行順序移動方式下flowshop調度問題的工件完工時間的計算模型基礎上，分析了帶固定交貨期和模糊交貨期時該問題的工件完工時間的隸屬函數，及總拖期最小化和總滿意度最大化這兩個目標函數的相互關系，指出前者西南交通大學博士研究生學位論文第頁問題是後者問題的一個子集，用每個工件模糊交貨期的隸屬函數表示決策者對該工件完工時間的滿意度，以總滿意度為目標函數，相應地建立了該問題下帶模糊交貨期的數學模型，設計了一個基於遺傳演算法的計算機模擬系統進行模擬試驗，結果是令人滿意的。 -
In this dissertation, we propose improved genetic algorithm and utilize it to search sample space for classification and evaluation with the best representative subset of training set
本文提出一種改進的遺傳演算法，利用改進的遺傳演算法搜索樣本空間，將得到的訓練集的近似最優代表性子集作為訓練集去分類評估集。 -
The problem of information weak consistency must be considered by the load balancing algorithm whn it performs schedu1ing. in order to using the weak consistency information effectively, we propose a smallest k - subset random algoritlun ( skr and conduct a lot of simulation
為了有效利用系統中的弱一致性信息，使之成為負國防科學技術大學研究生院學位論文載平衡調度的決策依據，我們提出了一種基於信息弱一致性模型的最小k子集隨機演算法，並進行了性能模擬分析。 -
Given the same feature subset, the proposed genetic algorithm utilizes fewer samples and obtains greater accuracy than random sampling. this dissertation mainly contributes to the following two aspects : 1
同以往的隨機抽樣方法相比，在同樣的特徵子集的情況下，本方法使用的樣本數量更少且預測準確率更高。
分享友人