classical optimization 中文意思是什麼

classical optimization 解釋
傳統優選法
  • classical : adj. 1. (文藝等)古典的,傳統的,權威的;古典文學的;古典語文的;古希臘[古羅馬]的;古典主義的,經典的。2. 人文科學的,文科的。3. =classic 1. adv. -ly
  • optimization : n. 最佳化,最優化。
  1. We present some classical theories about interprocedural analysis and optimization, including call multigraph construction, inline substitution and procedure cloning, and interprocedural information ( side - effect summary sets, alias information and interprocedural constant )

    然後,我們對過程間分析和優化的一些經典的理論,包括調用圖的構造,內聯替換和過程克隆,過程間信息(副作用摘要集合,別名和過程間常量)作了介紹。
  2. 2 ) linking the classical control theory with practice, it tries drawing a sententious and practical conclusion by optimization. correctness is proved by emulation with robust toolbox of matlab. 3 ) in view of the complicacy of the circuits, it optimizes reactive compensation by equivalent area theorem and programs by c. it has been used in practice and gets good benefit

    2 )結合多年工作經驗和一些經典控制理論對幾種典型負荷網路的補償容量、補償位置進行優化,尋求比較實用、可行的結論,並對其進行基於matlab的模擬,證明其正確性、可行性,使其具有更廣的應用性。
  3. Card makes design period shorter compution periods, having very high superourity compared to the classical methods. the use of optimization technique in card is an inevitable trend

    Card使得設計周期短、計算準確,與傳統的孔型設計方法相比有著極大的優越性。將優化技術用於card是必然趨勢。
  4. Because of the defect of long running time and big complexity in the classical job - shop scheduling algorithm, the paper brought forward an intelligent optimization algorithm based on rule ; scheduling process is divided to primary process and optimization process. through the method of ahp ( analytical hierarchy process ), the effect is researched between several rules and estimate. moreover, the results of ahp are used as a measurable standard to scheduling results

    本文針對傳統車間作業調度演算法運行時間長,復雜度大的缺點,提出了基於規則的智能優化調度演算法,將排序的過程分為初始排序與優化排序;基於多目標決策的層次分析方法,得出了各種規則與系統評價指標之間的影響度,其結論為生產計劃方案的選擇提供了定量的參考依據。
  5. To completely avoid producing elements jointed at their corner nodes and checkerboard patterns, which frequently occur when the topology optimization of plane continuum is studied, the theory of topology analysis of plane continuum in topology optimization process and the simple algorithm for programming are studied. according to algebraic topology theory, the boundary of elements and plane continuum are operated as a one - dimensional complex. by use of the adjacency vector in graph theory, the structural topology is described and the topological operation is achieved on a computer. by above, the structural topological feature in the evolutionary process is gained. these methods are effcient and reliable. under topology constraints, according to the results of stress analysis, by deleting elements and moving nodes at the boundary, more satisfactory results can be gained by using a few numbers of elements and iterations. to demonstrate the efficiency of these methods, solutions including some well - known classical problems are presented

    避免目前平面連續體結構拓撲優化過程中經常出現的單元鉸接以及「棋盤格」等現象,研究了連續體結構拓撲優化過程的拓撲分析方法,以及在計算機上實現的簡便演算法.根據代數拓撲理論,單元及連續體的邊界作為1 -復形進行運算.利用圖論中的鄰接向量概念,在計算機上實現了結構的拓撲描述及拓撲運算,得到了結構在拓撲演化過程中的拓撲特性,方法簡單、可靠.在一定的拓撲約束下,根據應力分析結果,採用刪除單元、單元退化、移動節點等方法,可以用較少單元得到更為滿意的結果,提高計算效率.為演示方法的有效性,給出幾個包括常見經典問題的解答
  6. This problem has vide applications in real areas, such as the design of water and electricity supply networks, and communication networks, etc. at the same time, the problem is also closely related with some classical combinatorial optimization problems, including the steiner problem and the travelling salesman problem, which are well - known. so, it is of great importance to study it

    所謂歐幾里德2 -連通steiner網路問題,就是對于給定的平面點集p ,確定它的長度最小的2 -連通steiner網路,該問題與組合最優化中著名的steiner問題和旅行售貨員問題有關,同時在水、電供應網路和通訊網路等設計中也有非常廣泛的應用,所以對該問題的研究具有重要的意義。
  7. To circumvent the non - differentiable difficulty caused by the positive homogeneously function that is involved in an equivalent unconstrained formulation for general inequality constrained optimization problems, we turn to the classical lagrangian function and redefine m ( x ) by a conic optimization problem with the lagrangian as the objective function

    為了克服不可微正齊次函數( ? | r _ - ~ m )給約束優化問題的等價無約束形式求解帶來的困難,我們將其目標函數m ( x )重新用一個以經典拉格朗日函數為目標的錐優化問題來表示。
  8. Then according to the essential trial of electric drive system in electric vehicles ( evs ), it is built that the simulation model of induction motor drive system of evs in efficiency optimization control ( eoc ), which suits different motors for simulation and research concerning the running condition of evs. taking nonlinear saturation problem into consideration, simulation study on eoc is proceeded by using an actual motor acting as an example, comparison of eoc with classical u / f control mode is completed at the same time. it is analysed that the variation of losses and their distribution causing by eoc

    聯系實際的應用背景,提出了電動車的最大效率控制問題。然後,從電動車電驅動系統的基本特性出發,建立了電動車工況下最大效率控制的感應電機驅動系統模擬模型,通過實例在飽和非線性的條件下進行了最大效率控制的模擬計算。針對感應電機損耗將最大效率控制產生的損耗變化及分佈規律進行了研究,對鐵心損耗的影響進行了分析。
  9. Srabpi integrates three sequential processes of classical schedule risk analysis method, namely project schedule planning, project schedule risk assessment, and project schedule risk management planning, into one process, which avoids the same difficulties as above and reveals the idea of system optimization

    Srabpi實現了進度計劃制訂、進度風險評估和進度風險管理計劃制訂這三個經典進度風險分析中原本為順序關系的過程的集成分析,較好避免了前述經典進度風險分析方法的普遍性問題,體現了系統優化的思想。
  10. Nonlinear programming which is considered to be recreation of the finite dimension optimization classical theory is a very important and active branch of opsearch. characteristic of nonlinear programming lies in : allowance of complex constraints on the optimization it studies, deep analysis of optimality and duality, emphasis on summarizing theorem and establishment of feasible algorithm

    非線性規劃是運籌學數學理論中特別重要而又活躍的一個分支,可認為它是有限維最優化經典理論的再創造,其特徵主要在於:所研究的最優化問題允許復雜的約束,對最優性、對偶性諸方面進行深入的分析,並強調進行理論概括和提出可行的演算法。
  11. Firstly, based on the utilization of the first and second law of thermodynamics, the ideal combined camot cycle model is set up. secondly, aimed at the insufficient of the classical thermodynamics analysis method, the popular method - - finite time thermodynamics analysis is applied to set up the model of endo - reversible combined carnot cycle. finally, the optimization relationships between the specific heating load ( shl ) and operating parameters and between shl and cop are conducted according to the characteristics of the function and investment of aht

    在首先利用熱力學第一、二定律分析方法的基礎上,建立了吸收式熱變換器的理想聯合卡諾循環模型,然後針對經典熱力學分析方法的不足,利用了當前很流行的有限時間熱力學分析手段,建立了aht系統內可逆聯合卡諾模型,根據熱變換器的功能、投資等方面的特點,導出了吸收式熱變換器比供熱率與操作參數、比供熱率與熱力學性能系數的優化體系。
  12. Chapter 2 embodies smart antenna technique. two types of smart antenna are introduced : beam - switched system and adaptive antenna system. then the spatial processor is discussed. some classical optimization beamforming schemes and adaptive algorithms are also presented

    第二章具體介紹了智能天線技術,包括兩種類型的智能天線:切換波束系統和自適應天線系統。
  13. It is significantly important to discuss semidefmite programming. its most important applications are found within many fields ; on the other hand, several classical optimization problems can be formulated as standard semidefinite programming. therefore semidefinite programming provides a unit form to study these problems and construct algorithms

    半定規劃為研究這一系列凸規劃問題並構造演算法提供了統一的數學框架,而且半定規劃在控制理論、信號處理、特徵值優化和組合優化等領域已獲得成功的應用,因此半定規劃在近幾年備受關注。
  14. In chapter 4, the performance of asynchronous systems with multilevel spreading codes based on periodical repetition of quantized chaotic time series is presented, focusing on the ds - cdma systems. some computer simulations for four kinds of chaos - based sequences are given to examine the results that chaos - based sequences outperform the classical spreading sequences ( maximum - length and gold sequences ) and the chaos - based sequences from the chevbyshev maps ( k = 3, 7, 11 ) is the best among them. as the result of these optimization effort, two design means toward sequences optimization are obtained, in which one is based on the entropy theory, the other is on minimizing the average possible error

    3 、本文的第四章分析了混沌序列的各種統計特性,著重研究混沌序列作為混沌擴頻序列在ds ? cdma系統中的抗擾性能,對不同的混沌擴頻序列和典型的擴頻序列進行了模擬,從模擬結果中可知,混沌擴頻序列的性能可以與典型的擴頻序列媲美,經過優化設計的混沌序列特性優于典型的擴頻序列;在混沌序列中, chebyshev混沌序列( k等於3 . 7 . 11 … …時)是最佳序列之一。
  15. On constructing and optimization of sample spaces in calculation of classical probability

    關于古典概率計算中樣本空間的構造及優化
  16. A lot of classical lpfs are designed for the filtering of acceleration signal, then the direction of filters " optimization is put forward in terms of the performance analysis of the filters and the filtering results. two adaptive filtering algorithms based on gratitude search are also discussed

    設計了多種對加速度信號進行濾波的經典數字低通濾波器,通過對濾波器的性能分析和濾波結果比較,總結了濾波器的優化方向;討論了基於梯度搜索的兩種自適應濾波演算法。
  17. The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard, and many practical problems can be formulated to it. therefore, studying the mcp is full of significance both in theory and in practice

    最大團問題是一個經典的np難的組合優化問題,很多實際問題都可以抽象為對無向圖上最大團問題的求解,所以,對最大團問題的研究無論在理論上還是實際上都有重要意義。
  18. Abstract : according to the characteristic of hybridize and sudden change of binary coding chromosome in classical genetic algorithm, this paper defines the rule of hybridize and sudden change of continuous variables. the method is noted for easy to operate and quite good to approach the best true solution in overall situation. by means of three computed examples of nonlinear optimization and quadratic programme problem, it confirms that the method has strong adaptability and can precisely determine the best solution, in overall situation

    文摘:根據傳統遺傳演算法中對於二進制編碼染色體的雜交和突變的特點,定義了連續變量的雜交、突變規則.此方法有操作簡便,可較好地逼近全局最優的真實解的特點.通過非線性優化和二次規劃問題的3個算例,證實本演算法適應性強,可較精確地確定全局最優解
分享友人