International Journal of Information Technology and Computer Science (IJITCS)

IJITCS Vol. 5, No. 6, May. 2013

Cover page and Table of Contents: PDF (size: 196KB)

Table Of Contents

REGULAR PAPERS

Ultrasound Image Despeckling using Local Binary Pattern Weighted Linear Filtering

By Simily Joseph Kannan Balakrishnan M.R. Balachandran Nair Reji Rajan Varghese

DOI: https://doi.org/10.5815/ijitcs.2013.06.01, Pub. Date: 8 May 2013

Speckle noise formed as a result of the coherent nature of ultrasound imaging affects the lesion detectability. We have proposed a new weighted linear filtering approach using Local Binary Patterns (LBP) for reducing the speckle noise in ultrasound images. The new filter achieves good results in reducing the noise without affecting the image content. The performance of the proposed filter has been compared with some of the commonly used denoising filters. The proposed filter outperforms the existing filters in terms of quantitative analysis and in edge preservation. The experimental analysis is done using various ultrasound images.

[...] Read more.
Random Connection Based Scale-free Networks

By Shun-Li Lou Xu-Hua Yang

DOI: https://doi.org/10.5815/ijitcs.2013.06.02, Pub. Date: 8 May 2013

Scale-free phenomenon has opened up a new network model as a special form of degree distribution. Preferential connection and growth constitutive are generally considered as the tow key factors in the formation of scale-free network. However, some network model with completely random connections instead of preferential connection can also generate scale-free networks, such as the protein interaction network in a cell. The article constructed such a random connection way: select an arbitrary neighbor vertex of a random vertex to add side. Through our simulation shows this model absolutely has the characteristics of scale-free networks. And the power-law distribution index [1+β^(-1)] of the new model is related to m which is the number of add edges every time. When m is sufficiently large, [1+β^(-1)] tends to quickly stable and the final size is 3. Then we use the Mean field theory analyzed theoretically, and get an analytic solution of degree distribution. Our study reveals that random connections without preferential strategy can also generate scale-free network.

[...] Read more.
Improvement over the OLSR Routing Protocol in Mobile Ad Hoc Networks by Eliminating the Unnecessary Loops

By Shahram Behzad Reza Fotohi Shahram Jamali

DOI: https://doi.org/10.5815/ijitcs.2013.06.03, Pub. Date: 8 May 2013

Mobile ad hoc networks are type of wireless networks in which any kind of infrastructure is not used, i.e. there are no infrastructures such as routers or switches or anything else on the network that can be used to support the network structure and the nodes has mobility. The purpose of this paper is to provide a better quality of the package delivery rate and the throughput, that is in need of powerful routing protocol standards, which can guarantee delivering of the packages to destinations, and the throughput on a network. For achieving this purpose, we use OLSR routing protocol that is a responsive protocol and is currently covered under the IETF standard (RFC 3626). At this paper, we improved the OLSR routing protocol by eliminating the unnecessary loops, and simulation results demonstrated a significant improvement in the criteria of package delivery rate and throughput.

[...] Read more.
Secured and Optimized AODV for Wireless Sensor Networks

By Benamar KADRI Mohammed FEHAM Abdellah MHAMMED

DOI: https://doi.org/10.5815/ijitcs.2013.06.04, Pub. Date: 8 May 2013

Similar to conventional wireless networks, WSNs are based on multi hop routing to ensure connectivity and data forwarding which makes the routing service a challenging task due to the nature of sensors usually limited in memory, battery and computing capacities as well as the nature of the environment which is hostile and unpredictable making the routing protocols developed for conventional wireless network useless for WSNs without modifications and adaptations for the new context of WSNs. Thus in this paper we present an optimized version of AODV protocol for WSNs which takes into consideration the traffic pattern of WSNs and sensors’ constraints. In the proposed protocol we affect the task of route discovery to the base station which periodically informs sensors about its location instead of letting this task to sensors which consumes the network resources due to the broadcasting nature of the route discovery. We have also proposed a key distribution scheme destined to establish a symmetric encrypting key between each sensor and the base station, the proposed key management scheme uses the underlying routing requests to execute handshakes and key update which have greatly saved the network resources and ensured a good threshold of security.

[...] Read more.
gSemSim: Semantic Similarity Measure for Intra Gene Ontology Terms

By Muhammad Naeem Saira Gillani Muhammad Abdul Qadir Sohail Asghar

DOI: https://doi.org/10.5815/ijitcs.2013.06.05, Pub. Date: 8 May 2013

