Moving Object Detection and Segmentation using Frame Differencing and Summing Technique

technology of motion detection has become one of the important research areas in computer vision. In surveillance video this has got a number of applications which range from indoor and outdoor security environment, traffic control, behavior detection during spot activities and for compression of video. In this paper simple but robust moving object detection and segmentation algorithm is proposed. The algorithm is based on the background subtraction. A differencing and summing technique (DST) has been used for the moving object detection and segmentation. This method is simple and low in computational complexity as compared to traditional object identification and segmentation techniques. The experimental results show that the proposed method work efficiently in identifying and segmenting moving objects, both in indoor as well as in outdoor environment with static background.

Performance Analysis of N-Queen Problem using Backtracking and Genetic Algorithm Techniques

In this paper the research work has done comparative analysis of one of the famous NP hard problem: NQueen using traditional Backtraking and Genetic Algorithm(GA). The research work has implemented the solution of the NQueen problem using backtracking and using GA. Both the methods of solving NQueen problem are entirely different. The first one is general method and takes time in days , months and years as N increases. In this paper the time taken by the two methods for a given value of N are compared. The work has restricted values of N upto 50 only as beyond this it is extremely difficult to get the solution of the problem using backtracking method. Both the implementation have been carried out in MATLAB using Pentium Core 2 Duo T6600 Core 2.2 GHz processor on Windows 8 with 4GB RAM. Because of the random nature of GA instead of time taken in obtaining all possible solutions for a given value of N, the time taken in obtaining say count number of solutions was first determined using GA, then time taken in same number of solutions that is count using backtracking was noted. Results are then presented in tabular manner. General Terms Backtracking, collisions, NP, problem

A Security Framework for E-Business Applications

During the electronic business, the clients and the merchants make use of the internet. Thus, we can say that the internet, the client, and the merchant are the components for the electronic business. The Electronic Business involves various categories of businesses. These various types of e-businesses have different types of security requirements to keep the businesses secure. The threats to these types of businesses prohibit people from believing on them. Except highly educated, people often do not take much interest in believing much on the services provided by e-businesses because of the problems of security in doing these types of businesses. We are proposing here a framework that can be implemented on various categories of e-business so that it can be trusted by most of the people. The framework can be used to define the possibilities of threats for the various categories. Using these possibilities, it is possible to give a prediction of the level of security needed for these categories.

New Data Compression Algorithm and its Comparative Study with Existing Techniques

Data compression is a technique to represent data using less number of bits than original data. There are various data compression techniques available, but still there is a need to achieve more compression ratio. This paper proposes an algorithm that combines the features of both Huffman’s algorithm and LZW algorithm to achieve more compression ratio. This algorithm is named as VJ Zip. In the new algorithm VJ Zip, for compression, firstly every duplicate occurrence of data is replaced with the pointer to its previous occurrence to obtain partially compressed data. From this partially compressed data, the literals and pointers are further compressed using two separate Huffman trees. We measure the performance of this new algorithm in terms of compression ratio and also compare the performance of this new modified algorithm with the two algorithms viz., Huffman’s algorithm and LZW algorithm, individually. Comparing the results it is inferred that new modified algorithm, VJ Zip, is more efficient than Huffman’s algorithm and LZW algorithm applied individually. On an Average, it achieves 26% & 54% more compression ratio for .txt and .xml format respectively, as compared to Huffman’s algorithm and16% & 18% more compression ratio for .txt and .xml format respectively, as compared to LZW. Also this paper compares the performance of new algorithm with the existing software 7Zip.As compared to 7Zip new modified algorithm gives almost same compression ratios for text format while achieves 1% more compression ratio for images and videos.

On the Application of Three-Term Conjugate Gradient Method in Regression Analysis

Conjugate gradient methods have played a useful and powerful role for solving large-scale optimization problems which has become more interesting and essential in many disciplines such as in engineering, statistics, physical sciences, social and behavioral sciences among others. In this paper, we present an application of a proposed three-term conjugate gradient method in regression analysis. Numerical experiments show that the proposed method is promising and superior to many well-known conjugate gradient methods in terms of efficiency and robustness.

Acknowledgment Time Delay Approach to Optimize TCP Performance in Hybrid Networked Systems

Transmission Control Protocol (TCP) is connection oriented transport protocol used on IP in wireless medium and it insists lossless data transmission in proper order. When TCP is used as a transmission protocol where physical layer is wireless medium, results high packet reordering due to bursty traffic and drastic variation in quality of service with respect to time. By sharing the same path for data and acknowledgement increases the traffic and collision, resulting in reduced throughput. In order to improve QoS this paper proposes a solution “Improved Delay the Duplicate Acknowledgement” (IDDA). This reduces traffic and spurious retransmissions, thereby improving TCP performance.

An Accreditation Exhibit Repository for Higher Education Institution

This project study aimed to develop a solution that will integrate the latest ICT technologies, carefully planned policies, procedures and dedicated people to design an accreditation exhibit repository for Higher Education Institution. Specifically, it aimed to identify the problems encountered in the traditional exhibit preparation and management. The researchers employed the descriptive-developmental research. This suits the situation since this kind of study focuses on the prevailing condition and assess changes over a period of time. For the software development, extreme programming where employed which is intended to improve software quality and responsiveness to changing stakeholder requirements. The researchers used different elicitation techniques such as interview, observation, survey, document analysis, and downloading of supporting materials. These are utilized in order to gather important information to support the project. There are different tools used to analyze gathered data such as use case diagram, entity-relationship diagram, database schema, sitemap, Ishikawa diagram (cause-and-effect diagram) and some statistical tools such as the use of frequency count and percentage. With the preparation and management evidences, the following problems were discovered: exhibits are presented in different sizes, kinds and formats; there is a large amount of evidences to be gathered; consolidation of exhibits from different sources and keeping all of its versions in-tack; duplication of evidences. Evidences might be needed in more than one sub-criteria and/or section; and accessibility of exhibits. Not all evidence can be accessed by anyone. The developed Accreditation Exhibit Repository for Higher Education Institution will help solve the problems identified in the preparation and management of exhibits for accreditation purposes. The system was tested on its acceptability and it was found out that it may handle the rigorous task of handling accreditation exhibits during and after the accreditation visit by the accrediting body.

Enhanced CSMA/CA Contention Window for Efficient Random Access in IEEE 802. 15. 6

Survey of Integrity Verification in Multi-Cloud Storage by Efficient Cooperative Provable Data Possession

Provable data possession (PDP) is one of the techniques to ensure the integrity of data in storage outsourcing. Here in this paper, we speak to the creation of an efficient PDP method for distributed cloud storage to maintain the scalability of service and data migration. On the basis on homomorphic verifiable response and hash index hierarchy we projected a cooperative PDP (CPDP) method. We confirm the security of our method based on multi-prover zero- knowledge proof scheme, which can satisfy knowledge soundness, fullness , and zero-knowledge properties. As well, we expressive performance optimization mechanisms for our method, and in particular present an capable method for selecting finest parameter values to reduce the addition expenses of storage service providers and client. Our experiment shows that our solution introduces lower addition and communication overheads in evaluation with non- cooperative approaches. KeywordsData Migration, Homomorphic, Multi-Prover

An Elliptical Routing Protocol for Wireless Mesh Networks: Performance Analysis