/*目的：使一個複數可顯數出來，可做+-/*，還要可以做>>跟<<的功能 題目：定義一個複數的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
