IJACSA Vol. 2 Issue 6 (2011)

1

Successful Transmission Rate of Mobile Terminals with Agents in Segmented Ad Hoc Network

Author 1: Kohei Arai Author 2: Lipur Sugiyanta

Mobile Wireless Ad-Hoc Network (MANET) is a special kind of network, where all of the nodes move in time. Random movement is the commonly used to model the mobility in this network. Beside as a host, each node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. In recent years, a variety of routing protocols have been proposed specially to accommodate this environment followed with its performance evaluations, likes DSDV, DSR, AODV, and extension OSPF. Researches in this network are mostly simulation based. Research efforts haven't focused much in evaluating network performance when applied to variable number of nodes that involving agents and distributed over several network areas. The paper performed simulations using MANET simulator, which carried out based on the extension OSPF routing protocol. The modification of OSPF protocol had intended to suit the OSPF standard mechanisms for operating with high performance over wireless networks characterized by a broadcast-based transmission medium, in which the physical layer connectivity is not fully meshed. Extensive simulation scenarios have been conducted in the simulator with various numbers of nodes, random and uniform movement direction, and different agent’s quantity with different size of network areas. In the performance evaluation of successful transmission (data) packets, the OSPF protocol with throughput weighted metric will be tested under different combination conditions of scenarios.

MANET agents movement packet routing network area.

Abstract doi.org/10.14569/IJACSA.2011.020601 PDF

2

Assessing 3-D Uncertain System Stability by Using MATLAB Convex Hull Functions

Author 1: Mohammed Tawfik Hussein

This paper is dealing with the robust stability of an uncertain three dimensional (3-D) system using existence MATLAB convex hull functions. Hence, the uncertain model of plant will be simulated by INTLAB Toolbox; furthermore, the root loci of the characteristic polynomials of the convex hull are obtained to judge whether the uncertain system is stable or not. A design third order example for uncertain parameters is given to validate the proposed approach.

Algorithm 3-D convex hull uncertainty robust stability root locus

Abstract doi.org/10.14569/IJACSA.2011.020602 PDF

3

Automating the Collection of Object Relational Database Metrics

Author 1: Samer M Suleiman Author 2: Qasem A. Al-Radaideh Author 3: Bilal A. Abulhuda Author 4: Izzat M. AlSmadi

The quality of software systems is the most important factor to consider when designing and using these systems. The quality of the database or the database management system is particularly important as it is the backbone for all types of systems that it holds their data. Many researches argued that software with high quality will lead to an effective and secure system. Software quality can be assessed by using software measurements or metrics. Typically, metrics have several problems such as: having no specific standards, sometimes they are hard to measure, while at the same time they are time and resource consuming. Metrics need also to be continuously updated. A possible solution to some of those problems is to automate the process of gathering and assessing those metrics. In this research the metrics that evaluate the complexity of Object Oriented Relational Database (ORDB) are composed of the object oriented metrics and relational database metrics. This research is based on common theoretical calculations and formulations of ORDB metrics proposed by database experts. A tool is developed that takes the ORDB schema as an input and then collects several database structural metrics. Based on those proposed and gathered metrics, a study is conducted and showed that such metrics’ assessment can be very useful in assessing the database complexity.

Object Oriented Relational Database Metrics Software Quality.

Abstract doi.org/10.14569/IJACSA.2011.020603 PDF

4

A Decision Support Tool for Inferring Further Education Desires of Youth in Sri Lanka

Author 1: M.F M Firdhous Author 2: Ravindi Jayasundara

This paper presents the results of a study carried out to identify the factors that influence the further education desires of Sri Lankan youth. Statistical modeling has been initially used to infer the desires of the youth and then a decision support tool has been developed based on the statistical model developed. In order to carry out the analysis and the development of the model, data collected as part of the National Youth Survey has been used. The accuracy of the model and the decision support tool has been tested by using a random data sets and the accuracy was found to be well above 80 percent, which is sufficient for any policy related decision making.

Educational Desires of Youth Univariate Analysis Logit Model Data Mining.

Abstract doi.org/10.14569/IJACSA.2011.020604 PDF

5

An Authorization Mechanism for Access Control of Resources in the Web Services Paradigm

