Web Personalization Report and Power Point Presentation

View Paper on Web Personalization

Use Download Box in my blog to download  the "Power Point Presentation.

Abstract:
                 Web personalization is the process of customizing the content and the structure of a Web site to the specific and individual needs of each user, without requiring from them to ask for it explicitly.This can be achieved by taking advantage of the user’s navigational behaviour, as it can be revealed through the processing of the Web usage logs, as well as the user’s characteristics and interests. Suchinformation can be further analysed in association with the content of a Web site, resulting to improvement of the system performance, users’ retention and/or site modification.The overall process of Web personalization consists of five modules, namely: user profiling, log analysis and Web usage mining, information acquisition, content management and Web sitepublishing. 
                 
                 Web personalization is a domain that has been recently gaining great momentum not only in the research area, where many research teams have addressed this problem from different perspectives, but also in the industrial area, where there exists a variety of tools and applications addressing one or more modules of the personalization process. Enterprises expect that by exploiting the information hidden in their Web server logs they could discover the interactions between their Web site visitors and the products offered through their Web site. Using such information, they can optimise their site in order to increase sales and ensure customer retention. Apart from Web usage mining, user profiling techniques are also employed in order to form a complete customer profile. Lately, there is an effort to incorporate web content in the recommendation process, in order to enhance the effectiveness of personalization. Thus web personalization has made web activities user-centric and has made the users an integrated part of the web environment.  

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes

Branch prediction logic (JAVA CODE)

//Aim:To implement branch prediction logic in java import java.util.*; class branch { public static void main(String args[]) { Scanner scr=new Scanner(System.in); int stage,inst,br; int cycle1,cycle2; System.out.println("Enter num of stages "); stage=scr.nextInt(); System.out.println("Enter num of instructions "); inst=scr.nextInt(); System.out.println("Enter num of branch instructions "); br=scr.nextInt(); cycle1=stage+(inst-1); cycle2=cycle1+(br*(stage-1)); System.out.println("Num of cycles without branching= "+cycle1); System.out.println("Num of cycles with branching= "+cycle2); } } /*OUTPUT C:\Users\Aditya\Desktop\aditya>javac branch.java C:\Users\Aditya\Desktop\aditya>java branch Enter num of stages 5 Enter num of instructions 5 Enter num of branch instructions 1 Num of cycles without branching= 9 Num of cycles with branching= 13 */

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes

RAID 0 and RAID 1 JAVA Implementation

