Weiner Filter

The inverse filtering is a restoration technique for deconvolution, i.e., when the image is blurred by a known lowpass filter, it is possible to recover the image by inverse filtering or generalized inverse filtering. However, inverse filtering is very sensitive to additive noise. The approach of reducing one degradation at a time allows us to develop a restoration algorithm for each type of degradation and simply combine them. The Wiener filtering executes an optimal tradeoff between inverse filtering and noise smoothing. It removes the additive noise and inverts the blurring simultaneously.
The Wiener filtering is optimal in terms of the mean square error. In other words, it minimizes the overall mean square error in the process of inverse filtering and noise smoothing. The Wiener filtering is a linear estimation of the original image. The approach is based on a stochastic framework. The orthogonality principle implies that the Wiener filter in Fourier domain can be expressed as follows:
where  are respectively power spectra of the original image and the additive noise, and  is the blurring filter. It is easy to see that the Wiener filter has two separate part, an inverse filtering part and a noise smoothing part. It not only performs the deconvolution by inverse filtering (highpass filtering) but also removes the noise with a compression operation (lowpass filtering).

Weiner Filter note uploaded on my blog ajinkyaspeaks.wordpress.com for easy download!!
Just download it from the "Download box" present on ajinkyaspeaks.wordpress.com.

Read More

Ajinkya Mandhare 5:00 pm  No comment

Robotics & Artificial Intelligence- Prolog Codes

Prolog is a logical and a declarative programming language. The name itself, Prolog, is short for PROgramming in LOGic. Prolog's heritage includes the research on theorem provers and other automated deduction systems developed in the 1960s and 1970s. The inference mechanism of Prolog is based upon Robinson's resolution principle (1965) together with mechanisms for extracting answers proposed by Green (1968). These ideas came together forcefully with the advent of linear resolution procedures. Explicit goal-directed linear resolution procedures, such as those of Kowalski and Kuehner (1971) and Kowalski (1974), gave impetus to the development of a general purpose logic programming system. The "first" Prolog was "Marseille Prolog" based on work by Colmerauer (1970). The first detailed description of the Prolog language was the manual for the Marseille Prolog interpreter (Roussel, 1975). The other major influence on the nature of this first Prolog was that it was designed to facilitate natural language processing.
Prolog is the major example of a fourth generation programming language supporting the declarative programming paradigm. The Japanese Fifth-Generation Computer Project, announced in 1981, adopted Prolog as a development language, and thereby focused considerable attention on the language and its capabilities. The programs in this tutorial are written in "standard" (University of) Edinburgh Prolog, as specified in the classic Prolog textbook by authors Clocksin and Mellish (1981,1992). The other major kind of Prolog is the PrologII family of Prologs which are the descendants of Marseille Prolog. The reference to Giannesini, et.al. (1986) uses a version of PrologII. There are differences between these two varieties of Prolog; part of the difference is syntax, and part is semantics. However, students who learn either kind of Prolog can easily adapt to the other kind.

Prolog Experiment
Click below to download
PROLOG

Read More

Anonymous 8:23 am  No comment

Booth Algorithm for Signed Binary Multiplication & IEEE Floating point representation

Booth's Algorithm:

It is a powerful algorithm for signing up a number of multiplication. It generates a 2n bit product and it treats both +ve & -ve number uniformly.

Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while doing research on crystallography at Birkbeck College in Bloomsbury, London. Booth used desk calculators that were faster at shifting than adding and created the algorithm to increase their speed. Booth's algorithm is of interest in the study of computer architecture

IEEE Floating point representation:

There are several ways to represent real numbers on computers. Fixed point places a radix point somewhere in the middle of the digits, and is equivalent to using integers that represent portions of some unit. For example, one might represent 1/100ths of a unit; if you have four decimal digits, you could represent 10.82, or 00.01. Another approach is to use rationals, and represent every number as the ratio of two integers.

Floating-point representation - the most common solution - basically represents reals in scientific notation. Scientific notation represents numbers as a base number and an exponent. For example, 123.456 could be represented as 1.23456 × 10². In hexadecimal, the number 123.abc might be represented as 1.23abc × 16².

Floating-point solves a number of representation problems. Fixed-point has a fixed window of representation, which limits it from representing very large or very small numbers. Also, fixed-point is prone to a loss of precision when two large numbers are divided.

Floating-point, on the other hand, employs a sort of "sliding window" of precision appropriate to the scale of the number. This allows it to represent numbers from 1,000,000,000,000 to 0.0000000000000001 with ease.

The IEEE Standard for Floating-Point Arithmetic (IEEE 754) is a technical standard for floating-point computation established in 1985 by the Institute of Electrical and Electronics Engineers (IEEE). Many hardware floating point units use the IEEE 754 standard. The current version, IEEE 754-2008 published in August 2008, includes nearly all of the original IEEE 754-1985 standard and the IEEE Standard for Radix-Independent Floating-Point Arithmetic (IEEE 854-1987). The international standard ISO/IEC/IEEE 60559:2011 (with identical content to IEEE 754) has been approved for adoption through JTC1/SC 25 under the ISO/IEEE PSDO Agreement and published.

The standard defines:
1. arithmetic formats: sets of binary and decimal floating-point data, which consist of finite numbers (including signed zeros and subnormal numbers), infinities, and special "not a number" values (NaNs)
2. interchange formats: encodings (bit strings) that may be used to exchange floating-point data in an efficient and compact form
3. rounding rules: properties to be satisfied when rounding numbers during arithmetic and conversions
operations: arithmetic and other operations on arithmetic formats
4. exception handling: indications of exceptional conditions (such as division by zero, overflow, etc.)


Booth Algorithm & IEEE representation

You can download the C++ programs for Booth's algorithm & IEEE representation from the download box present alongside.

Read More

Anonymous 12:08 am  No comment

DSIP University Papers

DSIP papers
Download the Digital Signal And Image Processing question papers from the download box alongside.

Read More

Anonymous 9:24 pm  No comment

Happy Independence Day

Read More

Anonymous 9:47 am  No comment

Object Oriented Software Engineering- Hospital Management in Rational Rose

Rational Rose is a tool set produced and marketed by Rational Software Corporation (now owned by IBM).  Rose is an operational tool set that uses the Unified Modeling Language (UML) as its means for facilitating the capture of domain semantics and architecture/design intent.  UML has a number of different notations, allowing the specification of the artifacts of design from many different perspectives and for different objectives during the computer engineering life cycle.  Most of these notations are directly supported through the Rose tool set.

Rational Rose is an object-oriented Unified Modeling Language (UML) software design tool intended for visual modeling and component construction of enterprise-level software applications. In much the same way a theatrical director blocks out a play, a software designer uses Rational Rose to visually create (model) the framework for an application by blocking out classes with actors (stick figures), use case elements (ovals), objects (rectangles) and messages/relationships (arrows) in a sequence diagram using drag-and-drop symbols. Rational Rose documents the diagram as it is being constructed and then generates code in the designer's choice of C++, Visual Basic, Java, Oracle8, Corba or Data Definition Language.