Author 1: Rajender Nath Author 2: Gulshan Ahuja

With the increase in web based enterprise services, there is an increasing trend among business enterprises to migrate to web services platform. Web services paradigm poses a number of new security challenges, which can only be realized by developing effective access control models. The fact that the enterprises allow access to the resources through web services requires development of access control models that can capture relevant information about a service requester at the time of access request and incorporate this information for making effective access control decisions. Researchers have addressed many issues related to authentication and authorization of web services requests for accessing resources, but the issues related to authorization work and identity based access are still poorly addressed. Authors of this paper focus on providing an extended approach to capture relevant information about a service requester and establish a certain level of trust so that amount of authorization work required for accessing any resource is reduced and service requests are served in an efficient manner. Compared with existing access control mechanisms, the proposed mechanism has reduced the amount of authorization work required for accessing resources across varied domains.

Web Services Access Control Authentication Authorization.

Abstract doi.org/10.14569/IJACSA.2011.020605 PDF

6

Design and Implementation on a Sub-band based Acoustic Echo Cancellation Approach

Author 1: Zhixin Chen

This paper describes the design and implementation of a sub-band based acoustic echo cancellation approach, which incorporates the normalized least mean square algorithm and the double talk detection algorithm. According to the simulation, the proposed approach works well in the modest linear noisy environment. Since the proposed approach is implemented in fix-pointed C, it can be easily ported into fixed-point DSPs to cancel acoustic echo in real systems.

Digital Signal Processing Adaptive Filter Acoustic Echo Cancellation.

Abstract doi.org/10.14569/IJACSA.2011.020606 PDF

7

An Efficient Density based Improved K- Medoids Clustering algorithm

Author 1: Raghuvira Pratap A Author 2: K Suvarna Vani Author 3: J Rama Devi Author 4: Dr.K Nageswara Rao

Clustering is the process of classifying objects into different groups by partitioning sets of data into a series of subsets called clusters. Clustering has taken its roots from algorithms like k-medoids and k-medoids. However conventional k-medoids clustering algorithm suffers from many limitations. Firstly, it needs to have prior knowledge about the number of cluster parameter k. Secondly, it also initially needs to make random selection of k representative objects and if these initial k medoids are not selected properly then natural cluster may not be obtained. Thirdly, it is also sensitive to the order of input dataset.Mining knowledge from large amounts of spatial data is known as spatial data mining. It becomes a highly demanding field because huge amounts of spatial data have been collected in various applications ranging from geo-spatial data to bio-medical knowledge. The database can be clustered in many ways depending on the clustering algorithm employed, parameter settings used, and other factors. Multiple clustering can be combined so that the final partitioning of data provides better clustering. In this paper, an efficient density based k-medoids clustering algorithm has been proposed to overcome the drawbacks of DBSCAN and kmedoids clustering algorithms. The result will be an improved version of kmedoids clustering algorithm. This algorithm will perform better than DBSCAN while handling clusters of circularly distributed data points and slightly overlapped clusters.

Clustering DBSCAN Centroid Medoid k-medoids.

Abstract doi.org/10.14569/IJACSA.2011.020607 PDF

8

Context Switching Semaphore with Data Security Issues using Self-healing Approach

Author 1: M Anand Author 2: Dr. S. Ravi Author 3: Kuldeep Chouhan Author 4: Syed Musthak Ahmed

The main objective of a self healing scheme is to share and secure the information of any system at the same time. “Self-healing” techniques ultimately are dependable computing techniques. Specifically self-healing systems have to think for itself without human input, able to boot up backup systems. However, sharing and protection are two contradictory goals. Protection programs may be completely isolated from each other by executing them on separate non-networked computer, however, this precludes sharing.

Self-healing Semaphore Data Security.

Abstract doi.org/10.14569/IJACSA.2011.020608 PDF

9

Mining Educational Data to Analyze Students Performance

Author 1: Brijesh Kumar Baradwaj Author 2: Saurabh Pal