Gene Ontology (GO) is an important bioinformatics scheme to unify the representation of gene and gene product attributes across all species. Measuring similarity or distance between GO terms is a key step for determining hidden relationship between genes. The notion of similarity between GO terms is a usual step in knowledge discovery related tasks. In literature various similarity measures between GO terms have been proposed. We have introduced a novel similarity measure scheme to improve three conventional similarity measures to reduce their limitations. The salient feature of the proposed GO Semantic Similarity (gSemSim) measure is its ability to show more realistic similarity between concepts in perspective of domain knowledge. A comparative result with other technique has also been presented that showing an improved contextual meaning of the proposed semantic similarity. This study is expected to assist the community of bio informaticians in the selection of better similarity measure required for correct annotations of genes in gene ontology.

[...] Read more.
Intelligent Vision Methodology for Detection of the Cutting Tool Breakage

By Abdallah A. Alshennawy Ayman A. Aly

DOI: https://doi.org/10.5815/ijitcs.2013.06.06, Pub. Date: 8 May 2013

In this paper, a new Intelligent system based on neurofuzzy for detecting and diagnostics the wear and damage of the milling cutter is presented. The compatibility between the computer vision and neurofuzzy techniques is introduced. The proposed approaches consists of capturing the milling cutter image, Fuzzy edge detection, Chain code technique for feature extraction and finally, apply the neural network on the feature. The results of the study are three different diagnostics models, The first is diagnostic model for the original profile of the perfect cutter, the second is model for the wearied profile and the third is model for the damage profile. Experimental test results show that the proposed system is reliable, practical and can be used for the easy distinguish between the wear and damage automatically.

[...] Read more.
The Major Physical Layer Constraints of Fiber Optical fiber Packet Switch Architectures

By Devesh Pratap Singh

DOI: https://doi.org/10.5815/ijitcs.2013.06.07, Pub. Date: 8 May 2013

Many optical packet switch (OPS) architectures are proposed and demonstrated. In the design of these architectures, most of the attention is paid on the network layer parameters like high through put (low packet loss probability) and low latency, etc. and to achieve these goals. The structure of the architectures becomes very complex. In real scenarios, these architectures may not work efficiently because of physical layer constraints. Hence, cross layer optimization needs to be considered. This paper addresses the major physical layer constraints, and it has been found that the optical packet switch architecture can work efficiently within the bounded regimes which can be called as an operation window.

[...] Read more.
Study of Parametric Performance Evaluation of Machine Learning and Statistical Classifiers

By Yugal kumar G. Sahoo

DOI: https://doi.org/10.5815/ijitcs.2013.06.08, Pub. Date: 8 May 2013

Most of the researchers/ scientists are facing data explosion problem presently. Large amount of data is available in the world i.e. data from science, industry, business, survey and many other areas. The main task is how to prune the data and extract valuable information from these data which can be used for decision making. The answer of this question is data mining. Data Mining is popular topic among researchers. There is lot of work that cannot be explored in the field of data mining till now. A large number of data mining tools/software’s are available which are used for mining the valuable information from the datasets and draw new conclusion based on the mined information. These tools used different type of classifiers to classify the data. Many researchers have used different type of tools with different classifiers to obtained desired results. In this paper three classifiers i.e. Bayes, Neural Network and Tree are used with two datasets to obtain desired results. The performance of these classifiers is analyzed with the help of Mean Absolute Error, Root Mean-Squared Error, Time Taken, Correctly Classified Instance, Incorrectly Classified instance and Kappa Statistic parameter.

[...] Read more.
An Efficient IBE Scheme using IFP and DDLP

By Chandrashekhar Meshram

DOI: https://doi.org/10.5815/ijitcs.2013.06.09, Pub. Date: 8 May 2013

In 1984, Shamir introduced the concept of an identity-based encryption. In this system, each user needs to visit a private key generation (PKG) and identify him- self before joining a communication network. Once a user is accepted, the PKG will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communication partner and the public key of the PKG. There is no public file required in this system. However, Shamir did not succeed in constructing an identity based encryption, but only in constructing an identity-based signature (IBS) scheme. In this paper, we propose an identity based encryption (IBE) based on the factorization problem (IFP) and double discrete logarithm problem (DDLP) and we consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.

[...] Read more.
Performance Analysis of MANET Routing Protocols in Different Mobility Models

By Anuj K. Gupta Harsh Sadawarti Anil K. Verma

DOI: https://doi.org/10.5815/ijitcs.2013.06.10, Pub. Date: 8 May 2013

A mobile ad-hoc network (MANET) is basically called as a network without any central administration or fixed infrastructure. It consists of a number of mobile nodes that use to send data packets through a wireless medium. There is always a need of a good routing protocol in order to establish the connection between mobile nodes since they possess the property of dynamic changing topology. Further, in all the existing routing protocols, mobility of a node has always been one of the important characteristics in determining the overall performance of the ad hoc network. Thus, it is essential to know about various mobility models and their effect on the routing protocols. In this paper, we have made an attempt to compare different mobility models and provide an overview of their current research status. The main focus is on Random Mobility Models and Group Mobility Models. Firstly, we present a survey of the characteristics, drawbacks and research challenges of mobility modeling. At the last we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Also, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

[...] Read more.