hanks for downloading this code. This VB Project shows you how to make forms with "rounded rectangle" shape. It also shows you how you can reduce the size of your programs with a GUI by using blocks of images and absolutely positioning and stretching them to create a dialog box, rather than making the whole dialog box in a graphics program and setting it as the Picture property of the Form. Another advantage of using image blocks is that you can resize this form to virtually any size and the effect will still be the same.
标签： downloading rectangle Project rounded
上传时间： 2013-12-13
上传用户：zhangliming420
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
The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And what is the most likely sequence of rainy/sunny days that would explain these observations? The first question is answered by the forward algorithm the second question is answered by the Viterbi algorithm. These two algorithms are structurally so similar (in fact, they are both instances of the same abstract algorithm) that they can be implemented in a single function:
标签： discover viterbi algorm friend
上传时间： 2016-02-16
上传用户：xc216
μC/OS-II Goals Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application code should require only minor changes (if any). Also, because μC/OS-II is based on the same core as μC/OS, it is just as reliable. I added conditional compilation to allow you to further reduce the amount of RAM (i.e. data space) needed by μC/OS-II. This is especially useful when you have resource limited products. I also added the feature described in the previous section and cleaned up the code. Where the book is concerned, I wanted to clarify some of the concepts described in the first edition and provide additional explanations about how μC/OS-II works. I had numerous requests about doing a chapter on how to port μC/OS and thus, such a chapter has been included in this book for μC/OS-II.
标签： OS-II compatible important Probably
上传时间： 2013-12-02
上传用户：jkhjkh1982
Uniform random number generators by Agner Fog, 2001 - 2007 randomc.zip contains a C++ class library of uniform random number generators of good quality. The random number generators found in standard libraries are often of a poor quality, insufficient for large Monte Carlo calculations. This C++ implementation provides random number generators of a much better quality: Better randomness, higher resolution, and longer cycle lengths. The same random number generators are available as libraries coded in assembly language for higher speed. These libraries can be linked into projects coded in other programming languages under Windows, Linux, BSD, etc. The library files are available in the archive asmlib.zip. Non-uniform random number generators are provided in stocc.zip.
标签： generators contains Uniform randomc
上传时间： 2014-12-01
上传用户：royzhangsz
map identification laquo yuan Problem description : the digital image processing of an image often expressed as a macute M pixel matrix. Each pixel value is 0 or 1. The value of 0 pixel image, said background, and the value of a pixel image, said a map of a million, usually called map million pixels. When a pixel in another pixels above, below, left or right, said that two adjacent pixels of the pixel. An image of the pixels belonging to the same map yuan, instead of adjacent pixels belonging to different map yuan. Figure yuan identification of problems is right for the given image pixel map marking yuan, making the same map billion yuan pixel map of the same markings and different map billion yuan pixel map of their marks are different. Trial queue abstract data type design solut
标签： image identification description processing
上传时间： 2013-12-15
上传用户：15736969615
Both the newest, hottest ight simulator and the simplest yet most powerful accounting programs use the same basic building blocks. In this part, you dis cover the basic features you need to write your killer application.
标签： accounting the simulator simplest
上传时间： 2014-01-09
上传用户：coeus
8051 Web Server project See Makefile for build notes Written for Keil C51 V5.1 compiler, notes: It uses big endian order, which is the same as the network byte order, unlike x86 systems. Use OPTIMIZE(2)or higher so that automatic variables get shared // between functions, to stay within the 256 bytes idata space
标签： notes for Makefile compiler
上传时间： 2013-12-17
上传用户：ikemada
多项式曲线拟合 任意介数 Purpose - Least-squares curve fit of arbitrary order working in C++ Builder 2007 as a template class, using vector<FloatType> parameters. Added a method to handle some EMathError exceptions. If do NOT want to use this just call PolyFit2 directly. usage: Call PolyFit by something like this. CPolyFit<double> PolyFitObj double correlation_coefficiant = PolyFitObj.PolyFit(X, Y, A) where X and Y are vectors of doubles which must have the same size and A is a vector of doubles which must be the same size as the number of coefficients required. returns: The correlation coefficient or -1 on failure. produces: A vector (A) which holds the coefficients.
标签： Least-squares arbitrary Purpose Builder
上传时间： 2013-12-18
上传用户：宋桃子
When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing! This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages: 这是一个基于Douglas-Peucker算法的二维估值算法。
标签： mathematical engineering simulations problems
上传时间： 2013-12-20
上传用户：changeboy
