The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us

IJACSA Vol. 1 Issue 4 (2010)

Open Access | | 17 papers

Copyright Statement: This is an open access publication licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

1

Improving the Technical Aspects of Software Testing in Enterprises

Author 1: Tim A Majchrzak

Many software developments projects fail due to quality problems. Software testing enables the creation of high quality software products. Since it is a cumbersome and expensive task, and often hard to manage, both its technical background and its organizational implementation have to be well founded. We worked with regional companies that develop software in order to learn about their distinct weaknesses and strengths with regard to testing. Analyzing and comparing the strengths, we derived best practices. In this paper we explain the project’s background and sketch the design science research methodology used. We then introduce a graphical categorization framework that helps companies in judging the applicability of recommendations. Eventually, we present details on five recommendations for tech-nical aspects of testing. For each recommendation we give im-plementation advice based on the categorization framework.

Software testing testing software quality design science IT alignment process optimization technical aspects
2

Organizational and collaborative knowledge management: a Virtual HRD model based on Web2.0

Author 1: Musadaq Hanandi Author 2: Michele Grimaldi

Knowledge development and utilization can be facilitated by human resource practices. At the organizational level, the competitive advantage depends upon the firm utilization of existing knowledge and its ability to generate new knowledge more efficiently. At the individual level, increased delegation of responsibility and freedom of creativity may better allow the discovery and utilization of local and dispersed knowledge in the organization. This paper aims at introducing an innovative organizational model to support enterprises, international companies, and governments, in developing their human resource, through the virtual human resource, as a tool for knowledge capturing and sharing inside the organization.The VHRD organizational model allows different actors (top Management, employees, and external experts) to interact and participate in the learning process, by providing non-threatening self-evaluation and individualized feedback. In this way, the model, which is based on possible patterns and rules from existing learning systems, Web 2.0 and a homogeneous set of integrated systems and technologies, can be of support to the enterprise human resource department. In addition to this, the paper presents an evaluation method to assess the knowledge management results inside the organisation, by connecting the financial impacts with the strategy map.

Virtual Human Resource Development Knowledge Management Human Resource Management Web2.0 Organizational model.
3

Development of a Low-Cost GSM SMS-Based Humidity Remote Monitoring and Control system for Industrial Applications

Author 1: Dr B Ramamurthy Author 2: S.Bhargavi Author 3: Dr.R.ShashiKumar

The paper proposes a wireless solution, based on GSM (Global System for Mobile Communication) networks [1] for the monitoring and control of humidity in industries. This system provides ideal solution for monitoring critical plant on unmanned sites. The system is Wireless [2] therefore more adaptable and cost-effective. Utilizing Humidity sensor HSM-20G, ARM Controller LPC2148 and GSM technology this system offers a cost effective solution to wide range of remote monitoring and control applications. Historical and real time data can be accessed world wide using the GSM network. The system can also be configured to transmit data on alarm or at preset intervals to a mobile phone using SMS text messaging. The proposed system monitors and controls the humidity from the remote location and whenever it crosses the set limit the LPC2148 processor will sends an SMS to a concerned plant authority(s) mobile phone via GSM network. The concerned authority can control the system through his mobile phone by sending AT Commands to GSM MODEM and in turn to processor. Also the system provides password security against operator misuse/abuse. The system uses GSM technology [3] thus providing ubiquitous access to the system for security and automated monitoring and control of Humidity.

Automation GSM SMS Humidity Sensor (HSM-20G) ARM Controller LPC2148 Remote Monitoring & Control AT Commands Password Security Mobile phone.
4

Design, Development and Simulations of MHD Equations with its proto type implementations

Author 1: Rajveer S Yaduvanshi Author 2: Harish Parthasarathy