The main objective of higher education institutions is to provide quality education to its students. One way to achieve highest level of quality in higher education system is by discovering knowledge for prediction regarding enrolment of students in a particular course, alienation of traditional classroom teaching model, detection of unfair means used in online examination, detection of abnormal values in the result sheets of the students, prediction about students’ performance and so on. The knowledge is hidden among the educational data set and it is extractable through data mining techniques. Present paper is designed to justify the capabilities of data mining techniques in context of higher education by offering a data mining model for higher education system in the university. In this research, the classification task is used to evaluate student’s performance and as there are many approaches that are used for data classification, the decision tree method is used here. By this task we extract knowledge that describes students’ performance in end semester examination. It helps earlier in identifying the dropouts and students who need special attention and allow the teacher to provide appropriate advising/counseling.

Educational Data Mining (EDM) Classification Knowledge Discovery in Database (KDD) ID3 Algorithm.

Abstract doi.org/10.14569/IJACSA.2011.020609 PDF

10

Comparison between Traditional Approach and Object-Oriented Approach in Software Engineering Development

Author 1: Nabil Mohammed Ali Munassar Author 2: Dr. A. Govardhan

This paper discusses the comparison between Traditional approaches and Object-Oriented approach. Traditional approach has a lot of models that deal with different types of projects such as waterfall, spiral, iterative and v-shaped, but all of them and other lack flexibility to deal with other kinds of projects like Object-Oriented. Object–oriented Software Engineering (OOSE) is an object modeling language and methodology. The approach of using object – oriented techniques for designing a system is referred to as object–oriented design. Object–oriented development approaches are best suited to projects that will imply systems using emerging object technologies to construct, manage, and assemble those objects into useful computer applications. Object oriented design is the continuation of object-oriented analysis, continuing to center the development focus on object modeling techniques.

Software Engineering Traditional Approach Object-Oriented Approach Analysis Design Deployment Test methodology Comparison between Traditional Approach and Object-Oriented Approach

Abstract doi.org/10.14569/IJACSA.2011.020610 PDF

11

Estimation of Dynamic Background and Object Detection in Noisy Visual Surveillance

Author 1: M Sankari Author 2: C. Meena

Dynamic background subtraction in noisy environment for detecting object is a challenging process in computer vision. The proposed algorithm has been used to identify moving objects from the sequence of video frames which contains dynamically changing backgrounds in the noisy atmosphere. There are many challenges in achieving a robust background subtraction algorithm in the external noisy environment. In connection with our previous work, in this paper, we have proposed a methodology to perform background subtraction from moving vehicles in traffic video sequences that combines statistical assumptions of moving objects using the previous frames in the dynamically varying noisy situation. Background image is frequently updated in order to achieve reliability of the motion detection. For that, a binary moving objects hypothesis mask is constructed to classify any group of lattices as being from a moving object based on the optimal threshold. Then, the new incoming information is integrated into the current background image using a Kalman filter. In order to improve the performance, a post-processing has been done. It has been accomplished by shadow and noise removal algorithms operating at the lattice which identifies object-level elements. The results of post-processing can be used to detect object more efficiently. Experimental results and analysis show the prominence of the proposed approach which has achieved an average of 94% accuracy in real-time acquired images.

Background subtraction Background updation Binary segmentation mask Kalman filter Noise removal Shadow removal Traffic video sequences.

Abstract doi.org/10.14569/IJACSA.2011.020611 PDF

12

Improvement of Brain Tissue Segmentation Using Information Fusion Approach

Author 1: Lamiche Chaabane Author 2: Moussaoui Abdelouahab

The fusion of information is a domain of research in full effervescence these last years. Because of increasing of the diversity techniques of images acquisitions, the applications of medical images segmentation, in which we are interested, necessitate most of the time to carry out the fusion of various data sources to have information with high quality. In this paper we propose a system of data fusion through the framework of the possibility theory adapted for the segmentation of MR images. The fusion process is divided into three steps : fuzzy tissue maps are first computed on all images using Fuzzy C- Means algorithm. Fusion is then achieved for all tissues with a fusion operator. Applications on a brain model show very promising results on simulated data and a great concordance between the true segmentation and the proposed system.

Information fusion possibility theory segmentation FCM MR images.

Abstract doi.org/10.14569/IJACSA.2011.020612 PDF

13

Image Retrieval using DST and DST Wavelet Sectorization

Author 1: H B Kekre Author 2: Dhirendra Mishra

