sallap
2008-11-07, 14:07
result=0.0;
sum=0.0;
maxvalue=0.0;
int i;
A=[ 0 0 0 0 0 0 0 0 0 0 0.088 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.897 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2.696 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.158 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.123 0.088 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.694 0.738 0 0 0 35.361 0 0 0 0 0 0 0 0 0.668 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.299 0 1.783 1.326 0.957 0.395 0.553 0 0 0 0 0 0 0 0 0 0 0 0.193 0 4.374 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3.364 2.152 0 0 0 0 0 0 0 0 0 0 0 0 0];
for i=1:1:size(A)
if A(i)==0
result= result+sum*maxvalue/6;
maxvalue=0.0;
sum=0.0;
else
sum=sum + 0.29*(1-0.72*exp(-0.082*A(i)/3))* A(i);
if A(i)>maxvalue
maxvalue=A(i);
end;
end;
end
sum=0.0;
maxvalue=0.0;
int i;
A=[ 0 0 0 0 0 0 0 0 0 0 0.088 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.897 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2.696 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.158 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.123 0.088 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.694 0.738 0 0 0 35.361 0 0 0 0 0 0 0 0 0.668 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.299 0 1.783 1.326 0.957 0.395 0.553 0 0 0 0 0 0 0 0 0 0 0 0.193 0 4.374 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3.364 2.152 0 0 0 0 0 0 0 0 0 0 0 0 0];
for i=1:1:size(A)
if A(i)==0
result= result+sum*maxvalue/6;
maxvalue=0.0;
sum=0.0;
else
sum=sum + 0.29*(1-0.72*exp(-0.082*A(i)/3))* A(i);
if A(i)>maxvalue
maxvalue=A(i);
end;
end;
end