Swapan Debbarma

A Review and Analysis of Software Complexity Metrics in Structural Testing

Software metrics is developed and used by the various software organizations for evaluating and assuring software code quality, operation, and maintenance. Software metrics measure various types of software complexity like size metrics, control flow metrics and data flow metrics. These software complexities must be continuously calculated, followed, and controlled. One of the main objectives of software metrics is that applies to a process and product metrics. It is always considered that high degree of complexity in a module is bad in comparison to a low degree of complexity in a module. Software metrics can be used in different phases of the software development lifecycle. This paper reviews the theory, called “software complexity metrics”, and analysis has been done based on static analysis. We try to evaluate and analyze different aspects of software metrics in structural testing which offers of estimating the effort needed for testing.

Voice Recognition and Authentication as a Proficient Biometric Tool and its Application in Online Exam for P.H People

Voice Recognition is a fascinating field spanning several areas of computer science and mathematics. Reliable speech recognition is a hard problem, requiring a combination of many complex techniques; however modern methods have been able to achieve an impressive degree of accuracy. On the other hand, today, most of the companies or institutes are conducting their examinations online to be a part of this best ever growing world. In this system user can give any available examination at any accessible center as per his/her choice and authority also can condense manpower and process delay overhead. This paper offers one way to conduct online examination for physically challenged people who can use their voice only to register and attend the examination. In addition, in the course of this paper it has been tried to authenticate one registered user and to make the authentication process persistent throughout the examination interlude.

Morphological analysis of Kokborok for universal networking language dictionary

This paper focuses on morphological analysis of Kokborok words to incorporate them into Kokborok dictionary and Kokborok Machine translator. So far, no attempt has been made to integrate the works for a concrete computational output. In this paper we particularly emphasize on bringing works on morphological analysis in the frame, with the goal to produce a Kokborok-dictionary, as well as Machine Translator, which will provide a unified base to fit into already developed universal conversion systems of UNL. We explain the morphological rules of Kokborok words for UNL structures. These rules tend to expose the modifications of parts of speech with regards to tense, person, subject etc. of the words of a sentence. Here we outline the morphology of nouns, verbs and adjective phrases only.

Improvisation of Biometrics Authentication and Identification through Keystrokes Pattern Analysis

In this paper we presented one fresh approach where the authentic users typing credentials are combined with the password to make authentication convincingly more secure than the usual password used in both offline and online transactions. With the help of empirical data and prototype implementation of the approach, we justified that our approach is ease of use, improved in security and performance. In normal approach different keystroke event timing is used for user profile creation. Keystroke latency and duration is inadequate for user authentication, which motivates exploring other matrices. In this paper we proposed combination of different matrices and calculation of degree of disorder on keystroke latency as well as duration to generate user profile. Statistical analysis on these matrices evaluates enhanced authentication process.

Scenario Based Pause Time Analysis of AODV, DSDV and DSR over CBR Connections in MANET

These Mobile Adhoc Network (MANET) is self-managing and governing network with their unique infrastructure less feature. There are many routing protocols have been proposed for the needs for research in MANET .The objective of this paper is to analyze and compare the behavior of three most popular routing protocols i.e. Ad-hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance Vector routing protocol (DSDV) and Dynamic Source Routing (DSR) using Network Simulator-ns-2 which is a discrete event open source simulator targeted at wired and wireless networking research .Here evaluation based on performance metrics such as packet-delivery-fraction (PDF) ,average end-to-end delay of data packets and data packet loss by keeping different pause time.

A Novel Reversible Data Hiding Technique with High Capacity and Less Overhead Information

paper, a new reversible image hiding scheme based on histogram shifting for grayscale images is proposed. As is known, the payload storage of histogram-based reversible data hiding is impacted by the overhead information of the pixel positions that have to be embedded in a cover image. To solve this problem, the cover image is divided into two parts, namely the Most Significant Part (MSP) and the Least Significant Part (LSP), secret data is hidden by shifting the histogram of the most significant part. To increase the payload of embedded data in a cover image, the proposed algorithm reduces the number of bits that represent the secret data without any corruption of that secret data. In addition, overflow and underflow problems are prevented by categorization of the histogram into three categories. According to the experimental results, the cover image is recovered correctly. A higher hiding capacity can be obtained and a good quality marked image is preserved when the proposed scheme is applied to hide the secret data by shifting the histogram of the most significant part instead of hiding by shifting the histogram of the whole cover image.

Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives

We consider a single-machine scheduling problem with two-agents, each with a set of non-pre-emptive jobs, where two agents compete for the use of a single processing resource. A switchover time arises whenever a job of one agent is processed after a job of another agent. Each agent wants to minimize a certain objective function, which depends upon the completion time and switchover time of their own jobs only. This paper considers the minimization of total weighted completion time of the first agent subject to an upper bound on the makespan of the second agent. We introduce some properties to the problem. The properties describe the structure of an optimal solution which is being used for developing an optimal algorithm. We propose an optimal algorithm, a simple heuristic algorithm, and a particle-swarm-based meta heuristic algorithm to solve the problem. The heuristic algorithm is based on the weighted shortest process time-first rule. The performances of the heuristic and particle swarm algorithms are evaluated on randomly generated problem instances. We perform the numerical analysis to reveal the properties of the proposed problem.

Keypoints based copy-move forgery detection of digital images

One of the most researched areas in digital image forensics is the copy-move forgery detection where part of the image is copied and paste in the same image. This is done with a motive to either highlight a particular object or to hide or remove an object from the image. Keypoints based approach uses descriptors from specific areas on the image unlike block based methods where features are extracted from every blocks. This lead to a smaller number of descriptors and hence a faster detection algorithm can be devised using keypoints. There are number of keypoints detection algorithms available such as SIFT, SURF, GLOH etc., in this paper we are using SIFT and SURF for the purpose of feature extraction and forgery detection. We also compare the performance of the two approaches in terms of speed and accuracy. Multiple cloning of region is also taken care of using iterative method in matching.

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

In this paper we perform analysis of the previous implementations and demonstrate feasibility of our implementation in a commercial operating system, without having to modify the kernel source code. We present SMP structure of VxWorks and how it can be used by extension of previous designs of hierarchical scheduling framework.

Vision in IT from Cloud Computing

Our paper proposes a new concept for Automatic- economic IT and optimum usage of resource in IT, especially for educational institutes. Theoretical background and overview is presented on the basic underlying principles, auto- utility computing, Service Oriented Architecture (SOA) . Their relation to cloud computing is explored and focused as a case for scaling out vs. scaling up is made and scaling out of relational databases in traditional application is stressed a bottleneck. The rapid development in IT and availability of services at low cost has exponentially expanded the use of internet for multiple applications. By evaluating strategic issues and weighting in economic adoption pros and cons. Cloud computing is expected to be an economically visible alternative to conventional methodology for implementation of projects without compromising the quality of services. This paper specifically point out cost efficiency, vendor lock in effects leading to operational risks to be prevailing for the majority of larger business customers that could potentially mandate their IT and computing needs from the cloud. Leading Current cloud architectures are compared in software industry. By exploration, it is found that the process of cloud architecture deployment will be gradual. Ultimately, conclusion will lead to an outlook and recommendations for companies and cloud providers.