Application Project Abstract-75

7/23/2019 Application Project Abstract-75

1/37

Application Project Abstract

1. E-Commerce shopping cart

Abstract

Electronic commerce, commonly known as e-commerce or e-business consists of the

buying and selling of products or service over electronic systems such as the Internet. This e-

commerce shopping cart application will help to purchase the product in online and pay the

amount in a secured way. In this application the user can add the product to the cart before

they purchased. In this application the user can do the following activities: Login,

egistration, edit the user profile such as password, contact details, view products by product

category, select the product and add to cart, view cart details, update or delete the product in

the cart and see the company profile.

2. Database Migration Framework

Abstract

This pro!ect aims to bring up the idea of automation of transfer of data structure "table#

designs as well as data "records# from one $%&' to another "possibly different type of#

$%&'. The user selects a $atabase and chooses the type of data base "&s (ccess, &' ')L

server, &y ')L#.This framework typically has the following phases: analysis of source data,

e*traction and transformation of data, and validation data.


2/37

3. Mobile shopping

Abstract

This pro!ect is a mobile based online shopping application. The main aim of this

application is to improve the services of +ustomers and vendors. This m-commerce shopping

cart application will help to purchase the product using mobile and pay the amount in a

secured way. In this application the user can add the product to the cart before they purchased.

In this application the user can do the following activities: Login, egistration, edit the user

profile such as password, contact details, view products by product category, select the

product and add to cart, view cart details, update or delete the product in the cart and see the

company profile.

. De!elopment o" a sa"e an# sec$re %nternet banking s&stem

Abstract

This pro!ect aims at creation of a secure Internet banking system. This will be accessible

to all customers who have a valid ser Id and assword. This system provides the following

facilities: %alance Enuiry, /unds Transfer to another account, viewing statements, change the

personal details and bill payments.

'. (nline learning management s&stem

Abstract

&any colleges and universities have added, or are considering, classes taught over the

internet in order to reach students who are unable to attend a traditional higher education

course. 0nline Learning &anagement 'ystem "0L&'# makes developing online courses easy.

The 0L&' lets any instructor create an online classroom that includes e*ams and ui11es,

discussion forums, a course calendar, and 2T&L content. The Instructors +ontrol anel lets


3/37

instructors create and modify course content, create e*ams and ui11es, administer students

and their grades, and much more. $istance learning software should be intuitive for the

student and the instructor. This simple solution puts the instructor in control of the distance

learning course. Each course has a built-in database for e*am uestions. Instructors load the

uestions into the database then create e*ams and ui11es based on them. The e*ams and

uestions can be edited, deleted, and re-used anytime for a uick feature rich online

e*amination system.

). M-Commerce shopping cart

Abstract

This pro!ect is a mobile based online shopping application. The main aim of this

application is to improve the services of +ustomers and vendors. This m-commerce shopping

cart application will help to purchase the product using mobile and pay the amount in a

secured way. In this application the user can add the product to the cart before they purchased.

In this application the user can do the following activities: Login, egistration, edit the user

profile such as password, contact details, view products by product category, select the

product and add to cart, view cart details, update or delete the product in the cart and see the

company profile.

*. M$lti $ser chatting

Abstract

&ulti user chatting is an open source Intranet messenger style service that runs on !ava

and uses the multicast system to send messages across a network. 2ere all users can

communicate with each other through a graphical user interface. The program also includes a

private chat function that enable two individual users can communicate with each other.


4/37

+. Encr&ption an# #ecr&ption o" con"i#ential #ata

Abstract

It is a security software program allowing you to prevent people from viewing, printing

or altering your confidential documents. This system keeps track of confidential information

like passwords, web logins, credit cards, bank account data, social security numbers and more.

