Portable Media Player

To provide a media player interface on Bluetooth enabled mobile device. In this module there will be a media player to play songs on a desktop and its instance interface on mobile device from where we can control playback remotely.

Streaming with above media player. Streaming of any song will be done by media player when it gets a request from its counterpart player on mobile device to do so. With this a person can listen to any song from media player library by streaming done with Bluetooth protocol .

Aim :

1. To learn interaction between a desktop and a Bluetooth enabled mobile device.

2. To provide a virtual command prompt on mobile device to perform various tasks remotely.

3. To provide new user experience for music freaks so that they can take advantage of their giant music library (that’s on PC) from anywhere within range of class B Bluetooth (30 feet).

4. To learn about all the technical restrictions that a developer can face while learning mobile development using JAVA.

Recently, MP3 become popular in this generation. Most of the software companies develop so many types of player which support MP3 file (e.g. Winamp, Window Media Player, Real, RealOne, etc). But there is not all of the software which are suitable for all different users.

Pomp is basically a facility for music lovers to control playback of mp3 player right from there Bluetooth enabled phone. Without a phone , it can work as a standalone mp3-player on system. This mp3 player has inbuilt ID3 tag editor.

To achieve this we have chosen java as the implementing language because java is platform independent so what will get can be run on any platform.following java’s “Write once run everywhere” title.

Benefits of the system

1. Fast standalone mp3 player.

2. Save user time controlling playback from their mobile doing anything else.

3. Facility to save play-list files.

4. ID3 tag editor to edit mp3 metadata.

5. Made in java, hence is extensible, platform independent, robust.

Objectives

The main purpose of POMP is to produce an audio (MP3) player that can be suitable for different level user. The goals of POMP are:

Provide a platform to play audio (MP3) file

Provide different interfaces for different level users

Support playlist (M3U) file

Provide playlist management

General Requirements

The following general requirements were laid out for our project named POMP:

• The player can play audio (MP3) file 7

• The player can provide some necessary function of playing audio (MP3) file, such as previous, next, random, repeat etc.

• Users can choose their interface for their level

• Users can add new songs to the playlist or manage their playlist

• All user’s data and playlists could be stored electronically

Rich Internet Application for Weekly Automatic College Timetable Generation

RA college timetable is a temporal arrangement of a set of classes and classrooms in which all given constraints are satisfied. Timetabling has long been known to belong to the class of problems called NP hard. This project introduces a practical timetabling algorithm capable of taking care of both strong and weak constraints effectively, used in an automated timetabling system.

Rich Internet applications (RIA) are web applications that have the features and functionality of traditional desktop applications. RIAs typically transfer the processing necessary for the user interface to the web client but keep the bulk of the data (i.e., maintaining the state of the program, the data etc) back on the application server. We have used the Google Web Toolkit, which is RIA framework, for the same purpose.

Our project reduces the overhead on server of rendering client’s UI components and makes room for processing time of Timetable Generator Algorithm. Our Timetabling Algorithm is main component of our project which produces the HTML based weekly timetable sheet as the output.

Our project takes various inputs from the user such as Teacher List, Course List, Semester List, Room List, Day List and Timeslot as well as various rules, facts and constraints using web based forms, which are stored in XML based knowledge base.

This knowledge base serves as input to our Timetable Generator Algorithm residing on server machine. Both GWT Client Side UI code and our algorithm are written in JAVA, which makes our project platform independent. Further benefits of choosing these frameworks are explained in later part of report with practically acceptable results.

Planning

An algorithm for constructing a timetable has to assign instances of the different resource classes to the event class instances. Some of these assignments are predetermined and cannot be changed, and some have to be done during the planning phase. To construct a timetable, one of the views mentioned in above section is used. In the school timetabling case our algorithm might use the class view to assign a subject, teacher and room to a lesson. In this case the class is fixed and the other instances have to be assigned to. Additionally, a time interval has to be assigned to each event class instance.

For each viewing perspective there are as many timetables as instances of this class to be planned exist. If we have t teachers at a high school, for example, t different teacher timetables belong to them. That is, if there exist l lessons in a high school timetabling problem, furthermore t teachers, r rooms and c classes, the number of instances of event classes including all views will be (t+r+c)×l. The timetables of the instances of one planning class contain all information necessary to construct the timetables for the instances of the other planning classes: i.e. the timetables of the different views can be mapped to timetables of other views. In the school timetabling case the t teachers’ timetables can be mapped to the r rooms’ timetables