Hospital Management
You can download the Software engineering models for hospital management from the download box alongside. These models were prepared using Rational Rose. 

Read More

Anonymous 10:49 am  No comment

System Programming & Compiler Construction

Here are all Spcc prog.
Download them from the download box alongside.
Note: If the question has the source prog in c language, & they ask for Uniform symbol table, or literal table, then don't get confused. It is not the prog of Assembler, but of Lexical Analyzer. If it is an assembly lang prog & they ask to find the Sym/lit table, then it is the question of Assembler.

Read More

Anonymous 3:04 pm  No comment

Advanced MicroProcessors

AMP All Programs
you can download all the programs from the download box alongside

Note: It does not include EFlags

Read More

Anonymous 7:41 pm  No comment

Advanced MicroProcessor Reservation Table

Reservation table

1.         Collision vector=(100)

  Simple cycles: (2),(4),(1,4),(1,1,4),(2,4)etc

  Greedy cycle: (1,4,2,4),(1,1,4,2,4)etc 

  MAL=2 

  Max throughput=0.5

2.       . Collision vector=(10)

  Simple cycles: (3),(1,3)

  Greedy cycle: (1,3,3),(3,1,3)

  MAL=2

  Max throughput=0.5

3.         Collision vector=(110)

  Simple cycles: (4),(1,4)

  Greedy cycle: (1,4,4),(4,1,4)

  MAL=2.5

  Max throughput=0.4

4.         Collision vector=(11)

  Simple cycles: (3)

  Greedy cycle: ---

  MAL=3

  Max throughput=0.33

 Note: The above answers were found to be correct by me. However I don't take the responsibility of this being fail-proof!!  

Read More

Anonymous 5:00 pm  No comment

Lexical Analyzer

LEXICAL ANALYZER
Download the program for Lexical Analyzer from the download box alongside

Read More

Anonymous 12:57 pm  No comment

OOSE Practicals

Question Bank for OOSE Practical Exam

     

1.      Airline Reservation System

2.      Railway Reservation System

3.      Nokia Gallery

4.      Banking System

5.      Big Bazaar

6.      Bus Reservation System

7.      Movie Ticket Reservation

8.      Hospital Management System

9.      Star Plus Serial Schedule Management System

10.  SUC Event Management

11.  Hotel Management

12.  IPL Matches

  

Following diagrams will be asked based on above systems…

1.  Class Diagram

2.  Sequence Diagram

3.  Collaboration Diagram

4.  State Transition Diagram

5.  Activity Diagram

6.  Use Case Diagram

Only System name would be given…

Example: Class diagram for Hospital Management System.

Note: Students first have to write the problem statement.. Then draw d diagram on answer sheet nd then perform pracs..

Read More

Anonymous 12:38 pm  2 comments

ANDROID SEMINAR

Android Seminar

Read More

Anonymous 5:54 pm  No comment

Assemblers (Pass1)

Programs for Pass1 assembler:
1. Pass 1(a):

import java.io.*; import java.util.*; class Pass1a {public static void main(String args[])throws IOException { int i=0; FileWriter fw=new FileWriter("Input.txt"); Scanner src=new Scanner(System.in); System.out.println("Enter code"); String code=src.next(); char code1[]=new char[500]; code1=code.toCharArray(); int n=code.length(); for( i=0;i<n;++i) { while((code1[i]!='|')&&i<n-1) { if(code1[i]==';') {fw.write("\n"); ++i; continue; } fw.write(code1[i]); ++i; } fw.write(" "); } fw.close(); FileReader fr=new FileReader("Input.txt"); BufferedReader br=new BufferedReader(fr); String input; while((input=br.readLine())!=null) System.out.println(input); String token=""; i=0; String prg[][] = new String[30][4]; int lines=0; input=""; FileReader fr1=new FileReader("Input.txt"); BufferedReader br1=new BufferedReader(fr1); while((input=br1.readLine())!=null) { int l=input.length(); i=0; token = ""; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][0]=token; token = ""; while(i<l) if(input.charAt(i)==' ') i++; else break; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][1]=token; while(i<l) if(input.charAt(i)==' ') i++; else break; token = ""; while(i<l) { if(input.charAt(i)!=' ' && input.charAt(i)!=',') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][2]=token; while(i<l) if(input.charAt(i)==' ' || input.charAt(i)==',') i++; else break; token = ""; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=""; prg[lines][3]=token; lines++; i=l; } int j; System.out.println("\n"); for(i=0;i<lines;i++) { for(j=0;j<4;j++) System.out.print(prg[i][j]+"\t"); System.out.println(); } }}

2. Pass 1(b):