The equations of motion of conducting fluid in a magnetic field are formulated. These consist of three sets. First is the mass conservation equation, second Navier Stokes equation which is Newton’s second law taking into account the force of magnetic field on moving charges. The electrical field effects are neglected as is usually done in MHD. The third set is Maxwell’s equation especially to monopole condition along with Ampere’s law with the current given by ohm’s law in a moving frame (the frame in which the moving particles of fluid is at rest).The mass conservation equation assuming the fluid to be incompressible leads us to express the velocity field as the curl of a velocity vector potential. The curl of the Navier Stokes equation leads to the elimination of pressure, there by leaving with an equation involving only magnetic field and the fluid velocity field. The curl of the Ampere law equation leads us to another equation relating to the magnetic field to the velocity field. A special case is considered in which the only non vanishing components of the fluid are the x and y components and the only non vanishing component of the magnetic field is z component. In this special case the velocity vector potential only has one non zero component and this is known as stream function. The MHD equation in this reduces to three partial differential equations for the three functions in 2D model. ? stream function embeds and components. Application of MHD system prototype has been worked and presented.

Lorentz force Navier Stokes Equation Maxwell’s Equation Iterative Solution Prototype.
5

Multipath Fading Channel Optimization for Wireless Medical Applications

Author 1: A.K.M Fazlul Haque Author 2: Md. Hanif Ali Author 3: M Adnan Kiber

In this paper, a new method has been proposed to eliminate the intersymbol interference (ISI) and interchannel interference (ICI) for discrete multitone/orthogonal frequency division multiplexing (DMT/OFDM) systems by considering Time to Live (TTL) of multipath channel fading, especially for wireless medical application. In this method, the existence time of the packet is considered as the maximum propagation time and when the packet is sent to the receiver, the down count of the TTL starts. The existence of the packet in a network depends on TTL in an Internet Protocol (IP) packet that tells a network router whether or not the packet has been in the network too long and should be discarded. The proposed structure prevents ICI with a preprocessing method that utilizes a particular time that is equal to the continuation time of the packet and removes ISI by canceling the replica at the receiver. The simulation results show that the proposed method reduces the BER/ISI better under mutipath fading environment than other existing system.

ISI ICI OFDM TTL Channel Fading
6

Performance Analysis of Indoor Positioning System

Author 1: Leena Arya Author 2: S.C. Sharma Author 3: Millie Pant

In the new era of wireless communication, Wireless Local Area Network has emerged as one of the key players in the wireless communication family. It is now a trend to develop the WLAN in various colleges and office campuses for increasing productivity and quality of goods. There are many obstacles when deploying WLAN, which demands seamless indoor handover. The objective of the work reported here is to develop modeling tools using QUALNET 5.0 simulation design tool for performance optimization of WLAN access points. To predict the signal strength and interference in a WLAN system, propagation model has been used.

WLAN Access point Path loss model Qualnet 5.0.
7

Performance Comparison between Ant Algorithm and Modified Ant Algorithm

Author 1: Shaveta Malik

This paper gives a brief about two of the meta-heuristic techniques that are used to find best among the optimal solutions for complex problems like travelling salesman problem, Quadratic problem. Both of these techniques are based on the natural phenomenon of ant. Ant algorithm find good path but due to some short comings of it, this algorithm is not able to give best out of the good or optimal solutions, but modified ant algorithm which is based on probability finds out the best among the optimal paths We will also see that the modified ant algorithm can obtain less number of hops which helps us to get the best solution to typical problems.

Ant Algorithm Modified Ant algorithm Travelling Salesman Problem Quadratic problem Ant System
8

Dynamic Reduct and Its Properties In the Object-Oriented Rough Set Models

Author 1: M Srivenkatesh Author 2: P.V.G.D.Prasadreddy Author 3: Y.Srinivas

This Paper deals with a new type of Reduct in the object-oriented rough set model which is called dynamic reduct. In the object–oriented rough set models, objects are treated as instances of classes, and illustrate structural hierarchies among objects based on is-a relationship and has-a relationship[6]. In this paper, we propose dynamic reduct and the notation of core according to the dynamic reduct in the object-oriented rough set models. It describes various formal definitions of core and discusses some properties about dynamic core in the object-oriented rough set models.

Rough Set Dynamic Reduct Feature Core Indiscernibility Relations Discernibility Matrices.
9

Parallel Printer Port for Phase Measurement

Author 1: Dr R.Padma Suvarna Author 2: Dr.M. Usha Rani Author 3: P.M.Kalyani Author 4: Dr.R.Seshadri Author 5: Yaswanth Kumar.Avulapati

