np (complexity) 中文意思是什麼

np (complexity) 解釋
np （度）
  • np : 1. no protest 【商業】未拒付（票據等）。2. ＝noun phrase 名詞短語。Np ＝【化學】neptunium 鎿。
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  1. This subject belongs to three - dimensional layout problems with behavioral constraints theoretically and concerns the knowledge of spacecraft design, mechanical engineering, computer science, mathematics, mechanics and system engineering. so it can be ascribed as the frontier fundamental and applied research of cross - discipline subject with np complexity theoretically. in term of engineering practice, this subject has extensive applications, such as layout design of spacecraft module, engineering machinery, submarine and shipping, tank, under - water suspension engineering, platform of marine drilling well, bullet train, multiple spindle box of machine tool, robot

    該課題在理論上，屬帶性能約束的三維布局問題，涉及航天器設計、機械工程、計算機、數學、力學和系統工程等學科，為交叉學科前沿課題的基礎理論和應用基礎研究，具有np難度；在實踐上，具有廣泛的工程應用背景，如航天器艙、工程機械、潛艇、船舶、坦克、水下懸浮工程、海上鉆井平臺、高速列車、組合機床多軸箱、機器人等的布局方案設計問題。
  2. The complexity theory of calculation has proved that the so - called problem of np and other similar problems are equal in calculating

    計算復雜性理論表明，被稱作np完全問題的旅行推銷員問題以及其它類似的組合優化問題在計算上是等價的。
  3. ( 3 ) it is well known that the determinant problem in classic proposition logic is a np complete problem, and the first order logic is a half determinant one. so both the analysis of computing complexity and the realization of it are the most important fields

    （ 3 ）眾所周知，經典命題邏輯中的判定問題是np完全問題，而一階邏輯是半可判定問題，關于非經典邏輯特別是非單調邏輯的計算復雜性分析和演算法實現是一個重要的研究領域。
  4. Considering the np - complete problem, how to get the approximate optimized scheme of job - shop scheduling, and aimed at improving the efficiency of products and taking good advantage of concurrence, asynchronism, distributing and juxtaposition in multi - products and devices processing, we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop, that is the working procedures are divided into two types, then the bf and the ff methods about memory scheduling in os are applied, therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling. namely, the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it. the results we analyzing and tested show that it is better than the heuristic algorithm common used, for less restriction terms, more satisfying algorithm complexity and better optimized results

    針對job - shop調度問題求最優解演算法這一npc問題，本文以充分發揮多產品、多設備加工所具有並發性、異步性、分佈性和并行性的加工優勢，從而提高產品的加工效率為目標，對job - shop調度問題的工藝圖進行適當分解，使工序在一定時間段或是為具有唯一緊前、緊后相關工序或是為獨立工序，即將工序分兩類，再結合操作系統中內存調度的最佳適應（ bf ）調度方法和首次適應（ ff ）調度方法的先進思想，通過分析提出了一種解決一般job - shop調度問題的全新近優解方案：在考慮關鍵設備上工序盡量緊湊的前提下，將工序分類、對這兩類工序分批採用擬關鍵路徑法（ acpm ）和最佳適應調度方法（ bfsm ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。
  5. Because of the np complexity of mapping problem, the thesis studies two - step method : optimal scheduling of data flow graph and optimal processor mapping

    考慮到演算法映射問題的np復雜度和求解時間的指數性增加，本文主要研究兩步規劃方法，即先進行數據流圖的最優規劃，然後進行處理器的映射。
  6. The optimum multiuser detection can obtain the best bit error rate theoretice. but its computing complexity increases with the number of users exponentially and belongs to np maturity problem. so much research fasten on the multiuser detection with low computing complexity. cdma multiuser detection is in fact a combination optimize problem

    基於最大似然準則的最佳多用戶檢測器在理論上可以獲得最小的誤碼率，提供最佳的檢測性能，但其計算復雜度隨用戶數呈指數增長，屬于np完備問題，因此大量的研究集中於發展計算復雜度較低的次最佳多用戶檢測器，使其具有合理的計算復雜度。
  7. Because the most scheduling problem is np hard, it is impossible to find out common algorithm with polynomial complexity

    由於調度問題大多數都是具有np難度的組合優化問題，尋找具有多項式復雜性的優化方法幾乎是不可能的。
  8. It sets forth relevant conceptions of ddm in ieee 1516 interface specification, including dimension, range, region, update region set and subscription region set. then it divides data filtering mechanism into four steps, consisting of region declaring, region matching, link establishing and data transmitting. and it displays the essence of ddm by researching on ddm ' s formalization, comparison about previous specification, algorithm computational complexity and np - completeness

    這包括：敘述了ieee1516規范中數據分發管理的相關概念，即：維、區間、區域、更新區域集和訂購區域集；接著劃分了數據分發管理實現的基本步驟，包括：區域聲明、區域匹配、建立連接和數據傳輸等；最後通過形式化描述、與先前規范的比較、演算法復雜度和np完全性的研究，深刻地揭示出數據分發管理的本質。
分享友人
分享到 Line

分享到臉書