import java.io.*; import java.util.*; class Pass1b {public static void main(String args[])throws IOException { int i=0; FileWriter fw=new FileWriter("Input.txt"); Scanner src=new Scanner(System.in); System.out.println("Enter code"); //int n=src.nextInt(); //St s[]=new St[n]; String code=src.next(); char code1[]=new char[500]; code1=code.toCharArray(); //for(int i=0;i<10;++i) //System.out.println(code1[i]); int n=code.length(); System.out.println(n); for( i=0;i<n;++i) { while((code1[i]!='|')&&i<n-1) { if(code1[i]==';') {fw.write("\n"); ++i; continue; } //System.out.println(i); fw.write(code1[i]); ++i; } fw.write(" "); } fw.close(); FileReader fr=new FileReader("Input.txt"); BufferedReader br=new BufferedReader(fr); String input; while((input=br.readLine())!=null) System.out.println(input); //fr.close(); String token=""; i=0; String prg[][] = new String[30][4]; int lines=0; input=""; FileReader fr1=new FileReader("Input.txt"); BufferedReader br1=new BufferedReader(fr1); while((input=br1.readLine())!=null) { int l=input.length(); i=0; token = ""; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][0]=token; token = ""; while(i<l) if(input.charAt(i)==' ') i++; else break; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][1]=token; while(i<l) if(input.charAt(i)==' ') i++; else break; token = ""; while(i<l) { if(input.charAt(i)!=' ' && input.charAt(i)!=',') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][2]=token; while(i<l) if(input.charAt(i)==' ' || input.charAt(i)==',') i++; else break; token = ""; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=""; prg[lines][3]=token; lines++; i=l; } int j; System.out.println("\n"); for(i=0;i<lines;i++) { for(j=0;j<4;j++) System.out.print(prg[i][j]+"\t"); System.out.println(); } String mnemonics[] = new String[10]; int mlen[] = new int[10]; int mno = 0; mnemonics[mno]="L"; mlen[mno++]=4; mnemonics[mno]="A"; mlen[mno++]=4; mnemonics[mno]="ST"; mlen[mno++]=4; String pseudo[] = new String[10]; int pno=0; pseudo[pno++]="START"; pseudo[pno++]="BALR"; pseudo[pno++]="USING"; pseudo[pno++]="DC"; pseudo[pno++]="DS"; pseudo[pno++]="END"; System.out.println(); System.out.println("-------------------------------------------"); System.out.println("Mnemonics opcode Table is : "); System.out.println(); System.out.println("Mnemonics\tLength"); System.out.println(); for(i=0;i<mno;i++) { System.out.print(mnemonics[i]+"\t\t "+mlen[i]); System.out.println(); } System.out.println(); System.out.println("-------------------------------------------"); System.out.println("Pseudo opcode Table is : "); System.out.println(); System.out.println("Psuedo\tRoutine Adderess"); System.out.println("Opcode"); System.out.println(); for(i=0;i<pno;i++) { System.out.print(pseudo[i]+"\t\t"+i); System.out.println(); } String symbol[] = new String[20]; int sym_value[] = new int[20]; int symno = 0; int lc=0; for(i=0;i<lines;i++) { token = prg[i][0]; if(token!=" ") { symbol[symno] = token; sym_value[symno++] = lc; } token = prg[i][1]; if(token.equalsIgnoreCase("DC")) lc=lc+4; else if(token.equalsIgnoreCase("DS")) lc=lc+4; else { for(j=0;j<mno;j++) { if(token.equals(mnemonics[j])) { lc=lc+mlen[j]; break; } } } } System.out.println(); System.out.println("-------------------------------------------"); System.out.println("Symbol Table is : "); System.out.println(); System.out.println("Symbol\tValue"); System.out.println(); for(i=0;i<symno;i++) { System.out.print(symbol[i]+"\t"+sym_value[i]); System.out.println(); } }}

3. Pass 1(c):

import java.io.*; import java.util.*; class Pass1c {public static void main(String args[])throws IOException { int i=0; FileWriter fw=new FileWriter("Input.txt"); Scanner src=new Scanner(System.in); System.out.println("Enter code with | as space & ; for next line"); String code=src.next(); char code1[]=new char[500]; code1=code.toCharArray(); int n=code.length(); for( i=0;i<n;++i) { while((code1[i]!='|')&&i<n-1) { if(code1[i]==';') {fw.write("\n"); ++i; continue; } fw.write(code1[i]); ++i; } fw.write(" "); } fw.close(); FileReader fr=new FileReader("Input.txt"); BufferedReader br=new BufferedReader(fr); String input; while((input=br.readLine())!=null) System.out.println(input); String token=""; i=0; String prg[][] = new String[30][4]; int lines=0; input=""; FileReader fr1=new FileReader("Input.txt"); BufferedReader br1=new BufferedReader(fr1); while((input=br1.readLine())!=null) { int l=input.length(); i=0; token = ""; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][0]=token; token = ""; while(i<l) if(input.charAt(i)==' ') i++; else break; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][1]=token; while(i<l) if(input.charAt(i)==' ') i++; else break; token = ""; while(i<l) { if(input.charAt(i)!=' ' && input.charAt(i)!=',') token+=input.charAt(i); else break; i++; } if(token=="") token=" "; prg[lines][2]=token; while(i<l) if(input.charAt(i)==' ' || input.charAt(i)==',') i++; else break; token = ""; while(i<l) { if(input.charAt(i)!=' ') token+=input.charAt(i); else break; i++; } if(token=="") token=""; prg[lines][3]=token; lines++; i=l; } int j; System.out.println("\n"); for(i=0;i<lines;i++) { for(j=0;j<4;j++) System.out.print(prg[i][j]+"\t"); System.out.println(); } String mnemonics[] = new String[10]; int mlen[] = new int[10]; int mno = 0; mnemonics[mno]="L"; mlen[mno++]=4; mnemonics[mno]="A"; mlen[mno++]=4; mnemonics[mno]="ST"; mlen[mno++]=4; String pseudo[] = new String[10]; int pno=0; pseudo[pno++]="START"; pseudo[pno++]="BALR"; pseudo[pno++]="USING"; pseudo[pno++]="DC"; pseudo[pno++]="DS"; pseudo[pno++]="END"; System.out.println(); System.out.println("-------------------------------------------"); System.out.println("Mnemonics opcode Table is : "); System.out.println(); System.out.println("Mnemonics\tLength"); System.out.println(); for(i=0;i<mno;i++) { System.out.print(mnemonics[i]+"\t\t "+mlen[i]); System.out.println(); } System.out.println(); System.out.println("-------------------------------------------"); System.out.println("Pseudo opcode Table is : "); System.out.println(); System.out.println("Psuedo\tRoutine Adderess"); System.out.println("Opcode"); System.out.println(); for(i=0;i<pno;i++) { System.out.print(pseudo[i]+"\t\t"+i); System.out.println(); } String symbol[] = new String[20]; int sym_value[] = new int[20]; int symno = 0; String literal[] = new String[20]; int lit_value[] = new int[20]; int litno = 0; String lit=""; int lc=0; for(i=0;i<lines;i++) { token = prg[i][0]; lit=prg[i][2]; if(lit!="") { if(lit.charAt(0)=='=') { literal[litno++] = lit; } } token = prg[i][1]; if(token.equalsIgnoreCase("DC")) lc=lc+4; else if(token.equalsIgnoreCase("DS")) lc=lc+4; else { for(j=0;j<mno;j++) { if(token.equals(mnemonics[j])) { lc=lc+mlen[j]; break; } } } } for(i=0;i<litno;i++) { lit=literal[i]; if(lit.charAt(1)=='F'||lit.charAt(1)=='f') { lit_value[i] = lc; lc=lc+4; } if(lit.charAt(1)=='H'||lit.charAt(1)=='h') { lit_value[i] = lc; lc=lc+2; } if(lit.charAt(1)=='D'||lit.charAt(1)=='d') { lit_value[i] = lc; lc=lc+8; } } System.out.println(); System.out.println("-------------------------------------------"); System.out.println("Literal Table is : "); System.out.println(); System.out.println("Literal\tValue"); System.out.println(); for(i=0;i<litno;i++) { System.out.print(literal[i]+"\t"+lit_value[i]); System.out.println(); } }}

NOTE:While entering the code use '|' as space & ';' for next line.

Read More

Anonymous 1:07 pm  No comment

Seminar Report

Android Operating System

Final Android

Read More

Anonymous 9:46 pm  No comment

ACN Practical exam list

ACN Practical Exam 2011

1.  Install Web Server

Site Name:
Contents of the site:

2. Implement Virtual Hosting (name based)

IP Address:

Site Name:
Contents of the Site:

3.  Implement Virtual Hosting (IP based)

IP Address:
Site Name:
Contents of the Site:

4. Analysis of packet captured (UDP)

Mention the port numbers of the captured packets

5. Analysis of packet captured (TCP)

Mention the flag status of the captured packets

6. Analysis of packet captured (ARP)

Mention the IP address of the source and destination hosts

7. Analysis of packet captured (IP)

Mention the IP address of the source and destination hosts

8. Implement Sliding Window Protocol (Go-Back-N)

9. Implement Sliding Window Protocol (Selective Repeat)

10.  Implement Group Chat Server (2 Clients)

11. Implement Group Chat Server (3 Clients)

12. Implement  multicast routing protocol DVMRP with following topology and groups

          Node ____ is the source.

          CBR traffic starts at ______ time.

          Node ____ joins the group at _______ time.

          Node ____ joins the group at _______ time.

          Node ____ leaves the group at _______ time.

Read More

Anonymous 9:43 am  No comment

SUPERSCALAR ARCHITECTURE in terms of Pipelining

Superscaler Program

/***********To Study The SUPERSCALAR ARCHITECTURE in terms of Pipelining****************/ import java.util.*; class superscalar { public static void main(String[] args) { int n,i,j,k; Scanner sc=new Scanner(System.in); System.out.print("Enter number of instructions: "); n=sc.nextInt(); if(n<=0) { System.out.println("No instructions available for execution!!!"); System.exit(0); } System.out.println("Fetch\tDecode\tExecute\tWrite"); for(i=1;i<=n;i++) { if(i%2==0) even(i); else odd(i); } for(i=n-1;i>=(n-5)&&i>0;i--) { System.out.print(" \t"+i); i--; } System.out.println(); for(i=n;i>=(n-4)&&i>0;i--) { System.out.print(" \t"+i); i--; } System.out.println(); System.out.print(" \t"); for(i=n-1;i>=(n-3)&&i>0;i--) { System.out.print(" \t"+i); i--; } System.out.println(); System.out.print(" \t"); for(i=n;i>=(n-2)&&i>0;i--) { System.out.print(" \t"+i); i--; } System.out.println(); if((n-1)>0) System.out.println(" \t\t\t"+(n-1)); System.out.println(" \t\t\t"+n); } static void even(int i) { int count=0,l; for(l=i;l>=2;l--) { if(count==4) { // System.out.println(); break; } if(l%2==0) { System.out.print(l+" \t"); count++; } } System.out.println(); } static void odd(int i) { int count=0,l; for(l=i;l>=1;l--) { if(count==4) { // System.out.println(); break; } if(l%2==1) { System.out.print(l+" \t"); count++; } } System.out.println(); } } /******************OUTPUT***************** Enter number of instructions: 5 Fetch Decode Execute Write 1 2 3 1 4 2 5 3 1 4 2 5 3 1 4 2 5 3 4 5 */

Read More

Anonymous 8:04 pm  No comment

Data & Web Mining

DWM Programs in java
Download the Data & Web Mining programs from the download box alongside.

Read More

Anonymous 8:02 pm  No comment

Arithmetic Pipelining for multiplicaion

ARITHMETIC PIPELINING
This the final prog for arithmetic pipelining. It works upto 8bit X 8bit multiplication. There were some minor changes in the datatypes of some variables as compared to the previous prog. 

//Arithmetic Pipelining Program by Ajinkya #include<iostream.h> #include<math.h> #include<conio.h> #include<stdio.h> int a1[20],a2[20],x[20],p[8][20],q[8][20],q2[8][20],i,j,k; long q3[8][20]; int a,b; void dectobin(int a, int a1[]); void csa(int p[8][20]); void cpa(int p[8][20]); void main() { for(i=0;i<20;++i) a1[i]=a2[i]=x[i]=0; for(i=0;i<8;++i) for(j=0;j<20;++j) {p[i][j]=0; q2[i][j]=0; q3[i][j]=0; } clrscr(); cout<<"Enter multiplicand"; cin>>a; cout<<"Enter multiplier"; cin>>b; cout<<"A= "; dectobin(a,a1); for(i=0;i<8;++i) cout<<a1[i]; cout<<endl<<"B= "; dectobin(b,a2); for(i=0;i<8;++i) cout<<a2[i]; cout<<endl; for(i=0;i<8;++i) { for(j=15;j>16-i-1;--j) p[i][j]=0; if(a2[i]==1) { k=0; for(j=i;j<16;++j) p[i][16-j-1]=a1[k++]; } else {for(j=i;j<16;++j) p[i][16-j-1]=0; } } for(i=0;i<8;++i) { cout<<"P"<<i<<" = "; for(j=0;j<16;++j) cout<<p[i][j]; cout<<endl; } i=0; j=0; csa(p); i=i+3; j++; csa(p); int z; for(j=0;j<3;++j) for(z=0;z<16;++z) {if(j==0||j==1) {p[2*j][z]=q[j][z]; p[2*j+1][z]=q2[j][z]; } else {p[2*j][z]=p[3*j][z]; p[2*j+1][z]=p[3*j+1][z]; } } i=0; j=0; csa(p); i=i+3; ++j; csa(p); for(j=0;j<3;++j) for(z=0;z<16;++z) {if(j==0||j==1) {p[2*j][z]=q[j][z]; p[2*j+1][z]=q2[j][z]; } } i=0; j=0; csa(p); for(j=0;j<2;++j) for(z=0;z<16;++z) {if(j==0) {p[2*j][z]=q[j][z]; p[2*j+1][z]=q2[j][z]; } else p[2*j][z]=p[3*j][z]; } i=0;j=0; csa(p); for(j=0;j<1;++j) for(z=0;z<16;++z) {p[2*j][z]=q[j][z]; p[2*j+1][z]=q2[j][z]; } i=0;j=0; cpa(p); getch(); } void dectobin(int a, int a1[]) {i=0; while(a>0) { x[i]=a%2; a=a/2; ++i; } --i; j=0; while(i>=0) { a1[i]=x[i]; --i; } } void csa(int p[8][20]) { cout<<"CSA"; int z; cout<<"Exor"<<endl; for(z=0;z<16;++z) {if((p[i][z]==p[i+1][z]==p[i+2][z]==0)||(p[i][z]==p[i+1][z]==1&&p[i+2][z]==0)||(p[i][z]==0&&p[i+1][z]==p[i+2][z]==1)||(p[i+1][z]==0&&p[i][z]==p[i+2][z]==1)) q[j][z]=0; else q[j][z]=1; cout<<q[j][z]; } q2[j][15]=0; int r=0; cout<<"Carry"<<endl; for(z=15;z>0;--z) { if((p[i][z]==0&&p[i+1][z]==0&&p[i+2][z]==0)||(p[i][z]==0&&p[i+1][z]==0)||(p[i+1][z]==0&&p[i+2][z]==0)||(p[i][z]==0&&p[i+2][z]==0)) { //cout<<endl<<p[i][z]<<p[i+1][z]<<p[i+2][z]; q2[j][z-1]=0; } else q2[j][z-1]=1; } for(z=0;z<16;++z) cout<<q2[j][z]; cout<<endl; } void cpa(int p[8][20]) { cout<<"CPA"; cout<<endl<<"P= "; int z; int c=0; for(z=15;z>=0;--z) {if(q[j][z]==0&&q2[j][z]==0&&c==0) {q3[j][z]=0; } else {if((q[j][z]==1&&q2[j][z]==0&&c==0)||(q2[j][z]==1&&q[j][z]==0&&c==0)||(q[j][z]==0&&q2[j][z]==0&&c==1)) { q3[j][z]=1; c=0; } else {if((q[j][z]==1&&q2[j][z]==1&&c==0)||(q[j][z]==1&&q2[j][z]==0&&c==1)||(q[j][z]==0&&q2[j][z]==1&&c==1)) {q3[j][z]=0; c=1; } else {q3[j][z]=1; c=1; } } } } if(c==1) q3[j][16]=1; cout<<"Sum: "; for(z=0;z<16;++z) cout<<q3[j][z]; cout<<endl; cout<<"Carry: "<<c; for(z=0;z<16;++z) {q3[j][z]=abs(q3[j][z])*pow(2,15-z); } float ans=0; for(z=0;z<16;++z) ans=ans+q3[j][z]; cout<<endl<<"Ans "<<ans; } /*******OUTPUT************** Enter Multiplicand 181 Enter Multiplier 147 A=10110101 B=10010011 P0=000000010110101 P1=000000111101010 P2=000000000000000 P3=000000000000000 P4=000101101010000 P5=000000000000000 P6=000000000000000 P7=101101010000000 CSA Exor: 000000111011111 Carry: 0000000001000000 CSA Exor: 0000101101010000 Carry: 0000000000000000 CSA Exor: 0000101011001111 Carry: 0000001010100000 CSA Exor: 0101101010000000 Carry: 0000000000000000 CSA Exor: 0101001011101111 Carry: 0001010100000000 CSA Exor: 0100011111101111 Carry: 0010000000000000 CPA Sum= 0110011111101111 Carry=0 P=0110011111101111 Ans=26607 ***************************/

Read More

Anonymous 8:42 pm  No comment

K-Mean & Nearest Neighbour Programs

Kmean & Nearest Neighbour Prog in java


1. Kmean:

#include<iostream.h> #include<conio.h> #include<math.h> void main() { clrscr(); int m1,m2,i,j,n,x,y,sum1,sum2,k; int d[100],k1[50],k2[50]; cout<<"Enter the no. of items in cluster:"; cin>>n; cout<<"Enter the items of the cluster:"; for(i=0;i<n;i++) cin>>d[i]; for(i=0;i<n;i++) { k1[i]=k2[i]=0; } m1=d[0]; m2=d[1]; k=1; while(1) { x=0; y=0; for(i=0;i<n;i++) { if(abs(m1-d[i]) <= abs(m2-d[i])) { k1[x++]=d[i]; } else k2[y++]=d[i]; } cout<<"\n\n\n** Iteration:"<<k<<" **\n"<<endl; cout<<"cluster1={"; for(i=0;i<x;i++) { cout<<k1[i]<<","; } cout<<"}"<<endl; cout<<"cluster2={"; for(i=0;i<y;i++) { cout<<k2[i]<<","; } cout<<"}"<<endl; sum1=sum2=0; for(i=0;i<x;i++) sum1=sum1+k1[i]; sum1=sum1/x; for(i=0;i<y;i++) sum2=sum2+k2[i]; sum2=sum2/y; if(sum1==m1 && sum2==m2) break; else { m1=sum1; m2=sum2; } k++; } getch(); }

2. Nearest Neighbour:

#include<iostream.h> #include<conio.h> void main() { clrscr(); int m,i,j,n,t,p,l,iflag,jflag; int a[10][10]; char k[10],k1[10],k2[10]; cout<<"Enter the no. of tuples:"; cin>>n; cout<<"Enter the name of the nodes:"; for(i=0;i<n;i++) { cin>>k[i]; } cout<<"Enter the adjacent matrix:\n\n"; cout<<" "; for(i=0;i<n;i++) cout<<" "<<k[i]; cout<<endl; for(i=0;i<n;i++) { cout<<endl<<k[i]<<" "; for(j=0;j<n;j++) cin>>a[i][j]; } cout<<endl; t=1; while(1) { cout<<"** Threshold="<<t<<" **\n\n"; m=0; iflag=1; jflag=1; for(i=0;i<n;i++) for(j=0;j<n;j++) { if(a[i][j]<=t && a[i][j]>0 && i<j) { cout<<k[i]<<" is connected to "<<k[j]<<" having distance of "<<a[i][j]<<endl; for(l=0;l<m;l++) { if(k[i]==k1[l]) { iflag=0; break; } else { iflag=1; } } for(l=0;l<m;l++) { if(k[j]==k1[l]) { jflag=0; break; } else { jflag=1; } } if(iflag==1) k1[m++]=k[i]; if(jflag==1) k1[m++]=k[j]; } } p=0; for(i=0;i<n;i++) { if(k[i]!=k1[i]) { k2[p++]=k[i]; } } cout<<"k1={"; for(i=0;i<m;i++) cout<<k1[i]<<","; cout<<"}\n"; cout<<"k2={"; for(i=0;i<p;i++) cout<<k2[i]<<","; cout<<"}\n"; if(m==n) break; t++; cout<<"\n\n"; } getch(); }

Read More

Anonymous 11:10 am  No comment

Seminar

ANDROID report
Download the report from the download box alongside 



Points for seminar:
1) intro
2) Innovative features
3) open source

4) arch