The concept of sectorization of the transformed images for CBIR is an innovative idea. This paper introduces the concept of Wavelet generation for Discrete sine transform (DST).The sectorization of the DST transformed images and the DST wavelet transforms has been done into various sector sizes i.e.4,8,12, and 16. The transformation of the images is tried and tested threefold i.e. row wise transformation, column wise transformation and Full transformation. We have formed two planes i.e. plane 1 and plane 2 for sectorization in full transformation .The performance of the all the approaches has been tested by means of the three plots namely average precision-recall cross over point plot, LIRS (Length of initial relevant string of images) plot, LSRR (Length of string to recover all relevant images in the database) plot. The algorithms are analyzed to check the effect of three parameters on the retrieval First the way of transformation (Row, Column, Full), Second the size of sector generated, Third the type of similarity measures used. With the consideration of all these the overall comparison has been performed.

CBIR Feature extraction Precision Recall LIRS LSRR DST DST Wavelet.

Abstract doi.org/10.14569/IJACSA.2011.020613 PDF

14

Performance Analysis of UMTS Cellular Network using Sectorization Based on Capacity and Coverage

Author 1: A.k M Fazlul Author 2: Mir Mohammad Abu Kyum Author 3: Md. Fokhray Hossain

A.K.M Fazlul Haque, Mir Mohammad Abu Kyum, Md. Baitul Al Sadi, Mrinal Kar, Md. Fokhray Hossain Abstract - Universal Mobile Telecommunications System (UMTS) is one of the standards in 3rd generation partnership project (3GPP). Different data rates are offered by UMTS for voice, video conference and other services. This paper presents the performance of UMTS cellular network using sectorization for capacity and coverage. The major contribution is to see the impact of sectorization on capacity and cell coverage in 3G UMTS cellular network. Coverage and capacity are vitally important issues in UMTS cellular Network. Capacity depends on different parameters such as sectorization, energy per bit noise spectral density ratio, voice activity, inter-cell interference and intra-cell interference, soft handoff gain factor, etc and coverage depends on frequency, chip rate, bit rate, mobile maximum power, MS Antenna Gain, EIRP, interference Margin, Noise figure etc. Different parameters that influence the capacity and coverage of UMTS cellular network are simulated using MATLAB 2009a. In this paper, the outputs of simulation for increasing amount of sectorization showed that the number of users gradually increased. The coverage area also gradually increased.

UMTS Capacit Coverage and data rates sectoring.

Abstract doi.org/10.14569/IJACSA.2011.020614 PDF

15

Architecture Aware Programming on Multi-Core Systems

Author 1: M R Pimple Author 2: S.R. Sathe

In order to improve the processor performance, the response of the industry has been to increase the number of cores on the die. One salient feature of multi-core architectures is that they have a varying degree of sharing of caches at different levels. With the advent of multi-core architectures, we are facing the problem that is new to parallel computing, namely, the management of hierarchical caches. Data locality features need to be considered in order to reduce the variance in the performance for different data sizes. In this paper, we propose a programming approach for the algorithms running on shared memory multi-core systems by using blocking, which is a well-known optimization technique coupled with parallel programming paradigm, OpenMP. We have chosen the sizes of various problems based on the architectural parameters of the system like cache level, cache size, cache line size. We studied the cache optimization scheme on commonly used linear algebra applications – matrix multiplication (MM), Gauss-Elimination (GE) and LU Decomposition (LUD) algorithm.

multi-core architecture parallel programming cache miss blocking OpenMP linear algebra.

Abstract doi.org/10.14569/IJACSA.2011.020615 PDF

16

Implementation of ISS - IHAS (Information Security System-Information Hiding in Audio Signal) model with reference to proposed e-cipher Method

Author 1: R Venkateswaran Author 2: Dr. V. Sundaram, Director

This paper shows the possibility of exploiting the features of E- cipher method by using both cryptography and Information hiding in Audio signal methods used to send and receive the message in more secured way. Proposed methodology shows that successfully using these Poly substitutions methods (Proposed E-Cipher) for Encode and decodes messages to evolve a new method for Encrypting and decrypting the messages. Embedding secret messages using audio signal in digital format is now the area in focus. There exist numerous steganography techniques for hiding information in audio medium. In our proposed theme, a new model ISS-IHAS - Embedding Text in Audio Signal that embeds the text like the existing system but with strong encryption that gains the full advantages of cryptography. Using steganography it is possible to conceal the full existence of the original text and the results obtained from the proposed model is compared with other existing techniques and proved to be efficient for textual messages of minimum size as the size of the embedded text is essentially same as that of encrypted text size. This emphasis the fact that we are able to ensure secrecy without an additional cost of extra space consumed for the text to be communicated.

