IJACSA Volume 5 Issue 1 - thesai.org

IJACSA Volume 5 Issue 1

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.

View Full Issue

Paper 1: A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem

Abstract: Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime efficiency and solution quality. The results show that Genetic Algorithm has a better solution quality while Tabu Search has a faster execution time in comparison with other Meta-heuristic algorithms for solving QAP.

Author 1: Gamal Abd El-Nasser A. Said

Author 2: Abeer M. Mahmoud

Author 3: El-Sayed M. El-Horbaty

Keywords: Quadratic Assignment Problem (QAP); Genetic Algorithm (GA); Tabu Search (TS); Simulated Annealing (SA); Performance Analysis

Paper 2: Generic Packing Detection Using Several Complexity Analysis for Accurate Malware Detection

Abstract: The attackers do not want their Malicious software (or malwares) to be reviled by anti-virus analyzer. In order to conceal their malware, malware programmers are getting utilize the anti reverse engineering techniques and code changing techniques such as the packing, encoding and encryption techniques. Malware writers have learned that signature based detectors can be easily evaded by “packing” the malicious payload in layers of compression or encryption. State-of-the-art malware detectors have adopted both static and dynamic techniques to recover the payload of packed malware, but unfortunately such techniques are highly ineffective. If the malware is packed or encrypted, then it is very difficult to analyze. Therefore, to prevent the harmful effects of malware and to generate signatures for malware detection, the packed and encrypted executable codes must initially be unpacked. The first step of unpacking is to detect the packed executable files. The objective is to efficiently and accurately distinguish between packed and non-packed executables, so that only executables detected as packed will be sent to an general unpacker, thus saving a significant amount of processing time. The generic method of this paper show that it achieves very high detection accuracy of packed executables with a low average processing time. In this paper, a packed file detection technique based on complexity measured by several algorithms, and it has tested using a packed and unpacked dataset of file type .exe. The preliminary results are very promising where achieved high accuracy with enough performance. Where it achieved about 96% detection rate on packed files and 93% detection rate on unpacked files. The experiments also demonstrate that this generic technique can effectively prepared to detect unknown, obfuscated malware and cannot be evaded by known evade techniques.

Author 1: Dr. Mafaz Mohsin Khalil Al-Anezi

Keywords: Packed Executables; Malware Detection; compression algorithms

Paper 3: Laguerre Kernels –Based SVM for Image Classification

Abstract: Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient properties that other methods hardly provide. However the performance of SVMs is very sensitive to how the kernel function is selected, the challenge is to choose the kernel function for accurate data classification. In this paper, we introduce a set of new kernel functions derived from the generalized Laguerre polynomials. The proposed kernels could improve the classification accuracy of SVMs for both linear and nonlinear data sets. The proposed kernel functions satisfy Mercer’s condition and orthogonally properties which are important and useful in some applications when the support vector number is needed as in feature selection. The performance of the generalized Laguerre kernels is evaluated in comparison with the existing kernels. It was found that the choice of the kernel function, and the values of the parameters for that kernel are critical for a given amount of data. The proposed kernels give good classification accuracy in nearly all the data sets, especially those of high dimensions.

Author 1: Ashraf Afifi

Keywords: Laguerre polynomials; kernel functions; functional analysis; SVMs; classification problem

Paper 4: Improving Classification Accuracy of Heart Sound Signals Using Hierarchical MLP Network

Abstract: Classification of heart sound signals to normal or their classes of disease are very important in screening and diagnosis system since various applications and devices that fulfilling this purpose are rapidly design and developed these days. This paper states and alternative method in improving classification accuracy of heart sound signals. Standard and improvised Multi-Layer Perceptron (MLP) network in hierarchical form were used to obtain the best classification results. Two data sets of normal and four abnormal heart sound signals from heart valve diseases were used to train and test the MLP networks. It is found that hierarchical MLP network could significantly increase the classification accuracy to 100% compared to standard MLP network with accuracy of 85.71% only.

Author 1: Mohd Zubir Suboh

Author 2: Md. Yid M.S.

Author 3: Muhyi Yaakob