5) comparison
6) system mgmt
7) life cycles
8) security
9) advantages

10) future pros

Read More

Anonymous 10:07 am  No comment

Go Back N - Sender & Receiver

1. Go Back N Sender:

import java.io.*; import java.net.*; import java.lang.*; public class gbnsend { public static void main(String args[]) { int serverport=3333; String address="127.0.0.2"; try { InetAddress ipaddress=InetAddress.getByName(address); Socket socket=new Socket(ipaddress,serverport); InputStream sin=socket.getInputStream(); OutputStream sout=socket.getOutputStream(); DataInputStream in=new DataInputStream(sin); DataOutputStream out=new DataOutputStream(sout); BufferedReader keyboard=new BufferedReader(new InputStreamReader(System.in)); String line=null; String word []=new String [8]; int i; System.out.println("plz input the no of frames to b sent"); int n=Integer.parseInt(keyboard.readLine()); for(i=0;i<n;i++) { word[i]=keyboard.readLine(); } i=0; while(i<n) { System.out.println("sending frame "+word[i]); out.writeUTF(word[i]); out.flush(); i++; } try { Thread.sleep(1000); } catch(InterruptedException e) { e.printStackTrace(); } line=in.readUTF(); System.out.println("nack received for frame "+line); i=Integer.parseInt(line); out.writeUTF(word[i]); System.out.println("retransmitting all frames after "+word[i]); i++; while(i<n) { System.out.println("sending frame "+word[i]); out.writeUTF(word[i]); out.flush(); i++; } } catch(Exception e) { e.printStackTrace(); } } }

