solution graph 中文意思是什麼
solution graph
解釋
解圖-
The three kinds of construction graph can be applied to optimization problems with different characteristics, and the two kinds of layered construction graph are more suitable for complex multi - stage dynamic decision problems ( cmsddp ) than scg. the clcg defines smaller solution building blocks and is able to perform better in large - scale cmsddps than the blcg. 2. the construction graph of aco algorithms need statically describe the whole solution space ( or discrete solution spa
（ 2 ）蟻群優化演算法的解構造圖一般要靜態地描述整個解空間（或者是離散化了的解空間） ，對于大規劃動態決策問題，不僅存在描述解空間的困難，而且讓蟻群在迭代過程中始終在整個解空間中進行搜索，搜索性能會很低。 -
Solution of the shortcut problem in graph algorithms
圖論中最短路徑問題的解法 -
This paper analyses and studies the design method of optical divide ratio of two way optical distributor in star optical fiber transport network, reaches a simple method to design optical divide ratio of two optical distributor : tabulated solution method and graph method, and then analyses and summarizes the characteristic and law of function curve, the five - point conclusion are presented finally
摘要對星形光纖傳輸網路中的光二分路器分光比的設計作了分析和研究，得到一種設計光二分路器分光比的簡便方法查表法和曲線圖解法，並對相關函數關系及其曲線特徵與規律作了分析，得出了5條結論。 -
Discussion on the graph theory solution for maze problems
迷宮問題的圖論解法探討 -
Aimed at the equal - diameter cam mechanism with follower of planar movement, and according to two conditions of existing meaningful solution of the mechanism and of ensuring transmission angle of output swinging rod, the value selection ranges of cam motion angle, of swinging angle of out - put swinging rod and of its primary installation angle were analyzed and determined, and then proceed to plot the region graph of selectable value for motion angle of cam and swinging angle of swinging rod, thus provided convenience for the design and employment of that mechanism
摘要針對平面運動從動件等徑凸輪機構，根據機構存在有意義解和保證輸出擺桿傳動角兩個條件，分析並確定了凸輪運動角、輸出擺桿擺角及其初始安裝角的取值范圍，進而繪制了凸輪運動角與擺桿擺角的可選值域圖，為該機構的設計與使用提供了方便。 -
The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. a column generation solution is proposed and several enhancements are made in order to fasten its convergence. numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes
一個對tdma機制的有效改進方法是空分tdma機制，它將無線結點之間的物理距離考慮在內，規定互相不干擾的通訊鏈路可以在相同的時間片內傳輸，從而減少了網路所需時間片的總量，從而提高了單位時間內可傳輸數據包的數量，即提高了整個網路的吞吐量throughput 。 -
This paper presents the conversion from dynamic logic gate to markov chain, the solution of dynamic subtree top event failure probability and the method of obtaining the failure mode of subsystem using markov model, that is sequence cutsets of the dynamic subtree. the typical approach to importance analysis of component is impractical for large systems in markov model, so this paper also provides a simple and intuitionistic graph solution based on markov chain
論文研究了動態邏輯門向馬爾可夫鏈的轉化方法，利用馬爾可夫鏈法求解動態子樹頂事件概率，以及通過馬爾可夫狀態轉移圖直接找齣子系統的故障模式和薄弱環節，即得到動態子樹的順序割集。 -
As an example, the parallel machine scheduling problem is mapped on a non - constrained matrix construction graph, and a aco algorithm is proposed to solve the parallel machine scheduling problem. comparison with other best - performing algorithm, the algorithm we proposed is very effective. the finite deterministic markov decision process corresponding to the solution construction procedure of aco algorithm is illustrated in the terminology of reinforcement learning ( rl ) theory
本章最後提出了解決并行機調度問題的蟻群演算法，該演算法把并行機調度問題映射為無約束矩陣解構造圖，並在演算法的信息素更新過程中應用了無約束矩陣解構造圖的局部歸一化螞蟻種子信息素更新規則，與其他幾個高性能演算法的模擬對比試驗證明這種方法是非常有效的。 -
The global normalized ants - seed pheromone update rule is presented to ensure that the sum of the pheromone distributed over the construction graph is a constant, in addition, the normalized mechanism solves the problem of pheromone initialization and avoids the influence of the scale of the quality function of the solution
本章還提出了一種全局歸一化的的螞蟻種子信息素更新規則，該規則能保證分佈在整個解構造圖上的信息素的總量保持恆定，同時解決了信息素初始化的問題以及消除了解質量函數的量綱對演算法性能的影響。 -
Construct a graph by plotting the meter readings versus the volumes of standard silver nitrate solution used in the titration
通過儀表讀數及與之讀數相對應的在測式中所用銷酸銀溶液的量建立一個圖表。 -
A possible solution to this problem is : adopting symbolic transition graph with assignment ( stga for short ) to model value - passing systems, introducing a predicate mu - calculus to characterize desired properties, and verifying value - passing concurrent processes using an " on - the - fly " algorithm
解決這個問題的一個方案是：使用帶賦值符號遷移圖（ stga ）作為並發傳值進程的模型，使用謂詞演算作為刻畫性質的邏輯，並採用動態實例化的演算法對傳值並發進程直接進行模型檢測。 -
According to the difference of defining solution building blocks and mapping them to the nodes of the construction graph, three kinds of construction graph, simple construction graph ( scg ), basic layered construction graph ( blcg ) and compound layered construction graph ( clcg ), are defined here
本論文根據對解構造塊的分解方式以及與解構造圖節點之間的映射方式的不同，分別定義了簡單解構造圖、基本層狀解構造圖及復合層狀解構造圖，並研究了這三種解構造圖適于求解的優化問題的特性。 -
For quantitative solution, we study gspn and find that the reachability graph of a gspn is isomorphic to a continuous time markov process ( ctmp ) when the vanishing markings are eliminated, so markov process method can be used
在安全性定量分析方面，我們研究發現去除消失標識后， gspn的可達圖與一個連續時間markov過程（ ctmp ）是同構的，為此，可利用markov過程方法進行分析。 -
The software can automatically deducate the character state equation from the power bond graph input by user, then put the result and parameters input by user into the ode file which is required by matlab. matlab can solve the ode file with numerical solution method of ordinary differential equation. so the timedependent solution of system parameters can be gained
該軟體從用戶輸入的功率鍵合圖入手，自動推導出系統的字元型狀態方程，並將推導結果同用戶輸入的各種參數一起輸入到matlab所要求的ode文件中，然後採用matlab所提供的常微分方程數值解法對該ode文件求解，從而得到系統各主要參數的時域解。 -
Then a suboptimal solution of the graph maximum equal - cut problem is presented employing the randomized algorithm and the improved coordinate ascent ( descent ) algorithm on the optimal solution of semidefmite relaxation
在利用lagrange乘子理論得出原始問題的等價形式之後，將近似演算法與改進的坐標上升（下降）演算法結合，求得原問題的次優解。 -
The local normalized ants - seed pheromone update rule for the matrix solution construction is presented to ensure that the sum of the pheromone distributed over a row of the nodes in the construction graph is a constant, and it can be proved that for the non - constrained matrix construction graph, the local normalized ants - seed pheromone updat e rule is a minimum cross - entropy pheromone update rule
然後定義了一種特殊的解構造圖-矩陣解構造圖，並提出了flowshop問題的矩陣解構造圖模型，同時針對矩陣解構造圖提出了局部歸一化的螞蟻種子信息素更新規則，該規則能保證分佈在矩陣解構造圖每一行結點上的信息素總量保持恆定。 -
This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms
這一結果將傳統的顯式圖搜索與隱式圖搜索，求一個解的局部搜索與求全體解的遍歷搜索，全部統一到同一個模型和若干演算法中去。 -
After introducing the main approaches briefly, this paper summarizes and contrast them. it lay emphasis on the research of galerkin fem equations for multiaquifers and its solution, and on the research of basic ideas and implementation of visual mesh auto - generation 。 with an in - depth study on automatic mesh generation dividingtechnology of finite element, computer image processing techniques and visual scientific calculation technology, and under thebased on windows 2000 platform, we work out the foreground programs using visual basic 6. 0 from microsoft, which possesses friendly programming environment and abounding graph function, while the background programs are accomplished using the powerful function of data base and chain table of delphi 6. 0 from borland
重點研究了潛水? ?承壓水多層結構含水層系統的伽遼金fem方程，並探討了其數值解法，提出了基於可視化理念的fem剖分軟體系統設計的基本思想及其實現的方法。在深入研究有限元自動剖分技術、計算機圖形處理技術和科學計算可視化技術的基礎上，在windows2000平臺下，採用microsoft公司的visualbasic6 . 0與borland公司的delphi6 . 0混合編程，利用vb友好的編程環境和豐富的圖形函數來編制前臺程序，而後臺程序則利用delphi強大的數據庫功能和鏈表功能來完成。 -
Security constraints are consistent by modifying security constraint definition, and an effective classification assignment algorithm is given in this paper. we analyze the problem of inference channel and give solution to solve the problem during database analysis and design period. by analyzing the problems resulting from extending single - level transactions to multilevel transactions, we also give a multilevel secure transaction schedule algorithm based multiversion snapshot graph
本文提出採用主從結構表的方法對blp模型加以改造，使得改造后的blp模型具有較高的可用性和安全性；通過修改安全約束的定義，使得安全約束之間始終是協調的，並給出一種高效的密級分配演算法；討論了推理通道問題，給出了在數據庫分析、設計等階段可以採用的對策；分析了事務從傳統的單級擴展到多級面臨的眾多難題，給出了一種基於多版本串列化圖的事務調度演算法；根據上述理論，開發了一個多級安全數據庫管理系統的原型系統。 -
A kind of heuristic information based on the dannenbring approach is introduced in the procedure of solution construction. the experiment shows that the stagnation step out mechanism and the pheromone trail limit mechanism can help ants stepping out of stagnation and the heuristic information is very effective, in addition, the eligibility trace mechanism in ant - q ( ) algorithm can greatly improve the performance of algorithm based on solution construction graph in arc mode
模擬試驗表明，信息素的結點模式總體優于孤模式；啟發式信息能較大改進演算法性能； acostag演算法的信息素蹤跡更新過程中的停滯狀態脫離機制以及信息素蹤跡限制機制能幫助螞蟻跳出局部最優解；此外antqo ）演算法的資格跡機制能大大改進採用弧模式解構造圖的蟻群演算法性能。
分享友人