Author 4: Mohd Shaiful Aziz Rashid Ali

Keywords: Hierarchical MLP network; Multi-layer Peceptron Network; heart sound signals

Paper 5: A Generic Framework for Automated Quality Assurance of Software Models –Implementation of an Abstract Syntax Tree

Abstract: Abstract Syntax Tree’s (AST) are used in language tools, such as compilers, language translators and transformers as well as analysers; to remove syntax and are therefore an ideal construct for a language independent tool. AST’s are also commonly used in static analysis. This increases the value of ASTs for use within a universal Quality Assurance (QA) tool. The Object Management Group (OMG) have outlined a Generic AST Meta-model (GASTM) which may be used to implement the internal representation (IR) for this tool. This paper discusses the implementation and modifications made to the previously published proposal, to use the Object Management Group developed Generic Abstract Syntax Tree Meta-model core-components as an internal representation for an automated quality assurance framework.

Author 1: Darryl Owens

Author 2: Dr Mark Anderson

Keywords: software quality assurance; software testing; automated software engineering; programming language paradigms; language independence; abstract syntax tree; static analysis; dynamic analysis

Paper 6: Computerized Kymograph for Muscle Contraction Measurement Using Ultrasonic Distance Sensor

Abstract: Kymograph is a device to record the magnitude of physiological variables, such as: muscle contraction. However, we observe some lacks of the conventional kymographs, such as: result’s visualisation and accuracy. Hence, we propose a computerized-kymograph which can automatically measure, record, and display graphical data of muscle contraction on the computer by using ultrasonic distance sensor. We develop hardware and software systems to support computerized kymograph and then test our device with live frog. The result shows that the device works well by displaying better visualization than the conventional kymograph.

Author 1: Suhaeri

Author 2: Vitri Tundjungsari

Keywords: kymograph; computerized; distance sensor

Paper 7: Comparative Study in Performance for Subcarrier Mapping in Uplink 4G-LTE under Different Channel Cases

Abstract: in recent years, wireless communication has experienced a rapid growth and it promises to become a globally important infrastructure. One common design approach in fourth generation 4G systems is Single Carrier Frequency Division Multiple Access (SC-FDMA). It is a single carrier communication technique on the air interface. It has become broadly accepted mainly because of its high resistance to frequency selective fading channels. The third Generation Partnership Project-Long Term Evolution (3GPP-LTE) uses this technique in uplink direction because of its lower peak to average power ratio PAPR as compared to Orthogonal Frequency Division Multiple Access (OFDMA) that is used for downlink direction. In this paper the LTE in general and SCFDMA will be discuss in details and its performance will be study under two types of subcarrier mapping which are localized and distributed mode also within different channel cases. The results show that the localized subcarrier mapping give lower bit error rate BER than the distributed mode and give different activity under miscellaneous channel cases.

Author 1: Raad Farhood Chisab

Author 2: Prof. (Dr.) C. K. Shukla

Keywords: LTE; SCFDMA; 4G; PAPR; BER; channel model

Paper 8: A Competency-Based Ontology for Learning Design Repositories

Abstract: Learning designs are central resources for educational environments because they provide the organizational structure of learning activities; they are concrete instructional methods. We characterize each learning design by the competencies they target. We define competencies at the meta-knowledge level, as generic processes acting on domain-specific knowledge. We summarize a functional taxonomy of generic skills that draws upon three fields of knowledge: education, software engineering and artificial intelligence. This taxonomy provides the backbone of an ontology for learning designs, enabling the creation of a library of learning designs based on their cognitive and meta-cognitive properties.

Author 1: Gilbert Paquette

Keywords: Learning Designs; Learning Objects Repository; Competency Referencin; Generic skills; Learning Design Ontology; Metadata for Learning Designs

Paper 9: Secure Undeniable Threshold Proxy Signature Scheme

