lower programming 中文意思是什麼

lower programming 解釋
低級編程
  • lower : adj 〈low 的比較級〉1 較低的。2 下級的，低級的。 lower animals 下等動物。3 南部的。 in lower Manh...
  • programming : 編程序的
  1. Abstract : a cad tool based on a group of efficient algorithms to verify, design, and optimize power / ground networks for standard cell model is presented. nonlinear programming techniques, branch and bound algorithms and incomplete cholesky decomposition conjugate gradient method ( iccg ) are the three main parts of our work. users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed. the experimental results prove that the algorithms can run very fast with lower wiring resources consumption. as a result, the cad tool based on these algorithms is able to cope with large - scale circuits

    文摘:介紹了一個基於標準單元布圖模式的電源線/地線網路的輔助設計集成工具.它應用了一系列高效的演算法，為用戶提供了電源線/地線網路的設計、優化和驗證的功能.非線性優化技術、分枝定界演算法和不完全喬萊斯基分解的預優共軛梯度法是該工作的三個主體部分.用戶可以選擇使用非線性規劃的方法或者幾種分枝定界方法來滿足他們對于精度和速度方面的不同需求.實驗結果表明，文中所提供的演算法可以在很快的運行速度下實現更低的布線資源佔用.因此，在這些有效演算法基礎上實現的輔助設計工具具有處理大規模電路的能力
  2. Evading risk in financial trading market cries for pricing options to a nicety. asian option, as the most flourish options in the finace market, the pricing has been focused on always. the exact pricing formula for the geometric average asian option had existed, but as to the european - style arithmetic average asian option, due to the dependence structure between the prices of the underlying asset, no analytical formula exists. on the hypothesis that the market is frictionless and without transaction costs 、 on the base of b - s ’ s and in the binomial tree model, we provide several algorithms for computing an accurate value of the european - style arithmetic average asian option. following rogers and shi and by jensen ’ s inequality, many different upper and lower bounds are provided ; meanwhile a formula have got by the comonotonicity and approximating the distribution function. all of the algorithms are easy for programming. with the development of computer, more accurater price can be computed quickly. and numerical example proved that these algorithms are very accurate

    對于幾何平均亞式期權它的定價相對簡單，已經給出了定價公式。對于算術平均亞式期權，它的未定權益具有軌道依賴特性，一直沒有得到它的定價方程的解析解形式。本文基於對市場是無摩擦且在沒有交易費用的情況下，在b - s模型下，利用二叉樹模型給出了算術平均亞式期權定價方法;並總結了利用jensen 』 s不等式給出的各種不同情況下的上下界;同時應用共單調性和近似分佈函數的方法也給出了算術平均亞式期權價格的近似公式。
  3. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  4. Details are as follows : we deal with properties of bilevel linear programming and prove the equivalence of bilevel linear programming and optimization over the efficient set. a class of multi - objective tow level programming, i. e. the upper - level is single objective and the lower - level is linear multi - objective, is mainly discussed. it can be converted into the optimization over the efficient set with parameter and an algorithm is given with its finite termination being proved ; when the upper - level is linear function, an exact penalty function algorithm is given

    分層（分級）遞階系統是社會組織管理的主要形式，多層規劃是研究這類系統優化問題的基本模型，其鮮明的實際背景和廣泛的應用前景引起了人們的廣泛關注，成為一個新興的活躍的研究領域，本論文研究了二層規劃中的若干問題，主要工作如下：討論了二層線性規劃的性質，並證明了它與零有效集上優化問題的等價性；對一類二層多目標規劃（上層為單目標規劃、下層為線性多目標規劃的問題）進行了探討，將其轉化為含參變量的有效集上的優化問題，進而給出了一種演算法，並證明了該演算法的有限終止性；當上層為線性單目標時，給出了一種罰函數方法
  5. 2. for the problem with size, stress and displacement constraints, the stress constraint is transformed into movable lower bounds of sizes, the displacement constraint is transformed into an approximate function which explicitly includes design variables by using mohr integral theory. a mathematical programming model of the optimization problem is set up. the dual programming of the model is approached into a quadratic programming model

    2 .對于尺寸、應力和位移約束的問題，將應力約束化為動態下限，用單位虛荷載方法將位移約束近似顯式化，構造優化問題的數學規劃模型，將其對偶規劃處理為二次規劃問題，採用lemke演算法進行求解，得到滿足尺寸、應力和位移約束條件的截面最優解。
  6. In upper level optimization, the thickness and geometry factors of composite skins and webs as well as other structural dimensions are taken as design variables. then, considering the behavior constraints and the side constraints, the structural mass is minimized by the mathematical programming technique. in lower level optimization, the mathematical programming technique or the genetic algorithm ( ga ) is used to search the practical stacking sequence of composite skins and webs to realize the given thickness and geometry factors from upper level optimization

    底層優化設西北工業大學博士學位論文計以復合材料蒙皮和腹板等層合板各分層的厚度（或鋪層數） 、鋪層角和鋪層順序為設計變量，以層合板的幾何因子與頂層優化設計給出的最優幾何因子之間的誤差最小為目標，考慮層合板厚度和製造工藝性約束，採用數學規劃方法或遺傳演算法（ geneticalgorithm ，簡稱ga ）求出底層最優設計變量。
  7. Application of sqp algorithm in 3d lower sequential quadratic programming limit analysis

    演算法在三維下限分析中的應用
  8. Executing the lifting method to the equivalent programming, we present a strengthened semidefmite relaxation. as predicted by theory and confirmed by numerical experiments the tight semidefinite relaxation gives a better lower bound of circuit bisection than the one that the previous semidefinite relaxation gives

    本文先通過增加非線性約束得到原始問題的等價模型，進而對等價模型利用提升技術，提出了一個強化的半定鬆弛模型；最後，將結果推廣到更具一般性的圖的分割問題。
  9. Combined with the construction programming of no. 3 lock, further studies on the flow pattern at various locks are undertaken. to the actual conditions of siyang locks and taking various effects into consideration, engineering measures which are expected to ameliorate the pattern of flow at lower lock approach are propose

    在此基礎上，結合泗陽三線船閘的建設規劃，進一步對各線船閘水流特徵進行了計算和試驗，針對泗陽船閘的具體情況綜合考慮多種因素，提出了改善下游引航道非恆定流的工程措施，獲得了滿意的結果。
  10. Cw group with in the logistics the strong real strenght of each professional realm with abundant of operation experience for rely on, take abilities, such as the logistics system programming, the professional supply chain design and management of science and the information technique service of the forerunner. . etc. as core, provide the logistics solution and characteristic service for various customers, satisfy customer ' s supply chain excellent turn integration to wrap with logistics outside of demand, help customer to raise the logistics efficiency, lower the logistics cost, strengthen the customer ' s market competition ability

    創馨國際商務部以在世界物流各專業領域的強大實力和豐富的操作經驗為依託為基礎，以科學的物流系統規劃、專業的供應鏈設計與管理以及先進的信息技術服務等能力為核心力量，為各類型客戶提供物流解決方案和個性化綜合服務，滿足客戶供應鏈優化整合與物流外包的所有需要，幫助客戶提高物流效率，降低物流成本，增強客戶的市場競爭能力。
分享友人
分享到 Line

分享到臉書