CSE Project Reports - 1000 Projects

September 23, 2012September 23, 2012

A Novel Algorithm for Hiding Sensitive Frequent Item Sets

Introduction to A Novel Algorithm for Hiding Sensitive Frequent Item Sets Project:

This paper discussed about fast hiding sensitive frequent itemsets (FHSFI) approach to hide sensitive frequent itemsets with one database scan and generate limited side effects.

Overview:

In a database, with an association analyzer, if an itemset with support above a given minimal support then that itemset is called a frequent itemset. There is a need to analyze the correlations between the sensitive itemsets and each transaction in a database. The transactions order to be altered can be decided based on the each transaction weight which is given by heuristic function.

So by this there is a possibility of saving time by only consider the actual required transactions to modified and then hide the given sensitive frequent itemsets. There is no need to deal with all the transactions to hide the sensitive frequent itemsets. FHSFI provides the facility to hide the SFI without generating many side effects but still there is loss in rule sets, so researches have been takes place to overcome this issue. The main goal of FHSFI is to hide sensitive frequent itemsets by allowing minimum support thresholds, by limited side effects and by executed only one database scan.

Conclusions:

In network and data mining world, there is a severe need to protect the confidentiality of sensitive information in a database. The relationships hidden among large data sets are in a form of frequent item sets or association rules. Privacypreserving data mining is an important issue which needs the immediate attentions in the current industry.

When the support of each given sensitive itemsets are reduced then it will help to hide sensitive frequent itemsets, and this can be achieved by modifying transaction in database but at the same time will have enough side effects due to it. So FHSFI emerged to hide sensitive frequent itemsets with limited side effects.

Download A Novel Algorithm for Hiding Sensitive Frequent Item Sets.

September 23, 2012September 23, 2012

NIT Seminar Topic on A Logic programming approach Knowledge State Planning

Introduction to NIT Seminar Topic on A Logic programming approach Knowledge State Planning:

This thesis discussed about new logic programming language k and how to apply it to knowledge state planning. The symantics and syntax of K is also discussed in this paper.

Overview:

The language K can describe the transitions between different knowledge states and also allows planning under incomplete knowledge. Also language K describes the transitions between completely described world states. Natural and compact representation is also possible with this language.

In reality, numbers of fluents are unknown and planning agents don’t have a complete knowledge. So to overcome this K language proved three valued view of fluent, and those values or true or false or unknown. K language never describes world’s view of knowledge states. Theoretical DVLk implementations are provided by K and computational complexity of K is analyzed.

K language consists of three disjoint sets namely action, fluent and type. If we start with the definition of the planning domain typed instantiation then we will get semantics of K planning domains and planning problems. After defining state transitions, there is a need to define an order of state transitions that leads from initial state to some success state and then in turn satisfies the given goal. Planning agent knows the complete knowledge of affairs initial state.

If initial state block locations are not known or if initial state is incompletely defined then any planning problem involving the domain does not admit any plan. In planning literature, based on the results the planning complexity in K is related to several results. In all the formalism, state transitions are similar in spirit and several complexity characteristics.

Conclusions:

This paper discussed about an approach to knowledge state planning using new logic programming. Problems like incomplete initial states are addressed by this language. The highlighted point in this paper is discussed the approach of problem solving using K.

Download NIT Seminar Topic on A Logic programming approach Knowledge State Planning.

September 23, 2012

Forward-Secure Digital Signature Scheme Project Abstract

Introduction to Forward-Secure Digital Signature Scheme Project:

This paper discussed about “forward security” , that is a security approach which ensures using secrets for short time periods and also reduces the damage when the secrets are exposed. This paper also describes how to design a forward-secure signature scheme.

Overview:

In a forward-secure signature scheme, if the current secret key is compromised, signatures from past time periods can still be trusted. A forward-secure digital signature scheme is a key-evolving digital signature scheme. Like a standard signature scheme, a key-evolving digital signature scheme contains algorithms related to key generation, signing and verification. Throughout the lifetime of this scheme, the public key remains unchanged. In this scheme, operations are divided into certain time periods and each period uses a different secret key to sign a message.