Abstract: the threshold proxy signature scheme allows the original signer to delegate a signature authority to the proxy group to cooperatively sign message on behalf of an original signer. In this paper, we propose a new scheme which includes the features and benefits of the RSA scheme. Also, we will evaluate the security of undeniable threshold proxy signature scheme with known signers. We find that the existing threshold proxy scheme is insecure against the original signer forgery. In this paper, we show the cryptanalysis of an existed scheme. Additional, we propose the secure, undeniable and known signers threshold proxy signature scheme which answers the drawback of an existed scheme. We also demonstrate that a threshold proxy signature suffers from a conspiracy of an original signer and a secret share dealer, that the scheme is commonly forgeable, and cannot offer undeniable. We claim that the proposed scheme offers the undeniable characteristic.

Author 1: Sattar J. Aboud

Keywords: cryptography; digital signature; proxy signature; threshold proxy signature

Paper 10: Reduced Complexity Divide and Conquer Algorithm for Large Scale TSPs

Abstract: The Traveling Salesman Problem (TSP) is the problem of finding the shortest path passing through all given cities while only passing by each city once and finishing at the same starting city. This problem has NP-hard complexity making it extremely impractical to get the most optimal path even for problems as small as 20 cities since the number of permutations becomes too high. Many heuristic methods have been devised to reach “good” solutions in reasonable time. In this paper, we present the idea of utilizing a spatial “geographical” Divide and Conquer technique in conjunction with heuristic TSP algorithms specifically the Nearest Neighbor 2-opt algorithm. We have found that the proposed algorithm has lower complexity than algorithms published in the literature. This comes at a lower accuracy expense of around 9%. It is our belief that the presented approach will be welcomed to the community especially for large problems where a reasonable solution could be reached in a fraction of the time.

Author 1: Hoda A. Darwish

Author 2: Ihab Talkhan

Keywords: Traveling Salesman Problem; Computational Geometry; Heuristic Algorithms; Divide and Conquer; Hashing; Nearest Neighbor 2-opt Algorithm

Paper 11: Spectrum Sharing Security and Attacks in CRNs: a Review

Abstract: Cognitive Radio plays a major part in communication technology by resolving the shortage of the spectrum through usage of dynamic spectrum access and artificial intelligence characteristics. The element of spectrum sharing in cognitive radio is a fundamental approach in utilising free channels. Cooperatively communicating cognitive radio devices use the common control channel of the cognitive radio medium access control to achieve spectrum sharing. Thus, the common control channel and consequently spectrum sharing security are vital to ensuring security in the subsequent data communication among cognitive radio nodes. In addition to well known security problems in wireless networks, cognitive radio networks introduce new classes of security threats and challenges, such as licensed user emulation attacks in spectrum sensing and misbehaviours in the common control channel transactions, which degrade the overall network operation and performance. This review paper briefly presents the known threats and attacks in wireless networks before it looks into the concept of cognitive radio and its main functionality. The paper then mainly focuses on spectrum sharing security and its related challenges. Since spectrum sharing is enabled through usage of the common control channel, more attention is paid to the security of the common control channel by looking into its security threats as well as protection and detection mechanisms. Finally, the pros and cons as well as the comparisons of different CR-specific security mechanisms are presented with some open research issues and challenges.

Author 1: Wajdi Alhakami

Author 2: Ali Mansour

Author 3: Ghazanfar A. Safdar

Keywords: Dynamic Spectrum Access; Spectrum Sharing; Common Control Channel; Cognitive Radio Networks

Paper 12: A Comparative Usability Study on the Use of Auditory Icons to Support Virtual Lecturers in E-Learning Interfaces

Abstract: Prior conducted research revealed that the auditory icons could contribute in supporting the virtual lecturers in presence of full body animation while delivering the learning content in e-learning interfaces. This paper presents further empirical investigation into the use of these supportive auditory icons by comparing three different e-learning interfaces in terms of usability aspects; effectiveness, user satisfaction and memorability. The aim is to find out which combination of the tested multimodal metaphors is the best one in terms of utilizing the auditory icons to supplement the presentation of learning material by virtual lecturer. The first experimental e-learning interface incorporates a speaking virtual lecturer with full body gestures along with supportive auditory icons. The second experimental e-learning interface includes the use of virtual lecturer speech in the absence of his body and accompanied with the same auditory icons used in the first interface. However, the third interface is similar to the second one in terms of using the virtual lecturer's speech but without any additional auditory icons. The obtained results have shown that the inclusion of auditory icons could enhance the usability and learning performance of e-learning interfaces much better if combined along with speaking virtual lectures in the absence of any body animation.

