整數法 的英文怎麼說
中文拼音 [zhěngshǔfǎ]
整數法
英文
rounding-off method-
On the basis of analyzing limitation of using penalty function method dealing with constraints, an amending method based on the knowlege regulating strategy is suggested to amende the mapping relationship of infeasible constraints in decoding, thus making the regulated individuals map into the space to obtain the most promising optimal solution
在分析懲罰函數法對約束處理效率較低的情況下，提出了一種基於知識調整策略的修正法，對解碼中不滿足約束的映射關系進行修正，使調整后個體映射到最有希望獲得最優解的空間中。The ceil ( ) function returns the value of a number rounded upwards to the nearest integer
函數的作用是：通過進一法取整（即：返回的數字是大於或等已給定數字的最小整數） 。A simplified method finding two - dimensional convolute integers
一種改進的求算二維卷積整數的方法Under this background, this thesis of master ' s degree studies and proposes a texture analysis method for handwriting image based on integer - to - integer wavelet transform by synthesizing methods that were excogitated
在這樣的背景下，本文通過綜合已有筆跡鑒別方法，研究提出了一種基於整數小波系數的筆跡鑒別方法。An unsigned integer representing the hash algorithm
表示哈希演算法的無符號整數。Some research work for integer programming has been done by now, but less for integer nonlinear programming, and little has been done to it by initiatory method
對純整數非線性規劃問題目前已有一些工作，對非線性混合整數規劃問題的工作較少，用啟發式演算法解決混合整數非線性規劃問題的工作也不多見。If we consider the integers with ordinary multiplication we have closure, associativity, and identity element.
如果我們考慮整數集且用通常的乘法，我們有封閉性，可結合性，和一個單位元。This method eliminates the clustering problem in linear rehashing by picking the integer pii in a pseudorandom fashion.
這種方法是按偽隨機方式去挑選整數pii，它能消除線性再散列中所產生的堆聚問題。Integer subtraction wraps, rather than saturates
整數減法回繞，而不是盡量充滿。Ant colony optimization algorithm for nonlinear integer programming
非線性整數規劃的蟻群演算法If an integer is four bytes in length with a big - endian encoding, then the message uses that same representation
如果整數採用big - endian法編碼、用四個位元組表示，那麼消息中也使用同樣的表示。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整數性能的程序之一。Fpga and dvb standard are introduced firstly, dvb - c standard and composition of its system are analyzed completely, development of modulator structure and dvb - c digital modulator composition are presented, more over, analysis of respective modular are given. then, principle of dvb - c digital modulator system are presented, they are error control technique 、 mqam 、 nyquist rule and root raised cosine filter 、 window design method for fir filter 、 multi - rate signal processing ( integer interpolating, conversion of fractional sampling, equal conversion of net structure, polyphase structure for filter, poly - phase structure for interpolator, multi - stage implementation of samplying conversion ) 、 distrubited algorithm 、 cic filter 、 dds 、 cordic algorithm
接著，專門利用一個章節闡述了dvb - c前端調制系統原理，他們了差錯控制技術、多進制調制（ mqam ） 、 nyquist準則與平方根升餘弦濾波器、有限沖擊響應濾波器的窗函數設計法、多抽樣率信號處理包括（整數倍內插原理、分數倍抽樣率轉換、網路結構的等效結構、濾波器的多相表示、內插器的多相表示、抽樣率轉換的多級實現） 、分散式演算法、 cic濾波器、直接數字頻率合成（ dds ） 、 cordic演算法。The topics covered in this course include : unconstrained optimization methods, constrained optimization methods, convex analysis, lagrangian relaxation, nondifferentiable optimization, and applications in integer programming
這門課程的主題包括：無限制最適化方法，限制最適化方法，凸分析，拉格朗日鬆弛法，不可微分函數最適化，以及在整數規劃上的應用。The feasibility of decomposition of transition firing sequence, the application of them in the detecting lfs and the reverse course of decomposition - synthesis are discussed. they provide theoretic basis for our algorithm in the field of petri net. supported by the above, two main part is included in the algorithm : at first, x is transacted according to the following method in order to get a set of xb named as basic vector of x which is the firing count vector of a directed path without circle if md is reached from m0 in the rg ( m0 )
在變遷序列分解的指導思想下，我們的演算法主要通過以下兩步工作完成： （ 1 ）首先對給出的已知條件中滿足狀態方程的n維非負整數向量進行處理，得到一組x的基礎向量x _ b ，使得在petri網的可達標識圖中，若存在一條由m _ o到m _ d的有向無環路，則x _ b為這樣的路上變遷引發序列的發生數向量。Based on statistic property of all sub - bands coefficients, this paper gives a lossless image coding scheme including dpgm, huffman coding and run length coding. this scheme reduces the calculating complexity and works highly efficiently
針對圖像整數小波分解后的各子帶系數的統計特性，提出結合dpcm ， huffman及遊程編碼的無損圖像編碼方法，該方法運算簡潔，速度快，易於硬體實現。This optimizing method had been used successfully in full - scale aircraft testing. 6 ) in the global equilibrating, a modified lagrange multiplier method had bring forward. this method can solve inequality constrained optimizer problems
在整體平衡中，提出了改進的拉格朗日乘數法，成功地解決了含不等式約束條件的優化問題，該方法具有計算簡單，收斂速度快等特點。In this paper, a method assessing harmonic impedance by synchronously layered distortion waves is proposed, which is based on the " fluctuations method " - a simple and effective means. however the method is based on the fourier transform, which can just precisely analyze the signals whose cycle is integer times as broad as that of fundamental wave. with sampling windows widening, the variations of distorted signals in a fundamental period are weakened
本文是以一種被廣泛採用的非干預式諧波阻抗估計方法? ? 「波動量」法，的基礎上，針對現有方法以直接的fourier變換為分析工具，只能對基波周期的整數倍窗口采樣信號進行分析，畸變信號在一個基波周期內的變化隨采樣窗口增大而被弱化，並且，諧波次數越高，解析度就越低，大大限制了諧波阻抗估計的準確性的提高。In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local
本文首先對聚類分析的遺傳演算法進行了研究，討論了聚類問題的編碼方式和適應度函數的構造方案與計算方法，分析了不同遺傳操作對聚類演算法的性能和聚類效果的影響意義。然後對k - means演算法中初值的選取方法進行了分析和研究，提出了一種基於遺傳演算法的k - means聚類改進（混合聚類演算法） ，在基於均勻采樣的小樣本集上用k值學習遺傳演算法確定聚類數k ，用遺傳聚類演算法的聚類結果作為k - means聚類的初始聚類中心，最後在已知初始聚類數和初始聚類中心的情況下用k - means演算法對完整數據集進行聚類。由於遺傳演算法是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用的能力，所以新的改進演算法具有較強的穩健性，可避免陷入局部最優，大大提高聚類效果。This article described the deformation features of taojiaba landslide and analyzed the inner factors, geologic setting, topography, morphology, stratum, lithology and texture, and the external influence factors, precipitation, flood, human activity, neotectonic activity and earthquake, and the transform features of landslide in the near future, and evaluate stability of landslide through the section coefficient method calculation on basis for landslide mechanism analysis and control work
摘要陶家壩滑坡基本特徵顯示，滑坡變形的主要影響因素有：地質環境因素（地形地貌、地層巖性、物質結構） 、外界影響因素（降水因素、洪水因素、人為因素、新構造及地震） ，以及滑坡近期變形特徵，通過剖面遞推系數法計算，對滑坡的穩定性進行了評價，為滑坡機制分析和優化整治措施提供依據。分享友人