pareto set 中文意思是什麼
pareto set
解釋
帕累托集-
The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed
較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。 -
When studying the network performance, flow control and resource provisioning of communication networks, traffic model plays a very important role. the recent studies show that the date network traffic is self - similar, so the markovian model, which describes telephone networks accurately, is not suitable for date networks. the self - similarity of the network traffic has severe impact on flow control and queuing analysis in date networks, therefore it has received significant attention. in this paper, g m 1 queuing model is used to analyze the queuing performance of generic variable length packet networks for the first time. the self - similar traffic is generated by multiplexing a large set of independent pareto heavy - tailed interarrival on off sources. the simulation results show that the heavy - tailed traffic results in queuing performance deterioration for variable length packet networks, which is in accordance with the analytical results for atm switches
業務量的自相似特徵顯著影響網路的流量控制與排隊分析，已經引起人們的極大重視。採用g m 1排隊模型對分組長度可變的網路的排隊性能進行了分析和模擬，其中自相似業務量是通過疊加大量獨立的到達間隔為pareto重尾分佈的on off源來生成的。模擬結果表明，自相似業務量導致網路的排隊性能劣化，這與有關文獻對atm交換的分析結果一致。 -
We develop the model by drawing into the concept of " pareto optimality " and use the concepts of feasible set and validation set to analyze the target function
同時，有創意的引入「帕累托最優」概念模型進行改進，還將投資學中的馬柯維茨關于可行集和有效集的概念與目標函數進行了類比分析。 -
Comparison and contrast on search space of the sga and full dominance - recessive diploid ga justifies the latter ' s capability to search hi a larger representation space. when applied to practical multi - objective design optimization, the proposed ga obtains a set of desired pareto solutions
將完全顯隱性二倍體遺傳演算法應用於一個帶約束的多目標結構優化設計問題之中，得到了一組pareto解，為遺傳演算法與多目標結構優化設計的結合作了有益的嘗試。 -
Therefore, venture capital should confirm the rational financing subject and set up a kind of effective encouragement and restraint mechanism in the course of financing venture capital, thus to reduce the transaction cost and raise the efficiency of the fund, and eventually realize the pareto optimum risk duty and the pareto optimum efforts level between investor and venture capitalist
因此，風險資本融資要確定合理的融資主體，建立一種有效的激勵和約束機制，來降低交易成本，提高資金的使用效益，在投資者與風險資本家之間實現帕累托最優風險負擔和帕累托最優努力水平。 -
Computing result shows that : coevolutionary mdo algorithms are effective on this problem ; distributed coevolutionary mdo algorithm is better than cooperate coevolutionary mdo algorithm ; asynchronous parallel version of distributed coevolutionary mdo algorithm speeds up the optimization procedure greatly while maintains good convergence performance ; multiobjective distributed coevolutionary mdo algorithm approximates the whole pareto optimal front well in only one single run, saves much computing cost than constraint method to obtain pareto optimal set, and greatly shortens search time by distributed asyn
計算結果表明：協同進化mdo演算法求解該問題是有效的，其中分散式協同進化mdo演算法優于合作協同進化mdo演算法；異步并行的分散式協同進化mdo演算法在保證收斂性能的同時大大加快了優化進程；多目標的分散式協同進化mdo演算法僅一次運行就很好的逼近了問題的整個pareto最優前沿，比用約束法求解pareto最優集節省了大量計算開銷，而且通過網路多臺微機的分散式并行執行大大縮短了搜索時間。 -
On the one hand, instead of a single optimal solution competing goals give rise to a set of compromise solutions, generally denoted as pareto - optimal
就第一點而言，與單目標優化不同的是多個相互競爭目標的優化結果是得到一組可行解，一般被稱作pareto最優解集。
分享友人