Author 1: Marwan Alseid

Author 2: Mohammad Azzeh

Author 3: Yousef El Sheikh

Keywords: auditory icons; virtual lecturer; e-learning; usability; speech; avatar; multimodal interaction

Paper 13: Probabilistic Monte-Carlo Method for Modelling and Prediction of Electronics Component Life

Abstract: Power electronics are widely used in electric vehicles, railway locomotive and new generation aircrafts. Reliability of these components directly affect the reliability and performance of these vehicular platforms. In recent years, several research work about reliability, failure mode and aging analysis have been extensively carried out. There is a need for an efficient algorithm able to predict the life of power electronics component. In this paper, a probabilistic Monte-Carlo framework is developed and applied to predict remaining useful life of a component. Probability distributions are used to model the component’s degradation process. The modelling parameters are learned using Maximum Likelihood Estimation. The prognostic is carried out by the mean of simulation in this paper. Monte-Carlo simulation is used to propagate multiple possible degradation paths based on the current health state of the component. The remaining useful life and confident bounds are calculated by estimating mean, median and percentile descriptive statistics of the simulated degradation paths. Results from different probabilistic models are compared and their prognostic performances are evaluated.

Author 1: T. Sreenuch

Author 2: A. Alghassi

Author 3: S. Perinpanayagam

Author 4: Y. Xie

Keywords: Prognostics; Monte-Carlo Simulation; Remaining Useful Life

Paper 14: An Automated approach for Preventing ARP Spoofing Attack using Static ARP Entries

Abstract: ARP spoofing is the most dangerous attack that threats LANs, this attack comes from the way the ARP protocol works, since it is a stateless protocol. The ARP spoofing attack may be used to launch either denial of service (DoS) attacks or Man in the middle (MITM) attacks. Using static ARP entries is considered the most effective way to prevent ARP spoofing. Yet, ARP spoofing mitigation methods depending on static ARP have major drawbacks. In this paper, we propose a scalable technique to prevent ARP spoofing attacks, which automatically configures static ARP entries. Every host in the local network will have a protected non-spoofed ARP cache. The technique operates in both static and DHCP based addressing schemes, and Scalability of the technique allows protecting of a large number of users without any overhead on the administrator. Performance study of the technique has been conducted using a real network. The measurement results have shown that the client needs no more than one millisecond to register itself for a protected ARP cache. The results also shown that the server can a block any attacker in just few microsecond under heavy traffic.

Author 1: Ahmed M. AbdelSalam

Author 2: Wail S.Elkilani

Author 3: Khalid M.Amin

Keywords: component; layer two attacks; ARP spoofing; ARP cache poisoning; Static ARP entries

Paper 15: For an Independent Spell-Checking System from the Arabic Language Vocabulary

Abstract: In this paper, we propose a new approach for spell-checking errors committed in Arabic language. This approach is almost independent of the used dictionary, of the fact that we introduced the concept of morphological analysis in the process of spell-checking. Hence, our new system uses a stems dictionary of reduced size rather than exploiting a large dictionary not covering the all Arabic words. The obtained results are highly positive and satisfactory; this has allowed us to appreciate the validity of our concept and shows the importance of our new approach.

Author 1: Bakkali Hamza

Author 2: Yousfi Abdellah

Author 3: Gueddah Hicham

Author 4: Belkasmi Mostafa

Keywords: Arabic language; Lexicon; Misspelled word; Error model; Spell-checking; Edit distance; Morphological analysis; Prefix; Stem, Suffix

Paper 16: On A New Competitive Measure For Oblivious Routing

