This paper presents a bidding model of power market and resolves it by a new interior point nonlinear programming algorithm for optimal power flow problems ( opf ) based on the perturbed kkt conditions of the primal problem . at the same time , it discusses the implementation of a bidding system based on web 本文基于原問題擾動karush - kuhn - tucker ( kkt )條件的現代內點最優化算法,完成了電力市場競價模型的建立和求解,并初步討論了一種基于web的競價交易系統之實現。
As more and more genome sequencing projects are accomplished one after another , the amount of sequence data has been exponentially increased , the demand for efficient alignment algorithm in sequence analysis is increasingly urgent . based on the concept of sequence segmentation , we applied the multiple - stage dynamic programming algorithm in pairwise alignment to devise a new algorithm named samidp and developed the corresponding programs in visualbasic , we find that samidp not only reduces the computation complexity to o ( n ) , but also obtains even satisfactory accuracy , and it is expected that the new algorithm will be important in global sequence alignment 基于段與段比對的概念,我們設計了一個用于核酸序列全局比對的新算法samidp ( sequencealignmentbasedonmultiplestageintelligentdynamicprogrammingalgorithm ) ,將多階段動態規劃決策算法用于兩兩序列比對并用visualbasic編程實現,結果發現該新算法在將計算復雜度減小到o ( n )的同時,也能夠獲得較為理想的計算精度,預期將在序列全局比對中起重要作用。
So a lot of researchers have attached importance to optimization computing , and put forward all kinds of algotithms for optimization problems , for instance : simplex algorithm , dynamic programming algorithm , branch - bound algorithm , etc . but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems 為了解決各種優化計算問題,人們提出了各種各樣的優化計算方法,如單純形法、梯度法、動態規劃法、分枝剪界法。這些優化算法各有各的長處,各有各的適用范圍,也有各自的限制。
The paper showed a way combining kbs ( knowledge based system ) and cbr ( case based ratiocination ) to choose the transport routes , and proposed a programmed algorithm based on a method of the fixed train path by the regular characteristic of artsr , which could arrange the train schedule on the chosen transport routes 從特殊需求的自身規律出發,運用知識系統和案例推理相結合的方法選擇運輸徑路,設計基于固定點號的運行計劃安排算法,在選定的運輸徑路上安排運行計劃。
As an application of succeeding , a numerical example of max - cut is given . 3 . several semidefinite relaxation detection strategies of the cdma maximum likelihood multiuser detection are investigated . rounding , coordinate descent , cutting plane and branch and bound based on quadratic programming algorithm are presented to get the suboptirnal solution 本文紿出了基于半定規劃模型尋求多用戶檢測問題次優解的幾種重要方法,包括隨機擾動法、坐標下降法、半定規劃的割平面法和二次規劃的分枝定界法等
Seventhly , technology reference model for network attack deception and program algorithms - based attack deception method are suggested ; the deception technologies for network scanning is studied ; the deception software system prototype of anti - webscanner is implemented ; the experimentation data shows that it has good effect 提出網絡攻擊誘騙技術參考模型和基于程序算法攻擊誘騙對抗方法,側重研究網絡掃描誘騙技術,實現對抗web攻擊掃描的誘騙軟件系統原型,并給出相關實驗數據。
In addition , we summarize some spatial join algorithms based on r - tree index and their cost estimation models . we also give out a query optimization algorithm framework based on dynamic programming algorithm , and integrated basic r - tree index method and query optimization mechanism into sadbs ii 另外,本文還總結了幾種基于r樹索引的空間連接算法及其代價評估模型,利用動態編程算法給出了查詢優化的算法框架,并在sadbs中集成了基本的r樹索引方法和查詢優化機制。
In the paper , we firstly summarize the theory , algorithm , application and recent research of semidefinite programming , then , introduce our some work in algorithm and application . for detail , we conclude them as follows : 1 . a nonlinear programming algorithm was proposed for the max - bisection problem , and the convergent result was given 本文首先介紹了半定規劃的基本知識,包括半定規劃的理論、算法、應用和研究現狀,然后在半定規劃的算法和應用方面做了一些工作,具體如下: 1 .對圖的最大二等分問題提出一種非線性規劃算法,并給出該算法的收斂性證明
According to new principles , the method of surface fairness and the character of surface based on direct on initial data point are researched , new curve and surface fairness optimization modeling fitting with fea are produced . 3 . evolutionary programming algorithm is presented to solve the optimization modeling ( 3 )在基于點的曲線曲面的表達方法下,結合曲線曲面的特點與光順處理的具體要求,采用一種新的現代優化技術? ?進化規劃算法的思路與方法,對問題進行求解。
A new evolution optimization - - - evolutionary programming algorithm is presented to solve the optimization modeling on curve and surface fairness . the following is a simple introduction to the thesis " s main content : 1 . according to finite element analysis , new surface fairness principles based on the method of surface reconstruction direct on initial data point are produced 論文分析了當前曲線曲面光順的主要問題,采用基于點的曲線曲面表達方式,針對有限元技術對曲線曲面的要求,提出針對有限元技術的曲線曲面光順準則,根據這個準則建立了相關的光順模型,并找出一種新的優化算法求解這個問題。