electrofriends.com » Computer Programming

Remote System Monitoring and Controlling via Web based Mobile or Desktop Application

Ranjan — Sun, 29 Jan 2012 09:41:22 +0000

Introduction

The idea of remote system monitoring and controlling application is to do some of the actions like ex: Shutdown, Reboot, Hibernate of the users systems remotely. The user can also make use of this application to query additional details of the systems.

Consider a scenario where you have a set of systems (Computers) and you want to control them from your mobile or any other desktop anywhere from the world. So this started as initial requirement of how we can implement the same to control numerous systems remotely.

Consider another scenario of how you can retrieve the information of a particular system remotely from your handheld devices or through desktops. By retrieving information, one may be interested in knowing the following

Machine Name
CPU information
Username
Domain Name
OS Version

Software Requirements Specification

Aim: The aim of this project is to provide a facility for the end user to remotely control their systems through desktop or mobile based web application.
Purpose: The purpose of this project is to implement a proof or concept of the same. And to show how easily it can be done with .NET technology
Scope: The scope of this project is very limited to controlling the system with few actions like Shutdown, Reboot, Hibernate, Logoff, Force close all applications etc. The user registration is done only at the client application and the it should be always running in-order to control the system remotely.
User Characteristics: The Following things are taken into consideration with this software development
1. Users can have multiple systems for controlling. There is absolutely no limit in the number of systems being controlled by the users.
2. The user can either control her/his systems through mobile or desktop based web application.
3. Each user can control his/her system only and don’t have access to control others systems.
4. Right now there is only one type of user of this system i.e. the System Administrators who will be using this system to control or fetch additional information of the system on their own interest.

Software and Hardware Requirement

Software Requirements:

Operating system: Microsoft Windows XP / Win 7 / Vista
.NET framework 4.0
SQL Server 2008

Hardware Requirements:

Processor Pentium 4
RAM- 256Mb
HDD-10GB

Technologies Used

Visual Studio.NET

The Client Application is developed with .NET C# Winform technology
The Server side web application is developed with ASP.NET MVC3 technology.

Internet based / Cloud based Microsoft SQL Server 2008

This software is designed with Software as a Service model with a common single cloud database which stores all the users and their system information.

How does the software functions?

Client Application:

When you run the client application for the first time, you will have to register yourself with the username and password. The same has to be provided as log on information which will authenticate the user in client and server applications.

Once authenticated, the user has to click on the Start button for continuous monitoring of the system behind the scene. The system registers by itself by putting an entry in database (this happens only for the first usage of the client app) so that the user can control that particular machine. When the user closes the client application, the entry in the database for that system will be deactivated. For subsequent usable of the client application, the system will be activated for monitoring and controlling.

Server Application:

It is a web based application, on requesting the user will be authenticated. The use has to provide the same username and password he/she has provided at the time of user registration in client app.

On successful authentication, the list of active systems will be displayed in a screen. The user can select one and perform the actions like Shutdown, Reboot etc.

Database Entity Relationship Design Diagram

M-TICKET – Mobile Booking

chitra — Wed, 24 Aug 2011 11:09:00 +0000

Chapter 1: INTRODUCTION

Nowadays SMS or Short Messaging Service is a major communication alternative. Also, in this modern world all the facilities should be available at our fingertips whenever required, wherever we are. So we thought of developing the “SMS based movie ticket reservation”. The main purpose of our project named “M-TICKET – Mobile Booking” is to make the ticket reservation simple and easy.

In the counter based movie ticket reservation, the user has to go to the counter and stand in a queue to reserve the ticket which is time consuming. Also, in the Online reservation the user should have the internet facility. Compared with these systems of ticket reservations, our system makes the reservation easy and quick.

In this application, the user can use his cell phone to send SMS to reserve the movie tickets. Also, he can get the movie updates from time to time through his Cell Phone in the form of SMS.

We try to implement this concept in small way using SMS technology. Here we show how to access the movie information that is stored in the database and reserve the ticket just by sending an SMS from your cell phone to SMS server and get back the required information on your Cell Phone.

Chapter 2: SOFTWARE REQUIREMENTS SPECIFICATION

2.1 Aim:

The aim of our project named “M-TICKET – Mobile Booking” is to develop a software which helps the user to reserve movie tickets just by sending an SMS. To access this software, the user need not load any application to his cell phone or he need not have internet facility. He needs to just send an SMS in a prescribed format to reserve the ticket.

2.2 Purpose:

The purpose of our project is to make ticket reservation simple and easy and to provide a cheaper way of reserving the ticket just by sending an SMS.

2.3 Scope:

This project will provide a simple way to reserve tickets. A user can reserve the tickets in two ways- SMS based reservation and counter based reservation. For the SMS based reservation the user has the facilities to register his mobile phone, reserve the tickets, request for movie updates, cancel the tickets and unregister his mobile number. The user will get an appropriate reply through SMS to his cell phone. The user can also come to the counter to reserve the tickets. The payment can be done either through credit card or in the counter.

2.4 User Characteristics:

A customer will be having the certain requirements that must be provided by the system. Hence at the initial stage of the software development, a requirement analysis is performed to identify the needs of the customer. Our software is movie ticket reservation software which can be used in any theatre. To make it applicable in any of the theatres, we have taken into consideration the following requirements:

Theatre can have any number of screens.
Each screen can have any number of classes.
The price of the ticket is based on the class.
Each class can have any number of rows.
Each row can have any number of seats.
Each screen can have certain number of shows per day.
The screen can have different movies in different shows.
Two different screens can have different movies running simultaneously.

There are two types of users of the system. One is the customer and the other is the administrator

The Customer should be able to

- Register with his username and credit card number (optional)
- Reserve the ticket
- Make payment either through credit card or through the counter
- Cancel some or all the reserved tickets
- Get the movie updates of the theatre
- Unregister

The Administrator should be able to

- Register himself by giving his details along with the user name and password
- Login into the system
- Update his information
- Change password
- View seat status
- Edit the screen, class, price, movie, seat, show time information etc.
- Perform reservation, cancellation, payment operations in the counter
- Delete the old records

The reservation can be done only for 2 days – today and tomorrow. After reserving the ticket, the payment must be done and the ticket must be collected before 45 minutes of the show. Otherwise the reserved tickets will be cancelled.

There are 2 modes of reservation:

Counter based reservation
SMS based reservation

In the counter based reservation, seats are reserved manually by the Administrator. The customer should come to the counter, and specify the movie, date of show, time of show, class and the number of seats required. Then the Admin will check the availability of seats. If the seats are available, then the reservation will be done and the reservation code will be given to the customer. The customer can also cancel some or all the reserved seats.

In the SMS based system, all the operations are done automatically by the system. The customer should first register himself through the SMS. A registered customer can reserve the seats, cancel the reserved seats, request for the movie updates of the theatre and unregister all by sending the SMS in the specified format.

Two payment options are available to the registered customer:

Credit card based payment
Counter payment
When the reservation code is entered, the system should automatically show the amount of money needs to be paid.

2.5 Feasibility Study:

The process of analyzing the requirements of the system should always be preceded by the feasibility study of the system to be developed. It involves knowing what the system must achieve and whether these requirements can be satisfied with the current software and hardware technologies available.

The SMS based reservation software should provide the following basic features:

It must enable designing the user friendly front end.
It must provide means to connect to the database where the data is stored.
It should provide the means to transfer the messages between the cell phone and the computer system.
It should provide the means to process the message.

Considering all these needs, we can use Visual Basic.NET Framework to develop the front end and to process the message, MS-SQL Server to create the database, ADO objects to database connectivity and ATtention (AT) commands to transfer the messages between the cell phone and the computer.

Feasibility of the system:

The feature required in the software	Technology used to provide the feature
1. User friendly front end	VisualBasic .NET Framework
2. Database	MS-SQL Server
3. Database connectivity	ADO.NET objects
4. Message transfer between cell phone and computer	ATtention (AT) commands

2.6 Software Requirements:

Operating system: Microsoft Windows XP
Microsoft Visual Studio 2005
SQL Server 2005

2.7 Hardware requirements:

Processor Pentium 4
RAM- 256Mb
HDD-10GB
USB cable
Cell Phone

We will try to implement our project in a small way using SMS technology. Here we will show how to access the movie information stored in the database and reserve the ticket just by sending an SMS from your cell phone to SMS server and get back the required information on your Cell Phone. This application is implemented using VB.NET (Visual Basic .NET) as front end, MS-SQL Server as backend, ADO.NET for connectivity and the AT (ATtention) commands are used to transfer the messages from the cell phone to the computer through Comport.

Design and Verification of a PCI Based System using SystemC

Ranjith — Sun, 06 Feb 2011 08:04:16 +0000

Study about PCI Bus protocol before reading this project

1.1. System Design Introduction:
The present design is of a PCI based system consisting of three Masters and six Slaves. The masters communicate with the slaves using the PCI bus. The transaction is governed by the standard PCI bus transaction protocol. Whenever a master needs to communicate with any of the slaves through the PCI bus it requests for the control of the bus to the arbiter. The arbiter grants the master control of the bus depending on the availability of the bus and also on the requesting master’s priority. Once the master is granted control of the bus it starts the transaction by keeping the address of the target slave along with the transaction command. The address thus kept is read by all the slaves. This address is decoded by each of them individually. If the address belongs to them, that particular slave acknowledges the call. This is the address phase. The address phase lasts for just one clock cycle. Once the address phase is finished the data phase begins. If none of the slaves acknowledge the masters call then the master aborts the transaction.

The design verification is done using the testbench. The testbench is connected to the design using channels. The testbench tells the master what transaction is to be carried out and also inspects the data sent and received at the slave end. The block diagram is as given below.

General system block diagram

1.2. System

This section describes the working of the present design in brief. The block diagram of the system is as shown in below fig.

The DUT consists of Master module, Slave module, Arbiter module, Channel declaration and a top file which connects all the instances. Just one module of the master is defined and three objects are instantiated in top file. The same is being done with the slave module, just one slave module is being described and six objects are being instantiated from it in the top file.

The interconnections of all the modules are shown below. Each of the blocks is as described below.

General block diagram of the system

1.2.1 Master :
In the fig5.2 Master 1, Master 2 and Master 3 are all instances of the main module Master. The master receives packets of information from the test bench. This packet contains information regarding address of the destination, command definition and data. It also tells which master is to carry out the transaction. Once the master receives and decodes this packet it begins the required transaction.

Whenever a master has to undertake any transaction it first requests the arbiter for permission to take over the bus. Once the arbiter has granted the request, the master begins the required transaction.

