難排序法 的英文怎麼說
中文拼音 [nánbèixùfǎ]
難排序法
英文
heasort-
Next, we proposed the method of fitness sequence statistics analysis, to directly explore characteristics of fitness landscapes, and to further measure the extent of ga - hardness
提出了一種排序統計分析方法，可以直接測試適應值曲面的特徵，從而進一步反映遺傳演算法對該問題優化的困難程度。With a few weeks to go before retiring from the force, mr foo encouraged the graduates to set themselves the goals of devotion to duty, giving their best at all times and executing their duties without fear or favour, whilst at the same time upholding their integrity, as well as that of the office they hold
快將退休的傅俊康勉勵結業學員必須身體力行，盡忠職守，精益求精，將學到的警務知識和技巧，以誠實、不偏不倚、不畏懼、不徇私的精神，執行法紀，維持秩序，服務社會，並為市民排難解困，救急扶危。The order of our discussions " about these tasks is as follows : firstly, we pay more attention to the characteristics and difficulties of its environment including the concept, typical system model, main challenges, mobile network connection and soft application. secondly, according to mobile specialties of the environment we make the sort of data into four kinds : general data, time series, spatial data and time - spatial data, and present general processing of data mining. lastly, we discuss the methods of data mining of these four kinds respectively : after the introduction of the actuality of data mining of every kind, an algorithm of rule updating based on rough set is given, then put forward the processing of data related to mobile users and flow chat according to characteristics of the other three kinds
本文對以上任務的討論順序安排如下：首先是對移動計算環境的技術特點和難點進行討論，包括移動計算的概念和典型系統模型、主要挑戰、移動聯網以及軟體應用這幾個大的方面；其次根據移動環境的移動特性把移動計算環境中的數據分為普通數據，時間數據，空間數據以及時空數據，提出了在移動計算環境中數據挖掘的一般流程；接下來分別對這四類數據進行挖掘演算法的討論：每一部分都是先介紹該類數據的挖掘方法研究現狀，對于普通數據，針對我們已提出的一種挖掘演算法-粗糙集演算法（ rs ） ，提出了對應的規則更新演算法，對於後三種數據，本人根據其在移動計算環境中的特點分別提出了與移動用戶相關的該類數據的一種具體的處理方法和演算法流程圖，包括基於移位連接方法的多屬性時間序列的挖掘演算法，基於apriori演算法的空間關聯規則數據挖掘方法以及關于移動用戶移動模式的時空數據挖掘方法，並用matlab對其中的規則更新演算法和時間序列的挖掘演算法這兩方面進行了實例模擬。On the basis of the mentioned above, this paper analyzes the international competition of our textile industry. and using the method of ahp analyzes the main difficulties that our clothing industry will encounter in the new environments and to what extent they will affect its development. according to that, an optimum developing plan is also put forward in this paper, which mainly includes : ( 1 ) increasing enterprises " capability on technology and equipment, ( 2 ) breaking through technical barriers, ( 3 ) enhancing the personnel characteristic and boosting the cultivation of talent resources, ( 4 ) enlarging enterprises " scope and constituting large textile groups, ( 5 ) knowing well the trade policy and chances in main market, ( 6 ) increasing product quality and developing characteristic and setting up globally famous brands, ( 7 ) carrying out adjustment of industrial structure and completing the reconstruction of modern enterprises " system, ( 8 ) actively replying anti - dumping barriers, ( 9 ) carrying out the strategies of differential market, ( 10 ) implementing regional adjustment
在此基礎上，分析了中國紡織服裝業的國際競爭力，並引入層次分析法（ ahp ）對中國紡織服裝業應對新環境的主要困難及其對發展中國紡織服裝業的影響程度進行理論分析，按照問題輕重和影響程度大小進行了排序，提出集中力量按照： （ 1 ）提高企業的技術裝備水平， （ 2 ）集中力量突破技術壁壘， （ 3 ）提高員工素質，加快人力資源培訓， （ 4 ）擴大企業規模，組建企業集團， （ 5 ）熟悉各主市場的貿易政策及其變動， （ 6 ）提高產品質量，開發特色產品，創建名牌產品， （ 7 ）進行產業結構調整，完善現代企業制度的改革， （ 8 ）積極應對反傾銷， （ 9 ）實施差別化的出口市場戰略， （ 10 ）進行區域結構調整，加大市場開放的力度，充分發揮產業集群的競爭力的主次分明地最優化發展方案。An approximation algorithm a2 - 1 with absolute performance ratio 3 / 4 is proposed and the asymptotic performance ratio of a2 - 1 applied to the problem in which machines require prepare times is 2 / 3. another problem is two parallel machines scheduling to maximize the number of just in time jobs. for this problem we give a polynomial time optional algorithm in the case early penalty is larger or equal to late penalty, and it is proofed to be np - had when early penalty is less than late penalty
第二章所討論的另一個問題是帶提前和延誤懲罰的兩臺機排序極大化justintime完工工件數問題，當提前懲罰大於或等於延誤懲罰時，本文提出了該問題的一個多項式時間最優演算法a _ （ 2 - 2 ） ，從而證明了該問題是一個p問題，當提前懲罰小於延誤懲罰時，我們證明了該問題是一個np難的問題。The assignment problem is a type of sophisticated combinatory designs which are difficult to be solved by the traditional methods, and so is the sequencing problem
指派問題和排序問題是一類復雜的組合問題，傳統的方法難于解決。相比之下，遺傳演算法解決此類問題具有優勢。As far as the lists of urban engineering layout are considered, city general planning, district planning and detailed local planning all include the related contents of city infrastructures planning. in the recent years, some cities have commenced to compile the special planning such as " city transportation planning ", " water drainage works planning ", etc., but considering the contents, deepness and expressional method they still should be ranked in general planning. they mainly control macroscopically and reveal the aspects of large - scale establishments, construction standards and framework
就市政工程規劃的序列而言，城市總體規劃、分區規劃、城市局部地區詳細規劃都包含了市政基礎設施規劃的有關內容，近年來，一些城市著手編制了諸如「城市道路交通規劃」 、 「排水工程規劃」等專業規劃，但其內容深度及表達形式仍屬總體規劃的序列，主要是對一些大型設施、建設標準、布局結構方面的宏觀控制和展現，其成果圖紙多為1 /萬以上比例，其內容深度難以直接作為設計和建設的依據，控制性詳細規劃或修建性詳細規劃層面的市政基礎設施規劃在內容深度上已具有了一定的可操作性，但其多為局部地段的規劃，無法保證市政設施整體性、系統性要求。分享友人