TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
標簽： Traveling algorithm Salesman complete
上傳時間： 2016-06-26
上傳用戶：sevenbestfei
This program is a new way to estimate the coherence function. It s based on the MVDR and is much more reliable than the classical Welch s method implemented in MATLAB. There are 2 programs: the main program called coherence_MVDR.m and and an example, called illustrate.m, that calls the main function to show how it works. There also included 2 papers that we published on this algorithm.
標簽： coherence the estimate function
上傳時間： 2016-07-03
上傳用戶：athjac
用Fourier變換求取信號的功率譜---周期圖法 用Fourier變換求取信號的功率譜---分段周期圖法 用Fourier變換求取信號的功率譜---welch方法 功率譜估計----多窗口法（multitaper method ,MTM法） 功率譜估計----最大熵法（maxmum entmpy method,MEM法） 功率譜估計----多信號分類法（multiple signal classification,music法）Fourier transform to strike a signal to the power spectrum - the cycle of plans Fourier transform to strike a signal to the power spectrum - Sub-cycle method Fourier transform to strike a signal to the power spectrum --- welch method Power spectrum estimated more than window ---- Law (multitaper method, MTM) ---- Power spectrum estimate of maximum entropy (maxmum entmpy method, MEM) ---- More than the estimated power spectrum signal classification (multiple signal classification, music)
上傳時間： 2016-07-16
上傳用戶：wqxstar
The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra- group similarity while minimizing the inter-group similarity． The first and foremost question needed to be considered in clustering W b sessions is how to measure the similarity between Web sessions．However．there are many shortcomings in traditiona1 measurements．This paper introduces a new method for measuring similarities between Web pages that takes into account not only the URL but also the viewing time of the visited web page．Yhen we give a new method to measure the similarity of Web sessions using sequence alignment and the similarity of W eb page access in detail Experiments have proved that our method is valid and e幣cient．
標簽： sessions clustering similarity Web
上傳時間： 2014-01-11
上傳用戶：songrui
Visual tracking is one of the key components for robots to accomplish a given task in a dynamic environment, especially when independently moving objects are included. This paper proposes an extension of Adaptive Visual Servoing (hereafter, AVS) for unknown moving object tracking. The method utilizes binocular stereo vision, but does not need the knowledge of camera parameters. Only one assumption is that the system need stationary references in the both images by which the system can predict the motion of unknown moving objects. The basic ideas how we extended the AVS method such that it can track unknown moving objects are given and formalized into a new AVS system. The experimental results with proposed control architecture are shown and a discussion is given.
標簽： components accomplish tracking dynamic
上傳時間： 2013-12-11
上傳用戶：lizhen9880
The package includes 3 Matlab-interfaces to the c-code: 1. inference.m An interface to the full inference package, includes several methods for approximate inference: Loopy Belief Propagation, Generalized Belief Propagation, Mean-Field approximation, and 4 monte-carlo sampling methods (Metropolis, Gibbs, Wolff, Swendsen-Wang). Use "help inference" from Matlab to see all options for usage. 2. gbp_preprocess.m and gbp.m These 2 interfaces split Generalized Belief Propagation into the pre-process stage (gbp_preprocess.m) and the inference stage (gbp.m), so the user may use only one of them, or changing some parameters in between. Use "help gbp_preprocess" and "help gbp" from Matlab. 3. simulatedAnnealing.m An interface to the simulated-annealing c-code. This code uses Metropolis sampling method, the same one used for inference. Use "help simulatedAnnealing" from Matlab.
標簽： Matlab-interfaces inference interface the
上傳時間： 2016-08-27
上傳用戶：gxrui1991
包括使用修正Gram-Schmit算法實現QR分解，自編LU分解、利用冪法和反冪法計算矩陣最大和最小特征值的程序。例外附有使用這些算法的例子供參考。 QR decomposition algorithm based on modified Gram-Schmit LU decomposition algorithm algorithm used to find maximum and minimum eigenvalue based on power and inverse power method and some examples are also included.
標簽： Gram-Schmit 正 分解 算法
上傳時間： 2016-09-07
上傳用戶：cooran
he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
標簽： equivalent likelihood algorithm Sejnowski
上傳時間： 2016-09-17
上傳用戶：Altman
采用3D Bresenham算法在兩點間劃一直線 ％ This program is ported to MATLAB from: ％ B.Pendleton. line3d - 3D Bresenham s (a 3D line drawing algorithm) ％ ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 ％ ％ Which is referenced by: ％ Fischer, J., A. del Rio (2004). A Fast method for Applying Rigid ％ Transformations to Volume Data, WSCG2004 Conference. ％ http://wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf
標簽： Bresenham Pendleton program MATLAB
上傳時間： 2013-12-10
上傳用戶：sz_hjbf
THE DESIGN PATTERNS JAVA COMPANION 1. Creational Patterns 17 The Factory Pattern 18 How a Factory Works 18 Sample Code 18 The Two Derived Classes 19 Building the Factory 20 Factory Patterns in Math Computation 22 When to Use a Factory Pattern 24 Thought Questions 25 The Abstract Factory Pattern 26 A GardenMaker Factory 26 How the User Interface Works 28 Consequences of Abstract Factory 30 Thought Questions 30 The Singleton Pattern 31 Throwing the Exception 32 Creating an Instance of the Class 32 Static Classes as Singleton Patterns 33 Creating Singleton Using a Static method 34
標簽： Creational COMPANION PATTERNS Patterns
上傳時間： 2013-12-20
上傳用戶：xwd2010