A public update algorithm in this scheme is used to computes the secret key for the new time period based on the previous period. But in this scheme we can able to get the secret key for the current period but not able to get any previously used secret keys. So, in order to overcome this drawback a forward-secure signature scheme comes into picture.
The public key for the forward-secure scheme is located at the root of the tree. In order to sign a message in a certain time period there is a need to use the secret key of the corresponding leaf and attach to the signature a certification chain depends on the root path to that leaf. In this scheme nodes are created dynamically to maintain forward security.

Transformation form secure identification scheme into a secure signature scheme without depends on random oracles is based on the concept of authentication trees. Forward-secure signature scheme is designed by not relying on random oracles. In this scheme whole tree nodes are created dynamically similar to that of GMR scheme.

The resulting scheme needs to remember previous message signature to compute the next signature. The length of each signature grows along with the signed messages. The main advantage of Forward-Secure Digital Signature Scheme is that we can obtain a signature scheme which is forward secured based on the security of the corresponding identification scheme.

September 23, 2012

An Approach for FEC Decoding Based on the BP Algorithm LTE and WiMAX Systems

This paper describes about unified belief propagation (BP) algorithm and how it helps in decoding in tailbiting convolutional and turbo codes. For all convolutional code classes and turbo codes, BP algorithm provides an effective general methodology for devising low-complexity iterative decoding algorithms. If a small performance has taken place during decoding turbo codes with BP instead of MAP, then this will be offset by the lower complexity of the BP algorithm.

Overview:

Prerequisites like generator matrix and parity check matrix are required to apply BP algorithm on tail-biting convolutional code by a Tanner graph for decoding. In order to replace the traditional decoders of turbo codes with the BP decoder, there is a need to obtain the turbo code party-check matrix. As the BP decoder is less complex than traditional decoder and also due to enables a unified decoding approach, the loss in BER performance is acceptable. When compares MAP and SOVA decoders, BP algorithm yields the lowest implementation complexity over all the required operations. BP algorithm for turbo codes is about 1.7 dB worse at a BER value of 10−2, than that of traditional decoders for turbo codes.

Conclusions:

The usage of BP algorithm is determined in this paper and also describes the feasibility of decoding arbitrary tailbiting convolutional and turbo codes. This algorithm helps to speeds up the error correction convergence and decreases the decoding computational complexity in WiMAX systems. Besides, based on forward-only algorithm, BP algorithm performs a non-trellis.

BP decoder for turbo codes in a combined architecture is having more benefits based on the efficient reuse of computational hardware and memory resources of the two separate decoders. As traditional turbo decoders having a higher complexity, there is a high loss in performance with BP. In fact, the low decoding complexity of BP decoder brings end-to-end efficiency as both encoding and decoding takes place with low hardware complexity.

September 23, 2012

An Efficient Wireless Architecture to Connect Rural Regions Project

Introduction to An Efficient Wireless Architecture to Connect Rural Regions Project:

This paper discussed about a new wireless network architecture WiRE (Wi-Fi-based Rural Extensions), which provides connectivity to rural regions at very low costs. To enhance the features of WiRE architectural, this paper also addressed the challenges at various protocols. Operations costs of WiMAX and cellular networks are higher in rural areas, because significant power consumption requires covering large areas with low user densities. So there is a need of WiRE network to provide connectivity to rural areas at low cost.

WiRE Network Architecture:

The main working principle of WiRE is to provide coverage to specific rural regions where connectivity is more required rather than providing broad coverage. The six important network components of WiRE are wireless nodes, point-to-multipoint links, low cost computing devices, point-to-point links, multi-radio mesh links and large local storage. The scope of WiRE network architecture is much broader when compared to that of WiLD networks. A wiRE network provides rural connectivity, supports wide range of applications and also focuses on challenges across different protocol layers. WiRE network provider uses unlicensed spectrum so there is no need to pay spectrum costs.

As the manufactures of Wi-Fi chipsets supports open source drivers which help to tailor the protocol in order to meet our needs. Low power single board computers are used by every wireless router in a WiRE network. PCs/ kiosks or the cell phones are the end-devices of WiRE. WiRE architecture is helpful to enable specific services like telephony services, tele consultation and telemedicine services, interactive distance learning service and mobile banking services to rural regions. But in order to provide the above mentioned services, WiRE network has to face some challenges which come across network and transport layers. WiRE network is designed in a way to tolerate all failures and address all challenges in these two layers.

Conclusions:

The WiRE architecture is developed for the typical rural regions to connect them to the city. WiRE is a wireless distribution network which extends connectivity from the city to village.

Download An Efficient Wireless Architecture to Connect Rural Regions Project.

September 23, 2012

Property Management System Implementation for a Organization Project

Introduction to Property Management System Implementation for a Organization Project:

This paper discussed about the how to manage the property in an organization and discussed about the importance of Property management system. Locating, tracking and controlling fixed assets can be called as Property Management. Solid Benefits can be obtained by an organization with the help of effective Controlling and Tracking of Property.

Overview:

When there is a tracking of fixed assets then can obtain benefits with the proper utilization of those fixed assets. Property Managements includes few tasks like controlling the property, accounting the fixed asset, managing the maintenance, control the inventory, security control, Warranty control, Calibration system control, billing and invoicing and tool control. A Property Management Program helps in accurate accounting and efficient compilation. Ultimately, the success of a Property Management Program depends on the support of top management and the commitment of an entire organization.

Across a wide range of organizational activities and concerns, using Property identification Program yields effective and numerous benefits. For implementing an effective tracking and controlling program there is a need to gather inputs from the employees during planning of the program and whose support is needed for implementing and perpetuating the program.

NPMA and ASTM organizations can assist the organization employees in implementing property management Program. Need to determine what property information records are needed and also determine what are the rules and regulations that applies to that organization. Determine the number of assets to be located recorded and estimate the cost for identification and protection of those assets from unauthorized usage.

There is a need to define which software should use for organization property identification. Should prepare a detailed written copy about the assets and must make it as a part of company’s policy. A Property Management program with procedures documents will help the organization to meet ISO standards. Each asset should be recorded in a detailed manner with necessary details like when the assets is purchased , from where it is purchased, current cost and asset benefits.

Download Property Management System Implementation for a Organization Project.

September 23, 2012

NIT Project on A Fast and Low Bit rate Speech Coding Algorithm Pulse Position Linear Predictive Coding

Introduction to A Fast and Low Bit rate Speech Coding Algorithm Pulse Position Linear Predictive Coding Project:

This paper discussed about a robust algorithm which provides quality speech less algorithmic complexity and at low bit rates. From the implementation point of view, high quality speech at low bit rate always come with the huge algorithmic complexities. There is a need to develop robust low rate coders which can accommodate signals other than speech. Current research is focused upon achieving high quality speech at low information rates.

Overview:

Vocoders works at low rates but also capable to produce synthetic quality speech. Vocoders works based on making vocal tract as a simple tube as with an excitation source at one end.As the algorithms used in this thesis are of lower complexity, the codec delay is also very less. The new algorithm proposed here is compared with the other existing algorithms on basis of voice quality, performance and voice intelligibility.

A common man always expects a modern communication should takes place with high quality at low rates. Low cost VoIP devices can achieve this goal, and these are developed with a fast and low complexity voice codec. The algorithm proposed in this paper provides high speech quality and intelligibility at low bit rate and low algorithmic complexity. Mean opinion scores and informal listening tests are used to verify the quality of these developed coders.

Conclusions:

Researches have been takes place to develop new speech coders which can able to produce high quality speech at low data rates. Excitation signal is the main factor which affects natural sounding speech synthesis. This paper discussed about the new parametric representation of an excitation signal and also designs a vocoder depends on the new excitation signal. When we placed pulses at peaks and residue signal valleys then the new excitation signal will created. The new vocoder which designed based on new excitation signal provides good quality at low bit-rate and codec delay.

Download NIT Project on A Fast and Low Bit rate Speech Coding Algorithm Pulse Position Linear Predictive Coding.

September 23, 2012

Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

Introduction:

This paper discussed about a distributed algorithm to compute all best swap edges for a minimum diameter spanning tree. A Minimum Diameter Spanning Tree minimizes the largest distance between any pair of nodes, even if edge lengths are not uniform.

Overview:

One drawback of a spanning tree is that a single link failure disconnects the network. Whenever link failures occur, it has to replace by a single other link called swap link to reconnect the network. Among all possible swap links, there is a need to choose a best swap to minimize the resulting swap tree diameter.

