A new cable fault location method based on wavelet reconstruction is proposed. In this method the difference between the currents of faulty phase and sound phase under the high voltage pulse excitation is used as the measured signal and is decomposed in multi-scale by wavelet transform, then reconstructed in single scale. Comparing with traditional fault location method by travelling wave, the presented method will not be interfered by the reflected wave from the branch joint of cables or from other positions where the impedances are not matched and not be influenced by fault types, otherwise, the reflected waves can be recognized even the faulty position is near to the measuring terminal, at the same time, the influence of the wave speed uncertainty can be reduced. The correctness of the proposed method is proved by simulation results.
標簽： method reconstruction location proposed
上傳時間： 2016-02-04
上傳用戶：maizezhen
Traffic sign shape classification based on Support Vector Machines and the FFT of the signature of blobs.pdf
標簽： classification the signature Machines
上傳時間： 2013-12-14
上傳用戶：rishian
Design of USB Interface Card Based on ISA Bus
標簽： Interface Design Based Card
上傳時間： 2016-02-05
上傳用戶：許小華
幾篇最經典的運動搜索算法的IEEE論文：A1. Enhanced Hexagonal Search for Fast Block Motion Estimation；A2. Hexagon-based search pattern for fast block motion estimation；A3. Predictive Motion Vector Field Adaptive Search Technique (PMVFAST)等
標簽： Hexagon-based Estimation Hexagonal Enhanced
上傳時間： 2013-12-24
上傳用戶：小碼農lz
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
標簽： the decision clusters Cluster
上傳時間： 2013-12-21
上傳用戶：gxmm
主要是KNN（the k-nearest neighbor algorithm ）,LVQ1（learning vector quantization 1）, DSM（decision surface mapping）算法。 and a simple clustering algorithm.
標簽： quantization k-nearest algorithm decision
上傳時間： 2016-02-07
上傳用戶：zhyiroy
bulkloop application source code based on mfc
標簽： application bulkloop source based
上傳時間： 2013-12-25
上傳用戶：yuzsu
One kind of decision-making tree algorithm, can be seen as one kind data mining algorithm ,find the rule from large-scale data middle.
標簽： algorithm kind decision-making mining
上傳時間： 2014-01-13
上傳用戶：ruan2570406
matlabBank-Based Kalman Filtering Technique for] - A Filter-Bank-Based Kalman Filtering Technique for Wavelet Estimation and Decomposition of Random Signals.pdf [DIP_dg.rar] - JPEG圖像壓縮像素之掃描方法之一（zigzag scan）這是用的循環法 [imagethreshold.zip] - 老外編寫的閾值分割代碼,非常的好,強烈推薦下載 [contour.rar] - 利用OpenCV進行輪廓提取，很好用！對于初學openCv的人來說是個很好的入門例程 [lu.rar] - 路徑識別
標簽： Filtering Technique Kalman Filter-Bank-Based
上傳時間： 2013-12-26
上傳用戶：417313137
Content-based Music Retrieval from Acoustic Input
標簽： Content-based Retrieval Acoustic Music
上傳時間： 2013-12-13
上傳用戶：yoleeson