The transaction begins with the master by asserting FRAME#. At the same time it keeps the address of the destination along with the transaction command definition. This is called ‘Address phase’. Once the address phase is done, the master asserts IRDY# and waits for the addressed slave to asserts DEVSEL#. If DEVSEL# is not asserted until the latency time runs out, the master ends the transaction with ‘Master abort’. If DEVSEL# is asserted the ‘Data phase’ begins. The data transaction between the master and slave takes place only when both IRDY# and TRDY# are asserted. As soon as TRDY# is asserted the master places the data on the AD lines during write transaction and during read transaction it reads the data from the bus after assertion of TRDY#. All signal assertions are done during the negative clock edge and are sampled during the positive clock edge. Care should be taken to see that the signals or data on the AD lines are stable during the positive edge of the clock pulse. The master can make the target wait for the data by deasserting the IRDY# signal.

Parity of AD, C/BE and PAR are checked regularly during each phase (data/address). During write transaction the master keeps the data on the multiplexed AD lines during one clock cycle and keep its parity during next clock cycle. During a read transaction the master checks for parity during the second clock cycle of the received data. If parity is found to be odd, it asserts the PERR# during the third clock cycle. This will result in ‘Master abort’.

In some cases the slave might be ready to carry out the present transaction that the master is requesting. During such a situation the master should end the transaction and retry after some time, but with the same address and command definition. The end of the transaction is marked by deassertion of FRAME#. The FRAME# might be deasserted after the last data has been transferred or just before the last data phase. Once all the data are transferred or received IRDY# is deasserted.

1.2.2 Slave :

In fig 5.2, Slave 1 – Slave 6 are the instances derived from the module called Slave. Each slave is assigned with a unique address that is used by the master to notify which slave it wants to interact with. The address is assigned while the object of slave is instantiated.

Before a slave undertakes nay memory or i/o based transactions its configuration space should be configured. In the present design this is done by any of the masters. Rest of the transactions are done depending on the content present in the configuration space. In our design we have implemented the configuration space using a structure. Once the slave has been configured it is ready to undertake any of the transactions.

The transaction begins when the master asserts FRAME#. During the address phase all the slaves read the address placed on the AD lines. In the same clock pulse each slave compares the read address with the content stored in the base address registers present in the configuration space. If the address belongs to any particular slave it acknowledges by asserting DEVSEL# in the next clock cycle. If the slave is ready to undertake the required transaction it asserts TRDY# along with DEVSEL#. But, if the slave is not ready to undertake the required transaction it asserts STOP# instead of TRDY# telling the master to retry the same try the same transaction after some time. Once TRDY# and IRDY# are asserted the data transfer takes place. If IRDY# is not asserted then the slave has to wait until the master asserts it. The slave has to wait until the master asserts it. The slave can also make the master wait by deasserting TRDY# and asserting it only when it is ready to receive/send data.

The memory and i/o space are implemented in the monitor. The slave extracts the address of the destination location from the address that is being sent from the maser and sends it to the monitor along with the data to be stored or retrieved.

In case of blast transaction if the slave is not able to continue with any more transaction it aborts the transaction. There are three ways a slave can abort a transaction – ‘Target Abort’, ‘Target abort with data’ and ‘Target abort without data’. In ‘Target abort’, the slave needs to abort if just asserts STOP# and at the same time deasserts DEVSEL# as well as TRDY#. In ‘Master abort without data’, as soon as STOP# is asserted only TRDY# is deasserted. DEVSEL# is deasserted only clock pulse after FRAME# is deasserted. In this case no data is transmitted one the STOP# is asserted. During ‘Target abort with data’, one data phase is allowed after STOP# is asserted. After one data phase has been completed TRDY# is deasserted. The rest of the deassertion are similar to that of target abort without data.

Parity of AD, C/BE and PAR are checked regularly during each phase (data/address). During read transaction the slave keeps the data on the multiplexed AD lines during one clock cycle and keeps its parity during next clock cycle. During a write transaction the slave checks for parity during the second clock cycle of the received data. If parity is found to be odd, it asserts the PERR# during the third clock cycle. This will result in ‘Target abort’.

1.2.3 Arbiter :

Since the PCI Bus accommodates multiple masters — any of which could request the use of the bus at any time — there must be a mechanism that allocates use of bus resources in a reasonable way and resolves conflicts among multiple masters wishing to use the bus simultaneously.

The arbiter is used to grant permission to the requesting master. When more than one master is requesting, the arbiter takes in all the requests and decides which master should be granted the permission of using the bus. The arbiter selects the master depending on its priority i.e. the requesting master with the highest priority is selected first by asserting the GNT# signal. In case of multiple requests the grant is given using ‘Round Robin’ logic. The grant is given by asserting the respective GNT(G1,G2,G3) signal. Every master is connected to the arbiter by individual REQ(R) and GNT(G) signals as seen in the fig 1.2. REQ# and GNT# are unique on a per master basis allowing the arbiter to implement a bus fairness algorithm. Arbitration in PCI is “hidden” in the sense that it does not consume clock cycles.

Sudoku Solver using C++

Ranjith — Thu, 20 Nov 2008 10:01:11 +0000

You have seen it in the news papers, you have seen it in the magazines or in the web sites, you might have sat hours ‘n hours to solve it. Yes, it is the king of all number puzzles, it is “SUDOKU”.

We bring to you the ultimate solution for all your struggles, The SUDOKU Solver.