Encryption Decryption Audio data hiding Mono Substitution Poly Substitution.

Abstract doi.org/10.14569/IJACSA.2011.020616 PDF

17

Image Compression using Approximate Matching and Run Length

Author 1: Samir Kumar Bandyopadhyay Author 2: Tuhin Utsab Paul Author 3: Avishek Raychoudhury

Image compression is currently a prominent topic for both military and commercial researchers. Due to rapid growth of digital media and the subsequent need for reduced storage and to transmit the image in an effective manner Image compression is needed. Image compression attempts to reduce the number of bits required to digitally represent an image while maintaining its perceived visual quality. This study concentrates on the lossless compression of image using approximate matching technique and run length encoding. The performance of this method is compared with the available jpeg compression technique over a wide number of images, showing good agreements.

lossless image compression approximate matching run length.

Abstract doi.org/10.14569/IJACSA.2011.020617 PDF

18

Interactive Intranet Portal for effective Management in Tertiary Institution

Author 1: Idogho O Philipa Author 2: Akpado Kenneth Author 3: James Agajo

Interactive Intranet Portal for effective management in Tertiary Institution is an enhanced and interactive method of managing and processing key issues in Tertiary Institution, Problems of result processing, tuition fee payment, library resources management are analyzed in this work. An interface was generated to handle this problem; the software is an interactive one. Several modules are involved in the paper, like: LIBRARY CONSOLE, ADMIN, STAFF, COURSE REGISTRATION, CHECKING OF RESULTS and E-NEWS modules. The server computer shall run the portal as well as OPEN SOURCE Apache Web Server, MySQL Community Edition RDBMS and PHP engine and shall be accessible by client computers on the intranet via thin-client browser such as Microsoft Internet Explorer or Mozilla Firefox. It shall be accessible through a well-secured authentication system. This Project will be developed using OPEN SOURCE technologies such XAMMP developed from WAMP (Windows Apache MySQL and PHP)

Portal Database webA MYSQL Intranet Admin

Abstract doi.org/10.14569/IJACSA.2011.020618 PDF

19

Iris Recognition Using Modified Fuzzy Hypersphere Neural Network with different Distance Measures

Author 1: S Chowhan Author 2: U. V. Kulkarni Author 3: G. N. Shinde

In this paper we describe Iris recognition using Modified Fuzzy Hypersphere Neural Network (MFHSNN) with its learning algorithm, which is an extension of Fuzzy Hypersphere Neural Network (FHSNN) proposed by Kulkarni et al. We have evaluated performance of MFHSNN classifier using different distance measures. It is observed that Bhattacharyya distance is superior in terms of training and recall time as compared to Euclidean and Manhattan distance measures. The feasibility of the MFHSNN has been successfully appraised on CASIA database with 756 images and found superior in terms of generalization and training time with equivalent recall time.

Bhattacharyya distance Iris Segmentation Fuzzy Hypersphere Neural Network.

Abstract doi.org/10.14569/IJACSA.2011.020619 PDF

20

Multi-Agent System Testing: A Survey

Author 1: Zina Houhamdi

In recent years, agent-based systems have received considerable attention in both academics and industry. The agent-oriented paradigm can be considered a natural extension to the object-oriented (OO) paradigm. Agents differ from objects in many issues which require special modeling elements but have some similarities. Although there is a well-defined OO testing technique, agent-oriented development has neither a standard development process nor a standard testing technique. In this paper, we will give an introduction to most recent works presented in the area of testing distributed systems composed of complex autonomous entities (agents). We will provide pointers to work by large players in the field. We will explain why this kind of system must be handled differently than less complex systems.

Software agent Software testing Multi-agent system testing.

Abstract doi.org/10.14569/IJACSA.2011.020620 PDF

21

