Tuesday 13 May 2014

Palmprint Verification Based On Competitive Coding and Robust Line Orientation Coding Schemes

Vol. 8 No. 2

Year: 2013

Issue : Oct-Dec

Title : Palmprint Verification Based On Competitive Coding and Robust Line Orientation Coding Schemes

Author Name : MARY JEYA PRIYA R, GAYATHRI S , LAKSHMIPRIYA C , ARUNKUMAR M

Synopsis :

There is an increasing interest in the development of reliable, rapid and non-intrusive security control systems. Among the many approaches, biometrics such as palmprints provide highly effective automatic mechanisms used for personal identification. This paper proposed a new method for extracting features from palmprints using the Competitive Coding Scheme and Robust Line Orientation Coding(RLOC) Scheme. The Competitive Coding Scheme uses multiple 2-D Gabor filters to extract orientation information from palm lines. This information is then stored in a feature vector called the Competitive Code. In Robust Line Orientation Code for palmprint verification, performance is improved by using three strategies. Firstly, a modified finite Radon transform (MFRAT) is proposed, which can extract the orientation feature of palmprint more accurately and solve the problem of sub-sampling. Secondly, the authors construct an enlarged training set to solve the problem of large rotations caused by imperfect preprocessing. Finally, a matching algorithm based on pixel-to-area comparison has been designed, which has better fault tolerant ability. The experimental results of verification on Palmprint Database show that the proposed approach has higher recognition rate and faster processing speed.



For more details:

HASHIM J. HASAN, Mohammad Alshraideh, Basel A. Mahafzah

Vol. 8 No. 2

Year: 2013

Issue : Oct-Dec

Title : Branch Coverage Testing Using Anti-Random Technique

Author Name : HASHIM J. HASAN, Mohammad Alshraideh, Basel A. Mahafzah

Synopsis :

Software testing is one of the most important, costly and time consuming phase in software development. Anti-random testing chooses the test case where it's total distance from all previous test cases is the maximum, using the Hamming distance and Cartesian distance as measures of difference. In this paper, the authors present an anti-random technique to achieve high branch coverage in white-box testing, depending on the hypothesis that any two test values with small distance mostly discover the same errors and faults. Experimental results show that anti-random testing yields acceptable results, but the target of branch coverage is not achieved in all cases. We executed the algorithm 60 times over ten different programs, and they found that coverage achieved for eight programs runs with high performance in terms of execution time.



For more details:

Blu-Versity – An Ubiquitous

Vol. 8 No. 2

Year: 2013

Issue : Oct-Dec

Title : Blu-Versity – An Ubiquitous

Author Name : SUGUNA. K, SUMAIYA S, VIGNESH V

Synopsis :

“Blu-Versity” is a prototype implementation for localizing the information gathering within a university campus. By making the information ubiquitous, blu-versity promotes its ability to support a wide range of information gathering for the students. Information availability is particularly low to the students despite of technological advancement. Students within a university campus, find it increasingly difficult to locate and access the essential information. This paper aims at providing a solution for eradicating the above problem, and make the necessary environmental modifications for the students in gathering information. A context-aware university campus is built, in combination with the widespread availability of handheld devices (like mobile devices, PDAs and smart devices) and which eliminate the difficulties present for the students in acquiring the essential information.



For more details:

Efficient Mining Of High Utility Patterns Using Frequent Pattern Growth Algorithm

Vol. 8 No. 2

Year: 2013

Issue : Oct-Dec

Title : Efficient Mining Of High Utility Patterns Using Frequent Pattern Growth Algorithm

Author Name : Asha Pandian, T.Jeba Rajan

Synopsis :

Data mining aims at extracting only the useful information from very large databases. Association Rule Mining (ARM) is a technique that tries to find the frequent itemsets or closely associated patterns among the existing items from the given database. Traditional methods of frequent itemset mining, assumes that the data is centralized and static which impose excessive communication overhead when the data is distributed, and they waste computational resources when the data is dynamic. To overcome this, Utility Pattern Mining Algorithm is proposed, in which itemsets are maintained in a tree based data structure, called as Utility Pattern Tree, which generates the itemset without examining the entire database, and has minimal communication overhead when mining with respect to distributed and dynamic databases. Hence, it provides faster execution, that is reduced time and cost.



For more details:

Performance Analysis of Modified OLSR Protocol for MANET

Vol. 8 No. 2

Year: 2013

Issue : Oct-Dec

Title : Performance Analysis of Modified OLSR Protocol for MANET

Author Name : Prabu K, Subramani A

Synopsis :

Mobile Ad-hoc Network (MANET) is an emerging area of research in the communication network world. MANET is a group of wireless mobile nodes dynamically establishing a short lived network without any use of network infrastructure or centralized administration. In addition to the high degree of mobility, MANET nodes are distinguished by their limited resources such as power, bandwidth, processing, and memory. In this paper, the authors modified proactive Optimized Link State Routing (OLSR) Protocol for MANET through the proposed new routing algorithm named Energy Saver Path Routing (ESPR) algorithm and the evaluation of this routing algorithm is compared with ordinary OLSR protocol through experiments and simulations. This proposed ESPR algorithm takes minimum energy to find the path between source and destination through edge node calculation. This edge node calculation is executed based on the highest potential score node selection towards destination with sufficient forward capacity. This ESPR algorithm provide better performance than ordinary OLSR and also improved packet delivery ratio, reduced end-to-end delay and reduced transmission power to transfer the packet from source to destination.



