less than satisfying 中文意思是什麼

less than satisfying 解釋
不滿意
  • less : adj 〈little 的比較級之一〉1 更小的，較小的，更少的，較少的。2 較次的，較劣的，較不重要的；身分較...
  • than : 1 比〈用於 than whom than which〉。 Here is my new teacher than whom a better does not exist 這就...
  • satisfying : adj. 1. 使人滿足的，令人滿意的。2. 充分的；可以相信的，確實的。adv. -ly
  1. The essay introduces the status of railway less - than - one carload transport, analyzes the problems on decrease of less - than - one carload traffic volume, explains the characteristics and development trend of less - than - one carload transport, and puts forward the basic ideas and methods on satisfying market demand and innovating less - than - one carload transport service system

    摘要介紹了鐵路零擔貨物運輸的現狀，分析了鐵路零擔貨運量下降的主要問題，闡述了零擔貨運的特徵和發展趨勢，提出了滿足市場需求，創新鐵路零擔貨運服務體系的基本思路和方法。
  2. 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 ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。
  3. Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems. a dual algorithm for solving unconstrained minimax problems, based on the penalty function of bertsekas ( 1982 ), is presented. we prove that there exits a threshold of the penalty parameter satisfying that the sequences generated by the dual algorithm converge locally to the kuhn - tuker point of the unconstrained minimax problems when the penalty parameter is less than the threshold

    第3章給出無約束極大極小問題的一個對偶演算法的收斂理論，給出一個基於bertsekas （ 1982 ）罰函數的求解無約束極大極小問題的對偶演算法，證明罰參數存在一個閥值，當罰參數小於這一閥值時，該對偶演算法產生的序列局部收斂到問題的kuhn - tuker點，並建立了參數解的誤差估計式，同樣估計了罰函數的hesse陣的條件數，它也依賴于罰參數。
  4. When the molten copper temperature at 1200 and the content of al in mixed - powder more than 16. 5 %, the microstructure and properties of the cu - al2o3 composites were more satisfying. being affected more by microscopic motion state of cu2o and al in the molten copper, the reaction between cu2o and al reacted non - uniformly while the content of al in mixed - powder is less than 16. 5 %

    熔液溫度為1200且混合粉末中al含量大於16 . 5時，材料組織性能較好； al含量小於16 . 5時， cu _ 2o與al在銅熔液中的反應受物質的微觀運動狀態影響較大，反應進行得不均勻。
  5. Then we estimate the number of u ' s satisfying the above congruences systems, which is less than n / 6 and n / 2 respectively

    然後得到滿足這幾個同余式組的u的個數的上界分別為n 6和m 2 。
分享友人
分享到 Line

分享到臉書