It may analyze the window structure, the advancement and the window news, has the very greatly auxiliary function to the development work. When we need to study some object, so long as assigns out its search window, drives the detector the indicator to assign the window/to control on to release then. Under, the author on and everybody same place, makes with VC to belong to own Spy++.
標簽： the window advancement structure
上傳時間： 2013-12-31
上傳用戶：ghostparker
Dijkstra算法求最短路徑(C#版) using System using System.Collections using System.Text namespace Greedy { class Marx { private int[] distance private int row private ArrayList ways = new ArrayList() public Marx(int n,params int[] d) { this.row = n distance = new int[row * row] for (int i = 0 i < row * row i++) { this.distance[i] = d[i]
標簽： System using Collections namespace
上傳時間： 2013-12-29
上傳用戶：liglechongchong
2.0.12 (May 13th, 2004) - Flag driver threads with PF_FREEZE to support software suspend. 2.0.11 (May 7th, 2004) - Avoid split-completion bugs in certain PCI-X chipsets by breaking up large completion entry DMAs on ADB boundaries. 2.0.10 (April 9th, 2004) - Return "command timeout" status instead of "selection timeout status" to the SCSI mid-layer in response to selection timeouts. While the latter may seem more correct, the mid-layer will not offline devices suffering from persistent selection timeouts. This leads to extremely long recovery times for devices that go missing. Returning command timeout status causes the mid-layer to enter recovery and eventually offline persistently missing devices.
標簽： PF_FREEZE software support suspend
上傳時間： 2016-01-05
上傳用戶：亞亞娟娟123
The TMS320C64x™ DSPs (including the TMS320DM642 device) are the highest-performance fixed-point DSP generation in the TMS320C6000™ DSP platform. The TMS320DM642 (DM642) device is based on the second-generation high-performance, advanced VelociTI™ very-long-instruction-word (VLIW) architecture (VelociTI.2™ ) developed by Texas Instruments (TI), making these DSPs an excellent choice for digital media applications. The C64x™ is a code-compatible member of the C6000™ DSP platform.
標簽： highest-performance fixed-point TMS 320
上傳時間： 2013-12-21
上傳用戶：watch100
DELPHIBOX The ImageHTML converts images to ASCII characters in HTML format. The output image is in three formats: true color, grayscale, and mono color. The ImageHTML is provided "AS IS " without any warranty of any kind, either express or implied. The entire risk as to the quality and performance of the software is with you. The author is not liable for any damages resulting from the use and misuse of the software. The ImageHTML is freeware. You may copy it as long as you copy all of files.
標簽： characters DELPHIBOX The ImageHTML
上傳時間： 2013-12-27
上傳用戶：zhichenglu
As all of you know, MATLAB is a powerful engineering language. Because of some limitation, some tasks take very long time to proceed. Also MATLAB is an interpreter not a compiler. For this reason, executing a MATLAB program (m file) is time consuming. For solving this problem, Mathworks provides us C Math Library or in common language, MATLAB API. A developer can employ these APIs to solve engineering problems very fast and easy. This article is about how can use these APIs.
標簽： some engineering limitation language
上傳時間： 2013-12-06
上傳用戶：huql11633
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
查找字符串 TABLE DB "ABCDEFGHIKLMNOPQRSTUVWYZ" STR1 DB "Please enter a string:",0DH,0AH,"$" STR2 DB "Wrong! The string is too long!"$"
標簽： ABCDEFGHIKLMNOPQRSTUVWYZ DB Please string
上傳時間： 2014-11-30
上傳用戶：hfmm633
壓縮解壓算法LZ77算法有許多派生算法(這里面包括 LZSS算法)。它們的算法原理上基本都相同，無論是哪種派生算法，LZ77算法總會包含一個動態窗口（Sliding Window）和一個預讀緩沖器（Read Ahead Buffer）。動態窗口是個歷史緩沖器，它被用來存放輸入流的前n個字節的有關信息。一個動態窗口的數據范圍可以從 0K 到 64K，而LZSS算法使用了一個4K的動態窗口。預讀緩沖器是與動態窗口相對應的，它被用來存放輸入流的前n個字節，預讀緩沖器的大小通常在0 – 258 之間。這個算法就是基于這些建立的。用下n個字節填充預讀緩存器（這里的n是預讀緩存器的大?。?。在動態窗口中尋找與預讀緩沖器中的最匹配的數據，如果匹配的數據長度大于最小匹配長度 （通常取決于編碼器，以及動態窗口的大小，比如一個4K的動態窗口，它的最小匹配長度就是2），那么就輸出一對〈長度（length），距離（distance）〉數組。長度(length)是匹配的數據長度，而距離(distance)說明了在輸入流中向后多少字節這個匹配數據可以被找到。
上傳時間： 2014-01-22
上傳用戶：tzl1975
Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assuming BPSK. Brute force Monte Carlo approach is unsatisfactory (takes too long) to find the BER curve. The computation uses a quasi-analytic (QA) technique that relies on the estimation (approximate one) of the information-bits Weight Enumerating Function (WEF) using A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.
標簽： convolutional Computes encoding decision
上傳時間： 2013-12-24
上傳用戶：咔樂塢