Video Compression by Memetic Algorithm

Author 1: Pooja Nagpal Author 2: Seema Baghla

Memetic Algorithm by hybridization of Standard Particle Swarm Optimization and Global Local Best Particle Swarm Optimization is proposed in this paper. This technique is used to reduce number of computations of video compression by maintaining same or better quality of video. In the proposed technique, the position equation of Standard Particle Swarm Optimization is modified and used as step size equation to find best matching block in current frame. To achieve adaptive step size, time varying inertia weight is used instead of constant inertia weight for getting true motion vector dynamically. The time varying inertia weight is based up on previous motion vectors. The step size equation is used to predict best matching macro block in the reference frame with respect to macro block in the current frame for which motion vector is found. The result of proposed technique is compared with existing block matching algorithms. The performance of Memetic Algorithm is good as compared to existing algorithms in terms number of computations and accuracy.

Memetic Algorithm (MA) Standard Particle Swarm Optimization (PSO) Global Local Best Particle Swarm Optimization (GLBest PSO) Video Compression Motion Vectors Number of Computations Peak Signal to Noise ratio (PSNR).

Abstract doi.org/10.14569/IJACSA.2011.020621 PDF

22

Impact of Cloud Computing on ERP implementations in Higher Education

Author 1: Shivani Goel Author 2: Dr Ravi Kiran Author 3: Dr Deepak Garg

Penetration of Higher Education in all regions is increasing all over the globe at a very fast pace. With the increase in the number of institutions offering higher education, ERP implementations has become one of the key ingredient to achieve competitiveness in the market. Many researchers have given their inputs specifying the different nature of ERP implementation in Educational institutions then the corporate organizations. Recently Cloud computing has become a buzzword and it is having applications in many domains. Researchers have already started applying cloud computing in ERP implementations of Higher education. This paper gives an insight into the nature of cloud computing impact on ERP implementations and discusses various issues related to this. Paper comes up with guidelines regarding the use of cloud computing technology in the ERP implementations of Higher Technical Education institutions.

Cloud Computing ERP Higher Technical Education ERP implementation.

Abstract doi.org/10.14569/IJACSA.2011.020622 PDF

23

Algorithms for Content Distribution in Networks

Author 1: Deepak Garg

In this paper an algorithm is presented which helps us to optimize the performance of content distribution servers in a network. If it is following the pay-as-you-use model then this algorithm will result in significant cost reduction. At different times the demand of different kind of content varies and based on that number of servers who are serving that demand will vary.

Content Distribution Efficient Algorithms Capacitated

Abstract doi.org/10.14569/IJACSA.2011.020623 PDF

24

Generation of Attributes for Bangla Words for Universal Networking Language(UNL)

Author 1: Muhammad Firoz Mridha Author 2: Kamruddin Md. Nur Author 3: Manoj Banik Author 4: Mohammad Nurul Huda

The usage of native language through Internet is highly demanding now a day due to rapidly increase of Internet based application in daily needs. It is important to read all information in Bangla from the internet. Universal Networking Language (UNL) addressed this issue in most of languages. It helps to overcome the language barrier among people of different nations to solve problems emerging from current globalization trends and geopolitical interdependence. In this paper we propose a work that aims to contribute with morphological analysis of those Bangla words from which we obtain roots and Primary suffixes and developing of grammatical attributes for roots and Primary suffixes that can be used to prepare Bangla word dictionary and Enconversion/Deconversion rules for Natural Language Processing(NLP).

Morphology Bangla Roots Primary Suffix Grammatical Attributes Universal Networking Language.

Abstract doi.org/10.14569/IJACSA.2011.020624 PDF

25

A MODIFIED METHOD FOR ORDER REDUCTION OF LARGE SCALE DISCRETE SYSTEMS

Author 1: G Saraswathi

In this paper, an effective procedure to determine the reduced order model of higher order linear time invariant discrete systems is discussed. A new procedure has been proposed for evaluating Time moments of the original high order system. Numerator and denominator polynomials of reduced order model are obtained by considering first few redefined time moments of the original high order system. The proposed method has been verified using numerical examples.

order reduction eigen values large scale discrete systems modeling.

Abstract doi.org/10.14569/IJACSA.2011.020625 PDF