Swap tree does not use the failed link like a minimum diameter spanning tree. The reason for preferring a swap tree is only one edge goes into service and routing can be managed with less effort. There is a moderate loss in diameter in choosing swap tree against adjusting an entire tree. When compared to that of the diameter of an entire adjusted tree which is a factor of 2.5 smaller than the swap tree diameter. There is a need to pre-compute each edge of the tree to get a best swap edge. Distributed computation of all best swaps has more efficiency as dependencies between the computations for failing edges can be exploited. When a failing edge is replaced by a best swap edge, we have a compact routing scheme for trees which can quickly and inexpensively adapt routing in distributed algorithm.

Distributed algorithm computes the best swap edge for every failing edge depends on the information available after the pre processing phase. To compute all best swap edges of a tree there is a need to execute this algorithm for each edge of tree independently.

Conclusions:

When computing best swap edges for a minimum diameter spanning tree, the solution obtained by this paper is asynchronous, needs a unique identifiers from a linearly ordered universe also uses time, small messages or messages size.

September 23, 2012September 23, 2012

Multiple Access techniques Used in Cellular technology and implementation of signals in C language

M.Sc. Project
M.Sc. Project Proposal
Student Name
Enrolment number
Project title	Multiple Access techniques Used in Cellular technology and implementation of signals in C language.
Is this an external project? Please note the warnings in the handbook	No
Proposed Project Supervisor: (First choice)
Proposed Project Supervisor: (Second choice)
Short description of the project:
Multiple-access channels are the mathematical model for a number of channels of interest. For instance, in cellular communications if we consider one cell in isolation then the channel seen by the mobile stations when transmitting to the base station can be modelled a multiple-access channel. Compared to a point-to-point channel, a multiple-access channel has the additional difficulty of the interference that users create with one another. This project explains all the multiple access techniques that make up a cellular communication.
Ethical and Legal Considerations
I believe that it is a most prestigious opportunity to get a chance to work on a project under the guidance of an esteemed univeristy in the subject of my choice. I will take extreme care to write my project with through research and shall not copy or state any information that is designed by others. I will make it a point to invest time and hardwork to get the best of my project under the guidance of my supervisor.
Main Aim of the Project
To discuss technologies used in cellular communication industry.
Project Objectives
To show the development in the communication industry.To state techniques used in the cellular industry.To show how, where, when communications occur and their proceedings. To show how the network is established and working procedures in detail.
Project Plan
To initiate the communication basics—1^st stageTo research the technologies that were previously used and why it was developed to the present. 2^nd stageHow the development occurred, the necessity for the improvement- 3^rd stage Try to meet individual agencies related to the project and take opinions and suggestions on the future of this technology—4^th stage Prepare the required paper work for the stages above—5^th stage. Take details of the references and get all together for the submission date—final stage.
References
Internet explorer, books, journals etc.

September 23, 2012

MSc Project – Guidelines on completing a Proposal

The proposal must use the template provided on Blackboard.

Student Name and Enrollment Number

Please ensure you complete these details

Project Title

The project title should be one you have devised yourself. If you do not have an idea for your project, look at the list of previous projects available on blackboard.

Is this an External Project?

An external project is any project that is defined or carried out outside of the University of Glamorgan. These projects may have an advantage in that commercially sponsored projects can lead to employment. However this type of project has an inherent risk with the student possibly limiting access to university facilities and staff and in the case of commercial projects conflicting project goals.

Proposed Supervisor (First choice)

This is your first choice of supervisor. It is not possible to guarantee the choice of supervisor.

Proposed Supervisor (Second choice)

This is the second choice of supervisor. It is not possible to guarantee the choice of supervisor.

Short Description of the Project

This should in 300-400 words provide some background as to the project.

Ethical and Legal Considerations

You should identify any ethical and legal issues relating to your project and explain how any such issues will be addressed.

You may find it useful to consult the University’s “General Ethical Guidelines for Research and Consultancy” when completing this section.

Main Aim of the Project

You should provide an overall aim for your project, which is a declaration of what you would like to achieve at the end of the project.

Project Objectives

Around 3-4 objectives, which act as clearly defined stages that make up your project. The objectives should focus on the research which sets the context for the project, what you intend to create to achieve your aim, and how you intend critically evaluating your project.

Project Plan

A project plan should be provided which provides an estimate of the time that you think you need in order to meet each of your objectives.

References

Provide a small number of key references which relate to your project topic. This will demonstrate that your project is current and it is supported by articles, papers or books, which are accessible.