That is why it is usually sufficient for a timetabling program to save the timetables of one resource type only. This avoids data redundancy caused by storing the same event information in different places, i.e. from different views.

Nevertheless, to be able to check constraint violations, translations to other views have to be done, for example to compute the number of assigned lessons of a teacher when working with the class view. Otherwise expensive computing time has to be accepted in order to compute the necessary information.

Support Vector Machines For Face Recognition

Neural networks have been applied extensively in computer vision and pattern recognition. Support vector machines have been recently proposed as new kinds of feed-forward networks for pattern recognition .

Intutively , given a set of points belonging to two classes , a SVM finds the hyperplane that separates the largest possible fraction of points of the same class on the same side , while maximizing the distance from either class to hyperplane.

This hyperplane is called optimal separating hyperplane which minimizes the risk of misclassifying not only the examples in training set , but also the unseen examples of the test set .The SVM is essentially developed to solve two class problem.

The application of SVMs to computer vision problem have been proposed recently . SVM is trained for face detection where the discrimination is between two classes : face and nonface , each with thousand of examples.

It is difficult to discriminate or recognize different persons by there faces because of similarity of the faces. In this project , we focus on the face recognition problem , and show that the discrimination function learned by SVMs can give much higher recognition than the poular standard eigenface approach or other approach .

After the features are extracted , the discrimination functions between each pair are learned by SVMs . Then the disjoint test set enters the system for recognition .

We will construct a binary tree structure to recognize the testing samples . We will develop a multi-class recognition strategy for the use of conventional bipartite SVMs to solve the face recognition problem .

Objective :

• Efficiently applying SVM to the n-class problem of face recognition

• Figuring out training and/or image preprocessing strategies

• Comapring how SVMs compare to other techniques

SOFTWARE AND TOOLS / TRAINING DATA :

• Thorsten's SVM Light

• Java Netbeans

• Visual Studio

• Image datasets for training and testing

 

SMTP Mail Server

The "SMTP MAIL SERVER" deals with identifying multiple users with in the same login and enabling them to send and receive mails. The current environment requires a login for each user to handle all mails related information. But more than one user can't use the same login and personalized security on mail transmission and reception.

Hence it becomes necessary to have a login for every user to communicate with each other by sending and receiving mails that are currently available in the default UNIX environment. A utility that will allow multiple clients to login under the same login name and have personalized mail information e developed.

Features of the project:

• Registration of mail ID's

• Address List maintenance

• Mail management

Modules:

Current application is differentiated into the following modules which are closely integrated to each other.

• User administration.

• Mail organization.

• Message composition.

• Message Address list

• Message Deletion

Hard ware Specification :

Processor : Intel P-VI based system

Processor Speed : 250 MHz to 833MHz

RAM : 512MB to 1024 MB

Hard Disk : 2GB to 30GB

Key Board : 104 keys

Software Specification:

Software : Visual Studio .Net 2005

Language : C# .Net

Database : SQL Serve-2005, Oracle-9i

Operating System : Windows 2000,XP,2003

Web Technologies : HTML, Java Script, ASP.NET

Training and Placement Cell Management

Development of distributed scalable web enabled application, for "Training and Placement officer of a college to evaluate and handover the list of candidates of third year and final year for short listing them on the basis of criterion specified conditions by companies.

Description:

This application provides automated system for on-line recording of academic details of students for third and final year for all semesters of students. The TPO office shall verify the records by actual documents. Once verified records of students are made available to TPO he/she can supply short listed candidates as per declared cut of marks as well as some other criterion desired by companies coming for conducting campus drive. The list of short listed can be sent to companies using system generated email.

Benefits:

• Reduce the paperwork and storage area.

• Improve the output of operators.

• Improve accuracy in result.

• Allow easy navigation through CV's and company information.

• Manage the man and machine resources efficiently.

• It has user friendly interface having quick authenticated access to documents.

• Easily scalable to grow with changing system requirement.

• Secured check in, check out & updates.

Locate CV's easily by various parameters

Functions:

Creation of student input records about academic career from 10 th , 12 th and all semester with facilities to modify the records and viewing changed records with full security.

Creation of Finally checked and verified records state by TPO level users. Once approved and verified by TPO, records can not be modified by any student, without getting modification permission from TPO.

Interface for generating the terms ad condition for campus selection criterion for a particular year. Provision has to be taken for specifying the new set of conditions for separate campus drive.

Building search interface for eligible candidates for a company's particular campus (for specified conditions) for 3 rd year student, 4 th year student and both type of student.

