/*目的：使一個複數可顯數出來，可做+-/*，還要可以做>>跟<<的功能 題目：定義一個複數的class叫Complex，a(實部)與b(虛部)為double的型態，i表示根號-1， 1.必須包含一個建構子有兩個參數(double型態)，能被用來設定物件中的變數為任意值 2.包含一個建構子只有一個參數(double型態)，呼叫參數的實部且定義為"實部+0i" 3.包含一個預建構子可把物件初始化為0+0i 4.overload以下的operator以致於可以正確的執行:+ - * / << >> */
标签：
上传时间： 2013-12-27
上传用户：lindor
要求:编写一个应用程序，对程序中给定的四个double型数据求其最大值和最小值。 文档包括了实验要求和详细的源代码.
上传时间： 2013-12-23
上传用户：Divine
多项式曲线拟合 任意介数 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
上传用户：宋桃子
kmeans算法实现 a simple k-means clustering routine. returns the cluster labels of the data points in an array.
标签： clustering the k-means cluster
上传时间： 2013-12-28
上传用户：一诺88
I made a lot of changed on this object,such as * // 1.Encapsulates all code in one userobjet,since PB does not * // support "Address of Function" , so we can not set new * // WndProc, just makes the object more easy to use. * // 2.Uses structure array instead of Datastore * // 3.Calc width of menuitem at runtime(MEASUREITEM) * // 4.Draw disabled status
标签： Encapsulates userobjet changed object
上传时间： 2014-01-14
上传用户：lx9076
C/C++ implementation of the Levenberg-Marquardt non-linear least squares algorithm. levmar includes double and single precision LM versions, both with analytic and finite difference approximated jacobians
标签： Levenberg-Marquardt implementation non-linear algorithm
上传时间： 2013-12-28
上传用户：gxf2016
linux下用C语言写的聊天程序！/*BUG and NOTE: Not join protect to Shared Memory Segments,example Semaphore Arrays. Not check the parameters validity. When transmit may be error. If the client program no right exit,others cannot know,the service program shouldbe check the client program whether exist timing. The program when exit(), it do not delete the Shared Memory Segments,you maybe use atexit() but the program have some processes. When one process is exit(),others is continue. The service program s action is few. And so on. */
标签： Semaphore Segments example protect
上传时间： 2014-01-25
上传用户：xhz1993
AS2Debug是为了弥补flash自带的trace的不足而制作的，增加了一下几个主要功能 1.对object和Array做了解析，能输出包含的具体数据和类型 2.对movieclip做了处理，使用digMc方法，可以方便的输出包含的所有子影片的详细信息 3.增加了信息分类和染色(分为trace,info,error,waring四种)
上传时间： 2014-12-03
上传用户：cc1015285075
动态规划的方程大家都知道，就是 f[i,j]=min{f[i-1,j-1],f[i-1,j],f[i,j-1],f[i,j+1]}+a[i,j] 但是很多人会怀疑这道题的后效性而放弃动规做法。 本来我还想做Dijkstra，后来变了没二十行pascal就告诉我数组越界了……（dist:array[1..1000*1001 div 2]...） 无奈之余看了xj_kidb1的题解，刚开始还觉得有问题，后来豁然开朗…… 反复动规。上山容易下山难，我们可以从上往下走，最后输出f[n][1]。 xj_kidb1的一个技巧很重要，每次令f[i][0]=f[i][i],f[i][i+1]=f[i][1]（xj_kidb1的题解还写错了）
上传时间： 2014-07-16
上传用户：libinxny
This programme is to control DC motor in a certain speed using PWM. The target speed is "r", it is the speed in 1s. The sample rate is 0.1s, so the actual speed target is "rc"=r/10. The "r" and "rc" are integer, and the range of "r" is from 50 to 100. Keep rc=r/10!!! The array "speed1" and "speed2" are the control result, in 0.1s and 1s. The length of "speed1" is 2400, and "speed2" is 240. The "pw" and "nw" are the parameters of PWM. The test will last 4 min.
标签： speed programme is control
上传时间： 2014-11-22
上传用户：jyycc