Abstract: Oblivious routing algorithms use only locally avail¬able information at network nodes to forward traffic, and as such, a plausible choice for distributed implementations. It is a natural desire to quantify the performance penalty we pay for this distributedness. Recently, Räcke has shown that for general undirected graphs the competitive ratio is only O(log n), that is, the maximum congestion caused by the oblivious algorithm is within a logarithmic factor of the best possible congestion. And while the performance penalty is larger for directed networks (Azar gives a O(vn) lower bound), experiments on many real-world topologies show that it usually remains under 2. These competitive measures, however, are of worst-case type, and therefore do not always give adequate characterization. The more different combinations of demands a routing algorithm can accommodate in the network without congestion, the better. Driven by this observation, in this paper we introduce a new competitive measure, the volumetric competitive ratio, as the measure of all admissible demands compared to the measure of demands routed without congestion. The main result of the paper is a general lower bound on the volumetric ratio; and we also show a directed graph with O(1) competitive ratio that exhibits O(n) volumetric ratio. Our numerical evaluations show that the competitivity of oblivious routing in terms of the new measure quickly vanishes even in relatively small common-place topologies.

Author 1: Gábor Németh

Keywords: competitive ratio; oblivious routing; l^p norm; L^p norm; throughput polytope; feasible region; probability of conges¬tion; hyper--spherical coordinates

Paper 17: Design of Reversible Counter

Abstract: This article presents a research work on the design and synthesis of sequential circuits and flip-flops that are available in digital arena; and describes a new synthesis design of reversible counter that is optimized in terms of quantum cost, delay and garbage outputs compared to the existing designs. We proposed a new model of reversible T flip-flop in designing reversible counter.

Author 1: Md. Selim Al Mamun

Author 2: B. K. Karmaker

Keywords: Flip-flop; Counter; Garbage Output; Reversible Logic; Quantum Cost

Paper 18: Modelling and Output Power Evaluation of Series-Parallel Photovoltaic Modules

Abstract: Solar energy has received attention in the Middle East given the abundant and free irradiance and extended sunny weather. Although photovoltaic panels were introduced decades ago, they have recently become economical and gained traction. We present a mathematical model for series-parallel photovoltaic modules, evaluate the model, and present the I-V and P-V characteristic plots for various temperatures, irradiance, and diode ideality factors. The power performance results are then analyzed and recommendations are made. Unlike other related work, our evaluation uses standard spreadsheet software avoiding commercial simulation packages and application programming. Results indicate improved power performance with irradiance and parallel connections of cell series branches. Given the hot weather in our region, increasing the number of cells connected in series from 36 to 72 is not recommended.

Author 1: Dr. Fadi N. Sibai

Keywords: solar energy; series-parallel photovoltaic modules; mathematical modeling

Paper 19: Mining of Web Server Logs in a Distributed Cluster Using Big Data Technologies

Abstract: Big Data is an emerging growing dataset beyond the ability of a traditional database tool. Hadoop rides the big data where the massive quantity of information is processed using cluster of commodity hardware. Web server logs are semi-structured files generated by the computer in large volume usually of flat text files. It is utilized efficiently by Mapreduce as it process one line at a time. This paper performs the session identification in log files using Hadoop in a distributed cluster. Apache Hadoop Mapreduce a data processing platform is used in pseudo distributed mode and in fully distributed mode. The framework effectively identifies the session utilized by the web surfer to recognize the unique users and pages accessed by the users. The identified session is analyzed in R to produce a statistical report based on total count of visit per day. The results are compared with non-hadoop approach a java environment, and it results in a better time efficiency, storage and processing speed of the proposed work.

Author 1: Savitha K

Author 2: Vijaya MS

Keywords: Big data; Hadoop; Mapreduce; Session identification; Analytics

Paper 20: Using the Technology Acceptance Model in Understanding Academics’ Behavioural Intention to Use Learning Management Systems

Abstract: Although e-learning is in its infancy in Saudi Arabia, most of the public universities in the country show a great interest in the adoption of learning and teaching tools. Determining the significance of a particular tool and predicting the success of implantation is essential prior to its adoption. This paper presents and modifies the technology acceptance model (TAM) in an attempt to assist public universities, particularly in Saudi Arabia, in predicting the behavioural intention to use learning management systems (LMS). This study proposed a theoretical framework that includes the core constructs in TAM: namely, perceived ease of use, perceived usefulness, and attitude toward usage. Additional external variables were also adopted—namely, the lack of LMS availability, prior experience (LMS usage experience), and job relevance. The overall research model suggests that all mentioned variables either directly or indirectly affect the overall behavioural intention to use an LMS. Initial findings suggest the applicability of using TAM to measure the behavioural intention to use an LMS. Further, the results confirm the original TAM’s findings.

