		FeedBack \| Contact Us \| Links \| Site Map

Welcome to Journal of Theoretical and Applied Information Technology

Submit Paper / Call for Papers

Journal receives papers in continuous flow and we will consider articles from a wide range of Information Technology disciplines encompassing the most basic research to the most innovative technologies. Please submit your papers electronically to our submission system at http://jatit.org/submit_paper.php in an MSWord, Pdf or compatible format so that they may be evaluated for publication in the upcoming issue. This journal uses a blinded review process; please remember to include all your personal identifiable information in the manuscript before submitting it for review, we will edit the necessary information at our side. Submissions to JATIT should be full research / review papers (properly indicated below main title).

Journal of Theoretical and Applied Information Technology
January 2017 | Vol. 95 No.1

Title:	FORECASTING THE NUMBER OF DENGUE FEVER CASES IN MALANG REGENCY INDONESIA USING FUZZY INFERENCE SYSTEM MODELS
Author:	WIWIK ANGGRAENI, I PUTU AGUS ADITYA PRAMANA, FEBRILIYAN SAMOPA, EDWIN RIKSAKOMARA, RADITYO P.WIBOWO, LULUS CONDRO T., PUJIADI
Abstract:	Dengue fever is a communicable disease that has been a big concern in Indonesia. This disease has spread out across Indonesia, including Malang Regency. Local Government and Public Health Service in Malang Regency has made various efforts including prevention and socialization, however the number of casualties caused by dengue fever are still high. Forecasting the number of dengue fever cases is very important for the local Public Health Service. It can help policy planning of disease prevention and patient care in the future. Delays in preventive measures, increasing casualties, lack of treatment facilities are the problems that can be avoided through better policy planning. In this research, Fuzzy Inference System (FIS) is used to predict number of dengue fever cases in Malang. FIS tends to have small error values and high accuracy due to detailed attention to all variables. Fuzzy Inference System does not require a lot of data and a long periods of time. The model is constructed by grouping the number of monthly dengue fever cases from the previous years based on geographical location. Population density is added as external variables of the model. The data is divided into training set, testing set, and validating set with the ratio of 70:20:10. This research shows that forecasting model based on FIS shows a good results in forecasting with MAPE 6% in lowlands, 12% in mediumlands, and 14% in highlands.
Keywords:	Forecasting, Fuzzy Inference System, Dengue Fever, Disease, MAPE
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	OBKA-FS: AN OPPOSITIONAL-BASED BINARY KIDNEY-INSPIRED SEARCH ALGORITHM FOR FEATURE SELECTION
Author:	MUSTAFA KADHIM TAQI, ROSMAH ALI
Abstract:	Feature selection is a key step when building an automatic classification system. Numerous evolutionary algorithms applied to remove irrelevant features in order to make the classifier perform more accurate. Kidney-inspired search algorithm (KA) is a very modern evolutionary algorithm. The original version of KA performed more effectively compared with other evolutionary algorithms. However, KA was proposed for continuous search spaces. For feature subset selection and many optimization problems such as classification, binary discrete space is required. Moreover, the movement operator of solutions is notably affected by its own best-known solution found up to now, denoted as S_best. This may be inadequate if S_best is located near a local optimum as it will direct the search process to a suboptimal solution. In this study, a three-fold improvement in the existing KA is proposed. First, a binary version of the kidney-inspired algorithm (BKA-FS) for feature subset selection is introduced to improve classification accuracy in multi-class classification problems. Second, the proposed BKA-FS is integrated into an oppositional-based initialization method in order to start with good initial solutions. Thus, this improved algorithm denoted as OBKA-FS. Third, a novel movement strategy based on the calculation of mutual information (MI), which gives OBKA-FS the ability to work in a discrete binary environment has been proposed. For evaluation, an experiment was conducted using ten UCI machine learning benchmark instances. Results show that OBKA-FS outperforms the existing state-of-the-art evolutionary algorithms for feature selection. In particular, OBKA-FS obtained better accuracy with same or fewer features and higher dependency with less redundancy. Thus, the results confirm the high performance of the improved kidney-inspired algorithm in solving optimization problems such as feature selection.
Keywords:	Feature Selection, Kidney-Inspired Algorithm, Mutual Information, Oppositional-Learning
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	REAL-TIME FACE RECOGNITION FOR ATTENDANCE MONITORING SYSTEM
Author:	S. SAYEED, J. HOSSEN, 3S.M.A. KALAIARASI, V. JAYAKUMAR, I. YUSOF, A. SAMRAJ
Abstract:	Authentication is a momentous issue in controlling system in computer based globally. Human face recognition has been widely used to be an important branch of biometrics verifications in many applications such as door control, video monitoring system, networks security and also human computer interactions. This paper presented an automated attendance monitoring system with face recognition in a real-time background world for with a database of students information by using Personal Component Analysis (PCA) algorithm. This task is very difficult as the real-time background subtraction in an image is still a challenge. Addition to that, managing a database with multiple of student informations is also an extra challenge to this system. The proposed biometric system is a real time attendance system based on the human face recognition with simple and fast algorithms and most important is gaining a high accuracy rate.
Keywords:	Automatic Attendance, Face Recognition, Authentication, Biometric, Principal Component Analysis (PCA).
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	OPTIMIZING RESOURCE ALLOCATION SCHEDULING IN CLOUD COMPUTING SERVICES
Author:	AMJAD GAWANMEH, AHMAD ALOMARI, ALAIN APRIL
Abstract:	Resource allocation in cloud computing systems is getting more complex and demanding due to the increasing requirements for cloud-based services. Scheduling services using a limited number of resources is problem that has been under study since the evolution of cloud computing. However, there are several open areas for improvements due to the large number of optimization variables. In this work, we intend to presents an algorithm to solve the fundamental problem of multiple tasks resource allocation that are to be scheduled on available services. Several resources will be considered where the cost of available services will depend the computational complexity needed for every service. The proposed algorithm can be applied without constraints on cost or execution time vectors as opposed to most practical and recent existing algorithms. The proposed algorithm is illustrated on two different examples. In addition, the algorithm as implemented and simulated in order to validate its correctness. The experimental results conducting using the proposed method proofs that the algorithm runs in linear time vs. different design parameters. The main limitation of the proposed algorithm is that it is only applicable to the scheduling problem of multiple tasks that has one price vector and one execution time vector. However, providing optimum solution for this particular case, can be helpful in designing heuristic based methods for cloud services are actually run with multiple users with multiple tasks, which requires initial solutions that are usually obtained based on guess or generated randomly.
Keywords:	Could services, Cloud Scheduling, Distributed systems, Cloud Computing, Scheduling
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	FOOD IMAGE REPRESENTATION BASED ON MODIFIED ORIENTATION MAP
Author:	SALWA KHALID ABDULATEEF, MASSUDI MAHMUDDIN, NOR HAZLYNA HARUN
Abstract:	Orientation map is an image representation method representing edges of objects in an image as a set of short line segments instead of pixels representation. The orientation map approach not only aims to extract the key orientation information which constitutes the semantic framework of the visual scene, but also to remove the insignificant elements which barely play a role in image understanding. However, there are two main problems in the current computational approach of orientation map: 1-the outliers in the orientation map 2- the deformities in some line segments. These two problems have an adverse impact on any algorithmic work for image interpretation. This article proposes two improvements, heuristic based and genetic based, to reduce outliers and deformities respectively. Experimental results prove the significant improvement on the current computational approach of calculating the orientation map.
Keywords:	Orientation Map, Image Representation, Genetic Algorithm, Heuristic Approach, Ganglion Cells.
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	AN EFFICIENT CROSS-LAYER BASED INTRUSION DETECTION SYSTEM FOR MOBILE AD HOC NETWORKS
Author:	Y.SHARMASTH VALI, T.R.RANGASWAMY
Abstract:	Recently, the widespread availability of wireless communications has led to the growth and significance of wireless Mobile Ad hoc Networks (MANETs). Among the routing layer attacks, packet dropping is one of the most disruptive threats in MANETs. Thus, the malicious nodes can camouflage under the background of harsh channel conditions and reduces the detection accuracy of conventional secure routing protocols. In such circumstances, observing the packet loss rate is not adequate to accurately identify the exact cause of a packet loss. This paper proposes a Cross-layer based distributed and cooperative Intrusion Detection System (IDS) with Dempster-Shafer evidence theory (CID) system to accurately discern and eradicate the intruders using cross layer information. The CID system includes local detection engine and IDS. A local detection engine continuously monitors the network activity and differentiates the packet loss due to harsh channel conditions from the malicious one using the features of physical, MAC, and network layer. When the local detection engine detects malicious activity, it turns on IDS in a node. The IDS utilizes the Dempster-Shafer (DS) evidence theory to collect evidence only from trustworthy nodes and provides a mathematical way to merge the evidence with direct trust value in confirming the malicious activities. Eventually, the proposed CID system is extended with the AODV routing protocol, and evaluated under malicious network traffic. The simulation results show that the CID system outperforms the existing EAACK in terms of attack detection accuracy, and network lifetime.
Keywords:	MANET, IDS, Packet Dropping Attacks, Cross-Layer, Trust Management, DS Theory
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	PERFORMANCE COMPARISON OF DRAGONFLY AND FIREFLY ALGORITHM IN THE RFID NETWORK TO IMPROVE THE DATA TRANSMISSION
Author:	C.HEMA, Dr.SHARMILA SANKAR, Dr.SANDHYA
Abstract:	RFID (Radio Frequency Identification) network is used for sensing and tracking the objects. The main flaw in this network is reader collision which leads to redundant data. Consequently, due to dissimilar mobility between a head and its member nodes causes unstable clustering. Hence, the protocol known as Dragonfly based Clustering Protocol (DCP) is proposed to minimize the frequent cluster breakage and to improve the data transmission in the network. The readers with high residual energy level are picked as an eligible cluster head. After picking the eligible head, the distance, speed and neighbor count values are calculated between the head nodes and its neighbors. The values are added and optimum cluster heads are opted if the calculated value is high. Then the other nodes join the cluster based on the movement of the head. The conclusion shows that optimal cluster heads are opted using DCP than LEACH and firefly algorithm in which mobility and neighbor count are not taken into account while picking the cluster head. The simulated result in NS2 shows that DCP protocol selects optimal cluster head and the cluster breakage is low when compared with LEACH protocol and firefly algorithm. The reading efficiency in RFID network is also improved using Dragonfly based clustering.
Keywords:	RFID, DCP, Firefly, Optimal cluster head, Cluster breakage.
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	AUTOMATIC GENERATION AND OPTIMIZATION OF COURSE TIMETABLE USING A HYBRID APPRAOCH
Author:	RAJESH KUMAR SAHOO, DEEPTIMANTA OJHA, DURGA PRASAD MOHAPATRA, MANAS RANJAN PATRA
Abstract:	Course timetable generation problem is a NP-hard problem where we have to take care of different constraints. Optimization problem is a technique of finding an alternative solution having cost effective or highly achievable performance subjected to given constraints, Optimization aims at maximizing desired factors and minimizing or reducing the undesired factors. This paper focuses the hybrid approach produced by combining the concept of Bee colony Optimization (BCO) and Firefly Algorithm (FA) collectively termed as BCFA for finding the optimal solutions of course time table. There are three objectives for construction of the paper, first objective is to get an overview on timetabling problem, second objective is the BCFA and its variations with other timetable generation algorithms and the third objective is to compare the result of BCFA with other evolutionary algorithms. The proposed approach aims at constructing or generating the course timetable and optimizing that timetable .
Keywords:	Bee Colony Optimization (BCO), Firefly Algorithm (FA), Particle Swarm Optimization (PSO), course timetable, hybrid approach
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	DESIGN OF LOW-POWER ADDER USING DOUBLE GATE & MTCMOS TECHNOLOGY
Author:	K. PRIYANKA, K. NEHRU, S. RAMBABU, NANDEESH KUMAR KUMARAVELU
Abstract:	Low power, high speed Dynamic adders is widely used in Digital Logic Designs to overcome the leakage power and speed issues in static adders. Hence, by using MTCMOS Technology, low power dynamic MTCMOS 8-Bit full-adder cells have been proposed. Eight bit MTCMOS adder circuit has been designed using 45nm CMOS Technology. The static Adder circuit is modified by adding an NMOS transistor as a footer or tail to the circuit. This tail transistor when operates in sleep mode, it cuts off the path of current flow from Rail to Rail, which results in leakage power reduction. Hence, the proposed double-gate, MTCMOS Technology dynamic adders are significantly faster as compared to static CMOS logic designs in two aspects reduction of delay when tail transistor operates in normal mode and reduction of leakage power when tail transistor operates in sleep mode. Design analyses, and comparison results verify that the proposed circuits operate with high speed, obtains a significant reduction in leakage power due to the tail transistor included in the circuit. It is also observed that the power consumption of proposed dynamic adder is significantly less compared to existing static adders.
Keywords:	Dynamic Adders, MTCMOS, Sleep Transistor, Double Gate MOSFET, Ground Bouncing Noise
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	AN AGENT-BASED ADAPTIVE E-CONTENT AND E-LEARNING ARCHITECTURE DESIGN AND IMPLEMENTATION
Author:	TEH NORANIS MOHD ARIS, BAKRI BADAWI
Abstract:	Individual students have different approaches towards learning because of different background knowledge, learning styles and preferences. Therefore, it is difficult for instructors to understand their student best learning approach. Furthermore, web application based on multi-agents for adaptive E-Content has been proposed to assist student individualized learning content in order to enhance their learning outcome. Existing systems normally utilize the main techniques of programming scripts and hierarchical course structure to support adaptive Electronic-Learning (E-Learning) course authoring for diverse category of students. These systems need instructor to obligate significant technical skills, and additionally to employ theories of learning styles, which are challenging requirements. To facilitate instructor to contribute in authoring adaptive E-Learning courses, we have designed web application architecture for administrator, assessor/instructor, and student. Three agents namely the exam agent, message agent and E-Content agent have been created to assist instructor and student. We designed the proposed architecture to be implemented for an online adaptive E-Content and E-Learning system. In addition, we conducted user studies to evaluate the effectiveness of the system.
Keywords:	Agent-based, Adaptive E-Content, E-Learning, Instructor, Student
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	4-STAGE GRAPHICAL PASSWORD AUTHENTICATION SCHEME FOR CLOUD
Author:	K. GANGADHARA RAO, R.VIJAYAKUMARI, B.BASAVESWARA RAO
Abstract:	Cloud computing is the fastest growing part of IT industry as it provides dynamic and scalable services to the user in a cost-efficient way. Unfortunately, cloud is also vulnerable to various attacks as it is based on Internet. Cloud service providers offering different types of services delivered over the internet without any delay are governed by Service Level Agreements, which are entered between the vendor and the user. Authentication still remains an issue that is vulnerable to shoulder surfing, guessing attack and various types of other attacks. There is a need to have a proper password checking mechanism so that the degree of vulnerability in the process of authentication gets reduced. In this paper, an effort has been made to present a novice algorithm for the authentication process which totally alleviates the problems of shoulder surfing and guessing attacks. This algorithm works in four stages. If all the four stages are through successfully then one can access the cloud securely.
Keywords:	Authentication, Shoulder-surfing attack, Graphical Passwords, Cloud Security
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	ENERGY SAVING IN WIRELESS SENSOR NETWORKS: URBAN TRAFFIC MANAGEMENT APPLICATION
Author:	MUSTAPHA KABRANE, SALAH-DDINE KRIT, LAHOUCINE EL MAIMOUNI, JALAL LAASSIRI
Abstract:	Since ten years, researches on the technology of wireless sensor network (WSN) in the field of urban traffic management succeed without proposing a reliable solution for all the constraints suffered. In this article, we study the scenario of using a wireless sensor network to control traffic lights an urban transport network and optimize its functioning by reducing the average waiting time of users and traffic fluidity. We are interested in a simple network at an intersection. Our study provides primarily, a study of the researches work that were done, and who are at the present time, in order to solve the number of communication problem between network of sensor node and the traffic light controller (each node collects data and sends them) with the consideration of energy consumption. it is termed the energy of communication. Note that the energy of communication represents the largest portion of the energy consumed by a sensor node. So, it is necessary minimize energy costs, because energy is a key constraint in sensor networks. For this, we have proposed an algorithm to reduce the number of packets sent by the sensor. The results of our simulations show that our algorithm is effective and practical.
Keywords:	Wireless sensor Networks (WSNs), Energy saving, Algorithm, urban traffic, Energy consumption, energy of communication
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	A PROTOTYPE TO DETECT AND EFFICIENTLY RECTIFY FAULTS IN A SMART POWER GRID USING AN INTELLIGENT KNOWLEDGE BASED INFORMATION SYSTEM
Author:	BIJU THERUVIL SAYED, ABDELKADER DEKDOUK, YASAR ASHRAF
Abstract:	Enhancement in distribution and management of electrical energy systems is one of the prominent and equally promising aspects to any sort of economical development in a country. Though the researches to further enhance the production, distribution and management of electrical power energy is vast, addressing the loss and wastage of power energy due to faults that exists in the distribution of the electrical power is too vital. Within the adaptive frame work, we would like to present an archetype of an Intelligent Knowledge Based Information System, based on an advanced level of smart power grid technology; in order to identify and rectify the faults resulted in electricity distribution system and management of electric power under the hood of smart grid technology. The system would help analyze the detection of faults in the equipments of the electrical distribution system, rectify the type of fault and will address it to the relevant technical specialists who would be ready to provide support in the field. The model would work on mining of text correspondences between the electrical engineers and technicians in the field, which would be changed into certain smart power grid fault rules. These rules, with the help of computer intelligence, will then be used to extract the attributes of faults such as the type of fault, the fault location, severity of fault, and other relevant coincidences to help rectify the fault healing process within the earliest time frame through nearest available supporting technical specialists. The system would also address the mobile based application support to enhance the time coping immediate support services and operations. The main objective of the prototype is to analyze the identified faults and rectify the power faults in an electrical smart power grid network to its best utilization within available technological resources, to consecutively elevate the supply and boost the power quality. The epitome would be designed in consultation with technical experts experienced in the power field and later be generated into an Intelligent Knowledge Based Information System to be tested through an existing power distribution and management company to measure its applicability, feasibility and sustainability.
Keywords:	Power Distribution Faults, Mobile Workforce Management System, Smart Power Grid Technology, Knowledge Management Systems, Intelligent Knowledge Based Information System
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	CROSSTALK REDUCTION FOR NETWORK MULTICORE FIBER WITH MANAGEMENT CORE AND SPECTRUM METHOD
Author:	ANDANI ACHMAD, DEWIANI DJAMALUDDIN, RIKLAN KANGO
Abstract:	Crosstalk is a problem in increasing the transmission capacity of multicore fiber networks. This research aimed to reduce inter-core crosstalk in multicore fiber networks. The method used was core allocation, i.e the core management and the spectrum slot. This method employs parallelization of two algorithms. First, the core prioritization algorithm which is based on the structural core of multicore fiber. Second, the core classification algorithm which is based on the required bandwidth connection. The research result indicated that this method worked well and effectively reduced the number of overlapping spectrum, so that it reduced the inter-core crosstalk of multicore fiber to 59.76%. It was concluded that the proposed method can reduce crosstalk problem in multicore fiber networks.
Keywords:	Core Classification, Core Prioritization, Crosstalk, Multicore Fiber.
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	DESIGN OF LOCATION BASED AUTHENTICATION SYSTEM USING VISIBLE LIGHT COMMUNICATION
Author:	KHAIRUL AZMI ABU BAKAR, DAHLILA PUTRI DAHNIL
Abstract:	User location information provides additional layer of security to a system. The location information of a user is an important attribute that can be used in authentication systems. Legitimate user has to be physically resides within a restricted area to gain access. With the growth of wireless communication technologies that use radio waves, determination of user location for indoor environment is very challenging. Radio signal can penetrate walls; thus it is not easy to verify location information within a restricted area as small as a room. In this paper, we propose a location-based authentication system that is cost-effective and user friendly. The proposed system uses common infrastructure such as LED lightbulb and smartphone. To verify the location of the user, visible light communication technology via the LED lightbulb is used.
Keywords:	VLC, Location Based System, User Authentication, QR Code, Security
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	IMPROVING SOFTWARE RELIABILITY GROWTH MODEL SELECTION RANKING USING PARTICLE SWARM OPTIMIZATION
Author:	LIANG FUH ONG, MOHD ADHAM ISA, DAYANG N. A. JAWAWI, SHAHLIZA ABDUL HALIM
Abstract:	Reliability of software always related to software failures and a number of software reliability growth models (SRGMs) have been proposed past few decades to predict software reliability. Different characteristics of SRGM leading to the study and practices of SRGM selection for different domains. Appropriate model must be chosen for suitable domain in order to predict the occurrence of the software failures accurately then help to estimate the overall cost of the project and delivery time. In this paper, particle swarm optimization (PSO) method is used to optimize a parameter estimation and distance based approach (DBA) is used to produce SRGM model selection ranking. The study concluded that the use of PSO for optimizing the SRGMs parameter has provided more accurate reliability prediction and improved model selection rankings. The model selection ranking methodology can facilitate a software developer to concentrate and analyze in making a decision to select suitable SRGM during testing phases.
Keywords:	Software Reliability Prediction, Model Selection, Parameter Estimation, Particle Swarm Optimization, Distance Based Approach, Software Reliability Growth Model (SRGM)
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	A NOVEL SECRET IMAGE HIDING TECHNIQUE FOR SECURE TRANSMISSION
Author:	S.MANIMURUGAN, SAAD AL-MUTAIRI
Abstract:	To transmit secret data from source to destination is a challenging task because there is a chance that intruders or third parties can hack the information at any moment. To address this problem, this paper proposed a new encryption technique called hybrid tailored visual cryptography and steganography (HTVCS) for secure transmission. In order to improve the algorithm complexity and strength, two popular methods were combined together in HTVCS. The original secret image was encrypted by modified tailored visual cryptography (MTVC). This MTVC encryption process can be classified into three processes: the pixel process, binary conversion and the share creation process. As a result, two encrypted shares were obtained. These shares were hidden inside a grayscale cover image in the steganography encode (SE) process using a key. The encoded image was sent to the receiver/authenticated person for the reconstruction process. In the decryption process, the encoded image was decoded by the steganography decode (SD) process using a key to obtain the share and cover images. In addition, the reconstructed shares were once again decrypted by MTVC decryption to retrieve the original secret image. The MTVC decryption can be divided into the following processes: re-swapping, share merging, decimal conversion and inverse pixel. The reconstructed secret image was validated by different parameters of the correlation coefficient (CC), the peak signal-to-noise ratio (PSNR), confidentiality, integrity and authentication (CIA) and complexity. As a result, the proposed HTVCS provided much better results than conventional methods. The main advantage of the proposed method is that a 98% exact replica of the secret image was retrieved and the algorithm complexity was improved due to the double encryption process. Therefore, it is very hard for intruders to hack the original secret data.
Keywords:	Modified Tailored Visual Cryptography, Steganography, Pixel Processing, Secret Key, Binary Conversion, Share Creation Process
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	EXPERIENCE BASED FACTORY MODEL FOR SOFTWARE DEVELOPMENT PROCESS: ITEM CONSTRUCT VALIDATION ON QUESTIONNAIRE DESIGN
Author:	MASTURA HANAFIAH, RUSLI ABDULLAH, MASRAH AZRIFAH AZMI MURAD, JAMILAH DIN, MOHD ZALI MOHD NOR
Abstract:	Software development is a highly intensive knowledge process. Information, data, knowledge and experiences are accumulated daily and it is crucial that they are managed appropriately for the purpose of sharing and future reuse. Today, software development has spread across geographical boundaries; therefore, the need for knowledge retention has risen, and the need for collaboration among the community of practice has been further in demand. Based on this motivation, we posit a model of managing the experiences of software development process by using experience based factory approach. An initial conceptual model has been constructed based on relevant theoretical frameworks which include knowledge management, experience factory, software development process, community of practice, technology and infrastructure, and influences from managerial and organizational levels. Based on the literature review, questionnaire items have been designed to form the identified latent constructs. A pilot survey has been conducted to verify the questionnaire items and the results are tested against Rasch measurement analysis. By using Rash logit measures, the items quality is ensured. Findings indicate that the item fitness is good (0.73), outfit and infit mean square values are very much close to 1, and Z-standardized value is within the expected range. Unidimensionality shows that there is no visible secondary dimension even though the scale category structure is rather high. Nonetheless, there are several misfitting items which are further calibrated and revised for future study. The initial model will be the basis of the future model development.
Keywords:	Experience Factory, Knowledge Management, Software Development Process, Questionnaire Design, Rasch Analysis
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	LI-AODV: LIFETIME IMPROVING AODV ROUTING FOR DETECTING AND REMOVING BLACK-HOLE ATTACK FROM VANET
Author:	ZAID A. ABDULKADER1, AZIZOL ABDULLAH, MOHD TAUFIK ABDULLAH, ZURIATI AHMAD ZUKARNAIN
Abstract:	Vehicular Ad-hoc Network (VANET) is an emerging technology and is an application of Mobile Ad-hoc Network (MANET). So it has same characteristics like wireless medium, dynamic topology, collision interference. Objective of VANET is to create and provide communications among group of vehicles without any central base station. An attack like Black hole in VANET is a main issue that degrades performance of whole network. Many existing algorithms tried to solve this issue but not completely. In order to solve above problems in VANET from black hole attack, we propose a new routing protocol named Lifetime Improving Ad-hoc On-demand Distance Vector (LI-AODV). To reduce overload in routing process we introduce a scheduling algorithm named Hybrid Round Robin with Highest Response Ratio Next (HRRHRRN). To prevent the network from Black hole attack we propose a new security algorithm called HMAC-SHA3-384 which is a combination of SHA3-384 and HMAC. This LI-AODV achieves better performance in lifetime of the network, reduces black hole attack, End-to-End delay, throughput, packet loss, Packet delivery ratio. Our experimental procedure provides efficient identification and removal of black hole attack in urban VANET.
Keywords:	VANET, Black hole attack, AODV routing protocol, Ad-hoc network, HMAC, SHA3-384.
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	A HYBRID ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND TARGET TIME
Author:	ABBASSI ABDERRAHMAN, EL BOUYAHYIOUY KARIM, EL HILALI ALAOUI AHMED, BELLABDAOUI ADIL
Abstract:	The routing of a fleet of vehicles to service a set of customers is important in the field of goods distribution. Vehicle routing problem with time windows (VRPTW) is a well-known combinatorial problem. This article aims at studying the vehicle routing problem with time windows and target time (VRPTWTT). VRPTWTT involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows as well as a target time. There are penalties associated with servicing either earlier or later than this target servicing time. The goal is to minimize the costs of transport and penalties of delay and ahead of time. Although VRPTWTT is a new variant of the VRP with time windows, the problem is not easy to solve, and it is also NP-hard. To solve the VRPTWTT, we propose a hybrid method combining Neighborhood search with Ant Colony Optimization Algorithm (ACO). Furthermore, when ACO is close to current optimal solution, neighborhood search is used to maintain the diversity of ACO and explore new solutions. First, we present a description of the hybrid method followed by computational results and the conclusion.
Keywords:	Vehicle Routing Problem, Time Window, Target time, Ant Colony Optimization, Neighborhood search.
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text