RAID has seven levels.It stands for Redundand Array Of Independent Disk.The code in JAVA gives the implementation of RAID 0 followed by a seperate code for RAID 1
// Aim:To implement RAID 0 in java import java.util.*; import java.io.*; class raid0 { public static void main(String args[]) throws Exception { Scanner scr=new Scanner(System.in); InputStreamReader isr=new InputStreamReader(System.in); BufferedReader br=new BufferedReader(isr); char r[][]=new char[4][4]; System.out.println("RAID 0 Non-redundant"); System.out.println("Enter 16 characters or numbers"); String s=scr.nextLine(); int c=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { r[i][j]=s.charAt(c); c=c+2; } } int choice=0; do { System.out.println("Enter your choice: 1.display 2.update 3.delete 4.exit"); choice=scr.nextInt(); switch(choice) { case 1: System.out.println("Disk0\tDisk1\tDisk2\tDisk3"); for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { System.out.print(r[i][j]+"\t"); } System.out.println(); } break; case 2: int pos=0; String s1; char val; System.out.println("Enter position to be updated(start pos=0) "); pos=scr.nextInt(); System.out.println("Enter value to be inserted "); s1=br.readLine(); val=s1.charAt(0); int count=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count==pos) { r[i][j]=val; } ++count; } } System.out.println("Value at position "+pos+" has been updated"); break; case 3: System.out.println("Enter position to be deleted(start pos=0) "); int pos1=scr.nextInt(); int count1=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count1==pos1) { r[i][j]=' '; } ++count1; } } System.out.println("Value at position "+pos1+" has been deleted."); break; } } while(choice!=4); } } /* OUTPUT C:\Users\Aditya\Desktop\aditya>java raid0 RAID 0 Non-redundant Enter 16 characters or numbers 1 2 3 a b c 4 5 6 d e f 7 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 1 2 3 a b c 4 5 6 d e f 7 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 2 Enter position to be updated(start pos=0) 4 Enter value to be inserted T Value at position 4 has been updated Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 1 2 3 a T c 4 5 6 d e f 7 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 3 Enter position to be deleted(start pos=0) 12 Value at position 12 has been deleted. Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 1 2 3 a T c 4 5 6 d e f 8 9 g Enter your choice: 1.display 2.update 3.delete 4.exit 4 */ // Aim:To implement RAID 1 in java import java.util.*; import java.io.*; class raid1 { public static void main(String args[]) throws Exception { Scanner scr=new Scanner(System.in); InputStreamReader isr=new InputStreamReader(System.in); BufferedReader br=new BufferedReader(isr); char r1[][]=new char[4][4]; char r2[][]=new char[4][4]; System.out.println("RAID 1 Mirrored"); System.out.println("Enter 16 characters or numbers"); String s=scr.nextLine(); int c=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { r1[i][j]=s.charAt(c); r2[i][j]=r1[i][j]; c=c+2; } } int choice=0; do { System.out.println("Enter your choice: 1.display 2.update 3.delete 4.exit"); choice=scr.nextInt(); switch(choice) { case 1: System.out.println("Disk0\tDisk1\tDisk2\tDisk3\t\tMD0\tMD1\tMD2\tMD3"); for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { System.out.print(r1[i][j]+"\t"); } System.out.print("|\t"); for(int j=0;j<4;++j) { System.out.print(r2[i][j]+"\t"); } System.out.println(); } break; case 2: int pos=0; String s1; char val; System.out.println("Enter position to be updated(start pos=0) "); pos=scr.nextInt(); System.out.println("Enter value to be inserted "); s1=br.readLine(); val=s1.charAt(0); int count=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count==pos) { r1[i][j]=val; r2[i][j]=val; } ++count; } } System.out.println("Value at position "+pos+" has been updated"); break; case 3: System.out.println("Enter position to be deleted(start pos=0) "); int pos1=scr.nextInt(); int count1=0; for(int i=0;i<4;++i) { for(int j=0;j<4;++j) { if(count1==pos1) { r1[i][j]=' '; r2[i][j]=' '; } ++count1; } } System.out.println("Value at position "+pos1+" has been deleted."); break; } } while(choice!=4); } } /*OUTPUT C:\Users\Aditya\Desktop\aditya>java raid1 RAID 1 Mirrored Enter 16 characters or numbers 1 2 3 4 5 6 7 8 9 a b c d e f g Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 MD0 MD1 MD2 MD3 1 2 3 4 | 1 2 3 4 5 6 7 8 | 5 6 7 8 9 a b c | 9 a b c d e f g | d e f g Enter your choice: 1.display 2.update 3.delete 4.exit 2 Enter position to be updated(start pos=0) 4 Enter value to be inserted R Value at position 4 has been updated Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 MD0 MD1 MD2 MD3 1 2 3 4 | 1 2 3 4 R 6 7 8 | R 6 7 8 9 a b c | 9 a b c d e f g | d e f g Enter your choice: 1.display 2.update 3.delete 4.exit 3 Enter position to be deleted(start pos=0) 12 Value at position 12 has been deleted. Enter your choice: 1.display 2.update 3.delete 4.exit 1 Disk0 Disk1 Disk2 Disk3 MD0 MD1 MD2 MD3 1 2 3 4 | 1 2 3 4 R 6 7 8 | R 6 7 8 9 a b c | 9 a b c e f g | e f g Enter your choice: 1.display 2.update 3.delete 4.exit 4 */

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes

4 stage floating point addition pipeline (JAVA CODE)

The 4 stages in floating point addition pipeline are:
1.Exponent comparer
2.Mantissa shifter
3.Mantissa adder
4.Normalize result
// Aim:To Implement 4 stage floating point addition pipeline import java.util.*; class fp // class of floating pt. nos. { double man; int exp; } class fp_add { static int compare_exp(fp f1,fp f2) // compares the exponent { if(f1.exp<f2.exp) { diff=f2.exp-f1.exp; // claculates difference in exponent return 1; // represents first number } else if(f2.exp<f1.exp) { diff=f1.exp-f2.exp; return 2; // represents second number } else return 0; // if both exponents are same } static fp shift_man(fp f) // shifts the mantissa by using "diff" value { for(int i=0;i<diff;++i) { f.man/=10; f.exp+=1; } return f; } static fp normalize(fp f) // normalize final result { while(f.man>=10) { f.man/=10; f.exp+=1; // exponent is -ve and hence adding 1 will increase its val ex. -5+1=-4 } return f; } static int diff; // difference in exponent values public static void main(String args[]) { Scanner scr=new Scanner(System.in); /* creating objects for two floating pt. nos. and result */ fp f1=new fp(); fp f2=new fp(); fp r=new fp(); System.out.println("Enter mantissa and exponent of x "); f1.man=scr.nextDouble(); f1.exp=scr.nextInt(); System.out.println("Enter mantissa and exponent of y "); f2.man=scr.nextDouble(); f2.exp=scr.nextInt(); int choice=compare_exp(f1,f2); System.out.print("STAGE 1(exponent comparer): The num with smaller exponent is "); if(choice==1)System.out.println("x \n");else if(choice==2)System.out.println("y \n");else System.out.println("Both are same.\n"); System.out.print("STAGE 2(mantissa shifter): "); if(choice==1) // choice is 1 hence first mantissa has to be shifted { f1=shift_man(f1); System.out.println("shifted mantissa "+f1.man+"\n"); } else if(choice==2) // choice is 2 hence second mantissa has to be shifted { f2=shift_man(f2); System.out.println("shifted mantissa "+f2.man+"\n"); } else // equal exponents System.out.println("no shifting required\n"); System.out.print("STAGE 3(mantissa adder): "); r.man=f1.man+f2.man; System.out.println("added mantissa "+r.man+"\n"); r.exp=f1.exp; // both f1 and f2 NOW have same exponents.Hence assign any one's exponent. r=normalize(r); // call the method to normalize final result. System.out.println("STAGE 4(normalize result):"); System.out.println("The normalized result is "+r.man+" * 10^"+r.exp); int c=-1*r.exp; /* Additional code to represent answer in different form ex 3.52*10^-3 will be 0.00352 (int i=0;i<c;++i) r.man=r.man/10; System.out.println("ie. The result is "+r.man);*/ } } /*OUTPUT C:\Users\Aditya\Desktop\aditya>java fp_add Enter mantissa and exponent of x 8.5 -3 Enter mantissa and exponent of y 2.345 -5 STAGE 1(exponent comparer): The num with smaller exponent is y STAGE 2(mantissa shifter): shifted mantissa 0.023450000000000002 STAGE 3(mantissa adder) added mantissa 8.52345 STAGE 4(normalize result): The normalized result is 8.52345 * 10^-3 */

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes

