Spring 2015 Report #020 – 03/19/15 JianjianWu

I. Plan for next week(***, **, *: order of priority)

• 60%:Complete sixty percent code about Alpha algorithm

• 40%:Read two paper about process mining

II. Tasks achieved this week(***, **, *: order of priority)

• 70%:Write code about Alpha algorithm

• 30%: Read one paper about process mining

III.Feedback of Prof. Qiu Prof. Li and Dr. Yan last week

• Write blog

• Weekly report could be more detail

IV. Reports

One part of code about Alpha algorithm :

#include <stdio.h>

#include<string>

//#include "file.h"

int main()

{

char t[30],line[256];

FILE *fp;

fp=fopen("test.txt","rw+");

int i,j,l,a[30][30],lines=0,b[50];

while(!feof(fp))

{fgets(line,256,fp);

lines++;

}

rewind(fp);

// printf("%d\n",lines);

for(i=0;i<30;i++)

for(j=0;j<30;j++)

a[i][j]=0;

for (i=0;i<30;i++)

for (j=0;j<30;j++)

    a[i][j]=0;

for (i=0;i<lines;i++)

{

  fscanf(fp,"%s",t);

      l=strlen(t);

for (j=0;j<l;j++)

{

 a[t[j]-65][t[j+1]-65]+=1;

}

}

for (i=0;i<l;i++)

{

for (j=0;j<l;j++)

{

      if(a[i][j]==a[j][i])

      {

      a[i][j]=0;

      a[j][i]=0;

     }

}

}

for (i=0;i<l;i++)

{

for (j=0;j<l;j++)

{

printf("%d",a[i][j]);

printf("\n");

}

while(1);

return 0;

}

V. Mile-Stone:

• Implement Alpha algorithm

• Complete one paper about process mining