As you know, now a days mathematical puzzle-SUDOKU is in boom all over the world. Sudoku is a 9X9 matrix with nine 3×3 sub-matrices, that we need to fill by entering the numbers from 1 through 9, without the repetition of the a number in the rows, columns or in the sub matrices.

Figure: 1- Sudoku Problem

We can get the Sudoku puzzle in ease by different means, as discussed. You might have struggled a lot to solve the same. To be true, even me too. Here I developed a fast and robust package, that solves the puzzles, that are not easy to solve by hands. It will solve the Sudoku entered in fraction of a milli-second and will display the solved result.

Figure: 2 - Sudoku Result

Click here to download the executable files

When the code executes, a blank Sudoku will be displayed with 9×9 red boxes. The user is needed to enter the numbers corresponding to the source puzzle (Figure 1). To enter this, user should use the arrow keys to cruse to the required box. The selected box will be highlighted with a blue boundary. You have to enter the number through the keyboard. Once you have done entering all the numbers in the puzzle just hit the ‘Enter’ key on the keyboard till you get the solved result (Figure 2). If the Sudoku cannot be solved by this program a message will be displayed telling that the given puzzle cannot be solved.

Shuffle game using C++

Ranjith — Thu, 20 Nov 2008 09:51:40 +0000

If you think playing a game as this is a child’s play, try a hand on this and think again. Its all about how you plan on making your next move. All the best, have fun.

Here is a simple game developed in C graphics which is called ‘The Shuffle Game’. We believe u have already played many of such games where in you need to arrange scrambled pieces of a picture, alphabets or numbers. In the present program you have been given a matrix of 16 squares of which 15 are assigned with 15 different numbers and 1 is left out blank (empty space for movement of the remaining boxes) which are all shuffled. All you have to do is arrange these numbers in order as shown in the picture given below. The number of moves and the number that have been arranged by you in the proper position will be continuously displayed on the screen. The controls are as given below.

Controls:

You can move the boxes by using the arrow keys on your keyboard or by simply clicking on the box which you want to move into the empty space. While using the arrow keys, if you want to move the box left to the empty space just hit the left arrow button. Similarly you can move the boxes on the top, bottom or right of the empty box by hitting the up, down or right arrows respectively. In case you want to restart the game all over again just click the ‘RESTART’ button or if you want to quit the game, all you have to do is to click the ‘EXIT’ button on the screen.

Shuffle game using C++

Source code:

#include
#include
#include
#include
#include
#include
#include
union REGS in,out;
void *buf;
int size,count=0,px,py,rnd[4][4],correct=0;

float octave [7]={130.81,146.83,164.81,174.61,196,220,246.94};