Author 1: Saleh Alharbi

Author 2: Steve Drew

Keywords: Technology Acceptance Model; Higher education; Learning management systems; Saudi Arabia

Paper 21: Spatial Domain Image Steganography based on Security and Randomization

Abstract: In the present digital scenario secure communication is the prime requirement. Commonly, cryptography used for the said purpose. Another method related to cryptography is used for the above objective is Steganography. Steganography is the art of hiding information in some medium. Here we are using image as a means for covering information. Spatial domain image Steganography has been used for the work because of its compatibility to images. Objective of the paper is to increase the capacity of hidden data in a way that security could be maintained. In the current work MSB of the randomly selected pixel have been used as indicator. Result analysis has been performed on the basis of different parameters like PSNR, MSE and capacity.

Author 1: Namita Tiwari

Author 2: Dr. Madhu Sandilya

Author 3: Dr. Meenu Chawla

Keywords: Spatial domain; PSNR; MSE

Paper 22: Mining Interesting Positive and Negative Association Rule Based on Improved Genetic Algorithm (MIPNAR_GA)

Abstract: Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the mining of positive and negative rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. A number of algorithms are wonder performance but produce large number of negative association rule and also suffered from multi-scan problem. The idea of this paper is to eliminate these problems and reduce large number of negative rules. Hence we proposed an improved approach to mine interesting positive and negative rules based on genetic and MLMS algorithm. In this method we used a multi-level multiple support of data table as 0 and 1. The divided process reduces the scanning time of database. The proposed algorithm is a combination of MLMS and genetic algorithm. This paper proposed a new algorithm (MIPNAR_GA) for mining interesting positive and negative rule from frequent and infrequent pattern sets. The algorithm is accomplished in to three phases: a).Extract frequent and infrequent pattern sets by using apriori method b).Efficiently generate positive and negative rule. c).Prune redundant rule by applying interesting measures. The process of rule optimization is performed by genetic algorithm and for evaluation of algorithm conducted the real world dataset such as heart disease data and some standard data used from UCI machine learning repository.

Author 1: Nikky Suryawanshi Rai

Author 2: Susheel Jain

Author 3: Anurag Jain

Keywords: Association rule mining; negative rule and positive rules; frequent and infrequent pattern set; genetic algorithm

Paper 23: De Jong’s Sphere Model Test for a Human Community Based Genetic Algorithm Model (HCBGA)

Abstract: A new structured population approach for genetic algorithm, based on the custom, behavior and pattern of human community is provided. This model is named the Human Community Based Genetic Algorithm (HCBGA) model. It includes gender, age, generation, marriage, birth and death. Using the De Jong’s first function 1, “The Sphere Model” comparisons between values and results concerning the averages and best fits of both, the Simple Standard Genetic Algorithm (SGA), and the Human Community Based Genetic Algorithm (HCBGA) model are obtained. These results are encouraging in that the Human Community Based Genetic Algorithm (HCBGA) model performs better in finding best fit solutions of generations in different populations than the Simple Standard Genetic Algorithm. The HCBGA model is an evolution of the simple Genetic Algorithm (SGA). The result of this paper is an extended of the result concerning algorithm in [6].

Author 1: Nagham Azmi AL-Madi

Keywords: Genetic Algorithms (GAs); Evolutionary Algorithms (EA); Simple Standard Genetic Algorithms (SGA), Human Community Based Genetic Algorithm (HCBGA) model; De Jongs’ functions, the Sphere model

Paper 24: DES: Dynamic and Elastic Scalability in Cloud Computing Database Architecture