This white paper talks about the measurement of phase angle using Phase Locked Loop and printer port.. The phase detector compares the phase of a periodic input signal against the phase of the output of voltage controlled oscillator and generates an average output voltage Vout which is linearly proportional to the phase difference, ?ø between its two inputs. This output voltage is measured using the parallel Printer port of a PC.

Phase detector voltage controlled oscillator phase locked loop and parallel printer port.
10

Traffic Load based Performance Analysis of DSR, STAR & AODV Adhoc Routing Protocol

Author 1: Parma Nand Author 2: Dr. S.C. Sharma Author 3: Rani Astya

The wireless adhoc network is comprised of nodes (it can be static or mobile) with wireless radio interface. These nodes are connected among themselves without central infrastructure and are free to move. It is a multihop process because of the limited transmission range of energy constrained wireless nodes. Thus, in such a multihop network system each node (also known as router) is independent, self-reliant and capable of routing the packets over the dynamic network topology and therefore routing becomes very important and basic operation of adhoc network. Many protocols are reported in this field but it is difficult to decide which one is best. In this paper table driven protocol STAR and on demand routing protocols AODV, DSR based on IEEE 802.11 are surveyed and characteristic summary of these routing protocols is presented. Their performance is analyzed on throughput, jitter, packet delivery ratio and end-to-end delay performance measuring metrics by varying CBR data traffic load and then their performance is also compared using QualNet 5.0.2 network simulator.

Adhoc networks wireless networks CBR routing protocols route discovery simulation performance evaluation MAC IEEE 802.11 STAR DSR AODV.
11

Computing the Most Significant Solution from Pareto Front obtained in Multi-objective Evolutionary

Author 1: P.M Chaudhari Author 2: Dr. R.V. Dharaskar Author 3: Dr. V. M. Thakare

Problems with multiple objectives can be solved by using Pareto optimization techniques in evolutionary multi-objective optimization algorithms. Many applications involve multiple objective functions and the Pareto front may contain a very large number of points. Selecting a solution from such a large set is potentially intractable for a decision maker. Previous approaches to this problem aimed to find a representative subset of the solution set. Clustering techniques can be used to organize and classify the solutions. Implementation of this methodology for various applications and in a decision support system is also discussed.

Multiobjective Pareto front Clustering techniques
12

Applying Intuitionistic Fuzzy Approach to Reduce Search Domain in an Accidental Case

Author 1: Yasir Ahmad Author 2: Sadia Husain Author 3: Afshar Alam

In this paper we are using intuitionistic fuzzy approach to minimize search domain in an accidental case where the data collected for investigation is intuitionistic fuzzy in nature. To handle these types of imprecise information we use intuitionistic fuzzy tolerance relation and translate intuitionistic fuzzy query to reach to the conclusion. Here we present an example of vehicle hit and run case where the accused had fled the accident spot within seconds leaving no clue behind.

fuzzy sets Intuitionistic fuzzy relation Intuitionistic fuzzy database Intuitionistic fuzzy tolerance
13

Search Technique Using Wildcards or Truncation: A Tolerance Rough Set Clustering Approach

Author 1: Sandeep Kumar Satapathy Author 2: Shruti Mishra Author 3: Debahuti Mishra

Search engine technology plays an important role in web information retrieval. However, with Internet information explosion, traditional searching techniques cannot provide satisfactory result due to problems such as huge number of result Web pages, unintuitive ranking etc. Therefore, the reorganization and post-processing of Web search results have been extensively studied to help user effectively obtain useful information. This paper has basically three parts. First part is the review study on how the keyword is expanded through truncation or wildcards (which is a little known feature but one of the most powerful one) by using various symbols like * or! The primary goal in designing this is to restrict ourselves by just mentioning the keyword using the truncation or wildcard symbols rather than expanding the keyword into sentential form. The second part of this paper gives a brief idea about the tolerance rough set approach to clustering the search results. In tolerance rough set approach we use a tolerance factor considering which we cluster the information rich search result and discard the rest. But it may so happen that the discarded results do have some information which may not be up to the tolerance level; still they do contain some information regarding the query. The third part depicts a proposed algorithm based on the above two and thus solving the above mentioned problem that usually arise in the tolerance rough set approach . The main goal of this paper is to develop a search technique through which the information retrieval will be very fast, reducing the amount of extra labor needed on expanding the query.