int callmouse()
{ in.x.ax=1;
int86(51,&in,&out);
return 1;

}
void mouseposi(int &xpos,int &ypos,int &click)
{ in.x.ax=3;
int86(51,&in,&out);
click=out.x.bx;
xpos=out.x.cx;
ypos=out.x.dx;
return ;
}
int mousehide()
{
in.x.ax=2;
int86(51,&in,&out);
return 1;
}
void done(void)
{
int i,j;
mousehide();
j=0;
int n;
for(i=1;i<=15;i++)
{
n=random(7);
sound(octave[n]*4);
delay(300);
setfillstyle(1,2);
bar(42+j,425,68+j,455);
setfillstyle(1,0);
bar(68+j,425,72+j,455);
j=j+29;
}
nosound();
delay(1000);
for(j=0;j<382;j+=2)
{
for(i=0;i<575;i+=2)
{
putpixel(26+i,25+j,4);
putpixel(26+i,460-j,4);
putpixel(25+j*3/4,28+i*3/4,2);
putpixel(595-j*3/4,458-i*3/4,2);
delay(0);
}
}
delay(1000);
settextstyle(1,0,5);
setcolor(14);

outtextxy(320,300,”http://electrofriends.com”);
outtextxy(321,300,”http://electrofriends.com”);
delay(500);
getch();
exit(0);
}
checknum(int mat[4][4])
{
int k=0,i,j;
correct=0;
for(i=0;i<=3;i++)
{
for(j=0;j<=3;j++)
{
k++;
if(k==mat[i][j])
correct++;
}
}
gotoxy(10,11);
printf(“NUMBERS ARE IN CORRECT POSITION IS ..: %d “,correct);
if(correct==15)
{
bar(130,40,480,80);
settextstyle(1,0,4);
outtextxy(300,60,”CONGRAGULATIONS !”);
done();
}
else
{
bar(20,415,480,463);
j=0;
for(i=1;i<=correct;i++)
{
setfillstyle(1,1);
bar(42+j,425,68+j,455);
setfillstyle(1,0);
bar(68+j,425,72+j,455);
j=j+29;
}
}
return 0;
}

void move(int &a,int &b,int &c,int &d,int &w,int &x,int &y,int &z,int &num)
{
if(a>192 && b>190 && c<403 && d<404)
{
sound(600);
count++;
gotoxy(10,9);
printf(“NUMBER OF MOVES..: %d “,count);
mousehide();
size=imagesize(a,b,c,d);
free(buf);
buf=malloc(size);
getimage(a,b,c,d,buf);
bar(a,b,c,d);
putimage(w,x,buf,COPY_PUT);
w=a;
x=b;
y=c;
z=d;
if(num==1)
{
rnd[px][py]=rnd[px+1][py];
rnd[px+1][py]=0;
px++;
}
else if(num==2)
{
rnd[px][py]=rnd[px-1][py];
rnd[px-1][py]=0;
px–;
}
else if(num==3)
{
rnd[px][py]=rnd[px][py+1];
rnd[px][py+1]=0;
py++;
}
else if(num==4)
{
rnd[px][py]=rnd[px][py-1];
rnd[px][py-1]=0;
py–;
}
checknum(rnd);
callmouse();
delay(40);
nosound();
}
return ;
}

main()
{
int a1,b1,cl,a,b,c,d,w,x,y,z,key,p=0,q=0;
int g=DETECT,m,ext=0,rst=0,rx,ry,num,i,j;
initgraph(&g,&m,”c:\\TC\\bgi”);
randomize();
gotoxy(50,9);
printf(“http://electrofriends.com”);

do
{
correct=0;
count=0;
gotoxy(10,9);
printf(“NUMBER OF MOVES..: %d “,count);

gotoxy(10,11);
printf(“NUMBERS ARE IN CORRECT POSITION IS ..: %d “,correct);
setfillstyle(SOLID_FILL,4);
setcolor(15);
for(j=200;j<360;j+=50)
{
for(i=200;i<365;i+=50)
{
rectangle(j-1,i-1,j+46,i+46);
bar(j,i,j+45,i+45);
}
}
rectangle(192,190,403,404);
settextstyle(1,0,3);
for(i=0;i<=3;i++)
{
for(j=0;j<=3;j++)
{
rnd[i][j]=0;
}
}
for(i=0;i<=15;i++)
{
do
{
rx=random(4);
ry=random(4);
} while(rnd[rx][ry]);
rnd[rx][ry]=i;
}
char ab[10];
settextjustify(CENTER_TEXT,CENTER_TEXT);
q=p=0;
for(i=0;i<=3;i++)
{
for(j=0;j<=3;j++)
{
if(rnd[i][j]!=0)
{
sprintf(ab,”%d”,rnd[i][j]);
outtextxy(225+p,217+q,ab);
}
else
{
setfillstyle(1,0);
px=i;py=j;
bar(199+p,199+q,247+p,247+q);
w=199+p;
x=199+q;
y=247+p;
z=247+q;
}
p+=50 ;
}
p=0;
q+=50 ;
}
bar(130,40,480,80);
bar(10,425,480,455);
setfillstyle(SOLID_FILL,4);
rectangle(534,374,591,411);
bar(535,375,590,410);
outtextxy(561,390,”EXIT”);
rectangle(484,419,591,456);
bar(485,420,590,455);
outtextxy(538,433,”RESTART”);
setcolor(4);
rectangle(10,10,610,470);
rectangle(15,15,605,465);
setcolor(14);
rectangle(12,12,607,467);
settextstyle(1,0,4);
outtextxy(300,60,”SHUFFLE GAME”);
line(150,85,450,85);

j=0;
delay(1500);
int n;
for(i=1;i<=15;i++)
{
n=random(7);
sound(octave[n]*4);
delay(300);
setfillstyle(1,2);
bar(42+j,425,68+j,455);
setfillstyle(1,0);
bar(68+j,425,72+j,455);
j=j+29;
}
nosound();
setfillstyle(SOLID_FILL,0);
bar(30,425,480,455);
settextstyle(2,0,5);
outtextxy(250,425,”YOU CAN USE ARROW BUTTONS OR MOUSE TO MOVE BLOCKS.”);
outtextxy(250,450,” PRESS ANY KEY TO START……..” );

getch();
bar(20,415,480,463);
callmouse();
do
{
gotoxy(10,20);
mouseposi(a1,b1,cl);
if(a1>w && a1x+50 && b1 {
num=1;
move(w,x+50,y,z+50,w,x,y,z,num);                   //up
}
if(a1>w && a1x-50 && b1 {
num=2;
move(w,x-50,y,z-50,w,x,y,z,num);              //down
}
if(a1>w+50 && a1x && b1 {
num=3;
move(w+50,x,y+50,z,w,x,y,z,num);                   //left
}
if(a1>w-50 && a1x && b1 {
num=4;
move(w-50,x,y-50,z,w,x,y,z,num);                   //right
}
if(kbhit())
{
key=getch();
switch(key)
{
case 72: num=1;
move(w,x+50,y,z+50,w,x,y,z,num);           //up
break;
case 80: num=2;
move(w,x-50,y,z-50,w,x,y,z,num);           //down
break;
case 75: num=3;
move(w+50,x,y+50,z,w,x,y,z,num);          //left
break;
case 77: num=4;
move(w-50,x,y-50,z,w,x,y,z,num);          //right
break;
}
}

if((a1>535 && a1<590 && b1>375 && b1<410 && cl==1) || key==27)
done();
rst=0;
if(a1>485 && a1<590 && b1>420 && b1<455 && cl==1 )
rst=1;
} while(rst==0);
} while(rst!=0);
closegraph();
}

If you find difficult to compile the code, Download source code, executable file and supporting files here.

You have seen it, you have played it, you have seen the source code. Now its your turn to show us how creative your thinking is!! We hope you have got all the ideas that you need to build such a game with C graphic. If you are successful do send us a copy of the game. We will see through that your name comes on this site.

Device Switching Using PC’s Parallel Port

Ranjith — Thu, 20 Nov 2008 09:30:15 +0000

Imagine the convenience, if we could control different devices at home/industry by using a single PC. Our project aims at the same and could be used to control the printer power, loads & other household electrical appliances. The circuit comprises decoder, inverter, latch & relay driver sections. To control these equipments we are using PC’s Parallel port. The program of controlling is written in C language. It is compiled using Turbo C compiler.

The project though a bit expensive, is very efficient in control of real world peripherals.

Contents:

INTRODUCTION
PARTS LIST
BLOCK DIAGRAM
COMPONENT DESCRIPTION
- Parallel Port
- IC 74LS154
- IC 74LS74
- 1C 74 LS05
- 1C ULN 2803
- Relay
CIRCUIT DESCRIPTION AND WORKING
SOFTWARE PROGRAM
CONCLUSION

INTRODUCTION:

The PC parallel port is an expensive yet a powerful platform for implementing projects dealing with the control of real-world peripherals. This port can be used to control the printer as also household and other electrical appliances. The computer program through the interface circuit controls the relays, which, in turn, switch the appliances on or off.

The parallel port has 12 outputs including 8 data lines and 4 control lines. The circuit described here can be used to control up to 255 electrical appliances using only eight data lines from the parallel port. Besides, the software program allows the users to know the current status of the loads.

PARTS LIST:

Semiconductors:
ICl, IC2, IC3               – 74LS154 l-of-16 decoder
IC4, IC5, IC6              – 74LSO5 inverter
IC7-ICI4                     – 74LS74 D-type flip/flop
ICI5, IC16                   – ULN2803 octal Darlington array driver
Misc.
Power supply               – 5V regulated DC, 12VregulatedDC
Relay                           – 12V,200-ohm, lC/O SPDT

BLOCK DIAGRAM:

The block diagram in Fig. 1 depicts the main components of the switching system for 255 electrical loads using PC. The control command to switch on/off the appliances is given through the keyboard. The software program scans the input and as per the input command, the data is available at the parallel port.

FIg 1. Block Diagram

Out of eight bits, first four bits (D0 through D3) are data signal bits and the remaining four bits (D4 through D7) are used as control signals. Control signals are given to decoder 1. The output of decoder 1 is given to Enable pins of decoders 2 and 3. Data signals are given to both decoders 2 and 3. The outputs of decoders 2 and 3 are inverted and fed to a D-type flip/flop that is used to latch the data. The latched data output is given to relay driver ICs ULN2803. The relay drivers drive the relays for switching the appliances.

COMPONENT DESCRIPTION:

1. THE PARALLEL PORT:

The parallel port or line printer terminal (LPT) port is a 25-pin D-type female connector available at the back of your PC. A basic IBM PC usually comes with one or two LPT ports. The original parallel port, called standard parallel port (SPP), is a bundle of three ports (or registers), namely, data port, status port, and control port. Pins 2 through 9 form the 8-bit data port. This port is purely a write-only port. This means it can be used only to output some data through it. Pins I, 14, 16, and 17 form the control port, which is capable of reading/writing. Pins 10 through 13 and pin 15 together form the status port. The status port is a read-only port. The details of 25-pin parallel port are given in Table 1.

TABLE 1: Parallel Port Pin Details

The base address of the first parallel port (LPT1) is 0378 in hexadecimal (hex) notation (or 888 in decimal notation). The base address of the second parallel port (LPT2) is 0278 in hex. In this project, we’ve used only LPT1.

2. DM74LS154 : 4-LINE TO 16-LINE DECODER / DE-MULTIPLEXER:

Each of these 4-line-to-16-line decoders utilizes TTL circuitry to decode four binary-coded inputs into one of six-teen mutually exclusive outputs when both the strobe inputs, GI and G2, are LOW. The de-multiplexing function is performed by using the 4 input lines to address the out-put line, passing data from one of the strobe inputs with the other strobe input LOW. When either strobe input is HIGH, all outputs are HIGH. These de-multiplexers are ideally suited for implementing high-performance memory decoders.
All inputs are buffered and input clamping diodes are provided to minimize transmission line effects and thereby simplify system design.

3. 74LS74 : DUAL D-TYPE POSITIVE-EDGE-TRIGGERED FLIP-FLOPS:

These devices contain two independent D-type positive-edge triggered flip-flops. A low level at the preset or clear inputs sets or resets the outputs regardless of the levels of the other inputs. When preset and clear are inactive (high), data at the D input meeting the setup time requirements are transferred to the outputs on the positive-going edge of the clock pulse. Clock triggering occurs at a voltage level and is not directly related to the rise time of the clock pulse. Following the hold time interval, data at the D input may be changed without affecting the levels at the outputs.

4. HEX INVERTER:

It is used for inversion of input signal. Since outputs from the de-multiplexers are active low, we invert them. This IC has 6 not-gates and hence called a hex-inverter.

5. ULN-2803 : OCTAL PERIPHERAL DRIVER ARRAYS:

The eight NPN Darlington connected transistors in this family of arrays are ideally suited for interfacing between low logic level digital circuitry (such as TTL, CMOS or PMOS/NMOS) and the higher current/voltage requirements of lamps, relays, printer hammers or other similar loads for a broad range of computer, industrial, and consumer applications. All devices feature open-collector outputs and freewheeling clamp diodes for transient suppression. The ULN2803 is designed to be compatible with standard TTL families while the ULN2804 is optimized for 6 to 15volt high-level CMOS or PMOS.

6. RELAYS:

The relay is a device by means of which an electrical circuit can be controlled (opened or closed) by sensing a change in the circuit in which it is connected. The relays can be either electromagnetic or electronic. In this circuit the electromagnetic relay is used to connect or disconnect the supply to the appliance to be controlled. It works on the principle of electromagnetic attraction and electromagnetic induction. These relays can be actuated by AC or DC quantities. In these relays there are one or more coils, movable elements, contact systems etc.

Lexical Analyzer

Ranjith — Thu, 20 Nov 2008 07:37:32 +0000

Lexical analyzer converts stream of input characters into a stream of tokens. The different tokens that our lexical analyzer identifies are as follows:

KEYWORDS: int, char, float, double, if, for, while, else, switch, struct, printf, scanf, case, break, return, typedef, void

IDENTIFIERS: main, fopen, getch etc

NUMBERS: positive and negative integers, positive and negative floating point numbers.

OPERATORS: +, ++, -, –, ||, *, ?, /, >, >=, <, <=, =, ==, &, &&.

BRACKETS: [ ], { }, ( ).

STRINGS : Set of characters enclosed within the quotes

COMMENT LINES: Ignores single line, multi line comments

For tokenizing into identifiers and keywords we incorporate a symbol table which initially consists of predefined keywords. The tokens are read from an input file. If the encountered token is an identifier or a keyword the lexical analyzer will look up in the symbol table to check the existence of the respective token. If an entry does exist then we proceed to the next token. If not then that particular token along with the token value is written into the symbol table. The rest of the tokens are directly displayed by writing into an output file.

The output file will consist of all the tokens present in our input file along with their respective token values.

INTRODUCTION:

Lexical analysis involves scanning the program to be compiled and recognizing the tokens that make up the source statements Scanners or lexical analyzers are usually designed to recognize keywords , operators , and identifiers , as well as integers, floating point numbers , character strings , and other similar items that are written as part of the source program . The exact set of tokens to be recognized of course, depends upon the programming language being used to describe it.

A sequence of input characters that comprises a single token is called a lexeme. A lexical analyzer can insulate a parser from the lexeme representation of tokens. Following are the list of functions that lexical analyzers perform.

Removal of white space and comment :

Many languages allow “white space” to appear between tokens. Comments can likewise be ignored by the parser and translator , so they may also be treated as white space. If white space is eliminated by the lexical analyzer, the parser will never have to consider it.

Constants :

An integer constant is a sequence of digits, integer constants can be allowed by adding productions to the grammar for expressions, or by creating a token for such constants . The job of collecting digits into integers is generally given to a lexical analyzer because numbers can be treated as single units during translation. The lexical analyzer passes both the token and attribute to the parser.

Recognizing identifiers and keywords :

Languages use identifiers as names of variables, arrays and functions. A grammar for a language often treats an identifier as a token. Many languages use fixed character strings such as begin, end , if, and so on, as punctuation marks or to identify certain constructs. These character strings, called keywords, generally satisfy the rules for forming identifiers.

SYSTEM ANALYSIS:

The operating system used is MS-DOS.

MS-DOS : The MS-DOS is a single user, single process, single processor operating system. Due to the confinement of the device dependent code into one layer, the porting of MS-DOS has theoretically been reduced to writing of the BIOS code for the new hardware. At the command level it provides a hierarchical file system, input output redirection, pipes and filters. User written commands can be invoked in the same way as the standard system commands, giving the appearance as if the basic system functionality has been extended.

Being a single user system, it provides only file protection and access control. The disk space is allocated in terms of a cluster of consecutive sectors. The command language of MS-DOS has been designed to allow the user to interact directly with the operating system using a CRT terminal. The principal use of the command language is to initiate the execution of commands and programs. A user program can be executed under MS-DOS by simply typing the name of the executable file of the user program at the DOS command prompt.

The programming language used here is C programming

SYSTEM DESIGN:

Process:

The lexical analyzer is the first phase of a compiler. Its main task is to read the input characters and produce as output a sequence of tokens that the parser uses for syntax analysis. This interaction, summarized schematically in fig. a.

fig a. Process of lexical analyzer

Upon receiving a “get next token “command from the parser, the lexical analyzer reads the input characters until it can identify next token.

Sometimes , lexical analyzers are divided into a cascade of two phases, the first called “scanning”, and the second “lexical analysis”.

The scanner is responsible for doing simple tasks, while the lexical analyzer proper does the more complex operations.

The lexical analyzer which we have designed takes the input from a input file. It reads one character at a time from the input file, and continues to read until end of the file is reached. It recognizes the valid identifiers, keywords and specifies the token values of the keywords.

It also identifies the header files, #define statements, numbers, special characters, various relational and logical operators, ignores the white spaces and comments. It prints the output in a separate file specifying the line number .

BLOCK DIAGRAM:

fig b. Block diagram of the project

Doctor’s Diary using JSP Technology

Ranjith — Thu, 20 Nov 2008 07:08:41 +0000

This is the model software from electrofriends.com. We successfully implemented the need and necessary concepts of a doctor, for his stand alone clinic. We hope this software package will definitely help the students, to get an idea about their academic projects.

For a doctor, it is absolutely difficult to keep all the details of his patients in such a manner that is easily retrievable in hardware domain, i.e. by keeping a booklet or file folder. So, it is the time to switch for a doctor from classic hardware book-keeping to the software domain, by storing all the details in Computer memories, databases, which are easy accessible at any time, every time. Before that, it should be implemented as the Academic projects in educational institutions. By that way, we are trying to help the students, by making the things easier. The most emerging technology, J2EE(JSP), SQL, JavaScript are the backbone of this project. This is the outcome of software professionals, from the knowledge city- Bengalooru. A student can get these codes and can find how the real time practical needs are made in such a sophisticated form and such a short size. The GUI developed is user- friendly and minimum computer knowledge is sufficient to handle the software, we can expect that now from doctor’s side on these days.

You can find the inner feature of the Doctor’s Diary, with static images of the Dynamic pages.

This software has mainly 3 modules.

Entering the New patient to the clinic.
Manipulating with Old patient details.
Setting the personal details of Doctor.

Figure 1: Main page of Doctor

Here are the brief descriptions of each field. In the left side of the home page we have an array of features of the software, in the black background.

1. New Patient:

The very first option in the features’ list is the New Patient. Clicking the option will lead to the corresponding page in the main page of the software which will input the new patient details to the database (Shown in figure 2). An auto incrementing number display named Patient Id, will be the unique identification number for the patient. The Doctor can enter the Patient Name, address and other details. He also can enter the Symptoms and the Medicine Prescribed for the patient. These details are getting stored in the database under today’s date.

Figure 2: New patient page of Doctor

Induction furnace control system

Ranjith — Thu, 20 Nov 2008 05:53:37 +0000

This project is an attempted step towards resolving the manual problems in controlling Induction Furnace and provides control for it, using Artificial Intelligence at a very small scale. The project deals with a simple aspect of giving information about the Induction Furnace and their control. Initially it provided a system release manual power as much as possible from control of Induction Furnace and can be handled with merely one person, if needed. Etymologically, idea of this project is to provide security to whole system of controlling in case of any emergency.

In project we will develop a system, which can control Induction furnace without any help of human side. The system will be capable of delivering message of over heating of blast furnace and can take decisions accordingly.

The project is prepared in order to control the “INDUCTION FURNACE” in the best and easiest possible way. This system can emerge as the pioneer step in implementation of “ARTIFICIAL INTELLIGENCE” in control of induction furnace

Induction furnace :

The induction furnace plays an important role in steel plants producing high quality and stainless steels. In the field of iron casting and foundries the induction furnace is known as a standard.

Induction furnaces offer certain advantages over other furnace systems. They include:

Higher Yield: The absence of combustion sources reduces oxidation losses that can be significant in production economics. This can amount to 2 to 7 percent yield savings in aluminum melting.

Faster Start up: Full power from the power supply is available, instantaneously, thus reducing the time to reach working temperature. Cold charge-to-tap times of one to two hours are common.

Automatic Operation: Precise automatic control of power reduces furnace manpower to that required only for charging, tapping, and metallurgical measurements.

parallel port

How to connect circuits to parallel port ?

PC parallel port is 25-pin D-shaped female connector in the back of the computer. It is normally used for connecting computer to printer, but many other types of hardware for that port is available today. Not all 25 are needed always. Usually you can easily do with only 8 output pins (data lines) and signal ground. I have presented those pins in the table below. Those output pins are adequate for many purposes.

pin : 2 3 4 5 6 7 8 9
function : D0 D1 D2 D3 D4 D5 D6 D7

Pins 18, 19, 20, 21, 22, 23, 24 and 25 are all ground pins.

Those data pins are TTL level output pins. This means that they put out ideally 0V when they are in low logic level (0) and +5V when they are in high logic level (1). In real world the voltages can be something different from ideal when the circuit is loaded. The output current capacity of the parallel port is limited to only few mill amperes.

Reading the input pins in parallel port :

PC parallel port has 5 input pins. The input pins can be read from the I/O address LPT port base address + 1.
The meaning of the buts in byte you read from that I/O port:

D0: state not specified
D1: state not specified
D2: state not specified
D3: state of pin 15 (ERROR) inverted
D4: state of pin 13 (SELECTED)
D5: state of pin 12 (PAPER OUT)
D6: state of pin 10 (ACK)
D7: state of pin 11 (BUSY) inverted

in = inportb(0×379); or in = inp(0×379);

Where N is the data you want to output. The actual I/O port controlling command varies from compiler to compiler because it is not part of standardized C libraries.

Interrupts :

Most parallel ports are capable of detecting interrupt signals from a peripheral. The peripheral may use an interrupt to announce that it’s ready to receive a byte, or that it has a byte to send. To use interrupts, a parallel port must have an assigned interrupt-request level (IRQ). Conventionally, LPT1 uses IRQ7 and LPT2 uses IRQ5. But many sound cards use IRQ5, and because free IRQ levels can be scarce on a system, even IRQ7 may be reserved by another device. Some ports allow choosing other IRQ levels besides these two.

Many printer drivers and many other applications and drivers that access the parallel port don’t require parallel-port interrupts. If you select no IRQ level for a port, the port will still work in most cases, though sometimes not as efficiently, and you can use the IRQ level for something else.

By
Prabhat kumar thakur, Ramayan patel, Tarun kumar das, Vijay dashore, Shikha khare
Chhattrapati Shivaji Institute of Technology, Shivaji nagar, Durg, (C.G.)

Circuit diagrams and source codes are given in the next page.