search-based program 中文意思是什麼
search-based program
解釋
基於搜索的程序-
Shared - memory multiprocessor systems. one is a recently - proposed parallel randomized best - first minimax search ( prbfm ) algorithm in a chess - playing program, and the other is the latest version of crafty, a state - of - the - art alpha - beta - based chess - playing program whose older sequential version is known as a typical game program in spec2000
演算法一是最近新出的parallelrandomizedbest - firstminimaxsearch （ prbfm ） ，演算法二是著名的開源棋類游戲crafty採用的dynamictreesplitting演算法，其早期的單線程版本是spec2000benchmark測試cpu整數性能的程序之一。 -
This thesis primarily makes below the work of a few aspects : ( 1 ) the method that measuring and solution of the control point ' s coordinate, calculation of the point, solution of intersection with polygons, and calculation the quantity of ore reserves in a drawing file by computer technology ; ( 2 ) the theory and the method to draw the diagram of the equivalent line by establishing the abnormal triangle net, and ore blending with the diagram of the equivalent degree ' s line ; ( 3 ) the principle and method to automatically divide the ore, and the method to adjust to the quantity of ore and search the ore ' s information ; ( 4 ) adoption the line program to beg to solve the problem to ore blending, and establish the linear programming model and the simplification model with ore blending. ( 5 ) establish the control model with ore degree based on modem control theories
本論文主要完成了以下幾方面的工作： （ 1 ）利用計算機技術直接在一張現狀圖中，實現了控制點的測量與求解、坐標展點計算、多邊形求交以及爆堆礦巖量的計算； （ 2 ）提出了通過建立非規則三角網的方法來繪制等值線圖的理論和實現方法，通過等品位線圖指導配礦工作； （ 3 ）提出了配礦塊段自動劃分的原理和方法，並在此基礎上實現礦塊礦量調整和礦塊信息查詢； （ 4 ）採用線性規劃的方法求解配礦問題，建立了配礦問題的線性規劃模型和簡化模型； （ 5 ）建立了基於現代控制理論的品位控制模型。 -
The research presented in this thesis was a sub - project of the national high technology research and development program of china ( no. 2004aa424530 ) on case - based industrial design ( cbid ) system. the procedural knowledge retrieve in case - based nc machine tools form design system is the focus of the research. with the analysis of the theory, a cognitive experiment with the method of protocol analysis was conducted to capture and identify the procedural knowledge and design problem domain, and the model of procedural knowledge search is proposed with the concept of membership from fuzzy theory
本文是「 863 」國家科技攻關項目「基於案例的工業設計技術（ casebasedindustrialdesigncbid ）和輔助設計應用系統研究」的研究子課題之一，文章研究重點為系統中數控機床工業設計中程序型知識檢索，通過理論分析和實驗研究，探討其在cbid系統中的實際應用模式，最後引入模糊數學中隸屬度的概念，探討了其在系統中的實現方式。 -
For circle failure surface, this paper uses ga ' s theory to search the center of a circle and the radius of it separately, and based on simple bishop method to compute the safety factor ( f ), and compiled program successfully
針對圓弧形滑動面法，採用嵌套式的遺傳演算法分別對滑動圓弧的圓心、半徑進行遺傳進化搜索，基於簡化bishop原理進行穩定系數的計算，成功的編制了程序。 -
According to the definitions of bottleneck bandwidth, available bandwidth and bulk transfer capacity, we analyzed the algorithms which named vps ( variable packet size ), pptd ( packet pair / train dispersion ), slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement, we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range, approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ), we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth, we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap, we developed a measurement program to look for bottleneck bandwidth. in ns2 experiments, the algorithm based on heterogenous packet - pair train fitted well, and the algorithm of self - loading binary search worked quickly, and the sctp scheme improved the throughput effectively
本文根據瓶頸帶寬、可用帶寬和btc （ bulktransfercapacity ）三類網路帶寬定義，分析了vps （ variablepacketsize ）和pptd （ packetpair / traindispersion ）瓶頸帶寬測試演算法， slops （ self - loadingperiodicstreams ）和topp （ trainsofpacketpairs ）可用帶寬測試演算法;基於子路徑瓶頸測試原理，設計了異構包對序列的瓶頸測試演算法;並結合三個子演算法（界定帶寬范圍演算法、接近帶寬值演算法和帶寬變化趨勢判定演算法） ，設計了自載流折半查找的可用帶寬測試演算法;把上面的演算法應用到sctp （ streamcontroltransmissionprotocal ）的多宿性和可用帶寬測試，提出了一個網路擁塞或故障時調整sctp傳輸路徑的方案;結合winsock和winpcap兩套網路開發工具，設計了一個瓶頸帶寬測試程序;通過ns2模擬實驗，驗證了基於異構包對序列瓶頸測試演算法的準確性、自載流折半查找演算法的快速性，和sctp改進方案的有效性。 -
Thirdly, the so - called fit degree and fit degree matrix are discussed to describe the rationale of knowledge supply and demand matching. furthermore, the entire design and implementation process of knowledge supply and demand matching based on an instance is discussed, including instance project introduction, knowledge base design and implementation, document management system and document fit degree management system implementation, middle layer operation process and user interface design. lastly, it summarizes the jobs the paper has done, focuses the prospect of knowledge search that should be done in the future and gives the essential program text of the system implementation
接著，提出了所謂的適合度和適合度矩陣的概念用以描述供需匹配的實現原理，然後結合一個實例詳述了知識供需匹配設計與實現的整個過程，包括實例項目簡介、知識庫的設計與構建、文檔管理系統和文檔適合度值管理系統的構建、中間層運作流程及用戶介面設計，最後對全文所做工作進行了總結，對知識搜索有待研究的工作進行了展望，並附上核心實現程序。
分享友人