Clustering Tolerance Rough Set Search Engine Wildcard Truncation
14

Measuring Semantic Similarity between Words Using Web Documents

Author 1: Sheetal A Takale Author 2: Sushma S. Nandgaonkar

Semantic similarity measures play an important role in the extraction of semantic relations. Semantic similarity measures are widely used in Natural Language Processing (NLP) and Information Retrieval (IR). The work proposed here uses web-based metrics to compute the semantic similarity between words or terms and also compares with the state-of-the-art. For a computer to decide the semantic similarity, it should understand the semantics of the words. Computer being a syntactic machine, it can not understand the semantics. So always an attempt is made to represent the semantics as syntax. There are various methods proposed to find the semantic similarity between words. Some of these methods have used the precompiled databases like WordNet, and Brown Corpus. Some are based on Web Search Engine. The approach presented here is altogether different from these methods. It makes use of snippets returned by the Wikipedia or any encyclopedia such as Britannica Encyclopedia. The snippets are preprocessed for stop word removal and stemming. For suffix removal an algorithm by M. F. Porter is referred. Luhn’s Idea is used for extraction of significant words from the preprocessed snippets. Similarity measures proposed here are based on the five different association measures in Information retrieval, namely simple matching, Dice, Jaccard, Overlap, Cosine coefficient. Performance of these methods is evaluated using Miller and Charle’s benchmark dataset. It gives higher correlation value of 0.80 than some of the existing methods.

Semantic Similarity Wikipedia Web Search Engine Natural Language Processing Information Retrieval Web Mining.
15

Classification of Self-Organizing Hierarchical Mobile Adhoc Network Routing Protocols - A Summary

Author 1: Udayachandran Ramasamy Author 2: K. Sankaranarayanan

MANET is a special kind of wireless network. It is a collection of mobile nodes without having aid of established infrastructure. Mobile Adhoc network removes the dependence on a fixed network infrastructure by treating every available mobile node as an intermediate switch, thereby extending the range of mobile nodes well beyond that of their base transceivers. Other advantages of Manet include easy installation and upgrade, low cost and maintenance, more flexibility, and the ability to employ new and efficient routing protocols for wireless communication. In this paper we present four routing algorithm, classifications, discuss their advantages and disadvantages.

MANET Routing Protocols Routing Topology Routing Algorithms and QoS.
16

Clustering Methods for Credit Card using Bayesian rules based on K-means classification

Author 1: S Jessica Saritha Author 2: Prof. P.Govindarajulu Author 3: K. Rajendra Prasad Author 4: S.C.V. Ramana Rao Author 5: C.Lakshmi

K-means clustering algorithm is a method of cluster analysis which aims to partition n observations into clusters in which each observation belongs to the cluster with the nearest mean. It is one of the simplest unconfirmed learning algorithms that solve the well known clustering problem. It is similar to the hope maximization algorithm for mixtures of Gaussians in that they both attempt to find the centers of natural clusters in the data. Bayesian rule is a theorem in probability theory named for Thomas Bayesian. It is used for updating probabilities by finding conditional probabilities given new data. In this paper, K-mean clustering algorithm and Bayesian classification are joint to analysis the credit card. The analysis result can be used to improve the accuracy.

Clusters Probability K-Means Thomas Bayesian rule Credit Card attributes banking.
17

Flow Controlling of Access at Edge Routers

Author 1: S.C.V Ramana Rao Author 2: S.Naga Mallik Raj Author 3: S. Neeraja Author 4: P.Prathusha Author 5: J.David Sukeerthi Kumar

It is very important to allocate and manage resources for multimedia type of data traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS). In this paper, we develop a scalable architecture and an algorithm for access control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data flow is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, access decision is made for each flow at the edge routers, but it is scalable because per-flow states are not maintained and the access algorithm is simple. In the proposed access control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a entry for access control, and thus, it is very important to accurately estimate the acceptable bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.

bandwidth Traffic edge-routers routers decision multimedia Quality of Service framework algorithm domain.