Short listed candidate for a particular campus needs to be stored.

Sending email to company for complete list of shortlisted candidates for particular campus.

Indication of hall ticket issued to candidates

Comparison and Simulation of Different Queuing Models

Queuing Theory is a collection of mathematical models of various queuing systems. It is used extensively to analyze production and service processes exhibiting random variability in market demand (arrival times) and service times.

In queuing theory , a queuing model is used to approximate a real queuing situation or system, so the queuing behavior can be analyzed mathematically. Queuing models allow a number of useful steady state performance measures to be determined, including:

The Average number in the queue, or the system, the average time spent in the queue, or the system, the statistical distribution of those numbers or times, the probability the queue is full, or empty, and the probability of finding the system in a particular state.

These performance measures are important as issues or problems caused by queuing situations are related to customer dissatisfaction with service or may be the root cause of economic losses in a business. Analysis of the relevant queuing models allows the cause of queuing issues to be identified and the impact of proposed changes to be assessed.

Markovian queueing model :-

If the arrival process is Poisson and the service time distributions are exponential for a queuing model then it is said to be a Markovian queuing model . 

A Markov chain is a sequence of random variables X 1 , X 2 , X 3 , ... with the Markov property , namely that, given the present state, the future and past states are independent. Formally,

Birth-death process :

The birth-death process is a special case of continuous-time Markov process where the states represent the current size of a population and where the transitions are limited to births and deaths. Birth-death processes have many applications in demography, queuing theory, performance engineering, or in biology. When a birth occurs, the process goes from state n to n+1. When a death occurs, the process goes from state n to state n-1. The process is specified by birth rates {? i } i=0.8 and death rates {µ i } i=1.8 . 

Applications Of Queuing Theory

Queuing Theory has a wide range of applications, and this section is designed to give an illustration of some of these. It has been divided into 3 main sections, Traffic Flow , Scheduling and Facility Design and Employee Allocation . The given examples are certainly not the only applications where queuing theory can be put to good use, some other examples of areas that queuing theory is used are also given.

Traffic Flow

This is concerned with the flow of objects around a network, avoiding congestion and trying to maintain a steady flow, in all directions.

Queueing on roads

Queues at a motorway junction , and queueing in the rush hour

Scheduling

Computer scheduling

Facility Design and Employee Management

Queues in a bank

A Mail Sorting Office

Trade Service Engine

An organization/company will have a number of products and services they may offer to their customers. Depending on the type of business or service offered the customers may have several doubts/complaints/problems.

The "Online Business Service Engine" helps to accomplish this task of solving and clarifying the customers' queries. This product facilitates the user to submit online complaints independent of the system

The "Business Service Engine" can be used by a business organization to provide online support to its customers. This may include questions about their services or even complaints the customers may have. Although a manual system can be done, time plays an important role in customer satisfaction.

A customer always expects services to be offered as soon as possible and the organization is responsible for making sure its customers stay satisfied. As most organizations are going, or are already online, the "Online Business Service Engine" will prove an added advantage to them in this internet world.

Objectives of the Project

The manual submission of complaints and customer servicing has been the most tedious part of the business. The time delay for a response and accuracy of complaint solving plays as vital role for customer servicing. This scenarios and objectives play the mandatory development of application to serve the customer with customer service satisfaction.

This System will allow the business process to run efficiently and will be used to assist or satisfy the customer by giving a brief solution for their complaint within a minimum time. The Customer receives the solution within a day online.

The customers may arise with many problems which cannot be solved at the same time with full support by the business. The main aim of the business is the Customer satisfaction.

This system helps the customers to give their problems online whenever the customer needs, without any constraints implied on them. This system helps the customers to briefly explain their complaint without any hesitation.

Through this system the customers are assisted with some predefined complaints and immediate solutions which save the precious time of the customers. The customers receive the solutions for their complaint within a day and the customer can also view the status of the complaint at any time using the complaint no. Through this system the customers receive a brief solution for their complaint.

Hardware Specification :

Processor : Intel P-VI based system

Processor Speed : 250 MHz to 833MHz

RAM : 512MB to 1024 MB

Hard Disk : 2GB to 30GB

Key Board : 104 keys

Software Specification:

Software : Visual Studio .Net 2005

Language : C# .Net

Database : SQL Serve-2005, Oracle-9i

Operating System : Windows 2000,XP,2003

Web Technologies : HTML, Java Script, ASP.NET