Minimum cuts and maximum flows in directed planar networks with both node and edge capacities 一種基于模塊單子語義的動態(tài)程序切片方法
An application on minimum cost and maximum flow model to flight connecting problem in single hub and spoke network 最小費用最大流模型在航班銜接問題中的應用
In parallel installations , the larger valve handles the requirements for maximum flow down to its low flow capacity 這種并聯(lián)安裝方式中,大閥門處理降到低流量空穴下的最大流量需求。
It is important not only to know the maximum flow capacity of a valve but also to know how capacity varies over the valve stroke 控制閥流量模擬分析技術(shù)主要利用數(shù)值模擬分析計算控制閥的流量、壓損、入口靜壓與閥開度的關(guān)系。
It allows maximum flow from the air supply valve ; it makes people easy to breath by appropriate air supply in dangerous working condition 供氣閥流量大,呼氣阻力小,且可大流量調(diào)節(jié),使作業(yè)人員在任何險惡環(huán)境下,工作輕松自如。
Algorithm testing shows : the new maximum flow algorithm in network with both node and edge capacity confined is completely feasible and availability effective 算法測試表明:點和邊有容量約束的網(wǎng)絡(luò)最大流新算法是完全可行和有效的。
The flow network is mainly studied in the network flow problem and it calls for the determination of the maximum flow or the minimum cost flow of the flow network 網(wǎng)絡(luò)流問題主要以流網(wǎng)絡(luò)為研究對象,要求求出流網(wǎng)絡(luò)中的最大流或最小費用流。
Eventually with the optimizing method , primarily to the maximum flow , this paper makes an account of the researches on the optimum parameters of the gear geometry of gear pumps 最后利用優(yōu)化方法,以齒輪泵流量最大為目標函數(shù)對輪齒的齒形參數(shù)進行了優(yōu)化設(shè)計。
Last , use the minimum cost and maximum flow method in graph theory to solve the problem . the result got is relativel y accurate and the solving process is quite fast and simple 問題求解利用網(wǎng)絡(luò)流中的最小費用最大流算法,既保證了必要的精度,又使得問題求解快速、簡單。
Project line vertically up to intersect with the valve characteristic curve and from this point project line horizontally across to the left of the chart and record the percentage of maximum flow rate 畫出垂直向上的線與閥門特性曲線相交,從這個點畫水平線穿過圖表左側(cè),記錄最大流量的百分比。