-
-
[分享]Fuzzy + Security (business-to-consumer trust in electronic commerce)
-
发表于: 2009-5-29 05:12
-
|
|
|---|---|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
原來如此，學習到此一用詞。
 謝謝大家解說。 To wangfir 大大~ 既然很熟練，那可以開始進入主題，這篇可以繼續做出很棒的東西。 請來研~ 謝謝~  Fig 1: Executed program. 附上源碼，希望有心人可以改的更好。 也希望熟 Fuzzy 的朋友熱烈參與討論。
/*funnzy control program
using by C language on May 09 2006.*/
#include <dos.h>
#include <math.h>
#include <stdio.h>
#include <conio.h>
#include <string.h>
#define max(i,j) (i>j)?i:j
#define min(i,j) (i<j)?i:j
//float Security_value, Familiarity_value, Design_value;
long set , n, condition, output, select;
double r_value, grade_reg[3],grade[25],a1,b1,I;
double error[4];
double Trust_mambership[5][3]={{-0.15,0.05,0.25}, /* VeryLow fuzzy set */
{0.05, 0.25, 0.45}, /* Low fuzzy set */
{ 0.25, 0.45, 0.65}, /* Moderate fuzzy set */
{ 0.45, 0.65, 0.85}, /* High fuzzy set */
{ 0.65, 0.85, 1.05}}, /* VeryHigh fuzzy set */
long Rule[25][3]={{1,1,5},{1,2,5},{1,3,5},{1,4,5},{1,5,5},
{2,1,5},{2,2,4},{2,3,4},{2,4,3},{2,5,3},
{3,1,4},{3,2,4},{3,3,3},{3,4,2},{3,5,2},
{4,1,3},{4,2,3},{4,3,2},{4,4,2},{4,5,1},
{5,1,1},{5,2,1},{5,3,1},{5,4,1},{5,5,1}};
long Trust_Rule[27][4] = {{3,3,3,5},{3,3,2,5},{3,3,1,4},
{3,1,3,4},{3,1,2,3},{3,1,1,3},
{3,2,3,5},{3,2,2,4},{3,2,1,3},
{1,3,3,2},{1,3,2,2},{1,3,1,1},
{1,1,3,1},{1,1,2,1},{1,1,1,1},
{1,2,3,2},{1,2,2,1},{1,2,1,1},
{2,3,3,3},{2,3,2,3},{2,3,1,2},
{2,1,3,2},{2,1,2,2},{2,1,1,2},
{2,2,3,3},{2,2,2,2},{2,2,1,2}
};
int B2C_Rule[15][4] = {{4,1,1},{4,3,3},{4,2,2},
{2,1,1},{2,3,2},{2,2,1},
{3,1,1},{3,3,2},{3,2,2},
{5,1,2},{5,3,3},{5,2,3},
{1,1,1},{1,3,1},{1,2,1}};
/* ---------------------------------------*/
/* compute viriable and fuzzy set degree */
/* ---------------------------------------*/
/*void compute_grade()
{
if((r < membership[set][0]) || (r > membership[set][2]))
{
grade_reg[condition]=0;
}
else
{
if((r>membership[set][1]))
{
grade_reg[condition]=(membership[set][2]-r)/(membership[set][2]-membership[set][1]);
}
else
{
grade_reg[condition]=(r-membership[set][0])/(membership[set][1]-membership[set][0]);
}
}
return;
}
void compute_grade1()
{
if((r<membership1[set][0])||(r>membership1[set][2]))
{
grade_reg[condition]=0;
}
else
{
if((r > membership1[set][1]))
{
grade_reg[condition]=(membership1[set][2]-r)/(membership1[set][2]-membership1[set][1]);
}
else
{
grade_reg[condition]=(r-membership1[set][0])/(membership1[set][1]-membership1[set][0]);
}
}
return;
}*/
void compute_trustgrade()
{
if((r_value < Trust_mambership[set][0]) || (r_value > Trust_mambership[set][2]))
{
grade_reg[condition]=0;
//printf("%d, ",set);
}
else
{
//printf("%d, ",set);
/*if(r_value >= 0.65)
{
grade_reg[condition] = 1;
}*/
if((r_value > Trust_mambership[set][1]))
{
grade_reg[condition]=(Trust_mambership[set][2]-r_value)/(Trust_mambership[set][2]-Trust_mambership[set][1]);
}
else
{
grade_reg[condition]=(r_value-Trust_mambership[set][0])/(Trust_mambership[set][1]-Trust_mambership[set][0]);
}
}
return;
}
void compute_B2Cgrade()
{
if((r_value < Trust_mambership[set][0]) || (r_value > Trust_mambership[set][2]))
{
grade_reg[condition]=0;
//printf("%d, ",set);
}
else
{
// printf("%d, ",set);
if((r_value >= Trust_mambership[set][1]))
{
grade_reg[condition]=(Trust_mambership[set][2]-r_value)/(Trust_mambership[set][2]-Trust_mambership[set][1]);
}
else
{
grade_reg[condition]=(r_value-Trust_mambership[set][0])/(Trust_mambership[set][1]-Trust_mambership[set][0]);
}
}
return;
}
/*void fuzzy_controller()
{
a1=0;b1=0,I=0;
for (n=0; n<=24 ; n++)
{
condition=0;
r=error[0];
set=Rule[n][0]-1;
compute_grade();
condition=1;
r=error[1];
set=Rule[n][1]-1;
compute_grade1();
grade[n]=min(grade_reg[0],grade_reg[1]);
a1=a1+(grade[n]*membership2[Rule[n][2]-1][1]);
b1=b1+grade[n];
}
I=a1/b1;
//gotoxy(20,18);
printf("fuzzy controller output=%7.4f",I);
return;
}*/
void Trust_fuzzy_controller()
{
a1=0;b1=0,I=0;
for (n=0; n<27 ; n++)
{
condition=0;
r_value=error[0];
set=Trust_Rule[n][0];
compute_trustgrade();
condition=1;
r_value=error[1];
set=Trust_Rule[n][1];
compute_trustgrade();
condition=2;
r_value=error[2];
set=Trust_Rule[n][2];
compute_trustgrade();
grade[n]=min(grade_reg[0],grade_reg[1]);
grade[n]=min(grade[n],grade_reg[2]);
a1=a1+(grade[n]*Trust_mambership[Trust_Rule[n][3]-1][1]);
b1=b1+grade[n];
//if(grade[n] > 0)
//printf("Rule %d Trust = %f\n",n+1,Trust_mambership[Trust_Rule[n][3]-1][1]);
}
I=a1/b1;
//gotoxy(20,18);
printf("\nTrust fuzzy controller output=%7.4lf\n",I);
return;
}
void B2C_fuzzy_controller()
{
a1=0;b1=0;
for (n=0; n<15 ; n++)
{
condition=0;
r_value=I;
set=B2C_Rule[n][0]-1;
compute_B2Cgrade();
condition=1;
r_value=error[3];
set=B2C_Rule[n][1];
compute_B2Cgrade();
grade[n]=min(grade_reg[0],grade_reg[1]);
a1=a1+(grade[n]*Trust_mambership[B2C_Rule[n][2]][1]);
b1=b1+grade[n];
//if(grade[n] > 0)
//printf("Rule %d B2C = %f\n",n+1,Trust_mambership[B2C_Rule[n][2]][1]);
}
I=a1/b1;
//gotoxy(20,18);
printf("\nB2C fuzzy controller output=%7.4lf\n",I);
return;
}
normalization()
{
printf("\nnormalization output = %7.4lf\n",(I-0.25)*1/0.4);
}
main()
{
while(1){
printf("Security linguistic value(0.25~0.65) : ");
scanf("%lf",&error[0]);
printf("Familiatrity linguistic value(0.25~0.65) : ");
scanf("%lf",&error[1]);
printf("Design linguistic value(0.25~0.65) : ");
scanf("%lf",&error[2]);
printf("Competitiveness linguistic value(0.25~0.65) : ");
scanf("%lf",&error[3]);
Trust_fuzzy_controller();
B2C_fuzzy_controller();
normalization();
printf("press \"0\" to exit or press any key to continue\n");
select=getch();
if(select == '0')
break;
}
return 0;
}
|
|
|
|
|
|
|
