資源簡介
時間序列預測法是一種定量分析方法,它是在時間序列變量分析的基礎上,運用一定的數學方法建立預測模型,使時間趨勢向外延伸,從而預測未來市場的發展變化趨勢,確定變量預測值。

代碼片段和文件信息
package?com.TimeDemo1;
public?class?base?{
protected?static?float?b=0;
protected?static?float?a=0;
static?float?[]arrayT=new?float?[16];
static?float?[]arrayP=new?float[16];
static?float[][]arrayPD=new?float[3][4];
static?float[][]arraySI=new?float[3][4];
static?float?myarray[]=new?float[4];
static?float?arrayX[][]={{32182139}{36212444}{39252848}};
//static?float?sumtx=0;
public?static?void??productArray(){
for(int?i=0;i<16;i++){
arrayT[i]=i+1;
}
}
public?static?float?sumT()
{
float?sumt=0;
productArray();
for(int?i=0;i<12;i++)
{
sumt+=arrayT[i];
}
//System.out.println(sumt);
return?sumt;
}
public?static?float?squareT(){
float?sumSquare=0;
productArray();
for?(int?i=0;i<12;i++){
sumSquare+=arrayT[i]*arrayT[i];
}
//System.out.println(sumSquare);
return?sumSquare;
}
public?static?float?sumX(){
float?sumx=0;
for(int?i=0;i<3;i++){
for(int?j=0;j<4;j++){
sumx+=arrayX[i][j];
}
}
//System.out.println(sumx);
return?sumx;
}
public?static?float?sumTX(){
float?sumtx=0;
float?sumtx1=0;
float?sumtx2=0;
float?sumtx3=0;
productArray();
for(int?i=0;i<3;i++){??
for(?int?j=0;j<4;j++){
if(i==0)
????sumtx1+=arrayT[j]*arrayX[i][j];
if(i==1)
sumtx2+=arrayT[4+j]*arrayX[i][j];
if(i==2)
sumtx3+=arrayT[8+j]*arrayX[i][j];
????????????????}
????}
sumtx=sumtx1+sumtx2+sumtx3;
//System.out.println(sumtx);
return?sumtx;
}
public?static?float?b(float?n){
b=(n*sumTX()-sumT()*sumX())/(n*squareT()-sumT()*sumT());
//System.out.println(b);
return?b;
}
public?static?float?a(float?n){
b(n);
float?a=0;
a=(sumX()/n)-(b*sumT()/n);
//System.out.println(b);
//System.out.println(a);
return?a;
}
????public?static?float?prodictModel(float?n){//x=a+bt
???? float?modelx=0;
???? for?(int?i=0;i<16;i++){
???? modelx=a(n)+b(n)*arrayT[i];
???? arrayP[i]=modelx;
???? //System.out.print(arrayP[i]);
???? }
???? return?modelx;
????}
????public?static?void?transforArray(){
???? //prodictModel(n);
???? for(int?i=0;i<3;i++){
???? for(int?j=0;j<4;j++){
???? if(i==0)
???? arrayPD[i][j]=arrayP[j];
???? else?if(i==1)
???? arrayPD[i][j]=arrayP[4+j];
???? else?if(i==2)
???? arrayPD[i][j]=arrayP[8+j];
???? }
???? }
//???? for(int?a=0;a<3;a++){
//???? for(int?b=0;b<4;b++){
//???? System.out.println(arrayPD[a][b]);
//???? }
//???? }
????}
????public?static?void?rateModel(){
???? transforArray();
???? for(int?i=0;i<3;i++){
???? for(int?j=0;j<4;j++){
???? arraySI[i][j]=arrayX[i][j]/arrayPD[i][j];
???? }
???? }
//???? for(int?a=0;a<3;a++){
// ????for(int?b=0;b<4;b++){
// ???? if(b==0)
// ?????System.out.println(arraySI[a][b]);
// ???? else?if(b==1)
// ???? ?System.out.println(arraySI[a][b]);
// ???? else?if(b==2)
// ???? ?System.out.println(arraySI[a][b]);
// ???? else?if(b==3)
// ???? ?Sys
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????3256??2009-03-28?13:06??TimeDemo1\ba
?????文件???????3643??2009-03-28?13:06??TimeDemo1\ba
?????文件???????1770??2009-03-28?13:44??TimeDemo1\Main.class
?????文件???????1662??2009-03-28?13:44??TimeDemo1\Main.java
?????目錄??????????0??2009-04-06?15:13??TimeDemo1
-----------?---------??----------?-----??----
????????????????10331????????????????????5
- 上一篇:KTV智能點歌系統,Java版本
- 下一篇:JAVA編寫的打磚塊程序源代碼
評論
共有 條評論