2. Go Back N Receiver:

import java.net.*; import java.io.*; public class gbnreceive { public static void main(String args[]) { int port=3333; try { ServerSocket ss=new ServerSocket(port); System.out.println("waiting for user2"); Socket socket=ss.accept(); System.out.println("user detected"); System.out.println(); InputStream sin=socket.getInputStream(); OutputStream sout=socket.getOutputStream(); DataInputStream in=new DataInputStream(sin); DataOutputStream out=new DataOutputStream(sout); BufferedReader keyboard=new BufferedReader(new InputStreamReader(System.in)); String line=null; String word []=new String [8]; int i=0; while(i<4) { line=in.readUTF(); word[i]=line; System.out.println("frame "+word[i]+" received successfully"); i++; } while(i<8) { if(i==4) { System.out.println("frame "+i+" not received"); i++; } else { System.out.println("frame "+i+" discarded"); i++; } } System.out.println("requesting for retransmaission"); line=keyboard.readLine(); out.writeUTF(line); out.flush(); i=4; while(i<8) { line=in.readUTF(); word[i]=line; i++; } System.out.println("received all retransmitted frames successfully"); } catch(Exception e) { e.printStackTrace(); } /*finally { sin.close(); sout.close(); in.close(); out.close(); }*/ } }

Read More

Anonymous 7:20 am  No comment

Infix to Postfix Conversion

Following is the java code for converting from infix to postfix:

// To convert Infix into Postfix import java.io.*; class infix2 { public static void main(String args[]) throws IOException { check obj=new check(); String str = new String(); char infix[]=new char[15]; char postfix[]=new char[15]; char stack[]=new char[15]; int len=0,i=0,j=0,top=-1,value; BufferedReader b=new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter Expression ==> "); str=b.readLine(); len=str.length(); infix=str.toCharArray(); for(i=0;i<=len-1;i++) { int t=obj.isoperand(infix[i]); if(t==1) { postfix[j]=infix[i]; j++; } else if(top==-1) { top++; stack[top]=infix[i]; } else if(infix[i]==')') { while(stack[top]!='(') { postfix[j]=stack[top]; top--; j++; } top--; } else if(obj.priority(infix[i])>obj.priority(stack[top])) { top++; stack[top]=infix[i]; } else { if(obj.priority(infix[i])==obj.priority(stack[top])) { postfix[j]=stack[top]; top--; j++; } else { while(obj.priority(infix[i])<obj.priority(stack[top]) && top!=-1 && stack[top]!='(') { postfix[j]=stack[top]; top--; j++; } } top++; stack[top]=infix[i]; } } //end of for loop while(top!=-1) { postfix[j]=stack[top]; top--; j++; } System.out.println("The Postfix Expression is"); for(i=0;i<len;i++) System.out.print(postfix[i]); }//end of main }//end of class class check { int isoperand(char ch) { if((ch>='A' && ch<='Z' )|| (ch>='a' && ch<='z')) return 1; else return 0; }//end of isoperand method int priority(char ch) { if(ch=='(') return 4; if(ch=='^' || ch=='%') return 3; if(ch=='*' || ch=='/') return 2; if(ch=='+' || ch=='-') return 1; if(ch==')') return 0; return -1; }//end of priority method }//end of class check

Read More

Anonymous 8:15 am  No comment

Packet Sniffer

ACN Packet Sniffer

Our sir told to use some packetsniffer other than Wireshark or Colasoft. So I used Smartsniff.
Click the link below for snapshots
SmartSniff

For snapshots of Wireshark click the link below
Wireshark

Read More

Anonymous 7:38 pm  No comment

Apriori Algorihm

Apriori Algorithm:

#include<stdio.h> #include<conio.h> int item[5][5]={{1,3,4,6},{2,3,5,7},{1,2,3,5,8},{2,5,9,10},{1,4}}; int fn(int a,int b); int main() { int tid[5]={1,2,3,4,5} ,i,j,ms,k,count[11]={0}; int p,a,b,c; printf("\n\tTrans_id\t\tItems\n\n"); for(i=0;i<5;i++) { printf("\t%d \t\t\t",tid[i]); for(j=0;j<5;j++) { if(item[i][j]!=0) printf("%d",item[i][j]); } printf("\n"); } printf("\n Assume minimum support:"); scanf("%d",&ms); for(k=1;k<=10;k++) { for(i=0;i<5;i++) for(j=0;j<5;j++) if(item[i][j]==k&&item[i][j]!=0) count[k]++; } printf("\nGenerating c1 from the data"); for(k=1;k<=10;k++) printf("\n\t\t%d\t\t%d",k,count[k]); for(k=1;k<=10;k++) { if(count[k]<ms) count[k]=0; } printf("\nGenerating l1 from c1"); for(k=1;k<=10;k++) { a=2; if(count[k]!=0) printf("\n\t\t%d\t\t%d",k,count[k]); } printf("\nGenerating l2 from c2"); p=2; b=3; for(i=1;i<4;i++) { for(j=p++;j<=5;j++) { if(fn(i,j)>=ms) printf("\n\t\t%d%d\t\t%d",i,j,fn(i,j)); c=5; } } printf("\n\t\tGenerating l3"); printf("\n\n\t\t\t\t%d %d %d",a,b,c); getch(); return 0; } int fn(int a,int b) { int i,j,cnt=0,aa,flag=0; for(i=0;i<5;i++) { flag=0; for(j=0;j<5;j++) { aa=j; if(flag==1) goto ab; if(a==item[i][j]) { flag=1; j++; ab: if(b==item[i][j]) { cnt++; break; } } j=aa; } } return cnt; } /************OUTPUT*********** Trans_id Items 1 1346 2 2357 3 12358 4 25910 5 14 Assume minimum support:2 Generating c1 from the data 1 3 2 3 3 3 4 2 5 3 6 1 7 1 8 1 9 1 10 1 Generating l1 from c1 1 3 2 3 3 3 4 2 5 3 Generating l2 from c2 13 2 14 2 23 2 25 3 35 2 Generating l3 2 3 5*/

Read More

Anonymous 7:28 pm  No comment

Computer Graphics programs in C++

The term computer graphics includes almost everything on computers that is not text or sound. Today almost every computer can do some graphics, and people have even come to expect to control their computer through icons and pictures rather than just by typing.