Title:	AN INITIAL STEP IN A BLIND SOURCE SEPARATION METHOD TO DETERMINE THE BASELINE SIGNAL WITH ACOUSTIC EMISSION
Author:	NOVITHA L. TH. THENU, DHANY ARIFIANTO, I MADE ARIANA, ACHMAD ZUBAYDI
Abstract:	The ability to diagnose problems in marine engines quickly and accurately is vital to the safe operation of any ship. Changes sound emanating from the operating system inside the engine room of a ship into vital information for early detection of the engine condition. This paper presents baseline signal measurement technique to detect early cracks that occur on the propeller shaft. Baseline signal measurement is a first stage application of Blind Source Separation method for separating a complex sound. The study was conducted in an anechoic chamber. Test of three shafts have been conducted by varying depth of crack. The first test was shaft without crack (healthy shaft), the second shaft was cracked shaft with the depth of crack is 25% of shaft diameter named cracked shaft 0.25D and the third shaft has 50 % depth of crack (cracked shaft 0.5D). The tested shaft was rotated at shaft speeds from 500 to 1000 rpm by an electric motor. The microphone as Acoustic Emission sensor was placed at various distances as long as of test shaft from 5 to 40 cm. The accelerometer attached on the casing of the electric motor. The sound of data is measured for 5 seconds and then processed through signal processing. Acoustic signal spectrums on each measurement position are different from one another. Note that the spectrums amplitude are approximately equal to the microphone position which are 30 and 40 cm. Locations around the crack are in the measurement position. Another result shows that the amplitude value will increase when the shaft speed improved . These findings indicate that the acoustic emission technique may be a suitable replacement to an accelerometer-based measurement. Furthermore, the specific finding is the initial step of baseline measurements successfully performed as data references to the application of Blind Source Separation method.
Keywords:	Acoustic Emission, Baseline Signal, Blind Source Separation, Cracked Shaft, Amplitude
Source:	Journal of Theoretical and Applied Information Technology 15^th January 2017 -- Vol. 95. No. 1 -- 2017
Full Text