For more details:








Monday 17 March 2014

The Software Architecture Towards Performance Evolution

Vol. 8 No. 1

Year: 2013

Issue : Jul-Sep

Title : The Software Architecture Towards Performance Evolution

Author Name : R. AROUL CANESSANE, Dr.S.Srinivasan

Synopsis :

Performance of a system is one of the key factors to be considered while building a system, due to the system characteristics such as code mobility, platform heterogeneity and distributed deployment. The decisions that are taken at the time of creating software architectural design have a major impact on the resulting system. Some of the performance indices are mostly hidden. The authors have proposed a design Framework which uses an iterative method for evaluating and also transforming software architecture until the performance indices are satisfied. There are several methodologies proposed for automating the software- hardware models to a performance models. The framework provides a set of resource models, annotations and the integration procedures which supports simulation and makes the performance analysis easier. They have presented the results from a SmartHome system which shows the stability of our approach.


For more details

A New Model For E-Business Performance Testing

Vol. 8 No. 1

Year: 2013

Issue : Jul-Sep

Title : A New Model For E-Business Performance Testing

Author Name : PUTTUMBAKU CHITTI BABU, K.C.K. Bharathi , J. Shaik Mohamed

Synopsis :

The extraordinary growth in the World Wide Web has been sweeping through business and industry. By using web technologies many companies have developed or integrated their critical applications. Testing web applications become crucial, particularly as performance of web applications become complex. Performance of many Web sites depends on the load on the site at peak time under varying conditions. Performance testing is normally conducted with the help of performance testing tools in a reasonable simulated environment. As user is the ultimate judge for the success of web site. Performance perceived by the user is most crucial. Due to complexity of web site, it is not possible to draw a common denominator for user perception of the Web site and designer's viewpoint. It is necessary to analyze the users perceptions and modulate to fit into the designer's shoes in such circumstance. This paper proposes a new model, which enforces the designer to incorporate the users perception by projecting and modulating the perceptions. Later, the designer would consider the projected perceptions during the performance testing without diluting the reliability.


For more details

Role Of Software Re-Engineering Through C To Java Conversion

Vol. 8 No. 1

Year: 2013

Issue : Jul-Sep

Title : Role Of Software Re-Engineering Through C To Java Conversion

Author Name : VINOD KUMAR YADAV, AJAY PAL SINGH , SATENDRA KUMAR

Synopsis :

Re-engineering is used to support evolutionary maintenance and it is most widely used in modern software development. The Re-engineering occurs at two level of abstraction: at business level and at software level. The term maintenance should be replaced by “re-engineering” or renovation or reclamation because it not only recovers information from existing system but uses this information to alter or reconstitute the existing system in an effect to improve its overall quality. The source code translation is one of the main tasks in software reengineering which is based on source to source transformation which plays an important role. If we want to migrate a procedural language into object oriented programming language because of its reusability of code, the code conversion is necessary due to hardware platform update, staff skill shortage and organization changes.



For more details

Software Quality Prediction Of Object Oriented Software In Successive Releases Through Multiple Classifiers

Vol. 8 No. 1

Year: 2013

Issue : Jul-Sep

Title : Software Quality Prediction Of Object Oriented Software In Successive Releases Through Multiple Classifiers

Author Name : Dharmendra Lal Gupta, Dr. Anil Kumar Malviya

Synopsis :

In this paper the comparative analysis of a java based text editor jEdit and all its successive releases has been done. Different machine learning classifiers have been used to get findings in terms of Accuracy, Precision, Recall, F-measure and AUC values. Based on all performance measures it is concluded that the bugs are decreasing release by release and quality is increasing as well. The authors have used WEKA a machine learning tool for finding and analysing of the results.



For more details

Performance Evaluation Of Fuzzy Voters Used In Safety Critical Systems

Vol. 8 No. 1

Year: 2013

Issue : Jul-Sep

Title : Performance Evaluation Of Fuzzy Voters Used In Safety Critical Systems

Author Name : Phani Kumar, SeethaRamaiah Panchumarthy , Anu Gokhale

Synopsis :

The main objective of this research paper is to design a self configurable dynamic fuzzy voter that can be used in the NModular Redundant (NMR) systems to mask the fault and exhibit better safety performance. Proposed dynamic voter can configure itself for the changing data of any range and changing deviations in the redundant module outputs due to the changes in the operational modes of the safety- critical embedded systems while in operation. In this paper, existing fuzzy voters are extensively surveyed and the merits and demerits or limitations are discussed. The major limitation observed in the existing fuzzy voters is the preselected optimal static fuzzy parameter selection technique. Preselected optimal fuzzy parameters may work for only specific ranges of data and specific amount of deviations among the redundant modules outputs of NMR systems but fail for the changing data ranges and deviations conditions. A dynamic fuzzy parameter selection method using statistical parameters on the local data in each voting cycle is proposed in this paper and applied to the existing static fuzzy voters. Static and dynamic versions of the fuzzy voters are empirically evaluated for 10,000 voting cycles and safety performance is plotted. Dynamic voters have shown improved safety performance compared to their static counterparts and are more useful for the changing operational modes and conditions.


For more details