(ll information is protected by strong 345-bit encryption. It give the peace of mind that your

data is safe, secure and organi1ed. 6e can set a password on the document of our choice

rotect your confidential data from wrong hands.

,. %ntranet Chatting

Abstract

This ro!ect Entitled as I7T(7ET +2(TTI78 is used basically for chatting purpose

with the remote clients or users on Internet or local networks. 2ere in this pro!ect a !ava

client 9 server combination is used to chat with remote users. 6hen a +lient wants to chat with

a user on a remote host, he sends a reuest to the 'erver with a identification name like chat-

id, the server responds to the reuest by identifying the client-id which is already registered in

the server domain and when matched his reuest is granted and the client can begin to chat

with the remote users present on the internet or local network.

1. eb Crawling /&stem.Abstract

The 6orld 6ide 6eb is a rapidly growing and changing information source. $ue to the

dynamic nature of the 6eb, it becomes harder to find relevant and recent information. 6e

present a new model and architecture of the 6eb +rawler using multiple 2TT connections to

666. The multiple 2TT connection is implemented using multiple threads and


5/37

asynchronous downloader module so that the overall downloading process is optimi1ed. The

user specifies the start L from the 8I provided. It starts with a L to visit. (s the

crawler visits the L, it identifies all the hyperlinks in the web page and adds them to the list

of Ls to visit, called the crawl frontier. Ls from the frontier are recursively visited and

it stops when it reaches more than five level from every home pages of the websites visited

and it is concluded that it is not necessary to go deeper than five levels from the home page to

capture most of the pages actually visited by the people while trying to retrieve information

from the internet.

11. File /haring /&stem

Abstract

/ile 'haring 'ystem provides file transfer operation from server to the reuested client.

/irst receives the reuest and recogni1e the file name, if the file e*ists in server transfers it

otherwise sends a file not found error message. It is a file transfer program without hassles.

(ll thats reuired is for two parties to load emote /ile Transfer. 0ne person sends a file, the

other person accepts the file, and thats it. The main aim of the pro!ect is to develop emote

/ile Transfer environment. emote /ile Transfer application provides remote service to its

entire client over the network. It acts as a network administrator to its client to provide remote

service like file transfer.

12. 0i#eo retrie!al $sing e& Frame etraction

Abstract

)uery by key frame is a convenient and often effective way to search in video database.

This paper proposes a new approach to support such searches. The main contribution of the

proposed approach is the consideration of both feature e*traction and distance computation as

a whole process. 6ith a video shot represented by key-frames corresponding to feature points

in a feature space, a new metric is defined to measure the distance between a uery image and

a shot based on the concept of 7earest /eature Line "7/L#. 6e propose to use the


6/37

;;breakpoints


7/37

1'. Encr&pt the File 7sing Des Algorithm

Abstract

rotection of data during transmission or while in storage may be necessary to maintain

the confidentiality and integrity of the information represented by the data. In this pro!ect

we can encrypt and decrypt the file using $E' "$ata Encryption 'tandard# algorithm. The

algorithms uniuely define the mathematical steps reuired to transform data into a

cryptographic cipher and also to transform the cipher back to the original form. Encrypting

data converts it to an unintelligible form called cipher. $ecrypting cipher converts the data

back to its original form called plainte*t. The algorithm described in this standard specifies

both enciphering and deciphering operations which are based on a binary number called a key.

( $E' key consists of => binary digits "?@?s or ?3?s# of which A= bits are randomly generated

and used directly by the algorithm. The other 5 bits, which are not used by the algorithm, may

be used for error detection.

1). File /plitter

Abstract

/ile 'plitter is software which is used to split the user specifying file according to the

user specifying si1e. It is very difficult to transfer one big file from one end to another through

any media like internet. This software helps to overcome this problem. The splitted portions of

file may carry some temporary information to denote the number of splitted part and total

number of parts etc. This idea is used to split big files to small pieces for transferring purpose,

uploading etc. In the destination side, these parts of file can be !ointed to form the original

source file. In this application we can split the te*t files and image files.


8/37

1*. 5he Application o" /tream Data in /tock Market Anal&sis

Abstract

6ith the rapid development of computer information technology, a new data model-the

stream data emerged. The stream data is coming continuously, uickly, changing with time,

and may be unpredictable and unlimited in the way. The emergence of stream data has

brought new challenges from the nature of the data applied to static database technology and

data mining technology. (t present, the stream data has been widely used in

telecommunications, financial securities, retail trade and other fields. 'tream data mining is a

process of finding and e*tracting potential information and knowledge hidden in the stream

data, which is useful but people do not know in advance. $ue to the stream data is on the

continuous arrival of large or even unlimited data, which cannot be all stored, so many

traditional data mining algorithms are not suitable for the stream data mining. The paper

proposes a mining model and algorithm of stream data time-series pattern reliance in a

dynamic stock market through the research of stream data time-series pattern mining

algorithms and applications, and then does short-term forecasts on the stocks with pattern

reliance to provide rational guidance for stock investors.

1+. Page le!el web #ata etraction

Abstract

6eb $ata E*tractor is a powerful and easy-to-use application which helps you

automatically e*tract specific information from web pages. 6ith 6eb $ata E*tractor you can

automatically get lists of meta-tags, e-mails, phone and fa* numbers, etc. and store them in

different formats for future use.

1,. D&namic loa# balancing in #istrib$te# s&stem

Abstract

In a distributed network of computing hosts, the performance of the system can depend

crucially on dividing up work effectively across the participating nodes. $ynamic load


9/37

balancing have the potential of performing better than static strategies, they are inevitably

more comple*. The overheads involved are much more. %ut one can not negate their benefits.

Load balancing is found to reduce significantly the mean and standard deviation of !ob

response times, especially under heavy and9or unbalanced workload. The performance is

strongly dependent upon the load inde*B ueue-length-based indices perform better. The

reduction of the mean response time increases with the number of hosts, but levels off beyond

a few tens of hosts. Load balancing is still very effective when a large portion of the workload

is immobile. (ll hosts, even those with light loads, benefit from load balancing. 'imilarly, all

types of !obs see improvements in their response times, with larger !obs benefiting more.

'ystem instability is possible, but can be easily avoided. The random arrival of tasks at each

processor is likely to bring about uneven processor loads in a distributed system. Carious

approaches are there to provide the dynamic load balancing. In one scheme, Load balancing

can be improved by having one centrali1ed node to handle the uneven load.

2. A#apti!e /ec$re Access to emote /er!ices

Abstract

'ince the inception of service-oriented computing paradigm, we have witnessed a

plethora of services deployed across a broad spectrum of applications, ranging from

conventional +-based services to '0(-based 6eb services.

Likewise, the proliferation of mobile devices has enabled the remote Don the move access of

these services from anywhere at any time. 'ecure access to these services is challenging with

heterogeneous modalities. +onventional static access control mechanisms are not able to

accommodate comple* secure access reuirements. In this paper, we propose an adaptive

secure access mechanism to address this problem. 0ur mechanism, which consists of two

components: an adaptive access control module and an adaptive function invocation module,

not only adapts access control policies to diverse reuirements, but also introduces function

invocation adaptation during access. 6e have successfully applied the proposed adaptive

secure access mechanism to a computer-assisted surgery application called bi+('.


10/37

erformance evaluation shows that with limited overhead, our techniue enforces secure

access to the services provided by the bi+(' system in a fle*ible way.

21. %#enti"ication o" $ser interest "or personali8e# search

Abstract

0ne hundred users, one hundred needs. (s more and more topics are being discussed on

the web and our vocabulary remains relatively stable, it is increasingly difficult to let the

search engine know what we want. +oping with ambiguous ueries has long been an

important part in the research of Information etrieval, but still remains to be a challenging

task. ersonali1ed search has recently got significant attention to address this challenge in the

web search community, based on the premise that a user


11/37

generate the rules. The rules generated are used to test the email as deceptive or not. In

particular we are interested in detecting emails about criminal activities. (fter classification

we must be able to differentiate the emails giving information about past criminal activities

"Informative email# and those acting as alerts "warnings# for the future criminal activities.

This differentiation is done using the features considering the tense used in the emails.

E*perimental results show that simple (ssociative classifier provides promising detection

rates.

23. Cre#ible 9:P "or /ec$re 6etworking

Abstract;

%order 8ateway rotocol "%8# is the de-facto routing protocol in the Internet. nfortunately,

it is not a secure protocol, and as a result, several attacks have been successfully mounted

against the Internet infrastructure. (mong the security reuirements of %8 is the ability to

validate the actual source and path of the %8 update message. This is needed to help reduce

the threat of prefi* hi!acking and I spoofing based attacks. %8 route associates an address

prefi* with a set of autonomous systems "('# that identify the inter-domain path that the

prefi* has traversed in the form of %8 announcements. This set is represented as the

('F(T2 attribute in %8 and starts with the (' that originated the prefi*. +redible %8

"+%8# proposes several e*tensions to %8 protocol to validate source and path of %8

update message and to use the resulting validation score to influence the route selection

algorithm. +%8 assigns credibility scores for (' prefi* origination and ('F(T2. These

credibility scores are used in the e*tended selection algorithm to prefer valid %8 routes. The

new protocol can detect %8 attacks such as (' ath In!ection and (' refi* high !acking.


12/37

2. /ec$re# Data 5ransmission thro$gh 6etwork

Abstract

The system deals with security during transmission of data. +ommonly used technology

is cryptography. 2ere we handle hiding a secret message with in an image in such a way that

others cannot discern the presence or contents of the hidden message.( message might be

hidden within an image and then transmitted through network.

2'. Content-base# image retrie!al


13/37

approach which uses freuent item "term# sets for te*t clustering. 'uch freuent sets can be

efficiently discovered using algorithms for association rule mining. To cluster based on

freuent term setsB we measure the mutual overlap of freuent sets with respect to the sets of

supporting documents. 6e present two algorithms for freuent term-based te*t clustering,

/T+ which creates flat clustering and 2/T+ for hierarchical clustering. (n e*perimental

evaluation on classical te*t documents as well as on web documents demonstrates that the

proposed algorithms obtain clustering of comparable uality significantly more efficiently

than state-of-the art te*t clustering algorithms. /urthermore, our methods provide an

understandable description of the discovered clusters by their freuent term sets.

2*. Minimi8ing "ile #ownloa# time in peer to peer networks

Abstract

The peer-to-peer "4# file-sharing applications are becoming increasingly popular and

account for more than G@H of the Internet


14/37

key content of 'emantic 6eb resources, that is relations. 2owever, in order to rank results,

most of the e*isting solutions need to work on the whole annotated knowledge base. In this

paper we propose a relation-based page rank algorithm to be used in con!unction with

'emantic 6eb search engines that simply relies on information which could be e*tracted from

user uery and annotated resource. elevance is measured as the probability that retrieved

resource actually contains those relations whose e*istence was assumed by the user at the time

of uery definition.

2,. /pam Filtering

Abstract

6hile the concept of collaboration provides a natural defense against massive spam e-

mails directed at large numbers of recipients, designing effective collaborative anti-spam

systems raises several important research challenges. /irst and foremost, since e-mails may

contain confidential information, any collaborative anti-spam approach has to guarantee

strong privacy protection to the participating entities. 'econd, the continuously evolving

nature of spam demands the collaborative techniues to be resilient to various kinds of

camouflage attacks. Third, the collaboration has to be lightweight, efficient, and scalable.

Toward addressing these challenges, this paper presents (L(+('a privacy-aware

framework for collaborative spam filtering. In designing the (L(+(' framework, we make

two uniue contributions. The first is a feature-preserving message transformation techniue

that is highly resilient against the latest kinds of spam attacks. The second is a privacy-

preserving protocol that provides enhanced privacy guarantees to the participating entities.

0ur e*perimental results conducted on a real e-mail data set shows that the proposed

framework provides a 3@ fold improvement in the false negative rate over the %ayesian-based

%ogo filter when faced with one of the recent kinds of spam attacks. /urther, the privacybreaches are e*tremely rare. This demonstrates the strong privacy protection provided by the

(L(+(' system.


15/37

3. Mining Fre>$ent Patterns

Abstract

(ssociation mining is one ma!or problem in the area of data mining. The problem

concerns finding freuent patterns hidden in a dataset. /reuent patterns are patterns such as

set of items that appear in data freuently. /inding such freuent patterns has become an

important data mining task because it reveals associations, correlations, and many other

interesting relationships among items in the dataset.

31. /ec$rit& an# Pri!ac& /$pport "or Data-Centric /ensor 6etworks

Abstract

The demand for efficient data dissemination9access techniues to find relevant data from

within a sensor network has led to the development of $ata-+entric 'ensor "$+'# networks,

where the sensor data instead of sensor nodes are named based on attributes such as event type

or geographic location. 2owever, saving data inside a network also creates security problems

due to the lack of tamper resistance of the sensor nodes and the unattended nature of the

sensor network. /or e*ample, an attacker may simply locate and compromise the node storing

the event of his interest. To address these security problems, we present p$+', a privacy

enhanced $+' network which offers different levels of data privacy based on different

cryptographic keys. p$+' also includes an efficient key management scheme to facilitate the

management of multiple types of keys used in the system. In addition, we propose several

uery optimi1ation techniues based on euclidean 'teiner Tree and keyed %loom /ilter "J%/#

to minimi1e the uery overhead while preserving uery privacy. /inally, detailed analysis and

simulations show that the J%/ scheme can significantly reduce the message overhead with

the same level of uery delay and maintain a very high level of uery privacy.


16/37

32. Feat$re a!elet Metho# "or %mage %n"ormation Mining

Abstract

Image transformation is reuired for color-te*ture image segmentation. Carious

techniues are available for the transformation along the spatial and spectral a*es. /or

instance, the 2'C-wavelet techniue is shown to be very effective for image information

mining in remote-sensing applications. 2owever, the 2'C transformation approach uses only

three spectral bands at a time. In this letter, a new feature set, obtained by combining

independent component analysis and wavelet transformation for image information mining in

geospatial data, is presented. E*perimental results show the effectiveness of the presented

method for image information mining in Earth observation data archives.

33. %mage E#ge Anal&sis an# Detection

Abstract

It is well known that the wavelet transform provides a very effective framework for

analysis of multi-scale edges. In this paper, we propose a novel approach based on the shearlet

transform: a multi-scale directional transform with a greater ability to locali1e distributed

discontinuities such as edges. Indeed, unlike traditional wavelets, shearlets are theoretically

optimal in representing images with edges and, in particular, have the ability to fully capture

directional and other geometrical features. 7umerical e*amples demonstrate that the shearlet

approach is highly effective at detecting both the location and orientation of edges, and

outperforms methods based on wavelets as well as other standard methods. /urthermore, the

shearlet approach is useful to design simple and effective algorithms for the detection of

corners and !unctions.

3. /?@ 5$tor


17/37

Abstract

(ctive learning and training is a particularly effective form of education. In various

domains, skills are eually important to knowledge. 6e present an automated learning and

skills training system for a database programming environment that promotes procedural

knowledge acuisition and skills training. The system provides meaningful knowledge-level

feedback such as correction of student solutions and personali1ed guidance through

recommendations. 'pecifically, we address automated synchronous feedback and

recommendations based on personali1ed performance assessment. (t the core of the tutoring

system is a pattern-based error classification and correction component that analy1es student

input in order to provide immediate feedback and in order to diagnose student weaknesses and

suggest further study material.

3'. Distrib$te# Database s&stem

Abstract

( distributed database can be defined as consisting of a collection of data with different

parts under the control of separate $%&'s running on independent computer systems. (ll the

computers are interconnected and each system has autonomous processing capability serving

local applications. This system allows a user to access and manipulate data from several

databases that are physically distributed to several sites. (n end user can create and store a

new database in the network, access and update the database.

3). /cene Detection in 0i#eos

Abstract

Cideo inde*ing reuires the efficient segmentation of video into scenes. The video is first

segmented into shots and a set of key-frames is e*tracted for each shot. Typical scene

detection algorithms incorporate time distance in a shot similarity metric. In the method we

propose, to overcome the difficulty of having prior knowledge of the scene duration, the shots


18/37

are clustered into groups based only on their visual similarity and a label is assigned to each

shot according to the group that it belongs to. Then, a seuence alignment algorithm is applied

to detect when the pattern of shot labels changes, providing the final scene segmentation

result.

3*. (nline D$plicate ecor# #etection

Abstract

ecord matching, which identifies the records that represent the same real-world entity, is

an important step for data integration. &ost state-of-the-art record matching methods are

supervised, which reuires the user to provide training data. These methods are not applicable

for the 6eb database scenario, where the records to match are uery results dynamically

generated on the- fly. 'uch records are uery-dependent and a pre-learned method using

training e*amples from previous uery results may fail on the results of a new uery. To

address the problem of record matching in the 6eb database scenario, we present an

unsupervised, online record matching method, $$, which, for a given uery, can effectively

identify duplicates from the uery result records.

3+. Peer to Peer Doc$ment Cl$stering

Abstract

&ining large document collections poses many challenges, one of which is the e*traction

of topics or summaries from documents for the purpose of interpretation of clustering results.

(nother important challenge, which is caused by new trends in distributed repositories and

peer-to-peer computing, is that document data is becoming more distributed. In this paper we

cluster the distributed documents using keypharse e*traction.


19/37

3,. E""ecti!e image retrie!al

Abstract

Image retrieval is an active research area in image processing, pattern recognition, and

computer vision. elevance feedback has been widely accepted in the field of content-based

image retrieval "+%I# as a method to boost the retrieval performance. To improve the

performance, a dominant color descriptor "$+$# is proposed. E*perimental results based on a

set of +orel images demonstrate that the proposed system performs much better than the

previous methods. It achieves high accuracy and reduces the processing time greatly.

. 0i#eo /tream %n#eing an# etrie!ing

Abstract

This paper presents an automation techniue for video inde*ing and creation of a digital

library. 6e will present how to detect shots cuts and features, which will be saved for the

video shots9frames. (lso build a video digital library composed of the stream shots9frames

plus wavelet coefficients for video stream shot


20/37

(ssociation rule mining has been an area of active research in the field of knowledge

discovery and numerous algorithms have been developed to this end. 0f late, data mining

researchers have improved upon the uality of association rule mining for business

development by incorporating the influential factors like value "utility#, uantity of items sold

"weight# and more, for the mining of association patterns. In this paper, we propose an

efficient approach based on weight factor and utility for effectual mining of significant

association rules. Initially, the proposed approach makes use of the traditional (priori

algorithm to generate a set of association rules from a database. The proposed approach

e*ploits the anti-monotone property of the (priori algorithm, which states that for a k-itemset

to be freuent all "k-3# subsets of this itemset also have to be freuent. 'ubseuently, the set

of association rules mined are sub!ected to weightage "6-gain# and utility "-gain#

constraints, and for every association rule mined, a combined tility 6eighted 'core "6-

'core# is computed. ltimately, we determine a subset of valuable association rules based on

the 6-'core computed. The e*perimental results demonstrate the effectiveness of the

proposed approach in generating high utility association rules that can be lucratively applied

for business development.

3. File eplication an# Consistenc& Maintenance in P2P /&stems

Abstract

In peer-to-peer file sharing systems, file replication and consistency maintenance are

widely used techniues for high system performance. $espite significant interdependencies

between them, these two issues are typically addressed separately. &ost file replication

methods rigidly specify replica nodes, leading to low replica utili1ation, unnecessary replicas

and hence e*tra consistency maintenance overhead. &ost consistency maintenance methods

propagate update messages based on message spreading or a structure without considering file

replication dynamism, leading to inefficient file update and hence high possibility of outdated

file response. This paper presents an Integrated file eplication and consistency &aintenance

mechanism "I that integrates the two techniues in a systematic and harmoni1ed manner.

It achieves high efficiency in file replication and consistency maintenance at a significantly


21/37

low cost. Instead of passively accepting replicas and updates, each node determines file

replication and update polling by dynamically adapting to time-varying file uery and update

rates, which avoids unnecessary file replications and updates. 'imulation results demonstrate

the effectiveness of I& in comparison with other approaches. It dramatically reduces

overhead and yields significant improvements on the efficiency of both file replication and

consistency maintenance approaches.

. @ogic base# Pattern Disco!er&

Abstract

In the data mining field, association rules are discovered having domain knowledge

specified as a minimum support threshold. The accuracy in setting up this threshold directly

influences the number and the uality of association rules discovered. 0ften, the number of

association rules, even though large in number, misses some interesting rules and the rules

Date post:	17-Feb-2018
Category:	Documents
Upload:	sikkandhar-jabbar
View:	219 times
Download:	0 times

Application Project Abstract-75

Documents