Here in our lab at the Program of Computer Graphics, we think of computer graphics as drawing pictures on computers, also called rendering. The pictures can be photographs, drawings, movies, or simulations -- pictures of things which do not yet exist and maybe could never exist. Or they may be pictures from places we cannot see directly, such as medical images from inside your body.

Computer graphics are graphics created using computers and the representation of image data by a computer specifically with help from specialized graphic hardware and software.

The interaction and understanding of computers and interpretation of data has been made easier because of computer graphics. Computer graphic development has had a significant impact on many types of media and have revolutionized animation, movies and the video game industry.

CG Programs
Most of the prog have been included.
click on the link below to download
CGprog

Read More

Anonymous 1:04 pm  No comment

Jigsaw puzzle

Jigsaw puzzle html
Download the Jigzaw puzzle from the download box alongside.

Read More

Anonymous 12:57 pm  No comment

Economic Crisis 2008 Seminar Presentation

This is the Seminar Presentation that we prepared for the Economic Crisis that started in 2008

Economic Crisis 2008

Read More

Anonymous 12:55 pm  No comment

Sudoku puzzle in javascript

Download the Code for Sudoku puzzle for 3X3, 6X6, & 9X9 from the download box alongside.

Read More

Anonymous 12:46 pm  No comment

Computer Graphics mini project/ Screen Saver code

1. Car Screensaver:

/******************************************************************* Program : Screensaver: Moving car ********************************************************************/ #include<iostream.h> #include"conio.h" #include<math.h> #include"stdlib.h" #include"dos.h" #include"graphics.h" #define DELAY 1 #define SOUND 3500 void state(int x,int y,int mode); int area,area1; void *ptr1,*ptr2,*burst; void BF(int,int,int,int); void circ_bre(int x,int y,int rad); void draw_burst ( int x, int y,int ); void display(int,int,int,int); void dda(int x1,int y1,int x2,int y2); int COND(int x,int y) { if (x>20 && x<getmaxx()-20 && y>20 && y<getmaxy()-20) return 1; else return 0; } void state(int x,int y,int mode) { while(COND(x,y)&&!kbhit()) { if(x==300&&y==230) { putimage(350,230,burst,COPY_PUT); sound(SOUND); delay(100); cleardevice(); state(30,30,0); } switch(mode) { case 0: // x++; putimage(getmaxx()-x,getmaxy()-y,ptr1,COPY_PUT); // delay(1); putimage(x,y,ptr2,COPY_PUT); // putimage(getmaxx()-x,getmaxy()-y,ptr1,XOR_PUT); // putimage(x,y,ptr2,COPY_PUT); // delay(3); //putimage(x,y,ptr2,XOR_PUT); x++; break; case 1: // x--; // putimage(getmaxx()-x,getmaxy()-y,ptr2,COPY_PUT); // delay(1); putimage(x,y,ptr1,COPY_PUT); putimage(getmaxx()-x,getmaxy()-y,ptr2,COPY_PUT); //putimage(x,y,ptr1,COPY_PUT); //delay(3); //putimage(x,y,ptr1,XOR_PUT); x--; break; case 2: putimage(getmaxx()-x,getmaxy()-y,ptr1,COPY_PUT); //delay(3); putimage(x,y,ptr2,COPY_PUT); //putimage(getmaxx()-x,getmaxy()-y,ptr1,XOR_PUT); //putimage(x,y,ptr2,COPY_PUT); //delay(3); //putimage(x,y,ptr2,XOR_PUT); x--; break; case 3: putimage(getmaxx()-x,getmaxy()-y,ptr2,COPY_PUT); //delay(3); putimage(x,y,ptr1,COPY_PUT); //putimage(getmaxx()-x,getmaxy()-y,ptr2,XOR_PUT); //putimage(x,y,ptr1,COPY_PUT); // delay(3); //putimage(x,y,ptr1,XOR_PUT); x++; break; } // delay(0); nosound(); } cleardevice(); if(y>=getmaxy()-20||y<=20) { sound(SOUND); switch(mode) { case 0: state(++x,y=y-20,2); break; case 1: state(++x,y=y+20,3); break; case 2: state(++x,y=y+20,1); break; case 3: state(++x,y=y+20,0); break; } } if(x>=(getmaxx()-20)||x<=20) { sound(SOUND); switch(mode) { case 0: state(--x,y=y+20,1); break; case 1: state(++x,y=y+20,0); break; case 2: state(--x,y=y-20,3); break; case 3: state(++x,y=y-20,2); break; } } } void main() { int gd = DETECT, gm; /*detect the graphics drivers automatically*/ initgraph(&gd,&gm,"\tc\tc\bgi"); /*Initialise to graphics mode*/ //int area; cleardevice(); // setbkcolor(); //CAR 1 dda(60,70,60,85); dda(60,70,80,75); dda(60,70,90,70); dda(80,75,80,90); dda(60,85,80,90); dda(80,75,110,75); dda(90,70,110,75); dda(90,70,110,55); dda(110,55,130,60); dda(110,75,130,60); dda(80,90,90,90); dda(110,90,160,90); dda(180,90,190,90); dda(190,75,190,90); dda(170,60,190,75); dda(130,60,170,60); dda(150,55,170,60); dda(110,55,150,55); dda(117,73,132,62); dda(132,62,168,62); dda(117,73,183,73); dda(168,62,183,73); dda(150,62,150,73); circ_bre(100,90,10); circ_bre(170,90,10); // BF(70,90,15,12); area=imagesize(59,55,191,100); ptr1=malloc(area); // setcolor(3); // floodfill(70,80,15); getimage(59,55,191,100,ptr1); cleardevice(); //CAR 2 dda(60,75,60,90); dda(60,75,80,60); dda(80,60,120,60); dda(80,60,100,55); dda(100,55,140,55); dda(120,60,140,55); dda(120,60,140,75); dda(140,55,160,70); dda(140,75,160,70); dda(160,70,190,70); dda(170,75,190,70); dda(140,75,170,75); dda(190,70,190,85); dda(170,90,190,85); dda(170,75,170,90); circ_bre(150,90,10); circ_bre(80,90,10); dda(160,90,170,90); dda(90,90,140,90); dda(60,90,70,90); dda(118,62,137,75); dda(80,62,118,62); dda(64,75,80,62); dda(64,75,137,75); dda(100,62,100,75); area=imagesize(59,55,190,100); ptr2=malloc(area); getimage(59,55,191,100,ptr2); cleardevice(); draw_burst(200,300,area1); cleardevice(); state(30,30,0); getch(); closegraph(); } void dda(int x1,int y1,int x2,int y2) { int i,dx,dy,steps; float x,y; float xinc,yinc; dx = (x2-x1); dy = (y2-y1); if(abs(dx)>=abs(dy)) /* decide whether to move along x-direction */ steps = dx; /* or y-direction */ else steps = dy; xinc =(float) dx/steps; /*calculate the increment value for x & y*/ yinc =(float) dy/steps; x = x1; y = y1; putpixel (x,y,RED); /* plot first point */ for (i=1;i<steps;i++) { x = x + xinc; y = y + yinc; /* convert the floating value to its nearest interger value. i.e. same as use of floor or ceil function */ x1 = x + 0.5 ; y1 = y + 0.5 ; putpixel (x1,y1,RED); /* plot the points */ } } void circ_bre(int x,int y,int rad) { float dp; //initialising the descision parameter. int x1,y1; x1 = 0; //initialisng the X,Y cordinates. y1 = rad; dp = 3 - 2*rad; while(x1<=y1) { if(dp<=0) dp += (4 * x1) + 6; else { dp += 4*(x1-y1)+10; y1--; } x1++; display(x1,y1,x,y); } } void display (int x1,int y1,int x,int y) { putpixel(x1+x,y1+y,WHITE); //plotting the pixels. putpixel(x1+x,y-y1,WHITE); putpixel(x-x1,y1+y,WHITE); putpixel(x-x1,y-y1,WHITE); putpixel(x+y1,y+x1,WHITE); putpixel(x+y1,y-x1,WHITE); putpixel(x-y1,y+x1,WHITE); putpixel(x-y1,y-x1,WHITE); } /*void BF(int x,int y,int bc,int fc) {if(getpixel(x,y)!=bc&&getpixel(x,y)!=fc) {putpixel(x,y,fc); BF(x+1,y,bc,fc); BF(x+1,y-1,bc,fc); BF(x,y-1,bc,fc); BF(x-1,y-1,bc,fc); BF(x-1,y,bc,fc); BF(x-1,y+1,bc,fc); BF(x,y+1,bc,fc); BF(x+1,y+1,bc,fc); } } */ void draw_burst ( int x, int y,int area ) { // setlinestyle(0,0,1); line ( x - 16, y - 12, x - 10, y - 2 ) ; line ( x - 10, y - 2, x - 16, y ) ; line ( x - 16, y, x - 10, y + 2 ) ; line ( x - 10, y + 2, x - 16, y + 12 ) ; line ( x - 16, y + 12, x - 6, y + 2 ) ; line ( x - 6, y + 2, x, y + 12 ) ; line ( x, y + 12, x + 6, y + 2 ) ; line ( x + 6, y + 2, x + 16, y + 12 ) ; line ( x - 16, y - 12, x - 6, y - 2 ) ; line ( x - 6, y - 2, x, y - 12 ) ; line ( x, y - 12, x + 6, y - 2 ) ; line ( x + 6, y - 2, x + 16, y - 12 ) ; line ( x + 16, y - 12, x + 10, y - 2 ) ; line ( x + 10, y - 2, x + 16, y ) ; line ( x + 16, y, x + 10, y + 2 ) ; line ( x + 10, y + 2, x + 16, y + 12 ) ; area=imagesize(0,0,32,24); burst=malloc(area); getimage(200-16,300-12,200+16,300+12,burst); // putimage(200-16,300-12,200+16,300+12,burst); cleardevice(); // putimage(200-16,300-12,200+16,300+12,burst); }

