For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
標(biāo)簽： the representation incomplete methods
上傳時(shí)間： 2015-05-05
上傳用戶(hù)：1159797854
The module LSQ is for unconstrained linear least-squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar-rotation algorithm is used to update the QR- factorization. This makes it suitable for updating regressions as more data become available. The module contains a test for singularities which is simpler and quicker than calculating the singular-value decomposition. An important feature of the algorithm is that it does not square the condition number. The matrix X X is not formed. Hence it is suitable for ill- conditioned problems, such as fitting polynomials. By taking advantage of the MODULE facility, it has been possible to remove many of the arguments to routines. Apart from the new function VARPRD, and a back-substitution routine BKSUB2 which it calls, the routines behave as in AS 274.
標(biāo)簽： least-squares unconstrained Statisti Applied
上傳時(shí)間： 2015-05-14
上傳用戶(hù)：aig85
《精通MATLAB7.0混合編程》系統(tǒng)地介紹MATLAB 7.0的混合編程方法和技巧。全書(shū)共分為13章。第1章和第2章介紹MATLAB的基礎(chǔ)知識(shí)，第3章簡(jiǎn)要介紹MATLAB混合編程，第4章至第9章分別介紹幾種典型的混合編程方法，包括C-MEX、MATLAB引擎、MAT數(shù)據(jù)文件共享、Mideva、matrix和Add-in。第10章、第11章介紹MATLAB與Delphi和Excel的混合編程。第12章介紹MATLAB COM Builder，第13章以圖像處理為例介紹了一個(gè)綜合應(yīng)用實(shí)例。 本書(shū)按混合編程的具體方法進(jìn)行邏輯編排，自始至終用實(shí)例描述，每章著重闡述各種混合編程方法的實(shí)質(zhì)和要點(diǎn)，同時(shí)穿插了作者多年使用MATLAB的經(jīng)驗(yàn)和體會(huì)。本書(shū)既適合初學(xué)者自學(xué)，也適用于高級(jí)MATLAB用戶(hù)，可作為高等數(shù)學(xué)、計(jì)算機(jī)、電子工程、數(shù)值分析、信息工程等課程的教學(xué)參考書(shū)，也可供上述領(lǐng)域的科研工作者參考。 這里是本書(shū)所有源碼壓縮包，內(nèi)容詳盡、實(shí)例豐富，包含MATLAB實(shí)例的源文件、函數(shù)/命令和注解以及程序?qū)嵗?/p>
上傳時(shí)間： 2013-12-19
上傳用戶(hù)：1051290259
實(shí)驗(yàn)描述：分布式數(shù)據(jù)庫(kù)的算法partition的具體實(shí)現(xiàn)。即通過(guò)該算法找到關(guān)系數(shù)據(jù)庫(kù)最優(yōu)分裂點(diǎn)，使得結(jié)果最優(yōu)。 算法思想： 1、 首先根據(jù)所輸入的attribute usage matrix得到AQ（ ） 2、 對(duì)CA矩陣中劃分點(diǎn)預(yù)先設(shè)在n-1處，并將屬性列分成兩個(gè)集合，TA和BA，TA中的元為：{ A1 、A2 …… An-1 },BA中的元素為：{ An} 3、 確定集合TQ、BQ和OQ，其中TQ={ qj| AQ(qi) TA},BQ= TQ={ qj| AQ(qi) BA}, OQ=Q-{TQ BQ}。 4、 計(jì)算出CTQ、CBQ、COQ這些值，其中CTQ= ，CBQ= ，COQ= 5、 通過(guò)劃分點(diǎn)的第次移動(dòng)分別計(jì)算出z=CTQ*CBQ-COQ2 6、 對(duì)取到的z的最大值處標(biāo)記，為分割點(diǎn) 7、 對(duì)CA進(jìn)行調(diào)整，重復(fù)計(jì)算得到最終z的最大值點(diǎn)，對(duì)CA矩陣進(jìn)行劃分 8、 對(duì)上述算法進(jìn)行修改，將得到的最大z值的分割點(diǎn)和次大的分割點(diǎn)都記錄下來(lái)，得到兩個(gè)分割，則將原有的屬性集劃分成三部分。 該算法的目的是找到獨(dú)立存取的屬性集合或者分別的應(yīng)用集。比如說(shuō)，如果可以找到兩個(gè)屬性A1,A2,他們只是被q1讀取，而A3,A4被q2,q3讀取，這樣在分裂的時(shí)候可以確定。算法就是找到這些組。另外為了簡(jiǎn)單化起見(jiàn)，我命令refj(qi)全部等于1.
標(biāo)簽： partition 算法 實(shí)驗(yàn) 分布式數(shù)據(jù)庫(kù)
上傳時(shí)間： 2015-06-04
上傳用戶(hù)：13160677563
實(shí)驗(yàn)描述：分布式數(shù)據(jù)庫(kù)的算法partition的具體實(shí)現(xiàn)。即通過(guò)該算法找到關(guān)系數(shù)據(jù)庫(kù)最優(yōu)分裂點(diǎn)(2個(gè)），使得結(jié)果最優(yōu)。 1、 首先根據(jù)所輸入的attribute usage matrix得到AQ（ ） 2、 對(duì)CA矩陣中劃分點(diǎn)預(yù)先設(shè)在n-1處，并將屬性列分成3個(gè)集合，TA和BA和MA， 3、 確定集合TQ、BQ,MQ和OQ，其中TQ={ qj| AQ(qi) TA},BQ= TQ={ qj| AQ(qi) BA}, MQ={ qj| AQ(qi) MA},OQ=Q-{TQ BQ}。 4、 計(jì)算出CTQ、CBQ、CMQ、COQ這些值，其中CTQ= ，CBQ= ，CMQ= ，COQ= 5、 通過(guò)劃分點(diǎn)的第次移動(dòng)分別計(jì)算出z=CTQ*CBQ*CMQ-COQ3 6、 對(duì)取到的z的最大值處標(biāo)記，為分割點(diǎn) 7、 對(duì)CA進(jìn)行調(diào)整，重復(fù)計(jì)算得到最終z的最大值點(diǎn)，對(duì)CA矩陣進(jìn)行劃分 對(duì)上述算法進(jìn)行修改，將得到的最大z值的分割點(diǎn)和次大的分割點(diǎn)都記錄下來(lái)，得到兩個(gè)分割，則將原有的屬性集劃分成三部分。
標(biāo)簽： partition 算法 實(shí)驗(yàn) 分布式數(shù)據(jù)庫(kù)
上傳時(shí)間： 2015-06-04
上傳用戶(hù)：515414293
尋找函數(shù)的全局極小值，global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.
上傳時(shí)間： 2013-12-15
上傳用戶(hù)：康郎
Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree structured wavelet transform of the input matrix, up to the given level of decomposition. Wav2 uses another function called wav1, which takes the well known wavelet transform of the given matrix. Daubechies wavelet coefficients are used for wavelet transform operation wahich is saved in wavcoeff.mat.
標(biāo)簽： implements the wav Included
上傳時(shí)間： 2015-06-23
上傳用戶(hù)：愛(ài)死愛(ài)死
使用pso求最小化一函數(shù) matlab程式碼，寫(xiě)的非常簡(jiǎn)潔(不到100行)，且還包括了2維的圖形展示，和大家分享參考!!! 一起學(xué)習(xí)matlab和各種optimize methods 最小化：(x-15)^2+(y-20)^2 The swarm matrix is swarm(index, [location, velocity, best position, best value], [x, y components or the value component]) Author: Wesam ELSHAMY (wesamelshamy@yahoo.com) MSc Student, Electrical Enginering Dept., Faculty of Engineering Cairo University, Egypt
上傳時(shí)間： 2013-12-18
上傳用戶(hù)：zhaiye
平均因子分解法，適用于正定矩陣First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition.
標(biāo)簽： 分解
上傳時(shí)間： 2013-12-24
上傳用戶(hù)：啊颯颯大師的
unix或linux下的DNA分析軟件源碼 其功能如下 1. Edit up to 256 peptide or DNA sequences simultaneously. 2. Translates DNA->protein click next to display next frame. 3. Dot matrix plot of any 2 sequences. 4. Rudimentary amino acid statistics (MW and amino acid percentage) 5. Saves matrix plot as PBM image format. 6. Sequence reversal. 7. Creates alignment file for highlight (below). 8. Tab key toggles editing of next sequence.
標(biāo)簽： simultaneously DNA sequences Transla
上傳時(shí)間： 2013-12-13
上傳用戶(hù)：lwwhust
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