Data Dependency Hazard (RAW, WAR, WAW) JAVA CODE

The Data dependency hazards are of 4 types.

1.RAR :Read After Read (This is not harmful as only read operations are performed.)

2.RAW :Read After Write(This may create problems and needs to be handled.)

3.WAR :Write After Read(A naming conflict. Not hazardous if sequential execution takes place)

4.WAW : Write After Write(A naming conflict. Not hazardous if sequential execution takes place)

//Aim:To check Data Dependency Hazards in Instructions using JAVA. import java.util.*; class hazard { static void accept() { Scanner scr=new Scanner(System.in); System.out.print("\nFirst Instruction:\nOpcode "); s[0][0]=scr.nextLine(); System.out.print("\nDomain: "); s[0][2]=scr.nextLine(); System.out.print("\nRange: "); s[0][1]=scr.nextLine(); System.out.print("\nSecond Instruction:\nOpcode "); s[1][0]=scr.nextLine(); System.out.print("\nDomain: "); s[1][2]=scr.nextLine(); System.out.print("\nRange: "); s[1][1]=scr.nextLine(); } static int check() { if(s[0][1].equals(s[1][2])) return 1; else if(s[0][2].equals(s[1][1])) return 2; else if(s[0][1].equals(s[1][1])) return 3; else return 0; } static String s[][]=new String[2][3]; public static void main(String args[]) { Scanner scr=new Scanner(System.in); int ch=0; do { int c=0; accept(); /*Display Instructions*/ System.out.println(s[0][0]+" "+s[0][1]+" "+s[0][2]); System.out.println(s[1][0]+" "+s[1][1]+" "+s[1][2]); c=check(); if(c==1) System.out.println("RAW hazard exists"); else if(c==2) System.out.println("WAR hazard exists"); else if(c==3) System.out.println("WAW hazard exists"); else System.out.println("There are No Data Dependency Hazards"); System.out.println("Do you wish to continue?(1/0)"); ch=scr.nextInt(); } while(ch==1); } } /*OUTPUT C:\Users\Aditya\Desktop\aditya>java hazard First Instruction: Opcode LOAD Domain: a Range: r1 Second Instruction: Opcode ADD Domain: r1 Range: r2 LOAD r1 a ADD r2 r1 RAW hazard exists Do you wish to continue?(1/0) 1 First Instruction: Opcode MUL Domain: r2 Range: r1 Second Instruction: Opcode ADD Domain: r3 Range: r2 MUL r1 r2 ADD r2 r3 WAR hazard exists Do you wish to continue?(1/0) 1 First Instruction: Opcode MUL Domain: r2 Range: r1 Second Instruction: Opcode ADD Domain: r4 Range: r1 MUL r1 r2 ADD r1 r4 WAW hazard exists Do you wish to continue?(1/0) 1 First Instruction: Opcode ADD Domain: r1 Range: r2 Second Instruction: Opcode MUL Domain: r3 Range: r4 ADD r2 r1 MUL r4 r3 There are No Data Dependency Hazards Do you wish to continue?(1/0) 0 */

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes

Easy Solution for Sem 6 DWDM pracs(Java Code)

Use Download box to download programs for decision tree and bayesian algo

VIEW OUR SPECIAL PAGE FOR SEM 7 STUDENTS -  sem 6 java codes