Read More

Anonymous 11:18 am  No comment

Packet garbage and analysis using Wireshark

On the Internet, packet filtering is the process of passing or blocking packets at a network interface based on source and destination addresses, ports, or protocols. The process is used in conjunction with packet mangling and Network Address Translation (NAT). Packet filtering is often part of a firewall program for protecting a local network from unwanted intrusion.

In a software firewall, packet filtering is done by a program called a packet filter. The packet filter examines the header of each packet based on a specific set of rules, and on that basis, decides to prevent it from passing (called DROP) or allow it to pass (called ACCEPT).

There are three ways in which a packet filter can be configured, once the set of filtering rules has been defined. In the first method, the filter accepts only those packets that it is certain are safe, dropping all others. This is the most secure mode, but it can cause inconvenience if legitimate packets are inadvertently dropped. In the second method, the filter drops only the packets that it is certain are unsafe, accepting all others. This mode is the least secure, but is causes less inconvenience, particularly in casual Web browsing. In the third method, if the filter encounters a packet for which its rules do not provide instructions, that packet can be quarantined, or the user can be specifically queried concerning what should be done with it. This can be inconvenient if it causes numerous dialog boxes to appear, for example, during Web browsing.

Wireshark is a network packet analyzer. A network packet analyzer will try to capture network packets and tries to display that packet data as detailed as possible.

You could think of a network packet analyzer as a measuring device used to examine what's going on inside a network cable, just like a voltmeter is used by an electrician to examine what's going on inside an electric cable (but at a higher level, of course).

Here are some examples people use Wireshark for:

• network administrators use it to troubleshoot network problems
• network security engineers use it to examine security problems
• developers use it to debug protocol implementations
• people use it to learn network protocol internals

Download the manual from the download box alongside.

Read More

Anonymous 8:22 am  No comment

Optimism Vs Pessimism

Is Your Glass Half Full or Half Empty?

Are you a glass half full or a glass half empty kind of person? Does it really make a difference? I think it makes a huge difference in the quality of your life. Both optimists and pessimists contribute to our society.  The optimist invents the airplane and the pessimist the parachute. Two men look out through the same bars: One sees the mud, & one the stars.

Optimism can lead to accomplishment. If you think something is possible, you will generally work harder to achieve it. Believing in the positive allows you to feel good about life in general. The average pencil is seven inches long, with just a half-inch eraser. Being optimistic can lead to an overall mood of happiness, and enjoyment in life. While most optimists understand that not everything works out as planned, they recognize that some good can come from the unexpected.

Pessimism can lead to defeat and despair. A pessimist is a man who looks both ways before crossing a one way street. When you are doubtful about your success, you tend not to try as hard - which then leads to failure. A pessimist is somebody who complains about the noise when opportunity knocks. Approaching everyday tasks with a negative attitude quickly leads to a negative outlook on life.

I don’t think many cases of eyestrain have been developed by looking on the bright side of things. I think it is this positive upbeat attitude that allows us to be productive and love the work we do. I truly believe that our optimistic attitude is what provides us with our sense of fulfillment, and improves our overall quality of life.

Between the optimist and the pessimist, the difference is droll. The optimist sees the doughnut; the pessimist the hole! Winston Churchill once said, “The pessimist sees difficulty in every opportunity. The optimist sees the opportunity in every difficulty”.

We all have moments of optimism and pessimism; what it comes down to is how the scale is tipped. Is your cup half full or half empty? One should realize that when it is dark enough, you can see the stars.

So from here on, when you face any challenge in life just say

“I'm not afraid of storms, for I'm learning how to sail my ship.”

Read More

Anonymous 8:09 pm  No comment