Abstract: Nowadays, companies are becoming global organizations. Such organizations do not limit themselves in conducting business in one country. They need dynamic, elastic, scalable cloud computing platform that operates around-the-clock. Full functionality, adaptability, non-stop availability and reduced cost are the major requirements that are expected from cloud computing services. Planned or unplanned system outages are the enemies of the successful business in cloud computing environment. Hence it requires highly available, elastic scalable systems. In this paper, we analyze the benefits of cloud computing and evaluates the database architectures namely shared-disk database architecture and shared-nothing database architecture for high availability, Dynamic and Elastic Scalability.

Author 1: Dr. K. Chitra

Author 2: B.Jeeva Rani

Keywords: Cloud computing; Availability; Scalability; Shared-disk; Shared-nothing

Paper 25: Wireless LAN Security Threats & Vulnerabilities

Abstract: Wireless LANs are everywhere these days from home to large enterprise corporate networks due to the ease of installation, employee convenience, avoiding wiring cost and constant mobility support. However, the greater availability of wireless LANs means increased danger from attacks and increased challenges to an organisation, IT staff and IT security professionals. This paper discusses the various security issues and vulnerabilities related to the IEEE 802.11 Wireless LAN encryption standard and common threats/attacks pertaining to the home and enterprise Wireless LAN system and provide overall guidelines and recommendation to the home users and organizations.

Author 1: Md. Waliullah

Author 2: Diane Gan

Keywords: WLAN; IEEE 802.11i; WIDS/WIPS; MITM; DoS; SSID; AP; WEP; WPA/WPA2

Paper 26: Novel Fractional Wavelet Transform with Closed-Form Expression

Abstract: A new wavelet transform (WT) is introduced based on the fractional properties of the traditional Fourier transform. The new wavelet follows from the fractional Fourier order which uniquely identifies the representation of an input function in a fractional domain. It exploits the combined advantages of WT and fractional Fourier transform (FrFT). The transform permits the identification of a transformed function based on the fractional rotation in time-frequency plane. The fractional rotation is then used to identify individual fractional daughter wavelets. This study is, for convenience, limited to one-dimension. Approach for discussing two or more dimensions is shown.

Author 1: K. O. O. Anoh

Author 2: R. A. A. Abd-Alhameed

Author 3: S. M. R. Jones

Author 4: O. Ochonogor

Keywords: Fractional Fourier transform; wavelet; fractional wavelet transform

Paper 27: Cost Effective System Modeling of Active Micro- Module Solar Tracker

Abstract: The increasing interests in using renewable energies are coming from solar thermal energy and solar photovoltaic systems to the micro production of electricity. Usually we already have considered the solar tracking topology in large scale applications like power plants and satellite but most of small scale applications don’t have any solar tracker system, mainly because of its high cost and complex circuit design. From that aspect, this paper confab microcontroller based one dimensional active micro-module solar tracking system, in which inexpensive LDR is used to generate reference voltage to operate microcontroller for functioning the tracking system. This system provides a fast response of tracking system to the parameters like change of light intensity as well as temperature variations. This micro-module model of tracking system can be used for small scale applications like portable electronic devices and running vehicles.

Author 1: Md. Faisal Shuvo

Author 2: Md. Abu Saleh Ovi

Author 3: Md. Mehedi Hasan

Author 4: Arifur Rahman

Keywords: micro-module, active solar tracker, LDR sensor, microcontroller

Paper 28: A Review of Scripting Techniques Used in Automated Software Testing

Abstract: Software testing is the process of evaluating the developed system to assess the quality of the final product. Unfortunately, software-testing process is expensive and consumes a lot of time through software development life cycle. As software systems grow, manual software testing becomes more and more difficult. Therefore, there was always a need to decrease the testing time. Recently, automation is as a major factor in reducing the testing effort by many researchers. Therefore, automating software-testing process is vital to its success. This study aims to compare the main features of different scripting techniques used in process of automating the execution phase in software testing process. In addition, an overview of different scripting techniques will be presented to show the state of art of this study.

Author 1: Milad Hanna

Author 2: Nahla El-Haggar

Author 3: Mostafa Sami

Keywords: Software Testing; Automated Software Testing; Test Data; Test Case; Test Script; Manual Testing; Software Under Test; Graphical User Interface